/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-46f3038-m [2020-07-08 23:38:01,923 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-08 23:38:01,926 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-08 23:38:01,943 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-08 23:38:01,943 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-08 23:38:01,945 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-08 23:38:01,947 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-08 23:38:01,959 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-08 23:38:01,961 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-08 23:38:01,962 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-08 23:38:01,964 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-08 23:38:01,966 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-08 23:38:01,967 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-08 23:38:01,970 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-08 23:38:01,971 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-08 23:38:01,972 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-08 23:38:01,975 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-08 23:38:01,976 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-08 23:38:01,978 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-08 23:38:01,979 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-08 23:38:01,980 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-08 23:38:01,981 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-08 23:38:01,982 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-08 23:38:01,983 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-08 23:38:01,985 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-08 23:38:01,985 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-08 23:38:01,986 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-08 23:38:01,986 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-08 23:38:01,987 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-08 23:38:01,988 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-08 23:38:01,988 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-08 23:38:01,989 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-08 23:38:01,989 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-08 23:38:01,990 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-08 23:38:01,991 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-08 23:38:01,991 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-08 23:38:01,992 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-08 23:38:01,992 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-08 23:38:01,992 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-08 23:38:01,993 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-08 23:38:01,994 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-08 23:38:01,994 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-08 23:38:02,004 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-08 23:38:02,004 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-08 23:38:02,005 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-08 23:38:02,005 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-08 23:38:02,006 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-08 23:38:02,006 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-08 23:38:02,006 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-08 23:38:02,006 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-08 23:38:02,006 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-08 23:38:02,007 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-08 23:38:02,007 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-08 23:38:02,007 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-08 23:38:02,007 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-08 23:38:02,007 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-08 23:38:02,008 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-08 23:38:02,008 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-08 23:38:02,008 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-08 23:38:02,008 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-08 23:38:02,008 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 23:38:02,009 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-08 23:38:02,009 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-08 23:38:02,009 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-08 23:38:02,009 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-08 23:38:02,268 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-08 23:38:02,282 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-08 23:38:02,285 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-08 23:38:02,286 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-08 23:38:02,286 INFO L275 PluginConnector]: CDTParser initialized [2020-07-08 23:38:02,287 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-08 23:38:02,359 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d925f9299/261788ff237c453787846c1b6f267958/FLAG829617895 [2020-07-08 23:38:02,792 INFO L306 CDTParser]: Found 1 translation units. [2020-07-08 23:38:02,793 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/NetBSD_loop.i [2020-07-08 23:38:02,799 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d925f9299/261788ff237c453787846c1b6f267958/FLAG829617895 [2020-07-08 23:38:03,241 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d925f9299/261788ff237c453787846c1b6f267958 [2020-07-08 23:38:03,251 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-08 23:38:03,253 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-08 23:38:03,254 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-08 23:38:03,254 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-08 23:38:03,257 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-08 23:38:03,259 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 11:38:03" (1/1) ... [2020-07-08 23:38:03,262 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51bd1d19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:38:03, skipping insertion in model container [2020-07-08 23:38:03,262 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 11:38:03" (1/1) ... [2020-07-08 23:38:03,269 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-08 23:38:03,286 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-08 23:38:03,494 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 23:38:03,504 INFO L203 MainTranslator]: Completed pre-run [2020-07-08 23:38:03,529 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 23:38:03,545 INFO L208 MainTranslator]: Completed translation [2020-07-08 23:38:03,546 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:38:03 WrapperNode [2020-07-08 23:38:03,546 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-08 23:38:03,547 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-08 23:38:03,547 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-08 23:38:03,547 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-08 23:38:03,561 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:38:03" (1/1) ... [2020-07-08 23:38:03,561 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:38:03" (1/1) ... [2020-07-08 23:38:03,567 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:38:03" (1/1) ... [2020-07-08 23:38:03,567 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:38:03" (1/1) ... [2020-07-08 23:38:03,574 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:38:03" (1/1) ... [2020-07-08 23:38:03,580 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:38:03" (1/1) ... [2020-07-08 23:38:03,582 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:38:03" (1/1) ... [2020-07-08 23:38:03,726 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-08 23:38:03,727 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-08 23:38:03,727 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-08 23:38:03,727 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-08 23:38:03,728 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:38:03" (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-08 23:38:03,797 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-08 23:38:03,797 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-08 23:38:03,797 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-08 23:38:03,797 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-08 23:38:03,798 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-08 23:38:03,798 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-08 23:38:03,798 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-08 23:38:03,798 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-08 23:38:03,799 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-08 23:38:03,799 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-08 23:38:03,799 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-08 23:38:03,799 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-08 23:38:03,800 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-08 23:38:04,079 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-08 23:38:04,079 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-08 23:38:04,083 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 11:38:04 BoogieIcfgContainer [2020-07-08 23:38:04,084 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-08 23:38:04,085 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-08 23:38:04,085 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-08 23:38:04,088 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-08 23:38:04,088 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.07 11:38:03" (1/3) ... [2020-07-08 23:38:04,089 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38ba3a76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 11:38:04, skipping insertion in model container [2020-07-08 23:38:04,089 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:38:03" (2/3) ... [2020-07-08 23:38:04,090 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38ba3a76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 11:38:04, skipping insertion in model container [2020-07-08 23:38:04,090 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 11:38:04" (3/3) ... [2020-07-08 23:38:04,092 INFO L109 eAbstractionObserver]: Analyzing ICFG NetBSD_loop.i [2020-07-08 23:38:04,107 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-08 23:38:04,119 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-08 23:38:04,138 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-08 23:38:04,162 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-08 23:38:04,162 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-08 23:38:04,162 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-08 23:38:04,162 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-08 23:38:04,163 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-08 23:38:04,163 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-08 23:38:04,163 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-08 23:38:04,163 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-08 23:38:04,181 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states. [2020-07-08 23:38:04,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-08 23:38:04,192 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:38:04,193 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-08 23:38:04,194 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:38:04,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:38:04,200 INFO L82 PathProgramCache]: Analyzing trace with hash -2007421113, now seen corresponding path program 1 times [2020-07-08 23:38:04,209 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:38:04,210 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1533910063] [2020-07-08 23:38:04,210 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:38:04,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:38:04,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:38:04,501 INFO L280 TraceCheckUtils]: 0: Hoare triple {39#true} assume true; {39#true} is VALID [2020-07-08 23:38:04,502 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {39#true} {39#true} #64#return; {39#true} is VALID [2020-07-08 23:38:04,504 INFO L263 TraceCheckUtils]: 0: Hoare triple {39#true} call ULTIMATE.init(); {39#true} is VALID [2020-07-08 23:38:04,505 INFO L280 TraceCheckUtils]: 1: Hoare triple {39#true} assume true; {39#true} is VALID [2020-07-08 23:38:04,505 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {39#true} {39#true} #64#return; {39#true} is VALID [2020-07-08 23:38:04,506 INFO L263 TraceCheckUtils]: 3: Hoare triple {39#true} call #t~ret2 := main(); {39#true} is VALID [2020-07-08 23:38:04,506 INFO L280 TraceCheckUtils]: 4: Hoare triple {39#true} havoc ~MAXPATHLEN~0; {39#true} is VALID [2020-07-08 23:38:04,506 INFO L280 TraceCheckUtils]: 5: Hoare triple {39#true} havoc ~pathbuf_off~0; {39#true} is VALID [2020-07-08 23:38:04,507 INFO L280 TraceCheckUtils]: 6: Hoare triple {39#true} havoc ~bound_off~0; {39#true} is VALID [2020-07-08 23:38:04,507 INFO L280 TraceCheckUtils]: 7: Hoare triple {39#true} havoc ~glob2_p_off~0; {39#true} is VALID [2020-07-08 23:38:04,508 INFO L280 TraceCheckUtils]: 8: Hoare triple {39#true} havoc ~glob2_pathbuf_off~0; {39#true} is VALID [2020-07-08 23:38:04,508 INFO L280 TraceCheckUtils]: 9: Hoare triple {39#true} havoc ~glob2_pathlim_off~0; {39#true} is VALID [2020-07-08 23:38:04,509 INFO L280 TraceCheckUtils]: 10: Hoare triple {39#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {39#true} is VALID [2020-07-08 23:38:04,509 INFO L280 TraceCheckUtils]: 11: Hoare triple {39#true} ~MAXPATHLEN~0 := #t~nondet0; {39#true} is VALID [2020-07-08 23:38:04,510 INFO L280 TraceCheckUtils]: 12: Hoare triple {39#true} havoc #t~nondet0; {39#true} is VALID [2020-07-08 23:38:04,510 INFO L280 TraceCheckUtils]: 13: Hoare triple {39#true} assume ~MAXPATHLEN~0 > 0 && ~MAXPATHLEN~0 < 2147483647; {39#true} is VALID [2020-07-08 23:38:04,511 INFO L280 TraceCheckUtils]: 14: Hoare triple {39#true} ~pathbuf_off~0 := 0; {43#(<= 0 main_~pathbuf_off~0)} is VALID [2020-07-08 23:38:04,512 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-08 23:38:04,514 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-08 23:38:04,515 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-08 23:38:04,517 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-08 23:38:04,519 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-08 23:38:04,522 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-08 23:38:04,523 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-08 23:38:04,524 INFO L280 TraceCheckUtils]: 22: Hoare triple {47#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {40#false} is VALID [2020-07-08 23:38:04,524 INFO L280 TraceCheckUtils]: 23: Hoare triple {40#false} assume !false; {40#false} is VALID [2020-07-08 23:38:04,529 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-08 23:38:04,530 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1533910063] [2020-07-08 23:38:04,532 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 23:38:04,532 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-08 23:38:04,533 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727813514] [2020-07-08 23:38:04,539 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2020-07-08 23:38:04,542 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 23:38:04,546 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-08 23:38:04,590 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-08 23:38:04,591 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-08 23:38:04,591 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 23:38:04,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-08 23:38:04,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-08 23:38:04,604 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 7 states. [2020-07-08 23:38:05,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:38:05,093 INFO L93 Difference]: Finished difference Result 68 states and 83 transitions. [2020-07-08 23:38:05,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-08 23:38:05,094 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2020-07-08 23:38:05,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 23:38:05,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-08 23:38:05,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 83 transitions. [2020-07-08 23:38:05,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-08 23:38:05,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 83 transitions. [2020-07-08 23:38:05,114 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 83 transitions. [2020-07-08 23:38:05,222 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-08 23:38:05,235 INFO L225 Difference]: With dead ends: 68 [2020-07-08 23:38:05,235 INFO L226 Difference]: Without dead ends: 40 [2020-07-08 23:38:05,239 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-08 23:38:05,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2020-07-08 23:38:05,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2020-07-08 23:38:05,313 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 23:38:05,314 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 37 states. [2020-07-08 23:38:05,314 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 37 states. [2020-07-08 23:38:05,315 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 37 states. [2020-07-08 23:38:05,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:38:05,321 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2020-07-08 23:38:05,322 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2020-07-08 23:38:05,323 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:38:05,323 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:38:05,323 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 40 states. [2020-07-08 23:38:05,323 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 40 states. [2020-07-08 23:38:05,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:38:05,328 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2020-07-08 23:38:05,328 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2020-07-08 23:38:05,329 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:38:05,329 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:38:05,330 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 23:38:05,330 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 23:38:05,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-07-08 23:38:05,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2020-07-08 23:38:05,335 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 24 [2020-07-08 23:38:05,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 23:38:05,335 INFO L479 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2020-07-08 23:38:05,336 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-08 23:38:05,336 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 37 states and 38 transitions. [2020-07-08 23:38:05,384 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-08 23:38:05,385 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2020-07-08 23:38:05,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-07-08 23:38:05,386 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:38:05,386 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-08 23:38:05,387 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-08 23:38:05,387 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:38:05,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:38:05,387 INFO L82 PathProgramCache]: Analyzing trace with hash -1994781074, now seen corresponding path program 1 times [2020-07-08 23:38:05,388 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:38:05,388 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2087642264] [2020-07-08 23:38:05,388 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:38:05,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:38:05,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:38:05,540 INFO L280 TraceCheckUtils]: 0: Hoare triple {346#true} assume true; {346#true} is VALID [2020-07-08 23:38:05,541 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {346#true} {346#true} #64#return; {346#true} is VALID [2020-07-08 23:38:05,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:38:05,560 INFO L280 TraceCheckUtils]: 0: Hoare triple {346#true} ~cond := #in~cond; {346#true} is VALID [2020-07-08 23:38:05,561 INFO L280 TraceCheckUtils]: 1: Hoare triple {346#true} assume !(0 == ~cond); {346#true} is VALID [2020-07-08 23:38:05,561 INFO L280 TraceCheckUtils]: 2: Hoare triple {346#true} assume true; {346#true} is VALID [2020-07-08 23:38:05,564 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-08 23:38:05,565 INFO L263 TraceCheckUtils]: 0: Hoare triple {346#true} call ULTIMATE.init(); {346#true} is VALID [2020-07-08 23:38:05,565 INFO L280 TraceCheckUtils]: 1: Hoare triple {346#true} assume true; {346#true} is VALID [2020-07-08 23:38:05,566 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {346#true} {346#true} #64#return; {346#true} is VALID [2020-07-08 23:38:05,566 INFO L263 TraceCheckUtils]: 3: Hoare triple {346#true} call #t~ret2 := main(); {346#true} is VALID [2020-07-08 23:38:05,567 INFO L280 TraceCheckUtils]: 4: Hoare triple {346#true} havoc ~MAXPATHLEN~0; {346#true} is VALID [2020-07-08 23:38:05,567 INFO L280 TraceCheckUtils]: 5: Hoare triple {346#true} havoc ~pathbuf_off~0; {346#true} is VALID [2020-07-08 23:38:05,567 INFO L280 TraceCheckUtils]: 6: Hoare triple {346#true} havoc ~bound_off~0; {346#true} is VALID [2020-07-08 23:38:05,568 INFO L280 TraceCheckUtils]: 7: Hoare triple {346#true} havoc ~glob2_p_off~0; {346#true} is VALID [2020-07-08 23:38:05,568 INFO L280 TraceCheckUtils]: 8: Hoare triple {346#true} havoc ~glob2_pathbuf_off~0; {346#true} is VALID [2020-07-08 23:38:05,569 INFO L280 TraceCheckUtils]: 9: Hoare triple {346#true} havoc ~glob2_pathlim_off~0; {346#true} is VALID [2020-07-08 23:38:05,569 INFO L280 TraceCheckUtils]: 10: Hoare triple {346#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {346#true} is VALID [2020-07-08 23:38:05,569 INFO L280 TraceCheckUtils]: 11: Hoare triple {346#true} ~MAXPATHLEN~0 := #t~nondet0; {346#true} is VALID [2020-07-08 23:38:05,570 INFO L280 TraceCheckUtils]: 12: Hoare triple {346#true} havoc #t~nondet0; {346#true} is VALID [2020-07-08 23:38:05,571 INFO L280 TraceCheckUtils]: 13: Hoare triple {346#true} assume ~MAXPATHLEN~0 > 0 && ~MAXPATHLEN~0 < 2147483647; {350#(<= 1 main_~MAXPATHLEN~0)} is VALID [2020-07-08 23:38:05,572 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-08 23:38:05,573 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-08 23:38:05,575 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-08 23:38:05,576 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-08 23:38:05,580 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-08 23:38:05,584 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-08 23:38:05,585 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-08 23:38:05,585 INFO L280 TraceCheckUtils]: 21: Hoare triple {346#true} ~cond := #in~cond; {346#true} is VALID [2020-07-08 23:38:05,585 INFO L280 TraceCheckUtils]: 22: Hoare triple {346#true} assume !(0 == ~cond); {346#true} is VALID [2020-07-08 23:38:05,586 INFO L280 TraceCheckUtils]: 23: Hoare triple {346#true} assume true; {346#true} is VALID [2020-07-08 23:38:05,588 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-08 23:38:05,589 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-08 23:38:05,590 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-08 23:38:05,591 INFO L280 TraceCheckUtils]: 27: Hoare triple {359#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {347#false} is VALID [2020-07-08 23:38:05,591 INFO L280 TraceCheckUtils]: 28: Hoare triple {347#false} assume !false; {347#false} is VALID [2020-07-08 23:38:05,598 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-08 23:38:05,598 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2087642264] [2020-07-08 23:38:05,599 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 23:38:05,599 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-08 23:38:05,599 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136080484] [2020-07-08 23:38:05,603 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2020-07-08 23:38:05,604 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 23:38:05,604 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-08 23:38:05,637 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-08 23:38:05,638 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-08 23:38:05,638 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 23:38:05,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-08 23:38:05,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-07-08 23:38:05,639 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 8 states. [2020-07-08 23:38:06,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:38:06,145 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2020-07-08 23:38:06,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-08 23:38:06,146 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2020-07-08 23:38:06,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 23:38:06,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-08 23:38:06,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 44 transitions. [2020-07-08 23:38:06,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-08 23:38:06,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 44 transitions. [2020-07-08 23:38:06,159 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 44 transitions. [2020-07-08 23:38:06,211 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-08 23:38:06,213 INFO L225 Difference]: With dead ends: 46 [2020-07-08 23:38:06,213 INFO L226 Difference]: Without dead ends: 44 [2020-07-08 23:38:06,214 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-08 23:38:06,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-07-08 23:38:06,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2020-07-08 23:38:06,307 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 23:38:06,307 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 42 states. [2020-07-08 23:38:06,307 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 42 states. [2020-07-08 23:38:06,308 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 42 states. [2020-07-08 23:38:06,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:38:06,317 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2020-07-08 23:38:06,317 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2020-07-08 23:38:06,318 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:38:06,318 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:38:06,318 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 44 states. [2020-07-08 23:38:06,318 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 44 states. [2020-07-08 23:38:06,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:38:06,325 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2020-07-08 23:38:06,326 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2020-07-08 23:38:06,326 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:38:06,327 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:38:06,327 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 23:38:06,327 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 23:38:06,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-07-08 23:38:06,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2020-07-08 23:38:06,332 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 29 [2020-07-08 23:38:06,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 23:38:06,332 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2020-07-08 23:38:06,332 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-08 23:38:06,336 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states and 43 transitions. [2020-07-08 23:38:06,395 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-08 23:38:06,396 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2020-07-08 23:38:06,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-07-08 23:38:06,397 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:38:06,397 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-08 23:38:06,398 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-08 23:38:06,398 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:38:06,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:38:06,398 INFO L82 PathProgramCache]: Analyzing trace with hash -1065397402, now seen corresponding path program 1 times [2020-07-08 23:38:06,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:38:06,399 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1515252469] [2020-07-08 23:38:06,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:38:06,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:38:06,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:38:06,512 INFO L280 TraceCheckUtils]: 0: Hoare triple {634#true} assume true; {634#true} is VALID [2020-07-08 23:38:06,512 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {634#true} {634#true} #64#return; {634#true} is VALID [2020-07-08 23:38:06,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:38:06,525 INFO L280 TraceCheckUtils]: 0: Hoare triple {634#true} ~cond := #in~cond; {634#true} is VALID [2020-07-08 23:38:06,525 INFO L280 TraceCheckUtils]: 1: Hoare triple {634#true} assume !(0 == ~cond); {634#true} is VALID [2020-07-08 23:38:06,525 INFO L280 TraceCheckUtils]: 2: Hoare triple {634#true} assume true; {634#true} is VALID [2020-07-08 23:38:06,530 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-08 23:38:06,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:38:06,537 INFO L280 TraceCheckUtils]: 0: Hoare triple {634#true} ~cond := #in~cond; {634#true} is VALID [2020-07-08 23:38:06,538 INFO L280 TraceCheckUtils]: 1: Hoare triple {634#true} assume !(0 == ~cond); {634#true} is VALID [2020-07-08 23:38:06,538 INFO L280 TraceCheckUtils]: 2: Hoare triple {634#true} assume true; {634#true} is VALID [2020-07-08 23:38:06,539 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-08 23:38:06,539 INFO L263 TraceCheckUtils]: 0: Hoare triple {634#true} call ULTIMATE.init(); {634#true} is VALID [2020-07-08 23:38:06,540 INFO L280 TraceCheckUtils]: 1: Hoare triple {634#true} assume true; {634#true} is VALID [2020-07-08 23:38:06,540 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {634#true} {634#true} #64#return; {634#true} is VALID [2020-07-08 23:38:06,540 INFO L263 TraceCheckUtils]: 3: Hoare triple {634#true} call #t~ret2 := main(); {634#true} is VALID [2020-07-08 23:38:06,541 INFO L280 TraceCheckUtils]: 4: Hoare triple {634#true} havoc ~MAXPATHLEN~0; {634#true} is VALID [2020-07-08 23:38:06,541 INFO L280 TraceCheckUtils]: 5: Hoare triple {634#true} havoc ~pathbuf_off~0; {634#true} is VALID [2020-07-08 23:38:06,541 INFO L280 TraceCheckUtils]: 6: Hoare triple {634#true} havoc ~bound_off~0; {634#true} is VALID [2020-07-08 23:38:06,541 INFO L280 TraceCheckUtils]: 7: Hoare triple {634#true} havoc ~glob2_p_off~0; {634#true} is VALID [2020-07-08 23:38:06,542 INFO L280 TraceCheckUtils]: 8: Hoare triple {634#true} havoc ~glob2_pathbuf_off~0; {634#true} is VALID [2020-07-08 23:38:06,542 INFO L280 TraceCheckUtils]: 9: Hoare triple {634#true} havoc ~glob2_pathlim_off~0; {634#true} is VALID [2020-07-08 23:38:06,542 INFO L280 TraceCheckUtils]: 10: Hoare triple {634#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {634#true} is VALID [2020-07-08 23:38:06,543 INFO L280 TraceCheckUtils]: 11: Hoare triple {634#true} ~MAXPATHLEN~0 := #t~nondet0; {634#true} is VALID [2020-07-08 23:38:06,543 INFO L280 TraceCheckUtils]: 12: Hoare triple {634#true} havoc #t~nondet0; {634#true} is VALID [2020-07-08 23:38:06,543 INFO L280 TraceCheckUtils]: 13: Hoare triple {634#true} assume ~MAXPATHLEN~0 > 0 && ~MAXPATHLEN~0 < 2147483647; {634#true} is VALID [2020-07-08 23:38:06,544 INFO L280 TraceCheckUtils]: 14: Hoare triple {634#true} ~pathbuf_off~0 := 0; {638#(<= 0 main_~pathbuf_off~0)} is VALID [2020-07-08 23:38:06,544 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-08 23:38:06,545 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-08 23:38:06,546 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-08 23:38:06,546 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-08 23:38:06,547 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-08 23:38:06,547 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-08 23:38:06,548 INFO L280 TraceCheckUtils]: 21: Hoare triple {634#true} ~cond := #in~cond; {634#true} is VALID [2020-07-08 23:38:06,548 INFO L280 TraceCheckUtils]: 22: Hoare triple {634#true} assume !(0 == ~cond); {634#true} is VALID [2020-07-08 23:38:06,548 INFO L280 TraceCheckUtils]: 23: Hoare triple {634#true} assume true; {634#true} is VALID [2020-07-08 23:38:06,549 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-08 23:38:06,549 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-08 23:38:06,549 INFO L280 TraceCheckUtils]: 26: Hoare triple {634#true} ~cond := #in~cond; {634#true} is VALID [2020-07-08 23:38:06,550 INFO L280 TraceCheckUtils]: 27: Hoare triple {634#true} assume !(0 == ~cond); {634#true} is VALID [2020-07-08 23:38:06,550 INFO L280 TraceCheckUtils]: 28: Hoare triple {634#true} assume true; {634#true} is VALID [2020-07-08 23:38:06,551 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-08 23:38:06,551 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-08 23:38:06,552 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-08 23:38:06,553 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-08 23:38:06,554 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-08 23:38:06,555 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-08 23:38:06,555 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-08 23:38:06,559 INFO L280 TraceCheckUtils]: 36: Hoare triple {652#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {635#false} is VALID [2020-07-08 23:38:06,560 INFO L280 TraceCheckUtils]: 37: Hoare triple {635#false} assume !false; {635#false} is VALID [2020-07-08 23:38:06,561 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-08 23:38:06,561 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1515252469] [2020-07-08 23:38:06,562 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 23:38:06,562 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-08 23:38:06,562 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132636215] [2020-07-08 23:38:06,563 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 38 [2020-07-08 23:38:06,563 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 23:38:06,563 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-08 23:38:06,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-08 23:38:06,594 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-08 23:38:06,594 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 23:38:06,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-08 23:38:06,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-07-08 23:38:06,595 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 9 states. [2020-07-08 23:38:07,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:38:07,110 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2020-07-08 23:38:07,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-08 23:38:07,110 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 38 [2020-07-08 23:38:07,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 23:38:07,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-08 23:38:07,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 44 transitions. [2020-07-08 23:38:07,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-08 23:38:07,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 44 transitions. [2020-07-08 23:38:07,117 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 44 transitions. [2020-07-08 23:38:07,162 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-08 23:38:07,167 INFO L225 Difference]: With dead ends: 50 [2020-07-08 23:38:07,168 INFO L226 Difference]: Without dead ends: 48 [2020-07-08 23:38:07,170 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-08 23:38:07,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-07-08 23:38:07,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2020-07-08 23:38:07,243 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 23:38:07,244 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 46 states. [2020-07-08 23:38:07,244 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 46 states. [2020-07-08 23:38:07,244 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 46 states. [2020-07-08 23:38:07,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:38:07,251 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2020-07-08 23:38:07,251 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2020-07-08 23:38:07,252 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:38:07,252 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:38:07,252 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 48 states. [2020-07-08 23:38:07,252 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 48 states. [2020-07-08 23:38:07,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:38:07,258 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2020-07-08 23:38:07,258 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2020-07-08 23:38:07,258 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:38:07,259 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:38:07,259 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 23:38:07,259 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 23:38:07,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-07-08 23:38:07,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2020-07-08 23:38:07,264 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 38 [2020-07-08 23:38:07,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 23:38:07,266 INFO L479 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2020-07-08 23:38:07,266 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-08 23:38:07,266 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 46 states and 46 transitions. [2020-07-08 23:38:07,316 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-08 23:38:07,317 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2020-07-08 23:38:07,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-07-08 23:38:07,318 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:38:07,318 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-08 23:38:07,318 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-08 23:38:07,319 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:38:07,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:38:07,319 INFO L82 PathProgramCache]: Analyzing trace with hash 470853039, now seen corresponding path program 2 times [2020-07-08 23:38:07,319 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:38:07,320 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1531141111] [2020-07-08 23:38:07,320 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:38:07,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:38:07,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:38:07,471 INFO L280 TraceCheckUtils]: 0: Hoare triple {955#true} assume true; {955#true} is VALID [2020-07-08 23:38:07,472 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {955#true} {955#true} #64#return; {955#true} is VALID [2020-07-08 23:38:07,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:38:07,485 INFO L280 TraceCheckUtils]: 0: Hoare triple {955#true} ~cond := #in~cond; {955#true} is VALID [2020-07-08 23:38:07,485 INFO L280 TraceCheckUtils]: 1: Hoare triple {955#true} assume !(0 == ~cond); {955#true} is VALID [2020-07-08 23:38:07,486 INFO L280 TraceCheckUtils]: 2: Hoare triple {955#true} assume true; {955#true} is VALID [2020-07-08 23:38:07,487 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-08 23:38:07,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:38:07,508 INFO L280 TraceCheckUtils]: 0: Hoare triple {955#true} ~cond := #in~cond; {955#true} is VALID [2020-07-08 23:38:07,509 INFO L280 TraceCheckUtils]: 1: Hoare triple {955#true} assume !(0 == ~cond); {955#true} is VALID [2020-07-08 23:38:07,509 INFO L280 TraceCheckUtils]: 2: Hoare triple {955#true} assume true; {955#true} is VALID [2020-07-08 23:38:07,510 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-08 23:38:07,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:38:07,528 INFO L280 TraceCheckUtils]: 0: Hoare triple {955#true} ~cond := #in~cond; {955#true} is VALID [2020-07-08 23:38:07,529 INFO L280 TraceCheckUtils]: 1: Hoare triple {955#true} assume !(0 == ~cond); {955#true} is VALID [2020-07-08 23:38:07,529 INFO L280 TraceCheckUtils]: 2: Hoare triple {955#true} assume true; {955#true} is VALID [2020-07-08 23:38:07,546 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-08 23:38:07,546 INFO L263 TraceCheckUtils]: 0: Hoare triple {955#true} call ULTIMATE.init(); {955#true} is VALID [2020-07-08 23:38:07,547 INFO L280 TraceCheckUtils]: 1: Hoare triple {955#true} assume true; {955#true} is VALID [2020-07-08 23:38:07,547 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {955#true} {955#true} #64#return; {955#true} is VALID [2020-07-08 23:38:07,547 INFO L263 TraceCheckUtils]: 3: Hoare triple {955#true} call #t~ret2 := main(); {955#true} is VALID [2020-07-08 23:38:07,548 INFO L280 TraceCheckUtils]: 4: Hoare triple {955#true} havoc ~MAXPATHLEN~0; {955#true} is VALID [2020-07-08 23:38:07,548 INFO L280 TraceCheckUtils]: 5: Hoare triple {955#true} havoc ~pathbuf_off~0; {955#true} is VALID [2020-07-08 23:38:07,549 INFO L280 TraceCheckUtils]: 6: Hoare triple {955#true} havoc ~bound_off~0; {955#true} is VALID [2020-07-08 23:38:07,549 INFO L280 TraceCheckUtils]: 7: Hoare triple {955#true} havoc ~glob2_p_off~0; {955#true} is VALID [2020-07-08 23:38:07,549 INFO L280 TraceCheckUtils]: 8: Hoare triple {955#true} havoc ~glob2_pathbuf_off~0; {955#true} is VALID [2020-07-08 23:38:07,549 INFO L280 TraceCheckUtils]: 9: Hoare triple {955#true} havoc ~glob2_pathlim_off~0; {955#true} is VALID [2020-07-08 23:38:07,550 INFO L280 TraceCheckUtils]: 10: Hoare triple {955#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {955#true} is VALID [2020-07-08 23:38:07,550 INFO L280 TraceCheckUtils]: 11: Hoare triple {955#true} ~MAXPATHLEN~0 := #t~nondet0; {955#true} is VALID [2020-07-08 23:38:07,550 INFO L280 TraceCheckUtils]: 12: Hoare triple {955#true} havoc #t~nondet0; {955#true} is VALID [2020-07-08 23:38:07,551 INFO L280 TraceCheckUtils]: 13: Hoare triple {955#true} assume ~MAXPATHLEN~0 > 0 && ~MAXPATHLEN~0 < 2147483647; {959#(<= 1 main_~MAXPATHLEN~0)} is VALID [2020-07-08 23:38:07,552 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-08 23:38:07,552 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-08 23:38:07,553 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-08 23:38:07,554 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-08 23:38:07,554 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-08 23:38:07,555 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-08 23:38:07,555 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-08 23:38:07,556 INFO L280 TraceCheckUtils]: 21: Hoare triple {955#true} ~cond := #in~cond; {955#true} is VALID [2020-07-08 23:38:07,556 INFO L280 TraceCheckUtils]: 22: Hoare triple {955#true} assume !(0 == ~cond); {955#true} is VALID [2020-07-08 23:38:07,556 INFO L280 TraceCheckUtils]: 23: Hoare triple {955#true} assume true; {955#true} is VALID [2020-07-08 23:38:07,558 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-08 23:38:07,558 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-08 23:38:07,558 INFO L280 TraceCheckUtils]: 26: Hoare triple {955#true} ~cond := #in~cond; {955#true} is VALID [2020-07-08 23:38:07,558 INFO L280 TraceCheckUtils]: 27: Hoare triple {955#true} assume !(0 == ~cond); {955#true} is VALID [2020-07-08 23:38:07,559 INFO L280 TraceCheckUtils]: 28: Hoare triple {955#true} assume true; {955#true} is VALID [2020-07-08 23:38:07,559 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-08 23:38:07,560 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-08 23:38:07,561 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-08 23:38:07,562 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-08 23:38:07,562 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-08 23:38:07,562 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-08 23:38:07,563 INFO L280 TraceCheckUtils]: 35: Hoare triple {955#true} ~cond := #in~cond; {955#true} is VALID [2020-07-08 23:38:07,563 INFO L280 TraceCheckUtils]: 36: Hoare triple {955#true} assume !(0 == ~cond); {955#true} is VALID [2020-07-08 23:38:07,563 INFO L280 TraceCheckUtils]: 37: Hoare triple {955#true} assume true; {955#true} is VALID [2020-07-08 23:38:07,564 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-08 23:38:07,565 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-08 23:38:07,566 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-08 23:38:07,566 INFO L280 TraceCheckUtils]: 41: Hoare triple {978#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {956#false} is VALID [2020-07-08 23:38:07,566 INFO L280 TraceCheckUtils]: 42: Hoare triple {956#false} assume !false; {956#false} is VALID [2020-07-08 23:38:07,569 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-08 23:38:07,569 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1531141111] [2020-07-08 23:38:07,569 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-08 23:38:07,569 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-07-08 23:38:07,570 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366072971] [2020-07-08 23:38:07,570 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 43 [2020-07-08 23:38:07,571 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 23:38:07,571 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-08 23:38:07,611 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-08 23:38:07,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-08 23:38:07,612 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 23:38:07,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-08 23:38:07,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2020-07-08 23:38:07,613 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 10 states. [2020-07-08 23:38:08,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:38:08,267 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2020-07-08 23:38:08,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-08 23:38:08,267 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 43 [2020-07-08 23:38:08,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 23:38:08,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-08 23:38:08,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 52 transitions. [2020-07-08 23:38:08,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-08 23:38:08,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 52 transitions. [2020-07-08 23:38:08,274 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 52 transitions. [2020-07-08 23:38:08,360 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-08 23:38:08,362 INFO L225 Difference]: With dead ends: 60 [2020-07-08 23:38:08,363 INFO L226 Difference]: Without dead ends: 58 [2020-07-08 23:38:08,364 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-08 23:38:08,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2020-07-08 23:38:08,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2020-07-08 23:38:08,456 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 23:38:08,456 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand 56 states. [2020-07-08 23:38:08,456 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 56 states. [2020-07-08 23:38:08,456 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 56 states. [2020-07-08 23:38:08,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:38:08,460 INFO L93 Difference]: Finished difference Result 58 states and 59 transitions. [2020-07-08 23:38:08,460 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2020-07-08 23:38:08,460 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:38:08,461 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:38:08,461 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 58 states. [2020-07-08 23:38:08,461 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 58 states. [2020-07-08 23:38:08,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:38:08,464 INFO L93 Difference]: Finished difference Result 58 states and 59 transitions. [2020-07-08 23:38:08,464 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2020-07-08 23:38:08,465 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:38:08,465 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:38:08,465 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 23:38:08,466 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 23:38:08,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-07-08 23:38:08,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 57 transitions. [2020-07-08 23:38:08,469 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 57 transitions. Word has length 43 [2020-07-08 23:38:08,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 23:38:08,469 INFO L479 AbstractCegarLoop]: Abstraction has 56 states and 57 transitions. [2020-07-08 23:38:08,469 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-08 23:38:08,469 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 56 states and 57 transitions. [2020-07-08 23:38:08,547 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-08 23:38:08,548 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2020-07-08 23:38:08,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2020-07-08 23:38:08,550 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:38:08,550 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-08 23:38:08,551 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-08 23:38:08,551 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:38:08,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:38:08,551 INFO L82 PathProgramCache]: Analyzing trace with hash -2065107152, now seen corresponding path program 3 times [2020-07-08 23:38:08,552 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:38:08,552 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1711785158] [2020-07-08 23:38:08,552 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:38:08,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:38:08,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:38:08,666 INFO L280 TraceCheckUtils]: 0: Hoare triple {1343#true} assume true; {1343#true} is VALID [2020-07-08 23:38:08,666 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1343#true} {1343#true} #64#return; {1343#true} is VALID [2020-07-08 23:38:08,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:38:08,689 INFO L280 TraceCheckUtils]: 0: Hoare triple {1343#true} ~cond := #in~cond; {1343#true} is VALID [2020-07-08 23:38:08,689 INFO L280 TraceCheckUtils]: 1: Hoare triple {1343#true} assume !(0 == ~cond); {1343#true} is VALID [2020-07-08 23:38:08,689 INFO L280 TraceCheckUtils]: 2: Hoare triple {1343#true} assume true; {1343#true} is VALID [2020-07-08 23:38:08,692 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-08 23:38:08,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:38:08,708 INFO L280 TraceCheckUtils]: 0: Hoare triple {1343#true} ~cond := #in~cond; {1343#true} is VALID [2020-07-08 23:38:08,709 INFO L280 TraceCheckUtils]: 1: Hoare triple {1343#true} assume !(0 == ~cond); {1343#true} is VALID [2020-07-08 23:38:08,709 INFO L280 TraceCheckUtils]: 2: Hoare triple {1343#true} assume true; {1343#true} is VALID [2020-07-08 23:38:08,710 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-08 23:38:08,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:38:08,742 INFO L280 TraceCheckUtils]: 0: Hoare triple {1343#true} ~cond := #in~cond; {1343#true} is VALID [2020-07-08 23:38:08,742 INFO L280 TraceCheckUtils]: 1: Hoare triple {1343#true} assume !(0 == ~cond); {1343#true} is VALID [2020-07-08 23:38:08,743 INFO L280 TraceCheckUtils]: 2: Hoare triple {1343#true} assume true; {1343#true} is VALID [2020-07-08 23:38:08,744 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-08 23:38:08,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:38:08,755 INFO L280 TraceCheckUtils]: 0: Hoare triple {1343#true} ~cond := #in~cond; {1343#true} is VALID [2020-07-08 23:38:08,755 INFO L280 TraceCheckUtils]: 1: Hoare triple {1343#true} assume !(0 == ~cond); {1343#true} is VALID [2020-07-08 23:38:08,756 INFO L280 TraceCheckUtils]: 2: Hoare triple {1343#true} assume true; {1343#true} is VALID [2020-07-08 23:38:08,757 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-08 23:38:08,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:38:08,777 INFO L280 TraceCheckUtils]: 0: Hoare triple {1343#true} ~cond := #in~cond; {1343#true} is VALID [2020-07-08 23:38:08,778 INFO L280 TraceCheckUtils]: 1: Hoare triple {1343#true} assume !(0 == ~cond); {1343#true} is VALID [2020-07-08 23:38:08,778 INFO L280 TraceCheckUtils]: 2: Hoare triple {1343#true} assume true; {1343#true} is VALID [2020-07-08 23:38:08,779 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-08 23:38:08,779 INFO L263 TraceCheckUtils]: 0: Hoare triple {1343#true} call ULTIMATE.init(); {1343#true} is VALID [2020-07-08 23:38:08,780 INFO L280 TraceCheckUtils]: 1: Hoare triple {1343#true} assume true; {1343#true} is VALID [2020-07-08 23:38:08,780 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1343#true} {1343#true} #64#return; {1343#true} is VALID [2020-07-08 23:38:08,780 INFO L263 TraceCheckUtils]: 3: Hoare triple {1343#true} call #t~ret2 := main(); {1343#true} is VALID [2020-07-08 23:38:08,780 INFO L280 TraceCheckUtils]: 4: Hoare triple {1343#true} havoc ~MAXPATHLEN~0; {1343#true} is VALID [2020-07-08 23:38:08,780 INFO L280 TraceCheckUtils]: 5: Hoare triple {1343#true} havoc ~pathbuf_off~0; {1343#true} is VALID [2020-07-08 23:38:08,781 INFO L280 TraceCheckUtils]: 6: Hoare triple {1343#true} havoc ~bound_off~0; {1343#true} is VALID [2020-07-08 23:38:08,781 INFO L280 TraceCheckUtils]: 7: Hoare triple {1343#true} havoc ~glob2_p_off~0; {1343#true} is VALID [2020-07-08 23:38:08,781 INFO L280 TraceCheckUtils]: 8: Hoare triple {1343#true} havoc ~glob2_pathbuf_off~0; {1343#true} is VALID [2020-07-08 23:38:08,781 INFO L280 TraceCheckUtils]: 9: Hoare triple {1343#true} havoc ~glob2_pathlim_off~0; {1343#true} is VALID [2020-07-08 23:38:08,782 INFO L280 TraceCheckUtils]: 10: Hoare triple {1343#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {1343#true} is VALID [2020-07-08 23:38:08,782 INFO L280 TraceCheckUtils]: 11: Hoare triple {1343#true} ~MAXPATHLEN~0 := #t~nondet0; {1343#true} is VALID [2020-07-08 23:38:08,782 INFO L280 TraceCheckUtils]: 12: Hoare triple {1343#true} havoc #t~nondet0; {1343#true} is VALID [2020-07-08 23:38:08,786 INFO L280 TraceCheckUtils]: 13: Hoare triple {1343#true} assume ~MAXPATHLEN~0 > 0 && ~MAXPATHLEN~0 < 2147483647; {1343#true} is VALID [2020-07-08 23:38:08,788 INFO L280 TraceCheckUtils]: 14: Hoare triple {1343#true} ~pathbuf_off~0 := 0; {1347#(<= main_~pathbuf_off~0 0)} is VALID [2020-07-08 23:38:08,788 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-08 23:38:08,789 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-08 23:38:08,790 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-08 23:38:08,790 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-08 23:38:08,791 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-08 23:38:08,791 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-08 23:38:08,791 INFO L280 TraceCheckUtils]: 21: Hoare triple {1343#true} ~cond := #in~cond; {1343#true} is VALID [2020-07-08 23:38:08,791 INFO L280 TraceCheckUtils]: 22: Hoare triple {1343#true} assume !(0 == ~cond); {1343#true} is VALID [2020-07-08 23:38:08,792 INFO L280 TraceCheckUtils]: 23: Hoare triple {1343#true} assume true; {1343#true} is VALID [2020-07-08 23:38:08,792 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-08 23:38:08,793 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-08 23:38:08,793 INFO L280 TraceCheckUtils]: 26: Hoare triple {1343#true} ~cond := #in~cond; {1343#true} is VALID [2020-07-08 23:38:08,793 INFO L280 TraceCheckUtils]: 27: Hoare triple {1343#true} assume !(0 == ~cond); {1343#true} is VALID [2020-07-08 23:38:08,793 INFO L280 TraceCheckUtils]: 28: Hoare triple {1343#true} assume true; {1343#true} is VALID [2020-07-08 23:38:08,795 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-08 23:38:08,795 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-08 23:38:08,796 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-08 23:38:08,796 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-08 23:38:08,797 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-08 23:38:08,797 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-08 23:38:08,797 INFO L280 TraceCheckUtils]: 35: Hoare triple {1343#true} ~cond := #in~cond; {1343#true} is VALID [2020-07-08 23:38:08,797 INFO L280 TraceCheckUtils]: 36: Hoare triple {1343#true} assume !(0 == ~cond); {1343#true} is VALID [2020-07-08 23:38:08,798 INFO L280 TraceCheckUtils]: 37: Hoare triple {1343#true} assume true; {1343#true} is VALID [2020-07-08 23:38:08,799 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-08 23:38:08,799 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-08 23:38:08,799 INFO L280 TraceCheckUtils]: 40: Hoare triple {1343#true} ~cond := #in~cond; {1343#true} is VALID [2020-07-08 23:38:08,799 INFO L280 TraceCheckUtils]: 41: Hoare triple {1343#true} assume !(0 == ~cond); {1343#true} is VALID [2020-07-08 23:38:08,800 INFO L280 TraceCheckUtils]: 42: Hoare triple {1343#true} assume true; {1343#true} is VALID [2020-07-08 23:38:08,802 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-08 23:38:08,802 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-08 23:38:08,803 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-08 23:38:08,803 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-08 23:38:08,804 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-08 23:38:08,804 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-08 23:38:08,805 INFO L280 TraceCheckUtils]: 49: Hoare triple {1343#true} ~cond := #in~cond; {1343#true} is VALID [2020-07-08 23:38:08,805 INFO L280 TraceCheckUtils]: 50: Hoare triple {1343#true} assume !(0 == ~cond); {1343#true} is VALID [2020-07-08 23:38:08,805 INFO L280 TraceCheckUtils]: 51: Hoare triple {1343#true} assume true; {1343#true} is VALID [2020-07-08 23:38:08,806 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-08 23:38:08,807 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-08 23:38:08,808 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-08 23:38:08,808 INFO L280 TraceCheckUtils]: 55: Hoare triple {1372#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {1344#false} is VALID [2020-07-08 23:38:08,809 INFO L280 TraceCheckUtils]: 56: Hoare triple {1344#false} assume !false; {1344#false} is VALID [2020-07-08 23:38:08,812 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-08 23:38:08,812 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1711785158] [2020-07-08 23:38:08,812 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-08 23:38:08,813 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-07-08 23:38:08,813 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626470155] [2020-07-08 23:38:08,813 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 57 [2020-07-08 23:38:08,814 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 23:38:08,814 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-08 23:38:08,852 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-08 23:38:08,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-08 23:38:08,853 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 23:38:08,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-08 23:38:08,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-07-08 23:38:08,854 INFO L87 Difference]: Start difference. First operand 56 states and 57 transitions. Second operand 8 states. [2020-07-08 23:38:09,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:38:09,234 INFO L93 Difference]: Finished difference Result 56 states and 57 transitions. [2020-07-08 23:38:09,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-08 23:38:09,235 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 57 [2020-07-08 23:38:09,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 23:38:09,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-08 23:38:09,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 35 transitions. [2020-07-08 23:38:09,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-08 23:38:09,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 35 transitions. [2020-07-08 23:38:09,238 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 35 transitions. [2020-07-08 23:38:09,278 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-08 23:38:09,278 INFO L225 Difference]: With dead ends: 56 [2020-07-08 23:38:09,278 INFO L226 Difference]: Without dead ends: 0 [2020-07-08 23:38:09,279 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-08 23:38:09,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-08 23:38:09,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-08 23:38:09,280 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 23:38:09,280 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-08 23:38:09,280 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-08 23:38:09,280 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-08 23:38:09,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:38:09,280 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-08 23:38:09,281 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 23:38:09,281 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:38:09,281 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:38:09,281 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-08 23:38:09,281 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-08 23:38:09,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:38:09,281 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-08 23:38:09,282 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 23:38:09,282 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:38:09,282 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:38:09,282 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 23:38:09,282 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 23:38:09,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-08 23:38:09,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-08 23:38:09,283 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 57 [2020-07-08 23:38:09,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 23:38:09,283 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-08 23:38:09,283 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-08 23:38:09,283 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2020-07-08 23:38:09,283 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-08 23:38:09,283 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 23:38:09,283 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:38:09,284 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-08 23:38:09,286 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-08 23:38:10,041 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-08 23:38:10,042 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-07-08 23:38:10,042 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-08 23:38:10,042 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-08 23:38:10,042 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-08 23:38:10,042 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-08 23:38:10,042 INFO L268 CegarLoopResult]: For program point L4-3(lines 3 5) no Hoare annotation was computed. [2020-07-08 23:38:10,043 INFO L268 CegarLoopResult]: For program point assume_abort_if_notENTRY(lines 3 5) no Hoare annotation was computed. [2020-07-08 23:38:10,043 INFO L268 CegarLoopResult]: For program point L4(line 4) no Hoare annotation was computed. [2020-07-08 23:38:10,043 INFO L268 CegarLoopResult]: For program point L4-1(line 4) no Hoare annotation was computed. [2020-07-08 23:38:10,043 INFO L268 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 3 5) no Hoare annotation was computed. [2020-07-08 23:38:10,043 INFO L271 CegarLoopResult]: At program point L33(lines 14 34) the Hoare annotation is: true [2020-07-08 23:38:10,043 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-08 23:38:10,044 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-08 23:38:10,044 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-08 23:38:10,044 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-08 23:38:10,044 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-08 23:38:10,044 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 13 34) the Hoare annotation is: true [2020-07-08 23:38:10,045 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-08 23:38:10,045 INFO L271 CegarLoopResult]: At program point L21(line 21) the Hoare annotation is: true [2020-07-08 23:38:10,045 INFO L271 CegarLoopResult]: At program point L21-1(line 21) the Hoare annotation is: true [2020-07-08 23:38:10,045 INFO L271 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: true [2020-07-08 23:38:10,045 INFO L271 CegarLoopResult]: At program point L21-2(line 21) the Hoare annotation is: true [2020-07-08 23:38:10,045 INFO L271 CegarLoopResult]: At program point L17(line 17) the Hoare annotation is: true [2020-07-08 23:38:10,045 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 13 34) the Hoare annotation is: true [2020-07-08 23:38:10,046 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-08 23:38:10,046 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 13 34) the Hoare annotation is: true [2020-07-08 23:38:10,046 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-08 23:38:10,046 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-08 23:38:10,046 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-08 23:38:10,047 INFO L271 CegarLoopResult]: At program point L22(line 22) the Hoare annotation is: true [2020-07-08 23:38:10,047 INFO L264 CegarLoopResult]: At program point L22-1(line 22) the Hoare annotation is: (<= 1 main_~MAXPATHLEN~0) [2020-07-08 23:38:10,047 INFO L271 CegarLoopResult]: At program point L20(line 20) the Hoare annotation is: true [2020-07-08 23:38:10,047 INFO L271 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: true [2020-07-08 23:38:10,047 INFO L271 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: true [2020-07-08 23:38:10,047 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 6 11) the Hoare annotation is: true [2020-07-08 23:38:10,047 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-08 23:38:10,048 INFO L264 CegarLoopResult]: At program point L8(line 8) the Hoare annotation is: (= 0 |__VERIFIER_assert_#in~cond|) [2020-07-08 23:38:10,048 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-08 23:38:10,048 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-08 23:38:10,048 INFO L264 CegarLoopResult]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8) the Hoare annotation is: (= 0 |__VERIFIER_assert_#in~cond|) [2020-07-08 23:38:10,052 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-08 23:38:10,053 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-08 23:38:10,053 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-08 23:38:10,054 WARN L170 areAnnotationChecker]: L4-1 has no Hoare annotation [2020-07-08 23:38:10,054 WARN L170 areAnnotationChecker]: L4-3 has no Hoare annotation [2020-07-08 23:38:10,065 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-08 23:38:10,078 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.07 11:38:10 BoogieIcfgContainer [2020-07-08 23:38:10,079 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-08 23:38:10,082 INFO L168 Benchmark]: Toolchain (without parser) took 6828.68 ms. Allocated memory was 138.9 MB in the beginning and 280.5 MB in the end (delta: 141.6 MB). Free memory was 104.0 MB in the beginning and 108.4 MB in the end (delta: -4.4 MB). Peak memory consumption was 137.2 MB. Max. memory is 7.1 GB. [2020-07-08 23:38:10,083 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 138.9 MB. Free memory is still 122.0 MB. There was no memory consumed. Max. memory is 7.1 GB. [2020-07-08 23:38:10,083 INFO L168 Benchmark]: CACSL2BoogieTranslator took 292.70 ms. Allocated memory is still 138.9 MB. Free memory was 104.0 MB in the beginning and 94.2 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. [2020-07-08 23:38:10,084 INFO L168 Benchmark]: Boogie Preprocessor took 179.43 ms. Allocated memory was 138.9 MB in the beginning and 206.0 MB in the end (delta: 67.1 MB). Free memory was 94.2 MB in the beginning and 185.8 MB in the end (delta: -91.5 MB). Peak memory consumption was 15.7 MB. Max. memory is 7.1 GB. [2020-07-08 23:38:10,085 INFO L168 Benchmark]: RCFGBuilder took 357.16 ms. Allocated memory is still 206.0 MB. Free memory was 185.8 MB in the beginning and 165.2 MB in the end (delta: 20.6 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. [2020-07-08 23:38:10,086 INFO L168 Benchmark]: TraceAbstraction took 5994.08 ms. Allocated memory was 206.0 MB in the beginning and 280.5 MB in the end (delta: 74.4 MB). Free memory was 165.2 MB in the beginning and 108.4 MB in the end (delta: 56.8 MB). Peak memory consumption was 131.2 MB. Max. memory is 7.1 GB. [2020-07-08 23:38:10,090 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 138.9 MB. Free memory is still 122.0 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 292.70 ms. Allocated memory is still 138.9 MB. Free memory was 104.0 MB in the beginning and 94.2 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 179.43 ms. Allocated memory was 138.9 MB in the beginning and 206.0 MB in the end (delta: 67.1 MB). Free memory was 94.2 MB in the beginning and 185.8 MB in the end (delta: -91.5 MB). Peak memory consumption was 15.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 357.16 ms. Allocated memory is still 206.0 MB. Free memory was 185.8 MB in the beginning and 165.2 MB in the end (delta: 20.6 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5994.08 ms. Allocated memory was 206.0 MB in the beginning and 280.5 MB in the end (delta: 74.4 MB). Free memory was 165.2 MB in the beginning and 108.4 MB in the end (delta: 56.8 MB). Peak memory consumption was 131.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 8]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: (((((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.1s, OverallIterations: 5, TraceHistogramMax: 6, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.7s, 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.3s AutomataMinimizationTime, 5 MinimizatonAttempts, 9 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 36 LocationsWithAnnotation, 78 PreInvPairs, 114 NumberOfFragments, 341 HoareAnnotationTreeSize, 78 FomulaSimplifications, 999 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 36 FomulaSimplificationsInter, 331 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 1.0s 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...