./Ultimate.py --spec ../../../trunk/examples/svcomp/ReachSafety.prp --file ../../../trunk/examples/svcomp/loops/string_true-unreach-call_true-termination.i --full-output --rcfgbuilder.size.of.a.code.block LoopFreeBlock --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0210da8c Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/config/TaipanReach.xml -i ../../../trunk/examples/svcomp/loops/string_true-unreach-call_true-termination.i -s /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UTaipan-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e655d34f6b59f7cc9a55d4dc4dc525a41685abad --rcfgbuilder.size.of.a.code.block LoopFreeBlock ........................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-0210da8 [2018-10-22 10:08:43,910 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-22 10:08:43,912 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-22 10:08:43,934 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-22 10:08:43,934 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-22 10:08:43,935 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-22 10:08:43,936 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-22 10:08:43,938 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-22 10:08:43,940 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-22 10:08:43,941 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-22 10:08:43,942 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-22 10:08:43,942 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-22 10:08:43,943 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-22 10:08:43,944 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-22 10:08:43,946 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-22 10:08:43,947 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-22 10:08:43,948 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-22 10:08:43,950 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-22 10:08:43,952 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-22 10:08:43,954 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-22 10:08:43,955 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-22 10:08:43,956 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-22 10:08:43,959 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-22 10:08:43,959 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-22 10:08:43,959 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-22 10:08:43,961 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-22 10:08:43,962 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-22 10:08:43,962 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-22 10:08:43,963 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-22 10:08:43,965 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-22 10:08:43,965 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-22 10:08:43,965 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-22 10:08:43,966 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-22 10:08:43,966 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-22 10:08:43,967 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-22 10:08:43,968 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-22 10:08:43,968 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-10-22 10:08:43,985 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-22 10:08:43,985 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-22 10:08:43,986 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-22 10:08:43,986 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-22 10:08:43,986 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-22 10:08:43,986 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-22 10:08:43,986 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-22 10:08:43,987 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-22 10:08:43,988 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-22 10:08:43,988 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-22 10:08:43,988 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-22 10:08:43,989 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-22 10:08:43,989 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-22 10:08:43,990 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-22 10:08:43,990 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-22 10:08:43,990 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-22 10:08:43,990 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-22 10:08:43,990 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-22 10:08:43,990 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-22 10:08:43,991 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-22 10:08:43,991 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-22 10:08:43,991 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-22 10:08:43,991 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-22 10:08:43,991 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-22 10:08:43,991 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-22 10:08:43,993 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-22 10:08:43,993 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-22 10:08:43,993 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-22 10:08:43,994 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-22 10:08:43,994 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-22 10:08:43,994 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-22 10:08:43,994 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-22 10:08:43,994 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-22 10:08:43,994 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-22 10:08:43,996 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UTaipan-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e655d34f6b59f7cc9a55d4dc4dc525a41685abad Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock [2018-10-22 10:08:44,065 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-22 10:08:44,082 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-22 10:08:44,087 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-22 10:08:44,088 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-22 10:08:44,090 INFO L276 PluginConnector]: CDTParser initialized [2018-10-22 10:08:44,091 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/loops/string_true-unreach-call_true-termination.i [2018-10-22 10:08:44,153 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/9a045b43f/319cabfa8a8f407a8244912ca845e173/FLAG2ef859e96 [2018-10-22 10:08:44,634 INFO L298 CDTParser]: Found 1 translation units. [2018-10-22 10:08:44,636 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/string_true-unreach-call_true-termination.i [2018-10-22 10:08:44,644 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/9a045b43f/319cabfa8a8f407a8244912ca845e173/FLAG2ef859e96 [2018-10-22 10:08:44,667 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/9a045b43f/319cabfa8a8f407a8244912ca845e173 [2018-10-22 10:08:44,672 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-22 10:08:44,675 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-22 10:08:44,676 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-22 10:08:44,678 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-22 10:08:44,683 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-22 10:08:44,683 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 10:08:44" (1/1) ... [2018-10-22 10:08:44,687 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8662dfd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 10:08:44, skipping insertion in model container [2018-10-22 10:08:44,688 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 10:08:44" (1/1) ... [2018-10-22 10:08:44,701 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-22 10:08:44,729 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-22 10:08:44,917 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-22 10:08:44,921 INFO L189 MainTranslator]: Completed pre-run [2018-10-22 10:08:44,949 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-22 10:08:44,972 INFO L193 MainTranslator]: Completed translation [2018-10-22 10:08:44,972 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 10:08:44 WrapperNode [2018-10-22 10:08:44,972 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-22 10:08:44,973 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-22 10:08:44,973 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-22 10:08:44,974 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-22 10:08:44,984 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 10:08:44" (1/1) ... [2018-10-22 10:08:44,995 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 10:08:44" (1/1) ... [2018-10-22 10:08:45,026 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-22 10:08:45,026 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-22 10:08:45,026 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-22 10:08:45,026 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-22 10:08:45,038 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 10:08:44" (1/1) ... [2018-10-22 10:08:45,039 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 10:08:44" (1/1) ... [2018-10-22 10:08:45,043 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 10:08:44" (1/1) ... [2018-10-22 10:08:45,043 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 10:08:44" (1/1) ... [2018-10-22 10:08:45,054 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 10:08:44" (1/1) ... [2018-10-22 10:08:45,065 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 10:08:44" (1/1) ... [2018-10-22 10:08:45,075 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 10:08:44" (1/1) ... [2018-10-22 10:08:45,079 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-22 10:08:45,083 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-22 10:08:45,083 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-22 10:08:45,083 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-22 10:08:45,084 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 10:08:44" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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 [2018-10-22 10:08:45,276 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-22 10:08:45,277 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-22 10:08:45,277 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-22 10:08:45,277 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-22 10:08:45,277 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-22 10:08:45,278 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-22 10:08:45,278 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-10-22 10:08:45,278 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-10-22 10:08:45,994 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-22 10:08:45,995 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 10:08:45 BoogieIcfgContainer [2018-10-22 10:08:45,995 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-22 10:08:45,996 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-22 10:08:45,996 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-22 10:08:46,001 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-22 10:08:46,001 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 10:08:44" (1/3) ... [2018-10-22 10:08:46,002 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69119f66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 10:08:46, skipping insertion in model container [2018-10-22 10:08:46,002 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 10:08:44" (2/3) ... [2018-10-22 10:08:46,003 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69119f66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 10:08:46, skipping insertion in model container [2018-10-22 10:08:46,003 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 10:08:45" (3/3) ... [2018-10-22 10:08:46,006 INFO L112 eAbstractionObserver]: Analyzing ICFG string_true-unreach-call_true-termination.i [2018-10-22 10:08:46,016 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-22 10:08:46,026 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-22 10:08:46,044 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-22 10:08:46,079 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-22 10:08:46,080 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-22 10:08:46,080 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-22 10:08:46,080 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-22 10:08:46,080 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-22 10:08:46,080 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-22 10:08:46,080 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-22 10:08:46,081 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-22 10:08:46,081 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-22 10:08:46,106 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2018-10-22 10:08:46,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-22 10:08:46,112 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 10:08:46,113 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 10:08:46,115 INFO L424 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 10:08:46,121 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 10:08:46,122 INFO L82 PathProgramCache]: Analyzing trace with hash -91098741, now seen corresponding path program 1 times [2018-10-22 10:08:46,125 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-22 10:08:46,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 10:08:46,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 10:08:46,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 10:08:46,180 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-22 10:08:46,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 10:08:46,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 10:08:46,276 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-22 10:08:46,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-22 10:08:46,277 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-22 10:08:46,283 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-10-22 10:08:46,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-22 10:08:46,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-22 10:08:46,297 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 2 states. [2018-10-22 10:08:46,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 10:08:46,320 INFO L93 Difference]: Finished difference Result 61 states and 86 transitions. [2018-10-22 10:08:46,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-22 10:08:46,321 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 21 [2018-10-22 10:08:46,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 10:08:46,331 INFO L225 Difference]: With dead ends: 61 [2018-10-22 10:08:46,331 INFO L226 Difference]: Without dead ends: 27 [2018-10-22 10:08:46,335 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-22 10:08:46,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-10-22 10:08:46,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-10-22 10:08:46,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-10-22 10:08:46,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2018-10-22 10:08:46,375 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 21 [2018-10-22 10:08:46,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 10:08:46,376 INFO L481 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2018-10-22 10:08:46,376 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-10-22 10:08:46,376 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2018-10-22 10:08:46,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-22 10:08:46,377 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 10:08:46,377 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 10:08:46,379 INFO L424 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 10:08:46,379 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 10:08:46,379 INFO L82 PathProgramCache]: Analyzing trace with hash -1214331009, now seen corresponding path program 1 times [2018-10-22 10:08:46,379 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-22 10:08:46,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 10:08:46,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 10:08:46,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 10:08:46,381 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-22 10:08:46,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 10:08:46,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 10:08:46,488 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-22 10:08:46,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-22 10:08:46,488 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-22 10:08:46,491 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-22 10:08:46,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-22 10:08:46,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-22 10:08:46,492 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand 3 states. [2018-10-22 10:08:46,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 10:08:46,596 INFO L93 Difference]: Finished difference Result 55 states and 65 transitions. [2018-10-22 10:08:46,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-22 10:08:46,596 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-10-22 10:08:46,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 10:08:46,600 INFO L225 Difference]: With dead ends: 55 [2018-10-22 10:08:46,600 INFO L226 Difference]: Without dead ends: 35 [2018-10-22 10:08:46,601 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-22 10:08:46,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-10-22 10:08:46,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2018-10-22 10:08:46,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-10-22 10:08:46,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2018-10-22 10:08:46,609 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 26 [2018-10-22 10:08:46,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 10:08:46,609 INFO L481 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2018-10-22 10:08:46,610 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-22 10:08:46,610 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2018-10-22 10:08:46,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-22 10:08:46,611 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 10:08:46,612 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-22 10:08:46,612 INFO L424 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 10:08:46,612 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 10:08:46,612 INFO L82 PathProgramCache]: Analyzing trace with hash -1346038476, now seen corresponding path program 1 times [2018-10-22 10:08:46,612 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-22 10:08:46,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 10:08:46,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 10:08:46,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 10:08:46,615 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-22 10:08:46,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 10:08:46,751 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-22 10:08:46,751 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 10:08:46,751 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-22 10:08:46,753 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 31 with the following transitions: [2018-10-22 10:08:46,755 INFO L202 CegarAbsIntRunner]: [5], [9], [12], [20], [24], [28], [31], [39], [43], [52], [58], [67], [76], [80], [84], [96], [100], [103], [105], [111], [112], [113], [115], [117], [118], [119], [120], [121] [2018-10-22 10:08:46,803 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-22 10:08:46,803 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-22 10:08:47,921 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-22 10:08:47,923 INFO L272 AbstractInterpreter]: Visited 27 different actions 57 times. Merged at 4 different actions 20 times. Widened at 2 different actions 2 times. Found 2 fixpoints after 2 different actions. Largest state had 41 variables. [2018-10-22 10:08:47,940 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 10:08:47,940 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-22 10:08:48,262 INFO L232 lantSequenceWeakener]: Weakened 28 states. On average, predicates are now at 79.87% of their original sizes. [2018-10-22 10:08:48,262 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-22 10:08:49,427 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-22 10:08:49,428 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-22 10:08:49,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [4] total 15 [2018-10-22 10:08:49,428 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-22 10:08:49,429 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-22 10:08:49,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-22 10:08:49,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2018-10-22 10:08:49,430 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 13 states. [2018-10-22 10:08:52,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 10:08:52,502 INFO L93 Difference]: Finished difference Result 62 states and 72 transitions. [2018-10-22 10:08:52,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-22 10:08:52,503 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 30 [2018-10-22 10:08:52,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 10:08:52,504 INFO L225 Difference]: With dead ends: 62 [2018-10-22 10:08:52,504 INFO L226 Difference]: Without dead ends: 47 [2018-10-22 10:08:52,508 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 34 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2018-10-22 10:08:52,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-22 10:08:52,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 41. [2018-10-22 10:08:52,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-10-22 10:08:52,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2018-10-22 10:08:52,534 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 30 [2018-10-22 10:08:52,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 10:08:52,535 INFO L481 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2018-10-22 10:08:52,535 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-22 10:08:52,535 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2018-10-22 10:08:52,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-10-22 10:08:52,536 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 10:08:52,536 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-22 10:08:52,538 INFO L424 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 10:08:52,538 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 10:08:52,538 INFO L82 PathProgramCache]: Analyzing trace with hash -1354922431, now seen corresponding path program 1 times [2018-10-22 10:08:52,539 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-22 10:08:52,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 10:08:52,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 10:08:52,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 10:08:52,542 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-22 10:08:52,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 10:08:52,692 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-22 10:08:52,693 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 10:08:52,693 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-22 10:08:52,693 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 33 with the following transitions: [2018-10-22 10:08:52,693 INFO L202 CegarAbsIntRunner]: [5], [9], [12], [20], [24], [28], [31], [39], [43], [52], [58], [67], [69], [76], [80], [84], [96], [100], [103], [105], [111], [112], [113], [115], [117], [118], [119], [120], [121] [2018-10-22 10:08:52,697 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-22 10:08:52,697 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-22 10:08:55,097 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-22 10:08:55,098 INFO L272 AbstractInterpreter]: Visited 28 different actions 389 times. Merged at 11 different actions 252 times. Widened at 4 different actions 61 times. Found 3 fixpoints after 3 different actions. Largest state had 42 variables. [2018-10-22 10:08:55,115 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 10:08:55,115 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-22 10:08:55,279 INFO L232 lantSequenceWeakener]: Weakened 30 states. On average, predicates are now at 79.76% of their original sizes. [2018-10-22 10:08:55,279 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-22 10:08:55,843 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-22 10:08:55,844 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-22 10:08:55,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [4] total 15 [2018-10-22 10:08:55,844 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-22 10:08:55,845 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-22 10:08:55,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-22 10:08:55,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2018-10-22 10:08:55,845 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand 13 states. [2018-10-22 10:08:57,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 10:08:57,544 INFO L93 Difference]: Finished difference Result 47 states and 54 transitions. [2018-10-22 10:08:57,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-22 10:08:57,544 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 32 [2018-10-22 10:08:57,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 10:08:57,545 INFO L225 Difference]: With dead ends: 47 [2018-10-22 10:08:57,545 INFO L226 Difference]: Without dead ends: 0 [2018-10-22 10:08:57,547 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 37 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2018-10-22 10:08:57,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-22 10:08:57,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-22 10:08:57,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-22 10:08:57,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-22 10:08:57,548 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 32 [2018-10-22 10:08:57,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 10:08:57,548 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-22 10:08:57,548 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-22 10:08:57,549 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-22 10:08:57,550 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-22 10:08:57,556 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-22 10:08:57,767 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 110 [2018-10-22 10:08:58,004 WARN L179 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 26 [2018-10-22 10:08:58,352 WARN L179 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 39 [2018-10-22 10:08:58,641 WARN L179 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 26 [2018-10-22 10:08:58,644 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-10-22 10:08:58,645 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-10-22 10:08:58,645 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-10-22 10:08:58,645 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-22 10:08:58,645 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-10-22 10:08:58,646 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-10-22 10:08:58,646 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-22 10:08:58,646 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 14 58) no Hoare annotation was computed. [2018-10-22 10:08:58,646 INFO L425 ceAbstractionStarter]: For program point L23-1(lines 23 24) no Hoare annotation was computed. [2018-10-22 10:08:58,646 INFO L425 ceAbstractionStarter]: For program point L23-3(lines 23 24) no Hoare annotation was computed. [2018-10-22 10:08:58,646 INFO L421 ceAbstractionStarter]: At program point L23-4(lines 23 24) the Hoare annotation is: (let ((.cse0 (* 2 main_~found~0))) (and (<= 0 .cse0) (<= .cse0 2) (not (= |main_~#string_A~0.base| 0)) (<= (* 2 |main_~#string_B~0.offset|) 0) (<= 0 (+ main_~i~0 |main_~#string_B~0.offset|)) (<= 0 (* 2 |main_~#string_A~0.offset|)) (<= (* 2 main_~i~0) 10) (not (= |main_~#string_B~0.base| 0)) (<= |main_~#string_A~0.offset| |main_~#string_B~0.offset|))) [2018-10-22 10:08:58,646 INFO L425 ceAbstractionStarter]: For program point L19-1(lines 19 20) no Hoare annotation was computed. [2018-10-22 10:08:58,647 INFO L425 ceAbstractionStarter]: For program point L23-5(lines 23 24) no Hoare annotation was computed. [2018-10-22 10:08:58,647 INFO L425 ceAbstractionStarter]: For program point L19-3(lines 19 20) no Hoare annotation was computed. [2018-10-22 10:08:58,647 INFO L421 ceAbstractionStarter]: At program point L19-4(lines 19 20) the Hoare annotation is: (let ((.cse0 (* 2 main_~found~0))) (and (<= 0 .cse0) (<= .cse0 2) (not (= |main_~#string_A~0.base| 0)) (<= (* 2 |main_~#string_B~0.offset|) 0) (<= 0 (+ main_~i~0 |main_~#string_B~0.offset|)) (<= 0 (* 2 |main_~#string_A~0.offset|)) (<= (* 2 main_~i~0) 10) (not (= |main_~#string_B~0.base| 0)) (<= |main_~#string_A~0.offset| |main_~#string_B~0.offset|))) [2018-10-22 10:08:58,647 INFO L425 ceAbstractionStarter]: For program point L19-5(lines 19 20) no Hoare annotation was computed. [2018-10-22 10:08:58,647 INFO L425 ceAbstractionStarter]: For program point L32-1(lines 32 33) no Hoare annotation was computed. [2018-10-22 10:08:58,647 INFO L425 ceAbstractionStarter]: For program point L32-2(lines 32 33) no Hoare annotation was computed. [2018-10-22 10:08:58,648 INFO L421 ceAbstractionStarter]: At program point L32-4(lines 32 33) the Hoare annotation is: (let ((.cse0 (* 2 main_~found~0))) (and (<= 0 .cse0) (<= .cse0 2) (not (= |main_~#string_A~0.base| 0)) (<= (* 2 |main_~#string_B~0.offset|) 0) (<= 0 (+ main_~i~0 |main_~#string_B~0.offset|)) (<= 0 (* 2 |main_~#string_A~0.offset|)) (<= (* 2 main_~i~0) 10) (not (= |main_~#string_B~0.base| 0)) (<= |main_~#string_A~0.offset| |main_~#string_B~0.offset|))) [2018-10-22 10:08:58,648 INFO L425 ceAbstractionStarter]: For program point L28-1(lines 28 29) no Hoare annotation was computed. [2018-10-22 10:08:58,648 INFO L425 ceAbstractionStarter]: For program point L32-5(lines 15 58) no Hoare annotation was computed. [2018-10-22 10:08:58,648 INFO L425 ceAbstractionStarter]: For program point L28-2(lines 28 29) no Hoare annotation was computed. [2018-10-22 10:08:58,648 INFO L421 ceAbstractionStarter]: At program point L28-4(lines 28 29) the Hoare annotation is: (let ((.cse0 (* 2 main_~found~0))) (and (<= 0 .cse0) (<= .cse0 2) (not (= |main_~#string_A~0.base| 0)) (<= (* 2 |main_~#string_B~0.offset|) 0) (<= 0 (+ main_~i~0 |main_~#string_B~0.offset|)) (<= 0 (* 2 |main_~#string_A~0.offset|)) (<= (* 2 main_~i~0) 10) (not (= |main_~#string_B~0.base| 0)) (<= |main_~#string_A~0.offset| |main_~#string_B~0.offset|))) [2018-10-22 10:08:58,648 INFO L425 ceAbstractionStarter]: For program point L28-5(lines 28 29) no Hoare annotation was computed. [2018-10-22 10:08:58,648 INFO L425 ceAbstractionStarter]: For program point L41(lines 41 50) no Hoare annotation was computed. [2018-10-22 10:08:58,649 INFO L421 ceAbstractionStarter]: At program point L41-2(lines 39 51) the Hoare annotation is: (let ((.cse2 (not (= |main_~#string_A~0.base| 0))) (.cse1 (not (= |main_~#string_B~0.base| 0)))) (or (let ((.cse0 (* 2 main_~found~0))) (and (<= 0 .cse0) .cse1 (<= .cse0 2) .cse2 (<= (* 2 |main_~#string_B~0.offset|) 0) (<= 0 (* 2 |main_~#string_A~0.offset|)) (<= |main_~#string_A~0.offset| |main_~#string_B~0.offset|))) (and .cse2 .cse1 (<= main_~nc_A~0 |main_~#string_A~0.offset|) (<= (+ |main_~#string_B~0.offset| |main_~#string_A~0.offset|) 0) (<= main_~nc_A~0 main_~j~0) (<= 0 (+ main_~i~0 main_~nc_A~0)) (<= (+ main_~j~0 main_~nc_B~0) 0) (<= 0 (* 2 main_~nc_B~0)) (<= 0 (+ main_~i~0 |main_~#string_B~0.offset|)) (= main_~i~0 0)))) [2018-10-22 10:08:58,649 INFO L425 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2018-10-22 10:08:58,649 INFO L425 ceAbstractionStarter]: For program point L21(line 21) no Hoare annotation was computed. [2018-10-22 10:08:58,649 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 14 58) no Hoare annotation was computed. [2018-10-22 10:08:58,649 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 14 58) the Hoare annotation is: true [2018-10-22 10:08:58,650 INFO L421 ceAbstractionStarter]: At program point L55(line 55) the Hoare annotation is: (let ((.cse0 (* 2 main_~found~0))) (and (<= 0 .cse0) (<= .cse0 2) (not (= |main_~#string_A~0.base| 0)) (<= (* 2 |main_~#string_B~0.offset|) 0) (<= 0 (* 2 |main_~#string_A~0.offset|)) (not (= |main_~#string_B~0.base| 0)) (<= |main_~#string_A~0.offset| |main_~#string_B~0.offset|))) [2018-10-22 10:08:58,650 INFO L425 ceAbstractionStarter]: For program point L55-1(line 55) no Hoare annotation was computed. [2018-10-22 10:08:58,650 INFO L425 ceAbstractionStarter]: For program point L39-1(lines 39 51) no Hoare annotation was computed. [2018-10-22 10:08:58,650 INFO L425 ceAbstractionStarter]: For program point L39-3(lines 39 51) no Hoare annotation was computed. [2018-10-22 10:08:58,650 INFO L428 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 4 9) the Hoare annotation is: true [2018-10-22 10:08:58,650 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2018-10-22 10:08:58,650 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 4 9) no Hoare annotation was computed. [2018-10-22 10:08:58,650 INFO L425 ceAbstractionStarter]: For program point L6(line 6) no Hoare annotation was computed. [2018-10-22 10:08:58,651 INFO L425 ceAbstractionStarter]: For program point L5(lines 5 7) no Hoare annotation was computed. [2018-10-22 10:08:58,651 INFO L425 ceAbstractionStarter]: For program point L5-2(lines 4 9) no Hoare annotation was computed. [2018-10-22 10:08:58,681 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 10:08:58 BoogieIcfgContainer [2018-10-22 10:08:58,682 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-22 10:08:58,683 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-22 10:08:58,683 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-22 10:08:58,683 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-22 10:08:58,684 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 10:08:45" (3/4) ... [2018-10-22 10:08:58,688 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-10-22 10:08:58,695 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-10-22 10:08:58,696 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-10-22 10:08:58,696 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-10-22 10:08:58,705 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 58 nodes and edges [2018-10-22 10:08:58,705 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 32 nodes and edges [2018-10-22 10:08:58,706 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2018-10-22 10:08:58,706 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-10-22 10:08:58,786 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/witness.graphml [2018-10-22 10:08:58,786 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-22 10:08:58,788 INFO L168 Benchmark]: Toolchain (without parser) took 14114.03 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 531.6 MB). Free memory was 953.2 MB in the beginning and 1.4 GB in the end (delta: -401.0 MB). Peak memory consumption was 130.6 MB. Max. memory is 11.5 GB. [2018-10-22 10:08:58,789 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-22 10:08:58,789 INFO L168 Benchmark]: CACSL2BoogieTranslator took 296.91 ms. Allocated memory is still 1.0 GB. Free memory was 953.2 MB in the beginning and 942.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-10-22 10:08:58,789 INFO L168 Benchmark]: Boogie Procedure Inliner took 52.67 ms. Allocated memory is still 1.0 GB. Free memory was 942.4 MB in the beginning and 937.1 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-10-22 10:08:58,792 INFO L168 Benchmark]: Boogie Preprocessor took 56.50 ms. Allocated memory is still 1.0 GB. Free memory is still 937.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-22 10:08:58,793 INFO L168 Benchmark]: RCFGBuilder took 912.29 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 180.4 MB). Free memory was 937.1 MB in the beginning and 1.1 GB in the end (delta: -198.9 MB). Peak memory consumption was 15.8 MB. Max. memory is 11.5 GB. [2018-10-22 10:08:58,795 INFO L168 Benchmark]: TraceAbstraction took 12685.81 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 351.3 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -218.3 MB). Peak memory consumption was 133.0 MB. Max. memory is 11.5 GB. [2018-10-22 10:08:58,796 INFO L168 Benchmark]: Witness Printer took 104.06 ms. Allocated memory is still 1.6 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. [2018-10-22 10:08:58,802 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 296.91 ms. Allocated memory is still 1.0 GB. Free memory was 953.2 MB in the beginning and 942.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 52.67 ms. Allocated memory is still 1.0 GB. Free memory was 942.4 MB in the beginning and 937.1 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 56.50 ms. Allocated memory is still 1.0 GB. Free memory is still 937.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 912.29 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 180.4 MB). Free memory was 937.1 MB in the beginning and 1.1 GB in the end (delta: -198.9 MB). Peak memory consumption was 15.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 12685.81 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 351.3 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -218.3 MB). Peak memory consumption was 133.0 MB. Max. memory is 11.5 GB. * Witness Printer took 104.06 ms. Allocated memory is still 1.6 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 6]: 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: 32]: Loop Invariant Derived loop invariant: (((((((0 <= 2 * found && 2 * found <= 2) && !(string_A == 0)) && 2 * string_B <= 0) && 0 <= i + string_B) && 0 <= 2 * string_A) && 2 * i <= 10) && !(string_B == 0)) && string_A <= string_B - InvariantResult [Line: 39]: Loop Invariant Derived loop invariant: ((((((0 <= 2 * found && !(string_B == 0)) && 2 * found <= 2) && !(string_A == 0)) && 2 * string_B <= 0) && 0 <= 2 * string_A) && string_A <= string_B) || (((((((((!(string_A == 0) && !(string_B == 0)) && nc_A <= string_A) && string_B + string_A <= 0) && nc_A <= j) && 0 <= i + nc_A) && j + nc_B <= 0) && 0 <= 2 * nc_B) && 0 <= i + string_B) && i == 0) - InvariantResult [Line: 28]: Loop Invariant Derived loop invariant: (((((((0 <= 2 * found && 2 * found <= 2) && !(string_A == 0)) && 2 * string_B <= 0) && 0 <= i + string_B) && 0 <= 2 * string_A) && 2 * i <= 10) && !(string_B == 0)) && string_A <= string_B - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: (((((((0 <= 2 * found && 2 * found <= 2) && !(string_A == 0)) && 2 * string_B <= 0) && 0 <= i + string_B) && 0 <= 2 * string_A) && 2 * i <= 10) && !(string_B == 0)) && string_A <= string_B - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: (((((((0 <= 2 * found && 2 * found <= 2) && !(string_A == 0)) && 2 * string_B <= 0) && 0 <= i + string_B) && 0 <= 2 * string_A) && 2 * i <= 10) && !(string_B == 0)) && string_A <= string_B - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 40 locations, 1 error locations. SAFE Result, 12.5s OverallTime, 4 OverallIterations, 2 TraceHistogramMax, 4.9s AutomataDifference, 0.0s DeadEndRemovalTime, 1.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 98 SDtfs, 152 SDslu, 254 SDs, 0 SdLazy, 42 SolverSat, 53 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 4 DeclaredPredicates, 76 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=41occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 3.6s AbstIntTime, 2 AbstIntIterations, 2 AbstIntStrong, 0.9455981416957023 AbsIntWeakeningRatio, 1.9666666666666666 AbsIntAvgWeakeningVarsNumRemoved, 269.18333333333334 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 10 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 11 LocationsWithAnnotation, 17 PreInvPairs, 33 NumberOfFragments, 281 HoareAnnotationTreeSize, 17 FomulaSimplifications, 2579 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 11 FomulaSimplificationsInter, 838 FormulaSimplificationTreeSizeReductionInter, 0.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 109 NumberOfCodeBlocks, 109 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 105 ConstructedInterpolants, 0 QuantifiedInterpolants, 3407 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 2 PerfectInterpolantSequences, 6/10 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...