/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/loop-invgen/NetBSD_loop.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-11 02:29:05,932 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-11 02:29:05,934 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-11 02:29:05,946 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-11 02:29:05,946 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-11 02:29:05,947 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-11 02:29:05,949 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-11 02:29:05,951 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-11 02:29:05,953 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-11 02:29:05,954 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-11 02:29:05,955 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-11 02:29:05,956 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-11 02:29:05,956 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-11 02:29:05,957 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-11 02:29:05,958 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-11 02:29:05,960 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-11 02:29:05,961 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-11 02:29:05,962 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-11 02:29:05,964 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-11 02:29:05,966 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-11 02:29:05,967 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-11 02:29:05,969 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-11 02:29:05,970 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-11 02:29:05,971 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-11 02:29:05,973 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-11 02:29:05,974 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-11 02:29:05,974 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-11 02:29:05,975 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-11 02:29:05,976 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-11 02:29:05,977 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-11 02:29:05,977 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-11 02:29:05,978 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-11 02:29:05,979 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-11 02:29:05,980 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-11 02:29:05,981 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-11 02:29:05,981 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-11 02:29:05,982 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-11 02:29:05,982 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-11 02:29:05,982 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-11 02:29:05,983 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-11 02:29:05,984 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-11 02:29:05,985 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-11 02:29:05,995 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-11 02:29:05,995 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-11 02:29:05,997 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-11 02:29:05,997 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-11 02:29:05,997 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-11 02:29:05,997 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-11 02:29:05,998 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-11 02:29:05,998 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-11 02:29:05,998 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-11 02:29:05,998 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-11 02:29:05,998 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-11 02:29:05,999 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-11 02:29:05,999 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-11 02:29:05,999 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-11 02:29:05,999 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-11 02:29:05,999 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-11 02:29:06,000 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-11 02:29:06,000 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-11 02:29:06,000 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-11 02:29:06,000 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-11 02:29:06,001 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-11 02:29:06,001 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-11 02:29:06,001 INFO L138 SettingsManager]: * Use separate solver for trace checks=false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-07-11 02:29:06,286 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-11 02:29:06,299 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-11 02:29:06,303 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-11 02:29:06,304 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-11 02:29:06,305 INFO L275 PluginConnector]: CDTParser initialized [2020-07-11 02:29:06,305 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-11 02:29:06,389 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5564341a/f9fed15d6079480b9333774fd7cea154/FLAG106f7e32f [2020-07-11 02:29:06,889 INFO L306 CDTParser]: Found 1 translation units. [2020-07-11 02:29:06,890 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/NetBSD_loop.i [2020-07-11 02:29:06,897 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5564341a/f9fed15d6079480b9333774fd7cea154/FLAG106f7e32f [2020-07-11 02:29:07,234 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5564341a/f9fed15d6079480b9333774fd7cea154 [2020-07-11 02:29:07,243 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-11 02:29:07,245 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-11 02:29:07,247 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-11 02:29:07,247 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-11 02:29:07,251 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-11 02:29:07,252 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 02:29:07" (1/1) ... [2020-07-11 02:29:07,255 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d9b1230 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:29:07, skipping insertion in model container [2020-07-11 02:29:07,256 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 02:29:07" (1/1) ... [2020-07-11 02:29:07,264 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-11 02:29:07,284 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-11 02:29:07,466 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-11 02:29:07,471 INFO L203 MainTranslator]: Completed pre-run [2020-07-11 02:29:07,489 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-11 02:29:07,502 INFO L208 MainTranslator]: Completed translation [2020-07-11 02:29:07,502 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:29:07 WrapperNode [2020-07-11 02:29:07,503 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-11 02:29:07,503 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-11 02:29:07,503 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-11 02:29:07,503 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-11 02:29:07,516 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:29:07" (1/1) ... [2020-07-11 02:29:07,516 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:29:07" (1/1) ... [2020-07-11 02:29:07,520 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:29:07" (1/1) ... [2020-07-11 02:29:07,521 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:29:07" (1/1) ... [2020-07-11 02:29:07,525 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:29:07" (1/1) ... [2020-07-11 02:29:07,531 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:29:07" (1/1) ... [2020-07-11 02:29:07,532 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:29:07" (1/1) ... [2020-07-11 02:29:07,606 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-11 02:29:07,606 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-11 02:29:07,607 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-11 02:29:07,607 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-11 02:29:07,608 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:29:07" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-11 02:29:07,680 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-11 02:29:07,680 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-11 02:29:07,680 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-11 02:29:07,680 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-11 02:29:07,680 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-11 02:29:07,681 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-11 02:29:07,681 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-11 02:29:07,681 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-11 02:29:07,681 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-11 02:29:07,681 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-11 02:29:07,681 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-11 02:29:07,681 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-11 02:29:07,682 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-11 02:29:07,972 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-11 02:29:07,973 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-11 02:29:07,978 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 02:29:07 BoogieIcfgContainer [2020-07-11 02:29:07,978 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-11 02:29:07,979 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-11 02:29:07,979 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-11 02:29:07,982 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-11 02:29:07,983 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.07 02:29:07" (1/3) ... [2020-07-11 02:29:07,984 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ffa6223 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 02:29:07, skipping insertion in model container [2020-07-11 02:29:07,984 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:29:07" (2/3) ... [2020-07-11 02:29:07,984 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ffa6223 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 02:29:07, skipping insertion in model container [2020-07-11 02:29:07,984 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 02:29:07" (3/3) ... [2020-07-11 02:29:07,986 INFO L109 eAbstractionObserver]: Analyzing ICFG NetBSD_loop.i [2020-07-11 02:29:07,998 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-11 02:29:08,006 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-11 02:29:08,030 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-11 02:29:08,076 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-11 02:29:08,076 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-11 02:29:08,076 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-11 02:29:08,077 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-11 02:29:08,077 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-11 02:29:08,077 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-11 02:29:08,077 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-11 02:29:08,077 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-11 02:29:08,096 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states. [2020-07-11 02:29:08,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-11 02:29:08,105 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:29:08,106 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 02:29:08,107 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:29:08,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:29:08,112 INFO L82 PathProgramCache]: Analyzing trace with hash -2007421113, now seen corresponding path program 1 times [2020-07-11 02:29:08,121 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:29:08,121 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1037605395] [2020-07-11 02:29:08,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:29:08,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:29:08,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:29:08,409 INFO L280 TraceCheckUtils]: 0: Hoare triple {39#true} assume true; {39#true} is VALID [2020-07-11 02:29:08,410 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {39#true} {39#true} #64#return; {39#true} is VALID [2020-07-11 02:29:08,413 INFO L263 TraceCheckUtils]: 0: Hoare triple {39#true} call ULTIMATE.init(); {39#true} is VALID [2020-07-11 02:29:08,413 INFO L280 TraceCheckUtils]: 1: Hoare triple {39#true} assume true; {39#true} is VALID [2020-07-11 02:29:08,414 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {39#true} {39#true} #64#return; {39#true} is VALID [2020-07-11 02:29:08,414 INFO L263 TraceCheckUtils]: 3: Hoare triple {39#true} call #t~ret2 := main(); {39#true} is VALID [2020-07-11 02:29:08,414 INFO L280 TraceCheckUtils]: 4: Hoare triple {39#true} havoc ~MAXPATHLEN~0; {39#true} is VALID [2020-07-11 02:29:08,415 INFO L280 TraceCheckUtils]: 5: Hoare triple {39#true} havoc ~pathbuf_off~0; {39#true} is VALID [2020-07-11 02:29:08,415 INFO L280 TraceCheckUtils]: 6: Hoare triple {39#true} havoc ~bound_off~0; {39#true} is VALID [2020-07-11 02:29:08,416 INFO L280 TraceCheckUtils]: 7: Hoare triple {39#true} havoc ~glob2_p_off~0; {39#true} is VALID [2020-07-11 02:29:08,416 INFO L280 TraceCheckUtils]: 8: Hoare triple {39#true} havoc ~glob2_pathbuf_off~0; {39#true} is VALID [2020-07-11 02:29:08,416 INFO L280 TraceCheckUtils]: 9: Hoare triple {39#true} havoc ~glob2_pathlim_off~0; {39#true} is VALID [2020-07-11 02:29:08,417 INFO L280 TraceCheckUtils]: 10: Hoare triple {39#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {39#true} is VALID [2020-07-11 02:29:08,417 INFO L280 TraceCheckUtils]: 11: Hoare triple {39#true} ~MAXPATHLEN~0 := #t~nondet0; {39#true} is VALID [2020-07-11 02:29:08,418 INFO L280 TraceCheckUtils]: 12: Hoare triple {39#true} havoc #t~nondet0; {39#true} is VALID [2020-07-11 02:29:08,418 INFO L280 TraceCheckUtils]: 13: Hoare triple {39#true} assume ~MAXPATHLEN~0 > 0 && ~MAXPATHLEN~0 < 2147483647; {39#true} is VALID [2020-07-11 02:29:08,420 INFO L280 TraceCheckUtils]: 14: Hoare triple {39#true} ~pathbuf_off~0 := 0; {43#(<= 0 main_~pathbuf_off~0)} is VALID [2020-07-11 02:29:08,421 INFO L280 TraceCheckUtils]: 15: Hoare triple {43#(<= 0 main_~pathbuf_off~0)} ~bound_off~0 := ~pathbuf_off~0 + (1 + ~MAXPATHLEN~0) - 1; {43#(<= 0 main_~pathbuf_off~0)} is VALID [2020-07-11 02:29:08,422 INFO L280 TraceCheckUtils]: 16: Hoare triple {43#(<= 0 main_~pathbuf_off~0)} ~glob2_pathbuf_off~0 := ~pathbuf_off~0; {44#(<= 0 main_~glob2_pathbuf_off~0)} is VALID [2020-07-11 02:29:08,423 INFO L280 TraceCheckUtils]: 17: Hoare triple {44#(<= 0 main_~glob2_pathbuf_off~0)} ~glob2_pathlim_off~0 := ~bound_off~0; {44#(<= 0 main_~glob2_pathbuf_off~0)} is VALID [2020-07-11 02:29:08,425 INFO L280 TraceCheckUtils]: 18: Hoare triple {44#(<= 0 main_~glob2_pathbuf_off~0)} ~glob2_p_off~0 := ~glob2_pathbuf_off~0; {45#(<= 0 main_~glob2_p_off~0)} is VALID [2020-07-11 02:29:08,426 INFO L280 TraceCheckUtils]: 19: Hoare triple {45#(<= 0 main_~glob2_p_off~0)} assume !!(~glob2_p_off~0 <= ~glob2_pathlim_off~0); {45#(<= 0 main_~glob2_p_off~0)} is VALID [2020-07-11 02:29:08,428 INFO L263 TraceCheckUtils]: 20: Hoare triple {45#(<= 0 main_~glob2_p_off~0)} call __VERIFIER_assert((if 0 <= ~glob2_p_off~0 then 1 else 0)); {46#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-11 02:29:08,429 INFO L280 TraceCheckUtils]: 21: Hoare triple {46#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {47#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-11 02:29:08,430 INFO L280 TraceCheckUtils]: 22: Hoare triple {47#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {40#false} is VALID [2020-07-11 02:29:08,431 INFO L280 TraceCheckUtils]: 23: Hoare triple {40#false} assume !false; {40#false} is VALID [2020-07-11 02:29:08,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-11 02:29:08,438 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1037605395] [2020-07-11 02:29:08,440 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 02:29:08,441 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-11 02:29:08,442 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805257256] [2020-07-11 02:29:08,450 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2020-07-11 02:29:08,453 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:29:08,458 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-11 02:29:08,520 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:29:08,521 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-11 02:29:08,521 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:29:08,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-11 02:29:08,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-11 02:29:08,536 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 7 states. [2020-07-11 02:29:09,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:29:09,093 INFO L93 Difference]: Finished difference Result 68 states and 83 transitions. [2020-07-11 02:29:09,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-11 02:29:09,093 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2020-07-11 02:29:09,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:29:09,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-11 02:29:09,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 83 transitions. [2020-07-11 02:29:09,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-11 02:29:09,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 83 transitions. [2020-07-11 02:29:09,115 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 83 transitions. [2020-07-11 02:29:09,238 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:29:09,253 INFO L225 Difference]: With dead ends: 68 [2020-07-11 02:29:09,254 INFO L226 Difference]: Without dead ends: 40 [2020-07-11 02:29:09,258 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-07-11 02:29:09,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2020-07-11 02:29:09,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2020-07-11 02:29:09,340 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:29:09,341 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 37 states. [2020-07-11 02:29:09,341 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 37 states. [2020-07-11 02:29:09,342 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 37 states. [2020-07-11 02:29:09,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:29:09,349 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2020-07-11 02:29:09,349 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2020-07-11 02:29:09,350 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:29:09,351 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:29:09,351 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 40 states. [2020-07-11 02:29:09,351 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 40 states. [2020-07-11 02:29:09,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:29:09,356 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2020-07-11 02:29:09,357 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2020-07-11 02:29:09,358 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:29:09,358 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:29:09,358 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:29:09,359 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:29:09,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-07-11 02:29:09,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2020-07-11 02:29:09,364 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 24 [2020-07-11 02:29:09,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:29:09,365 INFO L479 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2020-07-11 02:29:09,365 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-11 02:29:09,366 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 37 states and 38 transitions. [2020-07-11 02:29:09,418 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:29:09,419 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2020-07-11 02:29:09,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-07-11 02:29:09,420 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:29:09,420 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 02:29:09,421 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-11 02:29:09,421 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:29:09,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:29:09,421 INFO L82 PathProgramCache]: Analyzing trace with hash -1994781074, now seen corresponding path program 1 times [2020-07-11 02:29:09,422 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:29:09,422 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [869355723] [2020-07-11 02:29:09,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:29:09,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:29:09,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:29:09,591 INFO L280 TraceCheckUtils]: 0: Hoare triple {346#true} assume true; {346#true} is VALID [2020-07-11 02:29:09,591 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {346#true} {346#true} #64#return; {346#true} is VALID [2020-07-11 02:29:09,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:29:09,600 INFO L280 TraceCheckUtils]: 0: Hoare triple {346#true} ~cond := #in~cond; {346#true} is VALID [2020-07-11 02:29:09,601 INFO L280 TraceCheckUtils]: 1: Hoare triple {346#true} assume !(0 == ~cond); {346#true} is VALID [2020-07-11 02:29:09,601 INFO L280 TraceCheckUtils]: 2: Hoare triple {346#true} assume true; {346#true} is VALID [2020-07-11 02:29:09,603 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {346#true} {353#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} #68#return; {353#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} is VALID [2020-07-11 02:29:09,603 INFO L263 TraceCheckUtils]: 0: Hoare triple {346#true} call ULTIMATE.init(); {346#true} is VALID [2020-07-11 02:29:09,604 INFO L280 TraceCheckUtils]: 1: Hoare triple {346#true} assume true; {346#true} is VALID [2020-07-11 02:29:09,604 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {346#true} {346#true} #64#return; {346#true} is VALID [2020-07-11 02:29:09,604 INFO L263 TraceCheckUtils]: 3: Hoare triple {346#true} call #t~ret2 := main(); {346#true} is VALID [2020-07-11 02:29:09,605 INFO L280 TraceCheckUtils]: 4: Hoare triple {346#true} havoc ~MAXPATHLEN~0; {346#true} is VALID [2020-07-11 02:29:09,605 INFO L280 TraceCheckUtils]: 5: Hoare triple {346#true} havoc ~pathbuf_off~0; {346#true} is VALID [2020-07-11 02:29:09,605 INFO L280 TraceCheckUtils]: 6: Hoare triple {346#true} havoc ~bound_off~0; {346#true} is VALID [2020-07-11 02:29:09,606 INFO L280 TraceCheckUtils]: 7: Hoare triple {346#true} havoc ~glob2_p_off~0; {346#true} is VALID [2020-07-11 02:29:09,606 INFO L280 TraceCheckUtils]: 8: Hoare triple {346#true} havoc ~glob2_pathbuf_off~0; {346#true} is VALID [2020-07-11 02:29:09,606 INFO L280 TraceCheckUtils]: 9: Hoare triple {346#true} havoc ~glob2_pathlim_off~0; {346#true} is VALID [2020-07-11 02:29:09,607 INFO L280 TraceCheckUtils]: 10: Hoare triple {346#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {346#true} is VALID [2020-07-11 02:29:09,607 INFO L280 TraceCheckUtils]: 11: Hoare triple {346#true} ~MAXPATHLEN~0 := #t~nondet0; {346#true} is VALID [2020-07-11 02:29:09,607 INFO L280 TraceCheckUtils]: 12: Hoare triple {346#true} havoc #t~nondet0; {346#true} is VALID [2020-07-11 02:29:09,609 INFO L280 TraceCheckUtils]: 13: Hoare triple {346#true} assume ~MAXPATHLEN~0 > 0 && ~MAXPATHLEN~0 < 2147483647; {350#(<= 1 main_~MAXPATHLEN~0)} is VALID [2020-07-11 02:29:09,610 INFO L280 TraceCheckUtils]: 14: Hoare triple {350#(<= 1 main_~MAXPATHLEN~0)} ~pathbuf_off~0 := 0; {351#(<= (+ main_~pathbuf_off~0 1) main_~MAXPATHLEN~0)} is VALID [2020-07-11 02:29:09,611 INFO L280 TraceCheckUtils]: 15: Hoare triple {351#(<= (+ main_~pathbuf_off~0 1) main_~MAXPATHLEN~0)} ~bound_off~0 := ~pathbuf_off~0 + (1 + ~MAXPATHLEN~0) - 1; {351#(<= (+ main_~pathbuf_off~0 1) main_~MAXPATHLEN~0)} is VALID [2020-07-11 02:29:09,612 INFO L280 TraceCheckUtils]: 16: Hoare triple {351#(<= (+ main_~pathbuf_off~0 1) main_~MAXPATHLEN~0)} ~glob2_pathbuf_off~0 := ~pathbuf_off~0; {352#(<= (+ main_~glob2_pathbuf_off~0 1) main_~MAXPATHLEN~0)} is VALID [2020-07-11 02:29:09,612 INFO L280 TraceCheckUtils]: 17: Hoare triple {352#(<= (+ main_~glob2_pathbuf_off~0 1) main_~MAXPATHLEN~0)} ~glob2_pathlim_off~0 := ~bound_off~0; {352#(<= (+ main_~glob2_pathbuf_off~0 1) main_~MAXPATHLEN~0)} is VALID [2020-07-11 02:29:09,613 INFO L280 TraceCheckUtils]: 18: Hoare triple {352#(<= (+ main_~glob2_pathbuf_off~0 1) main_~MAXPATHLEN~0)} ~glob2_p_off~0 := ~glob2_pathbuf_off~0; {353#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} is VALID [2020-07-11 02:29:09,614 INFO L280 TraceCheckUtils]: 19: Hoare triple {353#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} assume !!(~glob2_p_off~0 <= ~glob2_pathlim_off~0); {353#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} is VALID [2020-07-11 02:29:09,615 INFO L263 TraceCheckUtils]: 20: Hoare triple {353#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} call __VERIFIER_assert((if 0 <= ~glob2_p_off~0 then 1 else 0)); {346#true} is VALID [2020-07-11 02:29:09,615 INFO L280 TraceCheckUtils]: 21: Hoare triple {346#true} ~cond := #in~cond; {346#true} is VALID [2020-07-11 02:29:09,615 INFO L280 TraceCheckUtils]: 22: Hoare triple {346#true} assume !(0 == ~cond); {346#true} is VALID [2020-07-11 02:29:09,616 INFO L280 TraceCheckUtils]: 23: Hoare triple {346#true} assume true; {346#true} is VALID [2020-07-11 02:29:09,621 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {346#true} {353#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} #68#return; {353#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} is VALID [2020-07-11 02:29:09,623 INFO L263 TraceCheckUtils]: 25: Hoare triple {353#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} call __VERIFIER_assert((if ~glob2_p_off~0 < 1 + ~MAXPATHLEN~0 then 1 else 0)); {358#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-11 02:29:09,625 INFO L280 TraceCheckUtils]: 26: Hoare triple {358#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {359#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-11 02:29:09,626 INFO L280 TraceCheckUtils]: 27: Hoare triple {359#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {347#false} is VALID [2020-07-11 02:29:09,627 INFO L280 TraceCheckUtils]: 28: Hoare triple {347#false} assume !false; {347#false} is VALID [2020-07-11 02:29:09,629 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-11 02:29:09,629 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [869355723] [2020-07-11 02:29:09,629 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 02:29:09,630 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-11 02:29:09,630 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297489014] [2020-07-11 02:29:09,632 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2020-07-11 02:29:09,632 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:29:09,632 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-11 02:29:09,665 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:29:09,666 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-11 02:29:09,666 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:29:09,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-11 02:29:09,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-07-11 02:29:09,667 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 8 states. [2020-07-11 02:29:10,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:29:10,149 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2020-07-11 02:29:10,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-11 02:29:10,149 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2020-07-11 02:29:10,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:29:10,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-11 02:29:10,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 44 transitions. [2020-07-11 02:29:10,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-11 02:29:10,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 44 transitions. [2020-07-11 02:29:10,161 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 44 transitions. [2020-07-11 02:29:10,212 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:29:10,215 INFO L225 Difference]: With dead ends: 46 [2020-07-11 02:29:10,216 INFO L226 Difference]: Without dead ends: 44 [2020-07-11 02:29:10,217 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2020-07-11 02:29:10,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-07-11 02:29:10,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2020-07-11 02:29:10,293 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:29:10,293 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 42 states. [2020-07-11 02:29:10,293 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 42 states. [2020-07-11 02:29:10,293 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 42 states. [2020-07-11 02:29:10,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:29:10,302 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2020-07-11 02:29:10,302 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2020-07-11 02:29:10,305 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:29:10,305 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:29:10,306 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 44 states. [2020-07-11 02:29:10,306 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 44 states. [2020-07-11 02:29:10,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:29:10,314 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2020-07-11 02:29:10,314 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2020-07-11 02:29:10,315 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:29:10,315 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:29:10,315 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:29:10,315 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:29:10,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-07-11 02:29:10,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2020-07-11 02:29:10,322 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 29 [2020-07-11 02:29:10,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:29:10,325 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2020-07-11 02:29:10,325 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-11 02:29:10,326 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states and 43 transitions. [2020-07-11 02:29:10,393 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:29:10,393 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2020-07-11 02:29:10,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-07-11 02:29:10,394 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:29:10,395 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 02:29:10,395 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-11 02:29:10,396 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:29:10,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:29:10,396 INFO L82 PathProgramCache]: Analyzing trace with hash -1065397402, now seen corresponding path program 1 times [2020-07-11 02:29:10,396 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:29:10,397 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1261649397] [2020-07-11 02:29:10,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:29:10,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:29:10,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:29:10,503 INFO L280 TraceCheckUtils]: 0: Hoare triple {634#true} assume true; {634#true} is VALID [2020-07-11 02:29:10,504 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {634#true} {634#true} #64#return; {634#true} is VALID [2020-07-11 02:29:10,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:29:10,510 INFO L280 TraceCheckUtils]: 0: Hoare triple {634#true} ~cond := #in~cond; {634#true} is VALID [2020-07-11 02:29:10,511 INFO L280 TraceCheckUtils]: 1: Hoare triple {634#true} assume !(0 == ~cond); {634#true} is VALID [2020-07-11 02:29:10,511 INFO L280 TraceCheckUtils]: 2: Hoare triple {634#true} assume true; {634#true} is VALID [2020-07-11 02:29:10,512 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {634#true} {640#(<= 0 main_~glob2_p_off~0)} #68#return; {640#(<= 0 main_~glob2_p_off~0)} is VALID [2020-07-11 02:29:10,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:29:10,519 INFO L280 TraceCheckUtils]: 0: Hoare triple {634#true} ~cond := #in~cond; {634#true} is VALID [2020-07-11 02:29:10,519 INFO L280 TraceCheckUtils]: 1: Hoare triple {634#true} assume !(0 == ~cond); {634#true} is VALID [2020-07-11 02:29:10,520 INFO L280 TraceCheckUtils]: 2: Hoare triple {634#true} assume true; {634#true} is VALID [2020-07-11 02:29:10,521 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {634#true} {640#(<= 0 main_~glob2_p_off~0)} #70#return; {640#(<= 0 main_~glob2_p_off~0)} is VALID [2020-07-11 02:29:10,521 INFO L263 TraceCheckUtils]: 0: Hoare triple {634#true} call ULTIMATE.init(); {634#true} is VALID [2020-07-11 02:29:10,521 INFO L280 TraceCheckUtils]: 1: Hoare triple {634#true} assume true; {634#true} is VALID [2020-07-11 02:29:10,521 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {634#true} {634#true} #64#return; {634#true} is VALID [2020-07-11 02:29:10,522 INFO L263 TraceCheckUtils]: 3: Hoare triple {634#true} call #t~ret2 := main(); {634#true} is VALID [2020-07-11 02:29:10,522 INFO L280 TraceCheckUtils]: 4: Hoare triple {634#true} havoc ~MAXPATHLEN~0; {634#true} is VALID [2020-07-11 02:29:10,522 INFO L280 TraceCheckUtils]: 5: Hoare triple {634#true} havoc ~pathbuf_off~0; {634#true} is VALID [2020-07-11 02:29:10,522 INFO L280 TraceCheckUtils]: 6: Hoare triple {634#true} havoc ~bound_off~0; {634#true} is VALID [2020-07-11 02:29:10,523 INFO L280 TraceCheckUtils]: 7: Hoare triple {634#true} havoc ~glob2_p_off~0; {634#true} is VALID [2020-07-11 02:29:10,523 INFO L280 TraceCheckUtils]: 8: Hoare triple {634#true} havoc ~glob2_pathbuf_off~0; {634#true} is VALID [2020-07-11 02:29:10,523 INFO L280 TraceCheckUtils]: 9: Hoare triple {634#true} havoc ~glob2_pathlim_off~0; {634#true} is VALID [2020-07-11 02:29:10,524 INFO L280 TraceCheckUtils]: 10: Hoare triple {634#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {634#true} is VALID [2020-07-11 02:29:10,524 INFO L280 TraceCheckUtils]: 11: Hoare triple {634#true} ~MAXPATHLEN~0 := #t~nondet0; {634#true} is VALID [2020-07-11 02:29:10,524 INFO L280 TraceCheckUtils]: 12: Hoare triple {634#true} havoc #t~nondet0; {634#true} is VALID [2020-07-11 02:29:10,524 INFO L280 TraceCheckUtils]: 13: Hoare triple {634#true} assume ~MAXPATHLEN~0 > 0 && ~MAXPATHLEN~0 < 2147483647; {634#true} is VALID [2020-07-11 02:29:10,525 INFO L280 TraceCheckUtils]: 14: Hoare triple {634#true} ~pathbuf_off~0 := 0; {638#(<= 0 main_~pathbuf_off~0)} is VALID [2020-07-11 02:29:10,526 INFO L280 TraceCheckUtils]: 15: Hoare triple {638#(<= 0 main_~pathbuf_off~0)} ~bound_off~0 := ~pathbuf_off~0 + (1 + ~MAXPATHLEN~0) - 1; {638#(<= 0 main_~pathbuf_off~0)} is VALID [2020-07-11 02:29:10,526 INFO L280 TraceCheckUtils]: 16: Hoare triple {638#(<= 0 main_~pathbuf_off~0)} ~glob2_pathbuf_off~0 := ~pathbuf_off~0; {639#(<= 0 main_~glob2_pathbuf_off~0)} is VALID [2020-07-11 02:29:10,527 INFO L280 TraceCheckUtils]: 17: Hoare triple {639#(<= 0 main_~glob2_pathbuf_off~0)} ~glob2_pathlim_off~0 := ~bound_off~0; {639#(<= 0 main_~glob2_pathbuf_off~0)} is VALID [2020-07-11 02:29:10,531 INFO L280 TraceCheckUtils]: 18: Hoare triple {639#(<= 0 main_~glob2_pathbuf_off~0)} ~glob2_p_off~0 := ~glob2_pathbuf_off~0; {640#(<= 0 main_~glob2_p_off~0)} is VALID [2020-07-11 02:29:10,532 INFO L280 TraceCheckUtils]: 19: Hoare triple {640#(<= 0 main_~glob2_p_off~0)} assume !!(~glob2_p_off~0 <= ~glob2_pathlim_off~0); {640#(<= 0 main_~glob2_p_off~0)} is VALID [2020-07-11 02:29:10,532 INFO L263 TraceCheckUtils]: 20: Hoare triple {640#(<= 0 main_~glob2_p_off~0)} call __VERIFIER_assert((if 0 <= ~glob2_p_off~0 then 1 else 0)); {634#true} is VALID [2020-07-11 02:29:10,532 INFO L280 TraceCheckUtils]: 21: Hoare triple {634#true} ~cond := #in~cond; {634#true} is VALID [2020-07-11 02:29:10,532 INFO L280 TraceCheckUtils]: 22: Hoare triple {634#true} assume !(0 == ~cond); {634#true} is VALID [2020-07-11 02:29:10,533 INFO L280 TraceCheckUtils]: 23: Hoare triple {634#true} assume true; {634#true} is VALID [2020-07-11 02:29:10,533 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {634#true} {640#(<= 0 main_~glob2_p_off~0)} #68#return; {640#(<= 0 main_~glob2_p_off~0)} is VALID [2020-07-11 02:29:10,534 INFO L263 TraceCheckUtils]: 25: Hoare triple {640#(<= 0 main_~glob2_p_off~0)} call __VERIFIER_assert((if ~glob2_p_off~0 < 1 + ~MAXPATHLEN~0 then 1 else 0)); {634#true} is VALID [2020-07-11 02:29:10,534 INFO L280 TraceCheckUtils]: 26: Hoare triple {634#true} ~cond := #in~cond; {634#true} is VALID [2020-07-11 02:29:10,534 INFO L280 TraceCheckUtils]: 27: Hoare triple {634#true} assume !(0 == ~cond); {634#true} is VALID [2020-07-11 02:29:10,534 INFO L280 TraceCheckUtils]: 28: Hoare triple {634#true} assume true; {634#true} is VALID [2020-07-11 02:29:10,535 INFO L275 TraceCheckUtils]: 29: Hoare quadruple {634#true} {640#(<= 0 main_~glob2_p_off~0)} #70#return; {640#(<= 0 main_~glob2_p_off~0)} is VALID [2020-07-11 02:29:10,535 INFO L280 TraceCheckUtils]: 30: Hoare triple {640#(<= 0 main_~glob2_p_off~0)} #t~post1 := ~glob2_p_off~0; {649#(<= 0 |main_#t~post1|)} is VALID [2020-07-11 02:29:10,536 INFO L280 TraceCheckUtils]: 31: Hoare triple {649#(<= 0 |main_#t~post1|)} ~glob2_p_off~0 := 1 + #t~post1; {650#(<= 1 main_~glob2_p_off~0)} is VALID [2020-07-11 02:29:10,537 INFO L280 TraceCheckUtils]: 32: Hoare triple {650#(<= 1 main_~glob2_p_off~0)} havoc #t~post1; {650#(<= 1 main_~glob2_p_off~0)} is VALID [2020-07-11 02:29:10,540 INFO L280 TraceCheckUtils]: 33: Hoare triple {650#(<= 1 main_~glob2_p_off~0)} assume !!(~glob2_p_off~0 <= ~glob2_pathlim_off~0); {650#(<= 1 main_~glob2_p_off~0)} is VALID [2020-07-11 02:29:10,544 INFO L263 TraceCheckUtils]: 34: Hoare triple {650#(<= 1 main_~glob2_p_off~0)} call __VERIFIER_assert((if 0 <= ~glob2_p_off~0 then 1 else 0)); {651#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-11 02:29:10,545 INFO L280 TraceCheckUtils]: 35: Hoare triple {651#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {652#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-11 02:29:10,546 INFO L280 TraceCheckUtils]: 36: Hoare triple {652#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {635#false} is VALID [2020-07-11 02:29:10,546 INFO L280 TraceCheckUtils]: 37: Hoare triple {635#false} assume !false; {635#false} is VALID [2020-07-11 02:29:10,548 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-11 02:29:10,548 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1261649397] [2020-07-11 02:29:10,548 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 02:29:10,549 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-11 02:29:10,549 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619953885] [2020-07-11 02:29:10,549 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 38 [2020-07-11 02:29:10,550 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:29:10,550 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-11 02:29:10,594 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-11 02:29:10,594 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-11 02:29:10,594 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:29:10,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-11 02:29:10,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-07-11 02:29:10,596 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 9 states. [2020-07-11 02:29:11,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:29:11,127 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2020-07-11 02:29:11,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-11 02:29:11,127 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 38 [2020-07-11 02:29:11,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:29:11,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-11 02:29:11,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 44 transitions. [2020-07-11 02:29:11,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-11 02:29:11,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 44 transitions. [2020-07-11 02:29:11,134 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 44 transitions. [2020-07-11 02:29:11,184 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:29:11,187 INFO L225 Difference]: With dead ends: 50 [2020-07-11 02:29:11,187 INFO L226 Difference]: Without dead ends: 48 [2020-07-11 02:29:11,188 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2020-07-11 02:29:11,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-07-11 02:29:11,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2020-07-11 02:29:11,272 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:29:11,272 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 46 states. [2020-07-11 02:29:11,273 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 46 states. [2020-07-11 02:29:11,273 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 46 states. [2020-07-11 02:29:11,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:29:11,276 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2020-07-11 02:29:11,276 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2020-07-11 02:29:11,277 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:29:11,277 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:29:11,278 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 48 states. [2020-07-11 02:29:11,278 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 48 states. [2020-07-11 02:29:11,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:29:11,281 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2020-07-11 02:29:11,281 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2020-07-11 02:29:11,282 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:29:11,282 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:29:11,282 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:29:11,282 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:29:11,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-07-11 02:29:11,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2020-07-11 02:29:11,285 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 38 [2020-07-11 02:29:11,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:29:11,285 INFO L479 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2020-07-11 02:29:11,286 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-11 02:29:11,286 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 46 states and 46 transitions. [2020-07-11 02:29:11,340 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:29:11,340 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2020-07-11 02:29:11,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-07-11 02:29:11,342 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:29:11,342 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 02:29:11,342 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-11 02:29:11,342 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:29:11,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:29:11,343 INFO L82 PathProgramCache]: Analyzing trace with hash 470853039, now seen corresponding path program 2 times [2020-07-11 02:29:11,343 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:29:11,343 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1278492884] [2020-07-11 02:29:11,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:29:11,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:29:11,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:29:11,509 INFO L280 TraceCheckUtils]: 0: Hoare triple {955#true} assume true; {955#true} is VALID [2020-07-11 02:29:11,510 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {955#true} {955#true} #64#return; {955#true} is VALID [2020-07-11 02:29:11,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:29:11,518 INFO L280 TraceCheckUtils]: 0: Hoare triple {955#true} ~cond := #in~cond; {955#true} is VALID [2020-07-11 02:29:11,519 INFO L280 TraceCheckUtils]: 1: Hoare triple {955#true} assume !(0 == ~cond); {955#true} is VALID [2020-07-11 02:29:11,519 INFO L280 TraceCheckUtils]: 2: Hoare triple {955#true} assume true; {955#true} is VALID [2020-07-11 02:29:11,519 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {955#true} {962#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} #68#return; {962#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} is VALID [2020-07-11 02:29:11,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:29:11,529 INFO L280 TraceCheckUtils]: 0: Hoare triple {955#true} ~cond := #in~cond; {955#true} is VALID [2020-07-11 02:29:11,530 INFO L280 TraceCheckUtils]: 1: Hoare triple {955#true} assume !(0 == ~cond); {955#true} is VALID [2020-07-11 02:29:11,530 INFO L280 TraceCheckUtils]: 2: Hoare triple {955#true} assume true; {955#true} is VALID [2020-07-11 02:29:11,530 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {955#true} {962#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} #70#return; {962#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} is VALID [2020-07-11 02:29:11,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:29:11,559 INFO L280 TraceCheckUtils]: 0: Hoare triple {955#true} ~cond := #in~cond; {955#true} is VALID [2020-07-11 02:29:11,559 INFO L280 TraceCheckUtils]: 1: Hoare triple {955#true} assume !(0 == ~cond); {955#true} is VALID [2020-07-11 02:29:11,559 INFO L280 TraceCheckUtils]: 2: Hoare triple {955#true} assume true; {955#true} is VALID [2020-07-11 02:29:11,560 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {955#true} {972#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} #68#return; {972#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} is VALID [2020-07-11 02:29:11,560 INFO L263 TraceCheckUtils]: 0: Hoare triple {955#true} call ULTIMATE.init(); {955#true} is VALID [2020-07-11 02:29:11,561 INFO L280 TraceCheckUtils]: 1: Hoare triple {955#true} assume true; {955#true} is VALID [2020-07-11 02:29:11,561 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {955#true} {955#true} #64#return; {955#true} is VALID [2020-07-11 02:29:11,561 INFO L263 TraceCheckUtils]: 3: Hoare triple {955#true} call #t~ret2 := main(); {955#true} is VALID [2020-07-11 02:29:11,562 INFO L280 TraceCheckUtils]: 4: Hoare triple {955#true} havoc ~MAXPATHLEN~0; {955#true} is VALID [2020-07-11 02:29:11,562 INFO L280 TraceCheckUtils]: 5: Hoare triple {955#true} havoc ~pathbuf_off~0; {955#true} is VALID [2020-07-11 02:29:11,562 INFO L280 TraceCheckUtils]: 6: Hoare triple {955#true} havoc ~bound_off~0; {955#true} is VALID [2020-07-11 02:29:11,562 INFO L280 TraceCheckUtils]: 7: Hoare triple {955#true} havoc ~glob2_p_off~0; {955#true} is VALID [2020-07-11 02:29:11,563 INFO L280 TraceCheckUtils]: 8: Hoare triple {955#true} havoc ~glob2_pathbuf_off~0; {955#true} is VALID [2020-07-11 02:29:11,563 INFO L280 TraceCheckUtils]: 9: Hoare triple {955#true} havoc ~glob2_pathlim_off~0; {955#true} is VALID [2020-07-11 02:29:11,563 INFO L280 TraceCheckUtils]: 10: Hoare triple {955#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {955#true} is VALID [2020-07-11 02:29:11,563 INFO L280 TraceCheckUtils]: 11: Hoare triple {955#true} ~MAXPATHLEN~0 := #t~nondet0; {955#true} is VALID [2020-07-11 02:29:11,564 INFO L280 TraceCheckUtils]: 12: Hoare triple {955#true} havoc #t~nondet0; {955#true} is VALID [2020-07-11 02:29:11,565 INFO L280 TraceCheckUtils]: 13: Hoare triple {955#true} assume ~MAXPATHLEN~0 > 0 && ~MAXPATHLEN~0 < 2147483647; {959#(<= 1 main_~MAXPATHLEN~0)} is VALID [2020-07-11 02:29:11,565 INFO L280 TraceCheckUtils]: 14: Hoare triple {959#(<= 1 main_~MAXPATHLEN~0)} ~pathbuf_off~0 := 0; {960#(<= (+ main_~pathbuf_off~0 1) main_~MAXPATHLEN~0)} is VALID [2020-07-11 02:29:11,566 INFO L280 TraceCheckUtils]: 15: Hoare triple {960#(<= (+ main_~pathbuf_off~0 1) main_~MAXPATHLEN~0)} ~bound_off~0 := ~pathbuf_off~0 + (1 + ~MAXPATHLEN~0) - 1; {960#(<= (+ main_~pathbuf_off~0 1) main_~MAXPATHLEN~0)} is VALID [2020-07-11 02:29:11,567 INFO L280 TraceCheckUtils]: 16: Hoare triple {960#(<= (+ main_~pathbuf_off~0 1) main_~MAXPATHLEN~0)} ~glob2_pathbuf_off~0 := ~pathbuf_off~0; {961#(<= (+ main_~glob2_pathbuf_off~0 1) main_~MAXPATHLEN~0)} is VALID [2020-07-11 02:29:11,568 INFO L280 TraceCheckUtils]: 17: Hoare triple {961#(<= (+ main_~glob2_pathbuf_off~0 1) main_~MAXPATHLEN~0)} ~glob2_pathlim_off~0 := ~bound_off~0; {961#(<= (+ main_~glob2_pathbuf_off~0 1) main_~MAXPATHLEN~0)} is VALID [2020-07-11 02:29:11,568 INFO L280 TraceCheckUtils]: 18: Hoare triple {961#(<= (+ main_~glob2_pathbuf_off~0 1) main_~MAXPATHLEN~0)} ~glob2_p_off~0 := ~glob2_pathbuf_off~0; {962#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} is VALID [2020-07-11 02:29:11,569 INFO L280 TraceCheckUtils]: 19: Hoare triple {962#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} assume !!(~glob2_p_off~0 <= ~glob2_pathlim_off~0); {962#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} is VALID [2020-07-11 02:29:11,569 INFO L263 TraceCheckUtils]: 20: Hoare triple {962#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} call __VERIFIER_assert((if 0 <= ~glob2_p_off~0 then 1 else 0)); {955#true} is VALID [2020-07-11 02:29:11,570 INFO L280 TraceCheckUtils]: 21: Hoare triple {955#true} ~cond := #in~cond; {955#true} is VALID [2020-07-11 02:29:11,570 INFO L280 TraceCheckUtils]: 22: Hoare triple {955#true} assume !(0 == ~cond); {955#true} is VALID [2020-07-11 02:29:11,570 INFO L280 TraceCheckUtils]: 23: Hoare triple {955#true} assume true; {955#true} is VALID [2020-07-11 02:29:11,571 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {955#true} {962#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} #68#return; {962#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} is VALID [2020-07-11 02:29:11,571 INFO L263 TraceCheckUtils]: 25: Hoare triple {962#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} call __VERIFIER_assert((if ~glob2_p_off~0 < 1 + ~MAXPATHLEN~0 then 1 else 0)); {955#true} is VALID [2020-07-11 02:29:11,572 INFO L280 TraceCheckUtils]: 26: Hoare triple {955#true} ~cond := #in~cond; {955#true} is VALID [2020-07-11 02:29:11,572 INFO L280 TraceCheckUtils]: 27: Hoare triple {955#true} assume !(0 == ~cond); {955#true} is VALID [2020-07-11 02:29:11,572 INFO L280 TraceCheckUtils]: 28: Hoare triple {955#true} assume true; {955#true} is VALID [2020-07-11 02:29:11,573 INFO L275 TraceCheckUtils]: 29: Hoare quadruple {955#true} {962#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} #70#return; {962#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} is VALID [2020-07-11 02:29:11,574 INFO L280 TraceCheckUtils]: 30: Hoare triple {962#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} #t~post1 := ~glob2_p_off~0; {971#(<= (+ |main_#t~post1| 1) main_~MAXPATHLEN~0)} is VALID [2020-07-11 02:29:11,575 INFO L280 TraceCheckUtils]: 31: Hoare triple {971#(<= (+ |main_#t~post1| 1) main_~MAXPATHLEN~0)} ~glob2_p_off~0 := 1 + #t~post1; {972#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} is VALID [2020-07-11 02:29:11,576 INFO L280 TraceCheckUtils]: 32: Hoare triple {972#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} havoc #t~post1; {972#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} is VALID [2020-07-11 02:29:11,576 INFO L280 TraceCheckUtils]: 33: Hoare triple {972#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} assume !!(~glob2_p_off~0 <= ~glob2_pathlim_off~0); {972#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} is VALID [2020-07-11 02:29:11,577 INFO L263 TraceCheckUtils]: 34: Hoare triple {972#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} call __VERIFIER_assert((if 0 <= ~glob2_p_off~0 then 1 else 0)); {955#true} is VALID [2020-07-11 02:29:11,577 INFO L280 TraceCheckUtils]: 35: Hoare triple {955#true} ~cond := #in~cond; {955#true} is VALID [2020-07-11 02:29:11,577 INFO L280 TraceCheckUtils]: 36: Hoare triple {955#true} assume !(0 == ~cond); {955#true} is VALID [2020-07-11 02:29:11,577 INFO L280 TraceCheckUtils]: 37: Hoare triple {955#true} assume true; {955#true} is VALID [2020-07-11 02:29:11,578 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {955#true} {972#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} #68#return; {972#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} is VALID [2020-07-11 02:29:11,579 INFO L263 TraceCheckUtils]: 39: Hoare triple {972#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} call __VERIFIER_assert((if ~glob2_p_off~0 < 1 + ~MAXPATHLEN~0 then 1 else 0)); {977#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-11 02:29:11,580 INFO L280 TraceCheckUtils]: 40: Hoare triple {977#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {978#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-11 02:29:11,581 INFO L280 TraceCheckUtils]: 41: Hoare triple {978#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {956#false} is VALID [2020-07-11 02:29:11,581 INFO L280 TraceCheckUtils]: 42: Hoare triple {956#false} assume !false; {956#false} is VALID [2020-07-11 02:29:11,584 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-11 02:29:11,584 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1278492884] [2020-07-11 02:29:11,585 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 02:29:11,585 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-07-11 02:29:11,585 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877053401] [2020-07-11 02:29:11,585 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 43 [2020-07-11 02:29:11,586 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:29:11,586 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-11 02:29:11,621 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:29:11,621 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-11 02:29:11,622 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:29:11,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-11 02:29:11,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2020-07-11 02:29:11,622 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 10 states. [2020-07-11 02:29:12,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:29:12,335 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2020-07-11 02:29:12,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-11 02:29:12,335 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 43 [2020-07-11 02:29:12,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:29:12,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-11 02:29:12,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 52 transitions. [2020-07-11 02:29:12,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-11 02:29:12,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 52 transitions. [2020-07-11 02:29:12,341 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 52 transitions. [2020-07-11 02:29:12,400 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:29:12,402 INFO L225 Difference]: With dead ends: 60 [2020-07-11 02:29:12,402 INFO L226 Difference]: Without dead ends: 58 [2020-07-11 02:29:12,403 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2020-07-11 02:29:12,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2020-07-11 02:29:12,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2020-07-11 02:29:12,516 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:29:12,516 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand 56 states. [2020-07-11 02:29:12,516 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 56 states. [2020-07-11 02:29:12,516 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 56 states. [2020-07-11 02:29:12,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:29:12,524 INFO L93 Difference]: Finished difference Result 58 states and 59 transitions. [2020-07-11 02:29:12,524 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2020-07-11 02:29:12,525 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:29:12,525 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:29:12,525 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 58 states. [2020-07-11 02:29:12,525 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 58 states. [2020-07-11 02:29:12,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:29:12,535 INFO L93 Difference]: Finished difference Result 58 states and 59 transitions. [2020-07-11 02:29:12,535 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2020-07-11 02:29:12,536 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:29:12,536 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:29:12,536 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:29:12,537 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:29:12,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-07-11 02:29:12,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 57 transitions. [2020-07-11 02:29:12,539 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 57 transitions. Word has length 43 [2020-07-11 02:29:12,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:29:12,540 INFO L479 AbstractCegarLoop]: Abstraction has 56 states and 57 transitions. [2020-07-11 02:29:12,540 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-11 02:29:12,540 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 56 states and 57 transitions. [2020-07-11 02:29:12,619 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:29:12,619 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2020-07-11 02:29:12,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2020-07-11 02:29:12,621 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:29:12,621 INFO L422 BasicCegarLoop]: trace histogram [6, 5, 5, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 02:29:12,622 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-11 02:29:12,622 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:29:12,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:29:12,622 INFO L82 PathProgramCache]: Analyzing trace with hash -2065107152, now seen corresponding path program 3 times [2020-07-11 02:29:12,623 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:29:12,623 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [880127551] [2020-07-11 02:29:12,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:29:12,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:29:12,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:29:12,737 INFO L280 TraceCheckUtils]: 0: Hoare triple {1343#true} assume true; {1343#true} is VALID [2020-07-11 02:29:12,738 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1343#true} {1343#true} #64#return; {1343#true} is VALID [2020-07-11 02:29:12,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:29:12,748 INFO L280 TraceCheckUtils]: 0: Hoare triple {1343#true} ~cond := #in~cond; {1343#true} is VALID [2020-07-11 02:29:12,749 INFO L280 TraceCheckUtils]: 1: Hoare triple {1343#true} assume !(0 == ~cond); {1343#true} is VALID [2020-07-11 02:29:12,749 INFO L280 TraceCheckUtils]: 2: Hoare triple {1343#true} assume true; {1343#true} is VALID [2020-07-11 02:29:12,750 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1343#true} {1349#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} #68#return; {1349#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2020-07-11 02:29:12,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:29:12,756 INFO L280 TraceCheckUtils]: 0: Hoare triple {1343#true} ~cond := #in~cond; {1343#true} is VALID [2020-07-11 02:29:12,756 INFO L280 TraceCheckUtils]: 1: Hoare triple {1343#true} assume !(0 == ~cond); {1343#true} is VALID [2020-07-11 02:29:12,757 INFO L280 TraceCheckUtils]: 2: Hoare triple {1343#true} assume true; {1343#true} is VALID [2020-07-11 02:29:12,764 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1343#true} {1349#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} #70#return; {1349#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2020-07-11 02:29:12,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:29:12,773 INFO L280 TraceCheckUtils]: 0: Hoare triple {1343#true} ~cond := #in~cond; {1343#true} is VALID [2020-07-11 02:29:12,774 INFO L280 TraceCheckUtils]: 1: Hoare triple {1343#true} assume !(0 == ~cond); {1343#true} is VALID [2020-07-11 02:29:12,774 INFO L280 TraceCheckUtils]: 2: Hoare triple {1343#true} assume true; {1343#true} is VALID [2020-07-11 02:29:12,774 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1343#true} {1349#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} #68#return; {1349#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2020-07-11 02:29:12,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:29:12,783 INFO L280 TraceCheckUtils]: 0: Hoare triple {1343#true} ~cond := #in~cond; {1343#true} is VALID [2020-07-11 02:29:12,784 INFO L280 TraceCheckUtils]: 1: Hoare triple {1343#true} assume !(0 == ~cond); {1343#true} is VALID [2020-07-11 02:29:12,784 INFO L280 TraceCheckUtils]: 2: Hoare triple {1343#true} assume true; {1343#true} is VALID [2020-07-11 02:29:12,785 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1343#true} {1349#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} #70#return; {1349#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2020-07-11 02:29:12,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:29:12,791 INFO L280 TraceCheckUtils]: 0: Hoare triple {1343#true} ~cond := #in~cond; {1343#true} is VALID [2020-07-11 02:29:12,791 INFO L280 TraceCheckUtils]: 1: Hoare triple {1343#true} assume !(0 == ~cond); {1343#true} is VALID [2020-07-11 02:29:12,791 INFO L280 TraceCheckUtils]: 2: Hoare triple {1343#true} assume true; {1343#true} is VALID [2020-07-11 02:29:12,792 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1343#true} {1366#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} #68#return; {1366#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} is VALID [2020-07-11 02:29:12,793 INFO L263 TraceCheckUtils]: 0: Hoare triple {1343#true} call ULTIMATE.init(); {1343#true} is VALID [2020-07-11 02:29:12,793 INFO L280 TraceCheckUtils]: 1: Hoare triple {1343#true} assume true; {1343#true} is VALID [2020-07-11 02:29:12,793 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1343#true} {1343#true} #64#return; {1343#true} is VALID [2020-07-11 02:29:12,793 INFO L263 TraceCheckUtils]: 3: Hoare triple {1343#true} call #t~ret2 := main(); {1343#true} is VALID [2020-07-11 02:29:12,794 INFO L280 TraceCheckUtils]: 4: Hoare triple {1343#true} havoc ~MAXPATHLEN~0; {1343#true} is VALID [2020-07-11 02:29:12,794 INFO L280 TraceCheckUtils]: 5: Hoare triple {1343#true} havoc ~pathbuf_off~0; {1343#true} is VALID [2020-07-11 02:29:12,794 INFO L280 TraceCheckUtils]: 6: Hoare triple {1343#true} havoc ~bound_off~0; {1343#true} is VALID [2020-07-11 02:29:12,794 INFO L280 TraceCheckUtils]: 7: Hoare triple {1343#true} havoc ~glob2_p_off~0; {1343#true} is VALID [2020-07-11 02:29:12,795 INFO L280 TraceCheckUtils]: 8: Hoare triple {1343#true} havoc ~glob2_pathbuf_off~0; {1343#true} is VALID [2020-07-11 02:29:12,795 INFO L280 TraceCheckUtils]: 9: Hoare triple {1343#true} havoc ~glob2_pathlim_off~0; {1343#true} is VALID [2020-07-11 02:29:12,795 INFO L280 TraceCheckUtils]: 10: Hoare triple {1343#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {1343#true} is VALID [2020-07-11 02:29:12,795 INFO L280 TraceCheckUtils]: 11: Hoare triple {1343#true} ~MAXPATHLEN~0 := #t~nondet0; {1343#true} is VALID [2020-07-11 02:29:12,796 INFO L280 TraceCheckUtils]: 12: Hoare triple {1343#true} havoc #t~nondet0; {1343#true} is VALID [2020-07-11 02:29:12,796 INFO L280 TraceCheckUtils]: 13: Hoare triple {1343#true} assume ~MAXPATHLEN~0 > 0 && ~MAXPATHLEN~0 < 2147483647; {1343#true} is VALID [2020-07-11 02:29:12,796 INFO L280 TraceCheckUtils]: 14: Hoare triple {1343#true} ~pathbuf_off~0 := 0; {1347#(<= main_~pathbuf_off~0 0)} is VALID [2020-07-11 02:29:12,797 INFO L280 TraceCheckUtils]: 15: Hoare triple {1347#(<= main_~pathbuf_off~0 0)} ~bound_off~0 := ~pathbuf_off~0 + (1 + ~MAXPATHLEN~0) - 1; {1348#(<= main_~bound_off~0 main_~MAXPATHLEN~0)} is VALID [2020-07-11 02:29:12,798 INFO L280 TraceCheckUtils]: 16: Hoare triple {1348#(<= main_~bound_off~0 main_~MAXPATHLEN~0)} ~glob2_pathbuf_off~0 := ~pathbuf_off~0; {1348#(<= main_~bound_off~0 main_~MAXPATHLEN~0)} is VALID [2020-07-11 02:29:12,809 INFO L280 TraceCheckUtils]: 17: Hoare triple {1348#(<= main_~bound_off~0 main_~MAXPATHLEN~0)} ~glob2_pathlim_off~0 := ~bound_off~0; {1349#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2020-07-11 02:29:12,810 INFO L280 TraceCheckUtils]: 18: Hoare triple {1349#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} ~glob2_p_off~0 := ~glob2_pathbuf_off~0; {1349#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2020-07-11 02:29:12,811 INFO L280 TraceCheckUtils]: 19: Hoare triple {1349#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} assume !!(~glob2_p_off~0 <= ~glob2_pathlim_off~0); {1349#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2020-07-11 02:29:12,811 INFO L263 TraceCheckUtils]: 20: Hoare triple {1349#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} call __VERIFIER_assert((if 0 <= ~glob2_p_off~0 then 1 else 0)); {1343#true} is VALID [2020-07-11 02:29:12,811 INFO L280 TraceCheckUtils]: 21: Hoare triple {1343#true} ~cond := #in~cond; {1343#true} is VALID [2020-07-11 02:29:12,812 INFO L280 TraceCheckUtils]: 22: Hoare triple {1343#true} assume !(0 == ~cond); {1343#true} is VALID [2020-07-11 02:29:12,812 INFO L280 TraceCheckUtils]: 23: Hoare triple {1343#true} assume true; {1343#true} is VALID [2020-07-11 02:29:12,813 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {1343#true} {1349#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} #68#return; {1349#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2020-07-11 02:29:12,813 INFO L263 TraceCheckUtils]: 25: Hoare triple {1349#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} call __VERIFIER_assert((if ~glob2_p_off~0 < 1 + ~MAXPATHLEN~0 then 1 else 0)); {1343#true} is VALID [2020-07-11 02:29:12,813 INFO L280 TraceCheckUtils]: 26: Hoare triple {1343#true} ~cond := #in~cond; {1343#true} is VALID [2020-07-11 02:29:12,814 INFO L280 TraceCheckUtils]: 27: Hoare triple {1343#true} assume !(0 == ~cond); {1343#true} is VALID [2020-07-11 02:29:12,814 INFO L280 TraceCheckUtils]: 28: Hoare triple {1343#true} assume true; {1343#true} is VALID [2020-07-11 02:29:12,815 INFO L275 TraceCheckUtils]: 29: Hoare quadruple {1343#true} {1349#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} #70#return; {1349#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2020-07-11 02:29:12,815 INFO L280 TraceCheckUtils]: 30: Hoare triple {1349#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} #t~post1 := ~glob2_p_off~0; {1349#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2020-07-11 02:29:12,816 INFO L280 TraceCheckUtils]: 31: Hoare triple {1349#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} ~glob2_p_off~0 := 1 + #t~post1; {1349#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2020-07-11 02:29:12,816 INFO L280 TraceCheckUtils]: 32: Hoare triple {1349#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} havoc #t~post1; {1349#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2020-07-11 02:29:12,817 INFO L280 TraceCheckUtils]: 33: Hoare triple {1349#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} assume !!(~glob2_p_off~0 <= ~glob2_pathlim_off~0); {1349#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2020-07-11 02:29:12,817 INFO L263 TraceCheckUtils]: 34: Hoare triple {1349#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} call __VERIFIER_assert((if 0 <= ~glob2_p_off~0 then 1 else 0)); {1343#true} is VALID [2020-07-11 02:29:12,818 INFO L280 TraceCheckUtils]: 35: Hoare triple {1343#true} ~cond := #in~cond; {1343#true} is VALID [2020-07-11 02:29:12,818 INFO L280 TraceCheckUtils]: 36: Hoare triple {1343#true} assume !(0 == ~cond); {1343#true} is VALID [2020-07-11 02:29:12,818 INFO L280 TraceCheckUtils]: 37: Hoare triple {1343#true} assume true; {1343#true} is VALID [2020-07-11 02:29:12,819 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {1343#true} {1349#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} #68#return; {1349#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2020-07-11 02:29:12,819 INFO L263 TraceCheckUtils]: 39: Hoare triple {1349#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} call __VERIFIER_assert((if ~glob2_p_off~0 < 1 + ~MAXPATHLEN~0 then 1 else 0)); {1343#true} is VALID [2020-07-11 02:29:12,819 INFO L280 TraceCheckUtils]: 40: Hoare triple {1343#true} ~cond := #in~cond; {1343#true} is VALID [2020-07-11 02:29:12,820 INFO L280 TraceCheckUtils]: 41: Hoare triple {1343#true} assume !(0 == ~cond); {1343#true} is VALID [2020-07-11 02:29:12,820 INFO L280 TraceCheckUtils]: 42: Hoare triple {1343#true} assume true; {1343#true} is VALID [2020-07-11 02:29:12,822 INFO L275 TraceCheckUtils]: 43: Hoare quadruple {1343#true} {1349#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} #70#return; {1349#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2020-07-11 02:29:12,822 INFO L280 TraceCheckUtils]: 44: Hoare triple {1349#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} #t~post1 := ~glob2_p_off~0; {1349#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2020-07-11 02:29:12,823 INFO L280 TraceCheckUtils]: 45: Hoare triple {1349#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} ~glob2_p_off~0 := 1 + #t~post1; {1349#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2020-07-11 02:29:12,823 INFO L280 TraceCheckUtils]: 46: Hoare triple {1349#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} havoc #t~post1; {1349#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2020-07-11 02:29:12,824 INFO L280 TraceCheckUtils]: 47: Hoare triple {1349#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} assume !!(~glob2_p_off~0 <= ~glob2_pathlim_off~0); {1366#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} is VALID [2020-07-11 02:29:12,825 INFO L263 TraceCheckUtils]: 48: Hoare triple {1366#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} call __VERIFIER_assert((if 0 <= ~glob2_p_off~0 then 1 else 0)); {1343#true} is VALID [2020-07-11 02:29:12,825 INFO L280 TraceCheckUtils]: 49: Hoare triple {1343#true} ~cond := #in~cond; {1343#true} is VALID [2020-07-11 02:29:12,825 INFO L280 TraceCheckUtils]: 50: Hoare triple {1343#true} assume !(0 == ~cond); {1343#true} is VALID [2020-07-11 02:29:12,825 INFO L280 TraceCheckUtils]: 51: Hoare triple {1343#true} assume true; {1343#true} is VALID [2020-07-11 02:29:12,827 INFO L275 TraceCheckUtils]: 52: Hoare quadruple {1343#true} {1366#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} #68#return; {1366#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} is VALID [2020-07-11 02:29:12,828 INFO L263 TraceCheckUtils]: 53: Hoare triple {1366#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} call __VERIFIER_assert((if ~glob2_p_off~0 < 1 + ~MAXPATHLEN~0 then 1 else 0)); {1371#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-11 02:29:12,829 INFO L280 TraceCheckUtils]: 54: Hoare triple {1371#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {1372#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-11 02:29:12,829 INFO L280 TraceCheckUtils]: 55: Hoare triple {1372#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {1344#false} is VALID [2020-07-11 02:29:12,829 INFO L280 TraceCheckUtils]: 56: Hoare triple {1344#false} assume !false; {1344#false} is VALID [2020-07-11 02:29:12,833 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2020-07-11 02:29:12,833 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [880127551] [2020-07-11 02:29:12,835 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 02:29:12,835 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-07-11 02:29:12,835 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405379001] [2020-07-11 02:29:12,836 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 57 [2020-07-11 02:29:12,836 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:29:12,836 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-11 02:29:12,875 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:29:12,875 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-11 02:29:12,875 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:29:12,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-11 02:29:12,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-07-11 02:29:12,876 INFO L87 Difference]: Start difference. First operand 56 states and 57 transitions. Second operand 8 states. [2020-07-11 02:29:13,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:29:13,312 INFO L93 Difference]: Finished difference Result 56 states and 57 transitions. [2020-07-11 02:29:13,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-11 02:29:13,312 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 57 [2020-07-11 02:29:13,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:29:13,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-11 02:29:13,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 35 transitions. [2020-07-11 02:29:13,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-11 02:29:13,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 35 transitions. [2020-07-11 02:29:13,316 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 35 transitions. [2020-07-11 02:29:13,363 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-11 02:29:13,363 INFO L225 Difference]: With dead ends: 56 [2020-07-11 02:29:13,364 INFO L226 Difference]: Without dead ends: 0 [2020-07-11 02:29:13,365 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2020-07-11 02:29:13,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-11 02:29:13,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-11 02:29:13,366 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:29:13,366 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-11 02:29:13,366 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-11 02:29:13,366 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-11 02:29:13,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:29:13,367 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-11 02:29:13,367 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-11 02:29:13,367 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:29:13,367 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:29:13,367 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-11 02:29:13,368 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-11 02:29:13,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:29:13,368 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-11 02:29:13,368 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-11 02:29:13,368 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:29:13,368 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:29:13,368 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:29:13,368 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:29:13,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-11 02:29:13,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-11 02:29:13,369 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 57 [2020-07-11 02:29:13,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:29:13,369 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-11 02:29:13,369 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-11 02:29:13,369 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2020-07-11 02:29:13,369 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:29:13,370 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-11 02:29:13,370 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:29:13,370 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-11 02:29:13,372 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-11 02:29:14,212 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-11 02:29:14,212 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-07-11 02:29:14,212 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-11 02:29:14,212 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-11 02:29:14,212 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-11 02:29:14,213 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-11 02:29:14,213 INFO L268 CegarLoopResult]: For program point L4-3(lines 3 5) no Hoare annotation was computed. [2020-07-11 02:29:14,213 INFO L268 CegarLoopResult]: For program point assume_abort_if_notENTRY(lines 3 5) no Hoare annotation was computed. [2020-07-11 02:29:14,213 INFO L268 CegarLoopResult]: For program point L4(line 4) no Hoare annotation was computed. [2020-07-11 02:29:14,213 INFO L268 CegarLoopResult]: For program point L4-1(line 4) no Hoare annotation was computed. [2020-07-11 02:29:14,213 INFO L268 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 3 5) no Hoare annotation was computed. [2020-07-11 02:29:14,214 INFO L271 CegarLoopResult]: At program point L33(lines 14 34) the Hoare annotation is: true [2020-07-11 02:29:14,214 INFO L264 CegarLoopResult]: At program point L31(lines 27 32) the Hoare annotation is: (and (<= main_~bound_off~0 main_~MAXPATHLEN~0) (<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0) (<= 0 main_~glob2_p_off~0) (<= 0 main_~glob2_pathbuf_off~0) (<= 0 main_~pathbuf_off~0) (<= main_~pathbuf_off~0 0) (<= main_~glob2_p_off~0 main_~MAXPATHLEN~0) (<= (+ main_~glob2_pathbuf_off~0 1) main_~MAXPATHLEN~0)) [2020-07-11 02:29:14,214 INFO L264 CegarLoopResult]: At program point L29(line 29) the Hoare annotation is: (and (<= main_~bound_off~0 main_~MAXPATHLEN~0) (<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0) (<= 0 main_~glob2_p_off~0) (<= 0 main_~glob2_pathbuf_off~0) (<= 0 main_~pathbuf_off~0) (<= main_~pathbuf_off~0 0) (<= main_~glob2_p_off~0 main_~MAXPATHLEN~0) (<= 0 |main_#t~post1|) (<= (+ main_~glob2_pathbuf_off~0 1) main_~MAXPATHLEN~0)) [2020-07-11 02:29:14,214 INFO L264 CegarLoopResult]: At program point L29-1(line 29) the Hoare annotation is: (and (<= main_~bound_off~0 main_~MAXPATHLEN~0) (<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0) (<= 0 main_~glob2_pathbuf_off~0) (<= main_~pathbuf_off~0 0) (<= 0 main_~pathbuf_off~0) (<= 0 |main_#t~post1|) (<= 1 main_~glob2_p_off~0) (<= (+ main_~glob2_pathbuf_off~0 1) main_~MAXPATHLEN~0)) [2020-07-11 02:29:14,215 INFO L264 CegarLoopResult]: At program point L27(line 27) the Hoare annotation is: (and (<= main_~bound_off~0 main_~MAXPATHLEN~0) (<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0) (<= 0 main_~glob2_pathbuf_off~0) (<= main_~pathbuf_off~0 0) (<= 0 main_~pathbuf_off~0) (<= (+ main_~glob2_pathbuf_off~0 1) main_~MAXPATHLEN~0)) [2020-07-11 02:29:14,215 INFO L264 CegarLoopResult]: At program point L25(line 25) the Hoare annotation is: (and (<= main_~bound_off~0 main_~MAXPATHLEN~0) (<= main_~pathbuf_off~0 0) (<= 0 main_~pathbuf_off~0) (<= (+ main_~pathbuf_off~0 1) main_~MAXPATHLEN~0)) [2020-07-11 02:29:14,215 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 13 34) the Hoare annotation is: true [2020-07-11 02:29:14,215 INFO L264 CegarLoopResult]: At program point L27-3(lines 27 32) the Hoare annotation is: (and (<= main_~bound_off~0 main_~MAXPATHLEN~0) (<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0) (<= 0 main_~glob2_p_off~0) (<= 0 main_~glob2_pathbuf_off~0) (<= main_~pathbuf_off~0 0) (<= 0 main_~pathbuf_off~0) (<= (+ main_~glob2_pathbuf_off~0 1) main_~MAXPATHLEN~0)) [2020-07-11 02:29:14,215 INFO L271 CegarLoopResult]: At program point L21(line 21) the Hoare annotation is: true [2020-07-11 02:29:14,215 INFO L271 CegarLoopResult]: At program point L21-1(line 21) the Hoare annotation is: true [2020-07-11 02:29:14,216 INFO L271 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: true [2020-07-11 02:29:14,216 INFO L271 CegarLoopResult]: At program point L21-2(line 21) the Hoare annotation is: true [2020-07-11 02:29:14,216 INFO L271 CegarLoopResult]: At program point L17(line 17) the Hoare annotation is: true [2020-07-11 02:29:14,216 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 13 34) the Hoare annotation is: true [2020-07-11 02:29:14,216 INFO L264 CegarLoopResult]: At program point L30(line 30) the Hoare annotation is: (let ((.cse0 (<= main_~bound_off~0 main_~MAXPATHLEN~0)) (.cse1 (<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)) (.cse2 (<= 0 main_~glob2_pathbuf_off~0)) (.cse3 (<= main_~pathbuf_off~0 0)) (.cse4 (<= 0 main_~pathbuf_off~0)) (.cse5 (<= (+ main_~glob2_pathbuf_off~0 1) main_~MAXPATHLEN~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= main_~glob2_p_off~0 main_~MAXPATHLEN~0) (<= 1 main_~glob2_p_off~0) .cse5) (and .cse0 .cse1 (<= 0 main_~glob2_p_off~0) .cse2 .cse3 .cse4 .cse5 (<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)))) [2020-07-11 02:29:14,217 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 13 34) the Hoare annotation is: true [2020-07-11 02:29:14,217 INFO L264 CegarLoopResult]: At program point L30-1(line 30) the Hoare annotation is: (let ((.cse0 (<= main_~bound_off~0 main_~MAXPATHLEN~0)) (.cse1 (<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)) (.cse2 (<= 0 main_~glob2_pathbuf_off~0)) (.cse3 (<= main_~pathbuf_off~0 0)) (.cse4 (<= 0 main_~pathbuf_off~0)) (.cse5 (<= (+ main_~glob2_pathbuf_off~0 1) main_~MAXPATHLEN~0))) (or (and .cse0 .cse1 .cse2 .cse3 (<= main_~glob2_p_off~0 main_~MAXPATHLEN~0) .cse4 (<= 1 main_~glob2_p_off~0) .cse5) (and .cse0 .cse1 (<= 0 main_~glob2_p_off~0) .cse2 .cse3 .cse4 .cse5 (<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)))) [2020-07-11 02:29:14,217 INFO L264 CegarLoopResult]: At program point L26(line 26) the Hoare annotation is: (and (<= main_~bound_off~0 main_~MAXPATHLEN~0) (<= 0 main_~glob2_pathbuf_off~0) (<= main_~pathbuf_off~0 0) (<= 0 main_~pathbuf_off~0) (<= (+ main_~glob2_pathbuf_off~0 1) main_~MAXPATHLEN~0)) [2020-07-11 02:29:14,217 INFO L264 CegarLoopResult]: At program point L24(line 24) the Hoare annotation is: (and (<= main_~pathbuf_off~0 0) (<= 0 main_~pathbuf_off~0) (<= (+ main_~pathbuf_off~0 1) main_~MAXPATHLEN~0)) [2020-07-11 02:29:14,217 INFO L271 CegarLoopResult]: At program point L22(line 22) the Hoare annotation is: true [2020-07-11 02:29:14,218 INFO L264 CegarLoopResult]: At program point L22-1(line 22) the Hoare annotation is: (<= 1 main_~MAXPATHLEN~0) [2020-07-11 02:29:14,218 INFO L271 CegarLoopResult]: At program point L20(line 20) the Hoare annotation is: true [2020-07-11 02:29:14,218 INFO L271 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: true [2020-07-11 02:29:14,218 INFO L271 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: true [2020-07-11 02:29:14,218 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 6 11) the Hoare annotation is: true [2020-07-11 02:29:14,218 INFO L264 CegarLoopResult]: At program point __VERIFIER_assertEXIT(lines 6 11) the Hoare annotation is: (or (= 0 |__VERIFIER_assert_#in~cond|) (not (= 0 __VERIFIER_assert_~cond))) [2020-07-11 02:29:14,218 INFO L264 CegarLoopResult]: At program point L8(line 8) the Hoare annotation is: (= 0 |__VERIFIER_assert_#in~cond|) [2020-07-11 02:29:14,219 INFO L264 CegarLoopResult]: At program point L7(lines 7 9) the Hoare annotation is: (or (= 0 |__VERIFIER_assert_#in~cond|) (not (= 0 __VERIFIER_assert_~cond))) [2020-07-11 02:29:14,219 INFO L264 CegarLoopResult]: At program point L7-2(lines 6 11) the Hoare annotation is: (or (= 0 |__VERIFIER_assert_#in~cond|) (not (= 0 __VERIFIER_assert_~cond))) [2020-07-11 02:29:14,219 INFO L264 CegarLoopResult]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8) the Hoare annotation is: (= 0 |__VERIFIER_assert_#in~cond|) [2020-07-11 02:29:14,223 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-11 02:29:14,224 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-11 02:29:14,224 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-11 02:29:14,224 WARN L170 areAnnotationChecker]: L4-1 has no Hoare annotation [2020-07-11 02:29:14,225 WARN L170 areAnnotationChecker]: L4-3 has no Hoare annotation [2020-07-11 02:29:14,234 INFO L163 areAnnotationChecker]: CFG has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-11 02:29:14,248 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.07 02:29:14 BoogieIcfgContainer [2020-07-11 02:29:14,248 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-11 02:29:14,251 INFO L168 Benchmark]: Toolchain (without parser) took 7005.44 ms. Allocated memory was 135.3 MB in the beginning and 304.1 MB in the end (delta: 168.8 MB). Free memory was 98.9 MB in the beginning and 109.7 MB in the end (delta: -10.8 MB). Peak memory consumption was 158.0 MB. Max. memory is 7.1 GB. [2020-07-11 02:29:14,251 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 135.3 MB. Free memory is still 117.1 MB. There was no memory consumed. Max. memory is 7.1 GB. [2020-07-11 02:29:14,252 INFO L168 Benchmark]: CACSL2BoogieTranslator took 256.28 ms. Allocated memory is still 135.3 MB. Free memory was 98.9 MB in the beginning and 89.1 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. [2020-07-11 02:29:14,253 INFO L168 Benchmark]: Boogie Preprocessor took 102.84 ms. Allocated memory was 135.3 MB in the beginning and 198.7 MB in the end (delta: 63.4 MB). Free memory was 89.1 MB in the beginning and 178.1 MB in the end (delta: -88.9 MB). Peak memory consumption was 15.6 MB. Max. memory is 7.1 GB. [2020-07-11 02:29:14,254 INFO L168 Benchmark]: RCFGBuilder took 371.62 ms. Allocated memory is still 198.7 MB. Free memory was 178.1 MB in the beginning and 158.2 MB in the end (delta: 19.9 MB). Peak memory consumption was 19.9 MB. Max. memory is 7.1 GB. [2020-07-11 02:29:14,255 INFO L168 Benchmark]: TraceAbstraction took 6268.82 ms. Allocated memory was 198.7 MB in the beginning and 304.1 MB in the end (delta: 105.4 MB). Free memory was 158.2 MB in the beginning and 109.7 MB in the end (delta: 48.5 MB). Peak memory consumption was 153.8 MB. Max. memory is 7.1 GB. [2020-07-11 02:29:14,259 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 135.3 MB. Free memory is still 117.1 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 256.28 ms. Allocated memory is still 135.3 MB. Free memory was 98.9 MB in the beginning and 89.1 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 102.84 ms. Allocated memory was 135.3 MB in the beginning and 198.7 MB in the end (delta: 63.4 MB). Free memory was 89.1 MB in the beginning and 178.1 MB in the end (delta: -88.9 MB). Peak memory consumption was 15.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 371.62 ms. Allocated memory is still 198.7 MB. Free memory was 178.1 MB in the beginning and 158.2 MB in the end (delta: 19.9 MB). Peak memory consumption was 19.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 6268.82 ms. Allocated memory was 198.7 MB in the beginning and 304.1 MB in the end (delta: 105.4 MB). Free memory was 158.2 MB in the beginning and 109.7 MB in the end (delta: 48.5 MB). Peak memory consumption was 153.8 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: (((((bound_off <= MAXPATHLEN && glob2_pathlim_off <= MAXPATHLEN) && 0 <= glob2_p_off) && 0 <= glob2_pathbuf_off) && pathbuf_off <= 0) && 0 <= pathbuf_off) && glob2_pathbuf_off + 1 <= MAXPATHLEN - ProcedureContractResult [Line: 13]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 6]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: 0 == \old(cond) || !(0 == cond) - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 41 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 5.2s, OverallIterations: 5, TraceHistogramMax: 6, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 143 SDtfs, 158 SDslu, 687 SDs, 0 SdLazy, 311 SolverSat, 73 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 98 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=56occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 5 MinimizatonAttempts, 9 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 36 LocationsWithAnnotation, 78 PreInvPairs, 114 NumberOfFragments, 341 HoareAnnotationTreeSize, 78 FomulaSimplifications, 999 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 36 FomulaSimplificationsInter, 331 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 191 NumberOfCodeBlocks, 191 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 186 ConstructedInterpolants, 0 QuantifiedInterpolants, 14762 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 3 PerfectInterpolantSequences, 88/95 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...