/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/loop-invgen/NetBSD_loop.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 20:22:47,399 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 20:22:47,401 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 20:22:47,415 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 20:22:47,415 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 20:22:47,416 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 20:22:47,417 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 20:22:47,419 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 20:22:47,421 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 20:22:47,422 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 20:22:47,423 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 20:22:47,424 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 20:22:47,424 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 20:22:47,425 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 20:22:47,427 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 20:22:47,428 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 20:22:47,431 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 20:22:47,432 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 20:22:47,435 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 20:22:47,437 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 20:22:47,443 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 20:22:47,445 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 20:22:47,448 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 20:22:47,449 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 20:22:47,454 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 20:22:47,454 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 20:22:47,454 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 20:22:47,456 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 20:22:47,456 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 20:22:47,460 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 20:22:47,460 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 20:22:47,461 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 20:22:47,462 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 20:22:47,463 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 20:22:47,467 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 20:22:47,468 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 20:22:47,470 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 20:22:47,470 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 20:22:47,471 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 20:22:47,471 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 20:22:47,473 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 20:22:47,474 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-10 20:22:47,486 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 20:22:47,486 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 20:22:47,488 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 20:22:47,489 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 20:22:47,489 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 20:22:47,489 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 20:22:47,489 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 20:22:47,489 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 20:22:47,490 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 20:22:47,490 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 20:22:47,491 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 20:22:47,491 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 20:22:47,492 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 20:22:47,492 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 20:22:47,492 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 20:22:47,493 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-10 20:22:47,493 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 20:22:47,493 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 20:22:47,493 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 20:22:47,494 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 20:22:47,494 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-10 20:22:47,494 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 20:22:47,494 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-10 20:22:47,871 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 20:22:47,887 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 20:22:47,891 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 20:22:47,893 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 20:22:47,893 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 20:22:47,894 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/NetBSD_loop.i [2020-07-10 20:22:47,975 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e38063a5/0a8821a647ef44f1ad4bc33e30322e15/FLAGc85ddabe6 [2020-07-10 20:22:48,463 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 20:22:48,464 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/NetBSD_loop.i [2020-07-10 20:22:48,471 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e38063a5/0a8821a647ef44f1ad4bc33e30322e15/FLAGc85ddabe6 [2020-07-10 20:22:48,890 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e38063a5/0a8821a647ef44f1ad4bc33e30322e15 [2020-07-10 20:22:48,902 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 20:22:48,905 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 20:22:48,909 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 20:22:48,909 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 20:22:48,913 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 20:22:48,916 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 08:22:48" (1/1) ... [2020-07-10 20:22:48,920 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11ee7b6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:22:48, skipping insertion in model container [2020-07-10 20:22:48,920 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 08:22:48" (1/1) ... [2020-07-10 20:22:48,929 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 20:22:48,949 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 20:22:49,162 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 20:22:49,169 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 20:22:49,192 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 20:22:49,208 INFO L208 MainTranslator]: Completed translation [2020-07-10 20:22:49,209 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:22:49 WrapperNode [2020-07-10 20:22:49,209 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 20:22:49,209 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 20:22:49,209 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 20:22:49,210 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 20:22:49,222 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:22:49" (1/1) ... [2020-07-10 20:22:49,222 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:22:49" (1/1) ... [2020-07-10 20:22:49,227 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:22:49" (1/1) ... [2020-07-10 20:22:49,227 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:22:49" (1/1) ... [2020-07-10 20:22:49,232 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:22:49" (1/1) ... [2020-07-10 20:22:49,237 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:22:49" (1/1) ... [2020-07-10 20:22:49,238 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:22:49" (1/1) ... [2020-07-10 20:22:49,317 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 20:22:49,320 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 20:22:49,320 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 20:22:49,321 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 20:22:49,324 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:22:49" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 20:22:49,393 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 20:22:49,394 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 20:22:49,394 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-10 20:22:49,394 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-10 20:22:49,394 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 20:22:49,394 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 20:22:49,395 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-10 20:22:49,395 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-10 20:22:49,395 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-10 20:22:49,395 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 20:22:49,395 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 20:22:49,396 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 20:22:49,396 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 20:22:49,854 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 20:22:49,855 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-10 20:22:49,860 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 08:22:49 BoogieIcfgContainer [2020-07-10 20:22:49,860 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 20:22:49,861 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 20:22:49,862 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 20:22:49,865 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 20:22:49,866 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 08:22:48" (1/3) ... [2020-07-10 20:22:49,866 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36498b88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 08:22:49, skipping insertion in model container [2020-07-10 20:22:49,867 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:22:49" (2/3) ... [2020-07-10 20:22:49,867 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36498b88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 08:22:49, skipping insertion in model container [2020-07-10 20:22:49,867 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 08:22:49" (3/3) ... [2020-07-10 20:22:49,869 INFO L109 eAbstractionObserver]: Analyzing ICFG NetBSD_loop.i [2020-07-10 20:22:49,880 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-10 20:22:49,888 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 20:22:49,903 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 20:22:49,928 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 20:22:49,929 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 20:22:49,929 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-10 20:22:49,929 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 20:22:49,930 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 20:22:49,930 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 20:22:49,930 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 20:22:49,930 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 20:22:49,945 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states. [2020-07-10 20:22:49,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-10 20:22:49,956 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:22:49,957 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-10 20:22:49,957 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:22:49,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:22:49,964 INFO L82 PathProgramCache]: Analyzing trace with hash -2007421113, now seen corresponding path program 1 times [2020-07-10 20:22:49,974 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:22:49,974 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [585979269] [2020-07-10 20:22:49,975 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:22:50,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:22:50,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:22:50,275 INFO L280 TraceCheckUtils]: 0: Hoare triple {39#true} assume true; {39#true} is VALID [2020-07-10 20:22:50,275 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {39#true} {39#true} #64#return; {39#true} is VALID [2020-07-10 20:22:50,277 INFO L263 TraceCheckUtils]: 0: Hoare triple {39#true} call ULTIMATE.init(); {39#true} is VALID [2020-07-10 20:22:50,278 INFO L280 TraceCheckUtils]: 1: Hoare triple {39#true} assume true; {39#true} is VALID [2020-07-10 20:22:50,278 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {39#true} {39#true} #64#return; {39#true} is VALID [2020-07-10 20:22:50,279 INFO L263 TraceCheckUtils]: 3: Hoare triple {39#true} call #t~ret2 := main(); {39#true} is VALID [2020-07-10 20:22:50,279 INFO L280 TraceCheckUtils]: 4: Hoare triple {39#true} havoc ~MAXPATHLEN~0; {39#true} is VALID [2020-07-10 20:22:50,279 INFO L280 TraceCheckUtils]: 5: Hoare triple {39#true} havoc ~pathbuf_off~0; {39#true} is VALID [2020-07-10 20:22:50,280 INFO L280 TraceCheckUtils]: 6: Hoare triple {39#true} havoc ~bound_off~0; {39#true} is VALID [2020-07-10 20:22:50,280 INFO L280 TraceCheckUtils]: 7: Hoare triple {39#true} havoc ~glob2_p_off~0; {39#true} is VALID [2020-07-10 20:22:50,280 INFO L280 TraceCheckUtils]: 8: Hoare triple {39#true} havoc ~glob2_pathbuf_off~0; {39#true} is VALID [2020-07-10 20:22:50,280 INFO L280 TraceCheckUtils]: 9: Hoare triple {39#true} havoc ~glob2_pathlim_off~0; {39#true} is VALID [2020-07-10 20:22:50,281 INFO L280 TraceCheckUtils]: 10: Hoare triple {39#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {39#true} is VALID [2020-07-10 20:22:50,281 INFO L280 TraceCheckUtils]: 11: Hoare triple {39#true} ~MAXPATHLEN~0 := #t~nondet0; {39#true} is VALID [2020-07-10 20:22:50,282 INFO L280 TraceCheckUtils]: 12: Hoare triple {39#true} havoc #t~nondet0; {39#true} is VALID [2020-07-10 20:22:50,282 INFO L280 TraceCheckUtils]: 13: Hoare triple {39#true} assume ~MAXPATHLEN~0 > 0 && ~MAXPATHLEN~0 < 2147483647; {39#true} is VALID [2020-07-10 20:22:50,287 INFO L280 TraceCheckUtils]: 14: Hoare triple {39#true} ~pathbuf_off~0 := 0; {43#(<= 0 main_~pathbuf_off~0)} is VALID [2020-07-10 20:22:50,289 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-10 20:22:50,292 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-10 20:22:50,293 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-10 20:22:50,295 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-10 20:22:50,296 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-10 20:22:50,301 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-10 20:22:50,302 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-10 20:22:50,304 INFO L280 TraceCheckUtils]: 22: Hoare triple {47#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {40#false} is VALID [2020-07-10 20:22:50,304 INFO L280 TraceCheckUtils]: 23: Hoare triple {40#false} assume !false; {40#false} is VALID [2020-07-10 20:22:50,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:22:50,309 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:22:50,311 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [585979269] [2020-07-10 20:22:50,314 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:22:50,314 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-10 20:22:50,315 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3540959] [2020-07-10 20:22:50,322 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2020-07-10 20:22:50,325 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:22:50,329 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-10 20:22:50,384 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-10 20:22:50,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-10 20:22:50,385 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:22:50,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-10 20:22:50,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-10 20:22:50,398 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 7 states. [2020-07-10 20:22:50,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:50,939 INFO L93 Difference]: Finished difference Result 68 states and 83 transitions. [2020-07-10 20:22:50,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-10 20:22:50,939 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2020-07-10 20:22:50,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:22:50,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 20:22:50,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 83 transitions. [2020-07-10 20:22:50,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 20:22:50,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 83 transitions. [2020-07-10 20:22:50,961 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 83 transitions. [2020-07-10 20:22:51,138 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-10 20:22:51,155 INFO L225 Difference]: With dead ends: 68 [2020-07-10 20:22:51,155 INFO L226 Difference]: Without dead ends: 40 [2020-07-10 20:22:51,160 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-10 20:22:51,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2020-07-10 20:22:51,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2020-07-10 20:22:51,294 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:22:51,295 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 37 states. [2020-07-10 20:22:51,295 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 37 states. [2020-07-10 20:22:51,296 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 37 states. [2020-07-10 20:22:51,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:51,303 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2020-07-10 20:22:51,303 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2020-07-10 20:22:51,304 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:22:51,304 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:22:51,305 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 40 states. [2020-07-10 20:22:51,305 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 40 states. [2020-07-10 20:22:51,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:51,310 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2020-07-10 20:22:51,311 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2020-07-10 20:22:51,312 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:22:51,312 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:22:51,312 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:22:51,312 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:22:51,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-07-10 20:22:51,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2020-07-10 20:22:51,318 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 24 [2020-07-10 20:22:51,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:22:51,319 INFO L479 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2020-07-10 20:22:51,319 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-10 20:22:51,319 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 37 states and 38 transitions. [2020-07-10 20:22:51,367 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-10 20:22:51,368 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2020-07-10 20:22:51,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-07-10 20:22:51,369 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:22:51,369 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-10 20:22:51,370 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 20:22:51,370 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:22:51,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:22:51,371 INFO L82 PathProgramCache]: Analyzing trace with hash -1994781074, now seen corresponding path program 1 times [2020-07-10 20:22:51,371 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:22:51,371 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1144604120] [2020-07-10 20:22:51,371 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:22:51,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:22:51,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:22:51,546 INFO L280 TraceCheckUtils]: 0: Hoare triple {346#true} assume true; {346#true} is VALID [2020-07-10 20:22:51,546 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {346#true} {346#true} #64#return; {346#true} is VALID [2020-07-10 20:22:51,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:22:51,559 INFO L280 TraceCheckUtils]: 0: Hoare triple {346#true} ~cond := #in~cond; {346#true} is VALID [2020-07-10 20:22:51,560 INFO L280 TraceCheckUtils]: 1: Hoare triple {346#true} assume !(0 == ~cond); {346#true} is VALID [2020-07-10 20:22:51,560 INFO L280 TraceCheckUtils]: 2: Hoare triple {346#true} assume true; {346#true} is VALID [2020-07-10 20:22:51,561 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-10 20:22:51,562 INFO L263 TraceCheckUtils]: 0: Hoare triple {346#true} call ULTIMATE.init(); {346#true} is VALID [2020-07-10 20:22:51,562 INFO L280 TraceCheckUtils]: 1: Hoare triple {346#true} assume true; {346#true} is VALID [2020-07-10 20:22:51,563 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {346#true} {346#true} #64#return; {346#true} is VALID [2020-07-10 20:22:51,563 INFO L263 TraceCheckUtils]: 3: Hoare triple {346#true} call #t~ret2 := main(); {346#true} is VALID [2020-07-10 20:22:51,563 INFO L280 TraceCheckUtils]: 4: Hoare triple {346#true} havoc ~MAXPATHLEN~0; {346#true} is VALID [2020-07-10 20:22:51,564 INFO L280 TraceCheckUtils]: 5: Hoare triple {346#true} havoc ~pathbuf_off~0; {346#true} is VALID [2020-07-10 20:22:51,564 INFO L280 TraceCheckUtils]: 6: Hoare triple {346#true} havoc ~bound_off~0; {346#true} is VALID [2020-07-10 20:22:51,564 INFO L280 TraceCheckUtils]: 7: Hoare triple {346#true} havoc ~glob2_p_off~0; {346#true} is VALID [2020-07-10 20:22:51,565 INFO L280 TraceCheckUtils]: 8: Hoare triple {346#true} havoc ~glob2_pathbuf_off~0; {346#true} is VALID [2020-07-10 20:22:51,565 INFO L280 TraceCheckUtils]: 9: Hoare triple {346#true} havoc ~glob2_pathlim_off~0; {346#true} is VALID [2020-07-10 20:22:51,565 INFO L280 TraceCheckUtils]: 10: Hoare triple {346#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {346#true} is VALID [2020-07-10 20:22:51,566 INFO L280 TraceCheckUtils]: 11: Hoare triple {346#true} ~MAXPATHLEN~0 := #t~nondet0; {346#true} is VALID [2020-07-10 20:22:51,566 INFO L280 TraceCheckUtils]: 12: Hoare triple {346#true} havoc #t~nondet0; {346#true} is VALID [2020-07-10 20:22:51,567 INFO L280 TraceCheckUtils]: 13: Hoare triple {346#true} assume ~MAXPATHLEN~0 > 0 && ~MAXPATHLEN~0 < 2147483647; {350#(<= 1 main_~MAXPATHLEN~0)} is VALID [2020-07-10 20:22:51,568 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-10 20:22:51,569 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-10 20:22:51,570 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-10 20:22:51,570 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-10 20:22:51,571 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-10 20:22:51,572 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-10 20:22:51,573 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-10 20:22:51,573 INFO L280 TraceCheckUtils]: 21: Hoare triple {346#true} ~cond := #in~cond; {346#true} is VALID [2020-07-10 20:22:51,573 INFO L280 TraceCheckUtils]: 22: Hoare triple {346#true} assume !(0 == ~cond); {346#true} is VALID [2020-07-10 20:22:51,574 INFO L280 TraceCheckUtils]: 23: Hoare triple {346#true} assume true; {346#true} is VALID [2020-07-10 20:22:51,575 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-10 20:22:51,576 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-10 20:22:51,577 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-10 20:22:51,578 INFO L280 TraceCheckUtils]: 27: Hoare triple {359#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {347#false} is VALID [2020-07-10 20:22:51,578 INFO L280 TraceCheckUtils]: 28: Hoare triple {347#false} assume !false; {347#false} is VALID [2020-07-10 20:22:51,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:22:51,580 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:22:51,581 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1144604120] [2020-07-10 20:22:51,581 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:22:51,581 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-10 20:22:51,582 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596401313] [2020-07-10 20:22:51,583 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2020-07-10 20:22:51,583 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:22:51,583 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-10 20:22:51,620 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:22:51,621 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-10 20:22:51,621 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:22:51,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-10 20:22:51,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-07-10 20:22:51,622 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 8 states. [2020-07-10 20:22:52,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:52,162 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2020-07-10 20:22:52,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-10 20:22:52,163 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2020-07-10 20:22:52,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:22:52,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-10 20:22:52,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 44 transitions. [2020-07-10 20:22:52,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-10 20:22:52,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 44 transitions. [2020-07-10 20:22:52,171 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 44 transitions. [2020-07-10 20:22:52,220 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-10 20:22:52,223 INFO L225 Difference]: With dead ends: 46 [2020-07-10 20:22:52,223 INFO L226 Difference]: Without dead ends: 44 [2020-07-10 20:22:52,224 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-10 20:22:52,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-07-10 20:22:52,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2020-07-10 20:22:52,294 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:22:52,294 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 42 states. [2020-07-10 20:22:52,294 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 42 states. [2020-07-10 20:22:52,295 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 42 states. [2020-07-10 20:22:52,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:52,299 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2020-07-10 20:22:52,299 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2020-07-10 20:22:52,300 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:22:52,300 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:22:52,300 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 44 states. [2020-07-10 20:22:52,300 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 44 states. [2020-07-10 20:22:52,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:52,305 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2020-07-10 20:22:52,305 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2020-07-10 20:22:52,306 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:22:52,306 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:22:52,306 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:22:52,306 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:22:52,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-07-10 20:22:52,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2020-07-10 20:22:52,310 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 29 [2020-07-10 20:22:52,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:22:52,310 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2020-07-10 20:22:52,310 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-10 20:22:52,311 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states and 43 transitions. [2020-07-10 20:22:52,375 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-10 20:22:52,375 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2020-07-10 20:22:52,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-07-10 20:22:52,377 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:22:52,377 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-10 20:22:52,377 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 20:22:52,377 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:22:52,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:22:52,378 INFO L82 PathProgramCache]: Analyzing trace with hash -1065397402, now seen corresponding path program 1 times [2020-07-10 20:22:52,378 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:22:52,379 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [907107201] [2020-07-10 20:22:52,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:22:52,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:22:52,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:22:52,574 INFO L280 TraceCheckUtils]: 0: Hoare triple {634#true} assume true; {634#true} is VALID [2020-07-10 20:22:52,574 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {634#true} {634#true} #64#return; {634#true} is VALID [2020-07-10 20:22:52,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:22:52,589 INFO L280 TraceCheckUtils]: 0: Hoare triple {634#true} ~cond := #in~cond; {634#true} is VALID [2020-07-10 20:22:52,590 INFO L280 TraceCheckUtils]: 1: Hoare triple {634#true} assume !(0 == ~cond); {634#true} is VALID [2020-07-10 20:22:52,590 INFO L280 TraceCheckUtils]: 2: Hoare triple {634#true} assume true; {634#true} is VALID [2020-07-10 20:22:52,591 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-10 20:22:52,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:22:52,609 INFO L280 TraceCheckUtils]: 0: Hoare triple {634#true} ~cond := #in~cond; {634#true} is VALID [2020-07-10 20:22:52,609 INFO L280 TraceCheckUtils]: 1: Hoare triple {634#true} assume !(0 == ~cond); {634#true} is VALID [2020-07-10 20:22:52,609 INFO L280 TraceCheckUtils]: 2: Hoare triple {634#true} assume true; {634#true} is VALID [2020-07-10 20:22:52,617 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-10 20:22:52,618 INFO L263 TraceCheckUtils]: 0: Hoare triple {634#true} call ULTIMATE.init(); {634#true} is VALID [2020-07-10 20:22:52,618 INFO L280 TraceCheckUtils]: 1: Hoare triple {634#true} assume true; {634#true} is VALID [2020-07-10 20:22:52,619 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {634#true} {634#true} #64#return; {634#true} is VALID [2020-07-10 20:22:52,619 INFO L263 TraceCheckUtils]: 3: Hoare triple {634#true} call #t~ret2 := main(); {634#true} is VALID [2020-07-10 20:22:52,619 INFO L280 TraceCheckUtils]: 4: Hoare triple {634#true} havoc ~MAXPATHLEN~0; {634#true} is VALID [2020-07-10 20:22:52,620 INFO L280 TraceCheckUtils]: 5: Hoare triple {634#true} havoc ~pathbuf_off~0; {634#true} is VALID [2020-07-10 20:22:52,620 INFO L280 TraceCheckUtils]: 6: Hoare triple {634#true} havoc ~bound_off~0; {634#true} is VALID [2020-07-10 20:22:52,624 INFO L280 TraceCheckUtils]: 7: Hoare triple {634#true} havoc ~glob2_p_off~0; {634#true} is VALID [2020-07-10 20:22:52,624 INFO L280 TraceCheckUtils]: 8: Hoare triple {634#true} havoc ~glob2_pathbuf_off~0; {634#true} is VALID [2020-07-10 20:22:52,624 INFO L280 TraceCheckUtils]: 9: Hoare triple {634#true} havoc ~glob2_pathlim_off~0; {634#true} is VALID [2020-07-10 20:22:52,625 INFO L280 TraceCheckUtils]: 10: Hoare triple {634#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {634#true} is VALID [2020-07-10 20:22:52,625 INFO L280 TraceCheckUtils]: 11: Hoare triple {634#true} ~MAXPATHLEN~0 := #t~nondet0; {634#true} is VALID [2020-07-10 20:22:52,625 INFO L280 TraceCheckUtils]: 12: Hoare triple {634#true} havoc #t~nondet0; {634#true} is VALID [2020-07-10 20:22:52,626 INFO L280 TraceCheckUtils]: 13: Hoare triple {634#true} assume ~MAXPATHLEN~0 > 0 && ~MAXPATHLEN~0 < 2147483647; {634#true} is VALID [2020-07-10 20:22:52,630 INFO L280 TraceCheckUtils]: 14: Hoare triple {634#true} ~pathbuf_off~0 := 0; {638#(<= 0 main_~pathbuf_off~0)} is VALID [2020-07-10 20:22:52,639 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-10 20:22:52,641 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-10 20:22:52,642 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-10 20:22:52,643 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-10 20:22:52,644 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-10 20:22:52,644 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-10 20:22:52,645 INFO L280 TraceCheckUtils]: 21: Hoare triple {634#true} ~cond := #in~cond; {634#true} is VALID [2020-07-10 20:22:52,645 INFO L280 TraceCheckUtils]: 22: Hoare triple {634#true} assume !(0 == ~cond); {634#true} is VALID [2020-07-10 20:22:52,645 INFO L280 TraceCheckUtils]: 23: Hoare triple {634#true} assume true; {634#true} is VALID [2020-07-10 20:22:52,647 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-10 20:22:52,647 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-10 20:22:52,648 INFO L280 TraceCheckUtils]: 26: Hoare triple {634#true} ~cond := #in~cond; {634#true} is VALID [2020-07-10 20:22:52,648 INFO L280 TraceCheckUtils]: 27: Hoare triple {634#true} assume !(0 == ~cond); {634#true} is VALID [2020-07-10 20:22:52,648 INFO L280 TraceCheckUtils]: 28: Hoare triple {634#true} assume true; {634#true} is VALID [2020-07-10 20:22:52,650 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-10 20:22:52,652 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-10 20:22:52,653 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-10 20:22:52,654 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-10 20:22:52,660 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-10 20:22:52,662 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-10 20:22:52,663 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-10 20:22:52,664 INFO L280 TraceCheckUtils]: 36: Hoare triple {652#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {635#false} is VALID [2020-07-10 20:22:52,664 INFO L280 TraceCheckUtils]: 37: Hoare triple {635#false} assume !false; {635#false} is VALID [2020-07-10 20:22:52,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:22:52,666 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:22:52,666 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [907107201] [2020-07-10 20:22:52,667 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:22:52,667 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-10 20:22:52,667 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985611952] [2020-07-10 20:22:52,667 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 38 [2020-07-10 20:22:52,668 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:22:52,668 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-10 20:22:52,713 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:22:52,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-10 20:22:52,713 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:22:52,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-10 20:22:52,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-07-10 20:22:52,714 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 9 states. [2020-07-10 20:22:53,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:53,232 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2020-07-10 20:22:53,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-10 20:22:53,232 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 38 [2020-07-10 20:22:53,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:22:53,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-10 20:22:53,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 44 transitions. [2020-07-10 20:22:53,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-10 20:22:53,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 44 transitions. [2020-07-10 20:22:53,245 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 44 transitions. [2020-07-10 20:22:53,295 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-10 20:22:53,298 INFO L225 Difference]: With dead ends: 50 [2020-07-10 20:22:53,299 INFO L226 Difference]: Without dead ends: 48 [2020-07-10 20:22:53,300 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-10 20:22:53,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-07-10 20:22:53,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2020-07-10 20:22:53,361 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:22:53,362 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 46 states. [2020-07-10 20:22:53,362 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 46 states. [2020-07-10 20:22:53,362 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 46 states. [2020-07-10 20:22:53,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:53,366 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2020-07-10 20:22:53,367 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2020-07-10 20:22:53,367 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:22:53,368 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:22:53,368 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 48 states. [2020-07-10 20:22:53,368 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 48 states. [2020-07-10 20:22:53,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:53,372 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2020-07-10 20:22:53,372 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2020-07-10 20:22:53,372 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:22:53,373 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:22:53,373 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:22:53,373 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:22:53,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-07-10 20:22:53,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2020-07-10 20:22:53,376 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 38 [2020-07-10 20:22:53,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:22:53,376 INFO L479 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2020-07-10 20:22:53,376 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-10 20:22:53,377 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 46 states and 46 transitions. [2020-07-10 20:22:53,440 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-10 20:22:53,440 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2020-07-10 20:22:53,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-07-10 20:22:53,441 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:22:53,442 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-10 20:22:53,442 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-10 20:22:53,442 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:22:53,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:22:53,443 INFO L82 PathProgramCache]: Analyzing trace with hash 470853039, now seen corresponding path program 2 times [2020-07-10 20:22:53,443 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:22:53,443 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [632653515] [2020-07-10 20:22:53,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:22:53,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:22:53,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:22:53,608 INFO L280 TraceCheckUtils]: 0: Hoare triple {955#true} assume true; {955#true} is VALID [2020-07-10 20:22:53,609 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {955#true} {955#true} #64#return; {955#true} is VALID [2020-07-10 20:22:53,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:22:53,619 INFO L280 TraceCheckUtils]: 0: Hoare triple {955#true} ~cond := #in~cond; {955#true} is VALID [2020-07-10 20:22:53,619 INFO L280 TraceCheckUtils]: 1: Hoare triple {955#true} assume !(0 == ~cond); {955#true} is VALID [2020-07-10 20:22:53,619 INFO L280 TraceCheckUtils]: 2: Hoare triple {955#true} assume true; {955#true} is VALID [2020-07-10 20:22:53,620 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-10 20:22:53,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:22:53,637 INFO L280 TraceCheckUtils]: 0: Hoare triple {955#true} ~cond := #in~cond; {955#true} is VALID [2020-07-10 20:22:53,638 INFO L280 TraceCheckUtils]: 1: Hoare triple {955#true} assume !(0 == ~cond); {955#true} is VALID [2020-07-10 20:22:53,638 INFO L280 TraceCheckUtils]: 2: Hoare triple {955#true} assume true; {955#true} is VALID [2020-07-10 20:22:53,639 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-10 20:22:53,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:22:53,647 INFO L280 TraceCheckUtils]: 0: Hoare triple {955#true} ~cond := #in~cond; {955#true} is VALID [2020-07-10 20:22:53,647 INFO L280 TraceCheckUtils]: 1: Hoare triple {955#true} assume !(0 == ~cond); {955#true} is VALID [2020-07-10 20:22:53,647 INFO L280 TraceCheckUtils]: 2: Hoare triple {955#true} assume true; {955#true} is VALID [2020-07-10 20:22:53,648 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-10 20:22:53,649 INFO L263 TraceCheckUtils]: 0: Hoare triple {955#true} call ULTIMATE.init(); {955#true} is VALID [2020-07-10 20:22:53,649 INFO L280 TraceCheckUtils]: 1: Hoare triple {955#true} assume true; {955#true} is VALID [2020-07-10 20:22:53,649 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {955#true} {955#true} #64#return; {955#true} is VALID [2020-07-10 20:22:53,649 INFO L263 TraceCheckUtils]: 3: Hoare triple {955#true} call #t~ret2 := main(); {955#true} is VALID [2020-07-10 20:22:53,650 INFO L280 TraceCheckUtils]: 4: Hoare triple {955#true} havoc ~MAXPATHLEN~0; {955#true} is VALID [2020-07-10 20:22:53,650 INFO L280 TraceCheckUtils]: 5: Hoare triple {955#true} havoc ~pathbuf_off~0; {955#true} is VALID [2020-07-10 20:22:53,650 INFO L280 TraceCheckUtils]: 6: Hoare triple {955#true} havoc ~bound_off~0; {955#true} is VALID [2020-07-10 20:22:53,650 INFO L280 TraceCheckUtils]: 7: Hoare triple {955#true} havoc ~glob2_p_off~0; {955#true} is VALID [2020-07-10 20:22:53,651 INFO L280 TraceCheckUtils]: 8: Hoare triple {955#true} havoc ~glob2_pathbuf_off~0; {955#true} is VALID [2020-07-10 20:22:53,651 INFO L280 TraceCheckUtils]: 9: Hoare triple {955#true} havoc ~glob2_pathlim_off~0; {955#true} is VALID [2020-07-10 20:22:53,651 INFO L280 TraceCheckUtils]: 10: Hoare triple {955#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {955#true} is VALID [2020-07-10 20:22:53,652 INFO L280 TraceCheckUtils]: 11: Hoare triple {955#true} ~MAXPATHLEN~0 := #t~nondet0; {955#true} is VALID [2020-07-10 20:22:53,652 INFO L280 TraceCheckUtils]: 12: Hoare triple {955#true} havoc #t~nondet0; {955#true} is VALID [2020-07-10 20:22:53,653 INFO L280 TraceCheckUtils]: 13: Hoare triple {955#true} assume ~MAXPATHLEN~0 > 0 && ~MAXPATHLEN~0 < 2147483647; {959#(<= 1 main_~MAXPATHLEN~0)} is VALID [2020-07-10 20:22:53,654 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-10 20:22:53,654 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-10 20:22:53,655 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-10 20:22:53,656 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-10 20:22:53,656 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-10 20:22:53,657 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-10 20:22:53,657 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-10 20:22:53,658 INFO L280 TraceCheckUtils]: 21: Hoare triple {955#true} ~cond := #in~cond; {955#true} is VALID [2020-07-10 20:22:53,658 INFO L280 TraceCheckUtils]: 22: Hoare triple {955#true} assume !(0 == ~cond); {955#true} is VALID [2020-07-10 20:22:53,658 INFO L280 TraceCheckUtils]: 23: Hoare triple {955#true} assume true; {955#true} is VALID [2020-07-10 20:22:53,659 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-10 20:22:53,659 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-10 20:22:53,659 INFO L280 TraceCheckUtils]: 26: Hoare triple {955#true} ~cond := #in~cond; {955#true} is VALID [2020-07-10 20:22:53,660 INFO L280 TraceCheckUtils]: 27: Hoare triple {955#true} assume !(0 == ~cond); {955#true} is VALID [2020-07-10 20:22:53,660 INFO L280 TraceCheckUtils]: 28: Hoare triple {955#true} assume true; {955#true} is VALID [2020-07-10 20:22:53,660 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-10 20:22:53,661 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-10 20:22:53,662 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-10 20:22:53,663 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-10 20:22:53,663 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-10 20:22:53,663 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-10 20:22:53,664 INFO L280 TraceCheckUtils]: 35: Hoare triple {955#true} ~cond := #in~cond; {955#true} is VALID [2020-07-10 20:22:53,664 INFO L280 TraceCheckUtils]: 36: Hoare triple {955#true} assume !(0 == ~cond); {955#true} is VALID [2020-07-10 20:22:53,664 INFO L280 TraceCheckUtils]: 37: Hoare triple {955#true} assume true; {955#true} is VALID [2020-07-10 20:22:53,665 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-10 20:22:53,681 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-10 20:22:53,683 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-10 20:22:53,684 INFO L280 TraceCheckUtils]: 41: Hoare triple {978#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {956#false} is VALID [2020-07-10 20:22:53,684 INFO L280 TraceCheckUtils]: 42: Hoare triple {956#false} assume !false; {956#false} is VALID [2020-07-10 20:22:53,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:22:53,687 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:22:53,688 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [632653515] [2020-07-10 20:22:53,688 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:22:53,688 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-10 20:22:53,688 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661170035] [2020-07-10 20:22:53,689 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 43 [2020-07-10 20:22:53,689 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:22:53,689 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-10 20:22:53,734 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-10 20:22:53,734 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-10 20:22:53,734 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:22:53,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-10 20:22:53,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2020-07-10 20:22:53,735 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 10 states. [2020-07-10 20:22:54,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:54,395 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2020-07-10 20:22:54,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-10 20:22:54,396 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 43 [2020-07-10 20:22:54,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:22:54,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-10 20:22:54,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 52 transitions. [2020-07-10 20:22:54,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-10 20:22:54,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 52 transitions. [2020-07-10 20:22:54,408 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 52 transitions. [2020-07-10 20:22:54,474 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-10 20:22:54,477 INFO L225 Difference]: With dead ends: 60 [2020-07-10 20:22:54,477 INFO L226 Difference]: Without dead ends: 58 [2020-07-10 20:22:54,478 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-10 20:22:54,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2020-07-10 20:22:54,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2020-07-10 20:22:54,594 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:22:54,594 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand 56 states. [2020-07-10 20:22:54,594 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 56 states. [2020-07-10 20:22:54,594 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 56 states. [2020-07-10 20:22:54,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:54,599 INFO L93 Difference]: Finished difference Result 58 states and 59 transitions. [2020-07-10 20:22:54,600 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2020-07-10 20:22:54,600 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:22:54,601 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:22:54,601 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 58 states. [2020-07-10 20:22:54,601 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 58 states. [2020-07-10 20:22:54,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:54,609 INFO L93 Difference]: Finished difference Result 58 states and 59 transitions. [2020-07-10 20:22:54,609 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2020-07-10 20:22:54,609 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:22:54,610 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:22:54,610 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:22:54,610 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:22:54,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-07-10 20:22:54,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 57 transitions. [2020-07-10 20:22:54,617 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 57 transitions. Word has length 43 [2020-07-10 20:22:54,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:22:54,619 INFO L479 AbstractCegarLoop]: Abstraction has 56 states and 57 transitions. [2020-07-10 20:22:54,620 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-10 20:22:54,620 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 56 states and 57 transitions. [2020-07-10 20:22:54,693 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-10 20:22:54,694 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2020-07-10 20:22:54,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2020-07-10 20:22:54,696 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:22:54,696 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-10 20:22:54,697 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-10 20:22:54,697 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:22:54,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:22:54,697 INFO L82 PathProgramCache]: Analyzing trace with hash -2065107152, now seen corresponding path program 3 times [2020-07-10 20:22:54,698 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:22:54,698 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [318535861] [2020-07-10 20:22:54,698 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:22:54,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:22:54,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:22:54,892 INFO L280 TraceCheckUtils]: 0: Hoare triple {1343#true} assume true; {1343#true} is VALID [2020-07-10 20:22:54,893 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1343#true} {1343#true} #64#return; {1343#true} is VALID [2020-07-10 20:22:54,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:22:54,902 INFO L280 TraceCheckUtils]: 0: Hoare triple {1343#true} ~cond := #in~cond; {1343#true} is VALID [2020-07-10 20:22:54,902 INFO L280 TraceCheckUtils]: 1: Hoare triple {1343#true} assume !(0 == ~cond); {1343#true} is VALID [2020-07-10 20:22:54,902 INFO L280 TraceCheckUtils]: 2: Hoare triple {1343#true} assume true; {1343#true} is VALID [2020-07-10 20:22:54,903 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-10 20:22:54,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:22:54,909 INFO L280 TraceCheckUtils]: 0: Hoare triple {1343#true} ~cond := #in~cond; {1343#true} is VALID [2020-07-10 20:22:54,909 INFO L280 TraceCheckUtils]: 1: Hoare triple {1343#true} assume !(0 == ~cond); {1343#true} is VALID [2020-07-10 20:22:54,909 INFO L280 TraceCheckUtils]: 2: Hoare triple {1343#true} assume true; {1343#true} is VALID [2020-07-10 20:22:54,910 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-10 20:22:54,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:22:54,920 INFO L280 TraceCheckUtils]: 0: Hoare triple {1343#true} ~cond := #in~cond; {1343#true} is VALID [2020-07-10 20:22:54,920 INFO L280 TraceCheckUtils]: 1: Hoare triple {1343#true} assume !(0 == ~cond); {1343#true} is VALID [2020-07-10 20:22:54,921 INFO L280 TraceCheckUtils]: 2: Hoare triple {1343#true} assume true; {1343#true} is VALID [2020-07-10 20:22:54,921 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-10 20:22:54,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:22:54,929 INFO L280 TraceCheckUtils]: 0: Hoare triple {1343#true} ~cond := #in~cond; {1343#true} is VALID [2020-07-10 20:22:54,930 INFO L280 TraceCheckUtils]: 1: Hoare triple {1343#true} assume !(0 == ~cond); {1343#true} is VALID [2020-07-10 20:22:54,930 INFO L280 TraceCheckUtils]: 2: Hoare triple {1343#true} assume true; {1343#true} is VALID [2020-07-10 20:22:54,931 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-10 20:22:54,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:22:54,942 INFO L280 TraceCheckUtils]: 0: Hoare triple {1343#true} ~cond := #in~cond; {1343#true} is VALID [2020-07-10 20:22:54,942 INFO L280 TraceCheckUtils]: 1: Hoare triple {1343#true} assume !(0 == ~cond); {1343#true} is VALID [2020-07-10 20:22:54,942 INFO L280 TraceCheckUtils]: 2: Hoare triple {1343#true} assume true; {1343#true} is VALID [2020-07-10 20:22:54,943 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-10 20:22:54,944 INFO L263 TraceCheckUtils]: 0: Hoare triple {1343#true} call ULTIMATE.init(); {1343#true} is VALID [2020-07-10 20:22:54,944 INFO L280 TraceCheckUtils]: 1: Hoare triple {1343#true} assume true; {1343#true} is VALID [2020-07-10 20:22:54,944 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1343#true} {1343#true} #64#return; {1343#true} is VALID [2020-07-10 20:22:54,944 INFO L263 TraceCheckUtils]: 3: Hoare triple {1343#true} call #t~ret2 := main(); {1343#true} is VALID [2020-07-10 20:22:54,945 INFO L280 TraceCheckUtils]: 4: Hoare triple {1343#true} havoc ~MAXPATHLEN~0; {1343#true} is VALID [2020-07-10 20:22:54,945 INFO L280 TraceCheckUtils]: 5: Hoare triple {1343#true} havoc ~pathbuf_off~0; {1343#true} is VALID [2020-07-10 20:22:54,945 INFO L280 TraceCheckUtils]: 6: Hoare triple {1343#true} havoc ~bound_off~0; {1343#true} is VALID [2020-07-10 20:22:54,946 INFO L280 TraceCheckUtils]: 7: Hoare triple {1343#true} havoc ~glob2_p_off~0; {1343#true} is VALID [2020-07-10 20:22:54,946 INFO L280 TraceCheckUtils]: 8: Hoare triple {1343#true} havoc ~glob2_pathbuf_off~0; {1343#true} is VALID [2020-07-10 20:22:54,946 INFO L280 TraceCheckUtils]: 9: Hoare triple {1343#true} havoc ~glob2_pathlim_off~0; {1343#true} is VALID [2020-07-10 20:22:54,946 INFO L280 TraceCheckUtils]: 10: Hoare triple {1343#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {1343#true} is VALID [2020-07-10 20:22:54,947 INFO L280 TraceCheckUtils]: 11: Hoare triple {1343#true} ~MAXPATHLEN~0 := #t~nondet0; {1343#true} is VALID [2020-07-10 20:22:54,947 INFO L280 TraceCheckUtils]: 12: Hoare triple {1343#true} havoc #t~nondet0; {1343#true} is VALID [2020-07-10 20:22:54,947 INFO L280 TraceCheckUtils]: 13: Hoare triple {1343#true} assume ~MAXPATHLEN~0 > 0 && ~MAXPATHLEN~0 < 2147483647; {1343#true} is VALID [2020-07-10 20:22:54,948 INFO L280 TraceCheckUtils]: 14: Hoare triple {1343#true} ~pathbuf_off~0 := 0; {1347#(<= main_~pathbuf_off~0 0)} is VALID [2020-07-10 20:22:54,950 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-10 20:22:54,952 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-10 20:22:54,954 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-10 20:22:54,954 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-10 20:22:54,955 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-10 20:22:54,955 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-10 20:22:54,956 INFO L280 TraceCheckUtils]: 21: Hoare triple {1343#true} ~cond := #in~cond; {1343#true} is VALID [2020-07-10 20:22:54,956 INFO L280 TraceCheckUtils]: 22: Hoare triple {1343#true} assume !(0 == ~cond); {1343#true} is VALID [2020-07-10 20:22:54,956 INFO L280 TraceCheckUtils]: 23: Hoare triple {1343#true} assume true; {1343#true} is VALID [2020-07-10 20:22:54,957 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-10 20:22:54,958 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-10 20:22:54,958 INFO L280 TraceCheckUtils]: 26: Hoare triple {1343#true} ~cond := #in~cond; {1343#true} is VALID [2020-07-10 20:22:54,958 INFO L280 TraceCheckUtils]: 27: Hoare triple {1343#true} assume !(0 == ~cond); {1343#true} is VALID [2020-07-10 20:22:54,959 INFO L280 TraceCheckUtils]: 28: Hoare triple {1343#true} assume true; {1343#true} is VALID [2020-07-10 20:22:54,960 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-10 20:22:54,960 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-10 20:22:54,961 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-10 20:22:54,961 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-10 20:22:54,962 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-10 20:22:54,962 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-10 20:22:54,963 INFO L280 TraceCheckUtils]: 35: Hoare triple {1343#true} ~cond := #in~cond; {1343#true} is VALID [2020-07-10 20:22:54,963 INFO L280 TraceCheckUtils]: 36: Hoare triple {1343#true} assume !(0 == ~cond); {1343#true} is VALID [2020-07-10 20:22:54,963 INFO L280 TraceCheckUtils]: 37: Hoare triple {1343#true} assume true; {1343#true} is VALID [2020-07-10 20:22:54,964 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-10 20:22:54,964 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-10 20:22:54,965 INFO L280 TraceCheckUtils]: 40: Hoare triple {1343#true} ~cond := #in~cond; {1343#true} is VALID [2020-07-10 20:22:54,965 INFO L280 TraceCheckUtils]: 41: Hoare triple {1343#true} assume !(0 == ~cond); {1343#true} is VALID [2020-07-10 20:22:54,965 INFO L280 TraceCheckUtils]: 42: Hoare triple {1343#true} assume true; {1343#true} is VALID [2020-07-10 20:22:54,966 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-10 20:22:54,967 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-10 20:22:54,968 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-10 20:22:54,968 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-10 20:22:54,969 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-10 20:22:54,970 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-10 20:22:54,970 INFO L280 TraceCheckUtils]: 49: Hoare triple {1343#true} ~cond := #in~cond; {1343#true} is VALID [2020-07-10 20:22:54,970 INFO L280 TraceCheckUtils]: 50: Hoare triple {1343#true} assume !(0 == ~cond); {1343#true} is VALID [2020-07-10 20:22:54,970 INFO L280 TraceCheckUtils]: 51: Hoare triple {1343#true} assume true; {1343#true} is VALID [2020-07-10 20:22:54,971 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-10 20:22:54,973 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-10 20:22:54,973 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-10 20:22:54,974 INFO L280 TraceCheckUtils]: 55: Hoare triple {1372#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {1344#false} is VALID [2020-07-10 20:22:54,974 INFO L280 TraceCheckUtils]: 56: Hoare triple {1344#false} assume !false; {1344#false} is VALID [2020-07-10 20:22:54,977 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-10 20:22:54,978 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:22:54,978 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [318535861] [2020-07-10 20:22:54,978 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:22:54,978 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-10 20:22:54,979 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305986606] [2020-07-10 20:22:54,979 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 57 [2020-07-10 20:22:54,980 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:22:54,980 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-10 20:22:55,016 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-10 20:22:55,017 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-10 20:22:55,017 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:22:55,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-10 20:22:55,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-07-10 20:22:55,018 INFO L87 Difference]: Start difference. First operand 56 states and 57 transitions. Second operand 8 states. [2020-07-10 20:22:55,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:55,416 INFO L93 Difference]: Finished difference Result 56 states and 57 transitions. [2020-07-10 20:22:55,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-10 20:22:55,416 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 57 [2020-07-10 20:22:55,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:22:55,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-10 20:22:55,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 35 transitions. [2020-07-10 20:22:55,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-10 20:22:55,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 35 transitions. [2020-07-10 20:22:55,421 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 35 transitions. [2020-07-10 20:22:55,452 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:22:55,452 INFO L225 Difference]: With dead ends: 56 [2020-07-10 20:22:55,453 INFO L226 Difference]: Without dead ends: 0 [2020-07-10 20:22:55,454 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 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-10 20:22:55,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-10 20:22:55,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-10 20:22:55,455 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:22:55,455 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-10 20:22:55,455 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 20:22:55,455 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 20:22:55,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:55,455 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 20:22:55,456 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 20:22:55,456 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:22:55,456 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:22:55,456 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 20:22:55,456 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 20:22:55,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:55,456 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 20:22:55,457 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 20:22:55,457 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:22:55,457 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:22:55,457 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:22:55,457 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:22:55,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-10 20:22:55,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-10 20:22:55,458 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 57 [2020-07-10 20:22:55,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:22:55,458 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-10 20:22:55,458 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-10 20:22:55,458 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2020-07-10 20:22:55,459 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-10 20:22:55,459 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 20:22:55,459 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:22:55,459 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-10 20:22:55,461 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-10 20:22:56,260 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-10 20:22:56,261 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-07-10 20:22:56,261 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-10 20:22:56,261 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-10 20:22:56,261 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-10 20:22:56,261 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-10 20:22:56,261 INFO L268 CegarLoopResult]: For program point L4-3(lines 3 5) no Hoare annotation was computed. [2020-07-10 20:22:56,261 INFO L268 CegarLoopResult]: For program point assume_abort_if_notENTRY(lines 3 5) no Hoare annotation was computed. [2020-07-10 20:22:56,261 INFO L268 CegarLoopResult]: For program point L4(line 4) no Hoare annotation was computed. [2020-07-10 20:22:56,261 INFO L268 CegarLoopResult]: For program point L4-1(line 4) no Hoare annotation was computed. [2020-07-10 20:22:56,261 INFO L268 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 3 5) no Hoare annotation was computed. [2020-07-10 20:22:56,262 INFO L271 CegarLoopResult]: At program point L33(lines 14 34) the Hoare annotation is: true [2020-07-10 20:22:56,262 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-10 20:22:56,262 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-10 20:22:56,263 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-10 20:22:56,263 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-10 20:22:56,263 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-10 20:22:56,263 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 13 34) the Hoare annotation is: true [2020-07-10 20:22:56,264 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-10 20:22:56,264 INFO L271 CegarLoopResult]: At program point L21(line 21) the Hoare annotation is: true [2020-07-10 20:22:56,264 INFO L271 CegarLoopResult]: At program point L21-1(line 21) the Hoare annotation is: true [2020-07-10 20:22:56,264 INFO L271 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: true [2020-07-10 20:22:56,264 INFO L271 CegarLoopResult]: At program point L21-2(line 21) the Hoare annotation is: true [2020-07-10 20:22:56,264 INFO L271 CegarLoopResult]: At program point L17(line 17) the Hoare annotation is: true [2020-07-10 20:22:56,265 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 13 34) the Hoare annotation is: true [2020-07-10 20:22:56,265 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-10 20:22:56,265 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 13 34) the Hoare annotation is: true [2020-07-10 20:22:56,265 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-10 20:22:56,265 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-10 20:22:56,266 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-10 20:22:56,266 INFO L271 CegarLoopResult]: At program point L22(line 22) the Hoare annotation is: true [2020-07-10 20:22:56,266 INFO L264 CegarLoopResult]: At program point L22-1(line 22) the Hoare annotation is: (<= 1 main_~MAXPATHLEN~0) [2020-07-10 20:22:56,266 INFO L271 CegarLoopResult]: At program point L20(line 20) the Hoare annotation is: true [2020-07-10 20:22:56,266 INFO L271 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: true [2020-07-10 20:22:56,266 INFO L271 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: true [2020-07-10 20:22:56,266 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 6 11) the Hoare annotation is: true [2020-07-10 20:22:56,266 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-10 20:22:56,266 INFO L264 CegarLoopResult]: At program point L8(line 8) the Hoare annotation is: (= 0 |__VERIFIER_assert_#in~cond|) [2020-07-10 20:22:56,267 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-10 20:22:56,267 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-10 20:22:56,267 INFO L264 CegarLoopResult]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8) the Hoare annotation is: (= 0 |__VERIFIER_assert_#in~cond|) [2020-07-10 20:22:56,271 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-10 20:22:56,272 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-10 20:22:56,272 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-10 20:22:56,273 WARN L170 areAnnotationChecker]: L4-1 has no Hoare annotation [2020-07-10 20:22:56,273 WARN L170 areAnnotationChecker]: L4-3 has no Hoare annotation [2020-07-10 20:22:56,283 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-10 20:22:56,299 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 08:22:56 BoogieIcfgContainer [2020-07-10 20:22:56,299 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 20:22:56,302 INFO L168 Benchmark]: Toolchain (without parser) took 7397.03 ms. Allocated memory was 140.0 MB in the beginning and 295.7 MB in the end (delta: 155.7 MB). Free memory was 105.4 MB in the beginning and 147.9 MB in the end (delta: -42.6 MB). Peak memory consumption was 113.1 MB. Max. memory is 7.1 GB. [2020-07-10 20:22:56,303 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 140.0 MB. Free memory was 123.4 MB in the beginning and 123.2 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-10 20:22:56,303 INFO L168 Benchmark]: CACSL2BoogieTranslator took 299.89 ms. Allocated memory is still 140.0 MB. Free memory was 105.2 MB in the beginning and 95.3 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. [2020-07-10 20:22:56,304 INFO L168 Benchmark]: Boogie Preprocessor took 110.28 ms. Allocated memory was 140.0 MB in the beginning and 199.8 MB in the end (delta: 59.8 MB). Free memory was 95.3 MB in the beginning and 179.0 MB in the end (delta: -83.7 MB). Peak memory consumption was 15.4 MB. Max. memory is 7.1 GB. [2020-07-10 20:22:56,305 INFO L168 Benchmark]: RCFGBuilder took 540.17 ms. Allocated memory is still 199.8 MB. Free memory was 179.0 MB in the beginning and 159.3 MB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 7.1 GB. [2020-07-10 20:22:56,306 INFO L168 Benchmark]: TraceAbstraction took 6437.34 ms. Allocated memory was 199.8 MB in the beginning and 295.7 MB in the end (delta: 95.9 MB). Free memory was 158.7 MB in the beginning and 147.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 106.7 MB. Max. memory is 7.1 GB. [2020-07-10 20:22:56,310 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.28 ms. Allocated memory is still 140.0 MB. Free memory was 123.4 MB in the beginning and 123.2 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 299.89 ms. Allocated memory is still 140.0 MB. Free memory was 105.2 MB in the beginning and 95.3 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 110.28 ms. Allocated memory was 140.0 MB in the beginning and 199.8 MB in the end (delta: 59.8 MB). Free memory was 95.3 MB in the beginning and 179.0 MB in the end (delta: -83.7 MB). Peak memory consumption was 15.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 540.17 ms. Allocated memory is still 199.8 MB. Free memory was 179.0 MB in the beginning and 159.3 MB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 6437.34 ms. Allocated memory was 199.8 MB in the beginning and 295.7 MB in the end (delta: 95.9 MB). Free memory was 158.7 MB in the beginning and 147.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 106.7 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.5s, OverallIterations: 5, TraceHistogramMax: 6, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 143 SDtfs, 158 SDslu, 687 SDs, 0 SdLazy, 311 SolverSat, 73 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 98 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=56occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 5 MinimizatonAttempts, 9 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 36 LocationsWithAnnotation, 78 PreInvPairs, 114 NumberOfFragments, 341 HoareAnnotationTreeSize, 78 FomulaSimplifications, 999 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 36 FomulaSimplificationsInter, 331 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, 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...