./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive-simple/id2_b3_o5_true-unreach-call_true-termination_true-no-overflow.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_f40ee94e-9340-4834-9208-ed9181763bf5/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_f40ee94e-9340-4834-9208-ed9181763bf5/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_f40ee94e-9340-4834-9208-ed9181763bf5/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_f40ee94e-9340-4834-9208-ed9181763bf5/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursive-simple/id2_b3_o5_true-unreach-call_true-termination_true-no-overflow.c -s /tmp/vcloud-vcloud-master/worker/working_dir_f40ee94e-9340-4834-9208-ed9181763bf5/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_f40ee94e-9340-4834-9208-ed9181763bf5/bin-2019/utaipan --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 ceb806ae997f94b7f09b4e2dce31a0e63ff1a329 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-22 22:04:13,295 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-22 22:04:13,296 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-22 22:04:13,303 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-22 22:04:13,303 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-22 22:04:13,304 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-22 22:04:13,305 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-22 22:04:13,306 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-22 22:04:13,307 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-22 22:04:13,307 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-22 22:04:13,308 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-22 22:04:13,308 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-22 22:04:13,309 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-22 22:04:13,310 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-22 22:04:13,311 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-22 22:04:13,311 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-22 22:04:13,312 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-22 22:04:13,313 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-22 22:04:13,314 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-22 22:04:13,315 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-22 22:04:13,316 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-22 22:04:13,317 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-22 22:04:13,319 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-22 22:04:13,319 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-22 22:04:13,319 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-22 22:04:13,320 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-22 22:04:13,320 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-22 22:04:13,321 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-22 22:04:13,321 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-22 22:04:13,322 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-22 22:04:13,322 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-22 22:04:13,323 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-22 22:04:13,323 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-22 22:04:13,323 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-22 22:04:13,324 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-22 22:04:13,324 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-22 22:04:13,324 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_f40ee94e-9340-4834-9208-ed9181763bf5/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-22 22:04:13,335 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-22 22:04:13,335 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-22 22:04:13,336 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-22 22:04:13,336 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-22 22:04:13,336 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-22 22:04:13,336 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-22 22:04:13,336 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-22 22:04:13,336 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-22 22:04:13,336 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-22 22:04:13,337 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-22 22:04:13,337 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-22 22:04:13,337 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-22 22:04:13,337 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-22 22:04:13,338 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-22 22:04:13,338 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-22 22:04:13,338 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-22 22:04:13,338 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-22 22:04:13,338 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-22 22:04:13,338 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-22 22:04:13,338 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-22 22:04:13,339 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-22 22:04:13,339 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-22 22:04:13,339 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-22 22:04:13,339 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-22 22:04:13,339 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-22 22:04:13,339 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-22 22:04:13,339 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-22 22:04:13,340 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-22 22:04:13,340 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-22 22:04:13,340 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-22 22:04:13,340 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-22 22:04:13,340 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-22 22:04:13,340 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-22 22:04:13,340 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-22 22:04:13,341 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-22 22:04:13,341 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-22 22:04:13,341 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-22 22:04:13,341 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_f40ee94e-9340-4834-9208-ed9181763bf5/bin-2019/utaipan 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 -> ceb806ae997f94b7f09b4e2dce31a0e63ff1a329 [2018-11-22 22:04:13,364 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-22 22:04:13,373 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-22 22:04:13,376 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-22 22:04:13,377 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-22 22:04:13,377 INFO L276 PluginConnector]: CDTParser initialized [2018-11-22 22:04:13,378 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_f40ee94e-9340-4834-9208-ed9181763bf5/bin-2019/utaipan/../../sv-benchmarks/c/recursive-simple/id2_b3_o5_true-unreach-call_true-termination_true-no-overflow.c [2018-11-22 22:04:13,415 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f40ee94e-9340-4834-9208-ed9181763bf5/bin-2019/utaipan/data/4695e9b8d/63e95d7c31ca4c89b088ec5d1e636b8c/FLAG643a56256 [2018-11-22 22:04:13,715 INFO L307 CDTParser]: Found 1 translation units. [2018-11-22 22:04:13,715 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_f40ee94e-9340-4834-9208-ed9181763bf5/sv-benchmarks/c/recursive-simple/id2_b3_o5_true-unreach-call_true-termination_true-no-overflow.c [2018-11-22 22:04:13,721 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f40ee94e-9340-4834-9208-ed9181763bf5/bin-2019/utaipan/data/4695e9b8d/63e95d7c31ca4c89b088ec5d1e636b8c/FLAG643a56256 [2018-11-22 22:04:13,732 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_f40ee94e-9340-4834-9208-ed9181763bf5/bin-2019/utaipan/data/4695e9b8d/63e95d7c31ca4c89b088ec5d1e636b8c [2018-11-22 22:04:13,735 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-22 22:04:13,736 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-22 22:04:13,736 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-22 22:04:13,737 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-22 22:04:13,739 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-22 22:04:13,740 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:04:13" (1/1) ... [2018-11-22 22:04:13,741 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33c486bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:04:13, skipping insertion in model container [2018-11-22 22:04:13,742 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:04:13" (1/1) ... [2018-11-22 22:04:13,752 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-22 22:04:13,768 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-22 22:04:13,911 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 22:04:13,913 INFO L191 MainTranslator]: Completed pre-run [2018-11-22 22:04:13,924 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 22:04:13,933 INFO L195 MainTranslator]: Completed translation [2018-11-22 22:04:13,934 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:04:13 WrapperNode [2018-11-22 22:04:13,934 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-22 22:04:13,934 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-22 22:04:13,934 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-22 22:04:13,935 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-22 22:04:13,940 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:04:13" (1/1) ... [2018-11-22 22:04:13,944 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:04:13" (1/1) ... [2018-11-22 22:04:13,948 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-22 22:04:13,948 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-22 22:04:13,948 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-22 22:04:13,948 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-22 22:04:13,954 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:04:13" (1/1) ... [2018-11-22 22:04:13,954 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:04:13" (1/1) ... [2018-11-22 22:04:13,954 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:04:13" (1/1) ... [2018-11-22 22:04:13,954 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:04:13" (1/1) ... [2018-11-22 22:04:13,957 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:04:13" (1/1) ... [2018-11-22 22:04:13,958 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:04:13" (1/1) ... [2018-11-22 22:04:13,958 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:04:13" (1/1) ... [2018-11-22 22:04:13,959 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-22 22:04:13,959 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-22 22:04:13,960 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-22 22:04:13,960 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-22 22:04:13,960 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:04:13" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f40ee94e-9340-4834-9208-ed9181763bf5/bin-2019/utaipan/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-11-22 22:04:14,040 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-22 22:04:14,040 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-22 22:04:14,040 INFO L130 BoogieDeclarations]: Found specification of procedure id2 [2018-11-22 22:04:14,040 INFO L138 BoogieDeclarations]: Found implementation of procedure id2 [2018-11-22 22:04:14,041 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-22 22:04:14,041 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-22 22:04:14,041 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-22 22:04:14,041 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-22 22:04:14,041 INFO L130 BoogieDeclarations]: Found specification of procedure id [2018-11-22 22:04:14,041 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2018-11-22 22:04:14,146 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-22 22:04:14,147 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-22 22:04:14,147 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:04:14 BoogieIcfgContainer [2018-11-22 22:04:14,147 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-22 22:04:14,147 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-22 22:04:14,147 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-22 22:04:14,149 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-22 22:04:14,150 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 10:04:13" (1/3) ... [2018-11-22 22:04:14,150 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bb92667 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 10:04:14, skipping insertion in model container [2018-11-22 22:04:14,150 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:04:13" (2/3) ... [2018-11-22 22:04:14,150 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bb92667 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 10:04:14, skipping insertion in model container [2018-11-22 22:04:14,150 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:04:14" (3/3) ... [2018-11-22 22:04:14,151 INFO L112 eAbstractionObserver]: Analyzing ICFG id2_b3_o5_true-unreach-call_true-termination_true-no-overflow.c [2018-11-22 22:04:14,157 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-22 22:04:14,162 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-22 22:04:14,173 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-22 22:04:14,196 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-22 22:04:14,196 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-22 22:04:14,196 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-22 22:04:14,196 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-22 22:04:14,196 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-22 22:04:14,196 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-22 22:04:14,196 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-22 22:04:14,196 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-22 22:04:14,206 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2018-11-22 22:04:14,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-22 22:04:14,209 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:04:14,210 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:04:14,211 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 22:04:14,214 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:04:14,214 INFO L82 PathProgramCache]: Analyzing trace with hash 128923731, now seen corresponding path program 1 times [2018-11-22 22:04:14,215 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 22:04:14,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:04:14,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:04:14,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:04:14,245 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 22:04:14,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:04:14,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 22:04:14,379 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:04:14,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-22 22:04:14,379 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 22:04:14,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-22 22:04:14,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-22 22:04:14,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-22 22:04:14,391 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 5 states. [2018-11-22 22:04:14,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:04:14,426 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2018-11-22 22:04:14,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-22 22:04:14,427 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-11-22 22:04:14,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:04:14,436 INFO L225 Difference]: With dead ends: 40 [2018-11-22 22:04:14,436 INFO L226 Difference]: Without dead ends: 26 [2018-11-22 22:04:14,438 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-22 22:04:14,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-22 22:04:14,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-11-22 22:04:14,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-22 22:04:14,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2018-11-22 22:04:14,466 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 13 [2018-11-22 22:04:14,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:04:14,466 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2018-11-22 22:04:14,466 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-22 22:04:14,466 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2018-11-22 22:04:14,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-22 22:04:14,468 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:04:14,468 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:04:14,468 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 22:04:14,469 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:04:14,469 INFO L82 PathProgramCache]: Analyzing trace with hash 1945633833, now seen corresponding path program 1 times [2018-11-22 22:04:14,469 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 22:04:14,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:04:14,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:04:14,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:04:14,470 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 22:04:14,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:04:14,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 22:04:14,558 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:04:14,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-22 22:04:14,558 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 22:04:14,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-22 22:04:14,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-22 22:04:14,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-22 22:04:14,560 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand 5 states. [2018-11-22 22:04:14,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:04:14,586 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2018-11-22 22:04:14,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-22 22:04:14,586 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-11-22 22:04:14,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:04:14,587 INFO L225 Difference]: With dead ends: 44 [2018-11-22 22:04:14,587 INFO L226 Difference]: Without dead ends: 32 [2018-11-22 22:04:14,588 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-22 22:04:14,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-22 22:04:14,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2018-11-22 22:04:14,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-22 22:04:14,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2018-11-22 22:04:14,592 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 20 [2018-11-22 22:04:14,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:04:14,592 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2018-11-22 22:04:14,592 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-22 22:04:14,592 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2018-11-22 22:04:14,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-22 22:04:14,592 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:04:14,593 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:04:14,593 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 22:04:14,593 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:04:14,593 INFO L82 PathProgramCache]: Analyzing trace with hash 1974262984, now seen corresponding path program 1 times [2018-11-22 22:04:14,593 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 22:04:14,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:04:14,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:04:14,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:04:14,594 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 22:04:14,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:04:14,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 22:04:14,697 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:04:14,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-22 22:04:14,698 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 22:04:14,698 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-22 22:04:14,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-22 22:04:14,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-22 22:04:14,699 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 8 states. [2018-11-22 22:04:14,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:04:14,738 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2018-11-22 22:04:14,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-22 22:04:14,738 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-11-22 22:04:14,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:04:14,739 INFO L225 Difference]: With dead ends: 36 [2018-11-22 22:04:14,739 INFO L226 Difference]: Without dead ends: 32 [2018-11-22 22:04:14,739 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-22 22:04:14,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-22 22:04:14,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2018-11-22 22:04:14,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-22 22:04:14,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2018-11-22 22:04:14,744 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 20 [2018-11-22 22:04:14,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:04:14,744 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2018-11-22 22:04:14,744 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-22 22:04:14,745 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2018-11-22 22:04:14,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-22 22:04:14,745 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:04:14,745 INFO L402 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] [2018-11-22 22:04:14,746 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 22:04:14,746 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:04:14,746 INFO L82 PathProgramCache]: Analyzing trace with hash 1423155149, now seen corresponding path program 1 times [2018-11-22 22:04:14,746 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 22:04:14,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:04:14,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:04:14,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:04:14,747 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 22:04:14,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:04:14,797 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-22 22:04:14,797 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:04:14,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-22 22:04:14,798 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 22:04:14,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-22 22:04:14,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-22 22:04:14,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-22 22:04:14,799 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 5 states. [2018-11-22 22:04:14,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:04:14,810 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2018-11-22 22:04:14,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-22 22:04:14,810 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-11-22 22:04:14,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:04:14,811 INFO L225 Difference]: With dead ends: 48 [2018-11-22 22:04:14,811 INFO L226 Difference]: Without dead ends: 36 [2018-11-22 22:04:14,812 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-22 22:04:14,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-22 22:04:14,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2018-11-22 22:04:14,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-22 22:04:14,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2018-11-22 22:04:14,816 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 27 [2018-11-22 22:04:14,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:04:14,816 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2018-11-22 22:04:14,816 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-22 22:04:14,817 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-11-22 22:04:14,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-22 22:04:14,817 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:04:14,817 INFO L402 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] [2018-11-22 22:04:14,817 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 22:04:14,817 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:04:14,818 INFO L82 PathProgramCache]: Analyzing trace with hash 1226641644, now seen corresponding path program 1 times [2018-11-22 22:04:14,818 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 22:04:14,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:04:14,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:04:14,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:04:14,819 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 22:04:14,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:04:14,881 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-22 22:04:14,881 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:04:14,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-22 22:04:14,882 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 22:04:14,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-22 22:04:14,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-22 22:04:14,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-22 22:04:14,883 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 5 states. [2018-11-22 22:04:14,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:04:14,892 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2018-11-22 22:04:14,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-22 22:04:14,893 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-11-22 22:04:14,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:04:14,894 INFO L225 Difference]: With dead ends: 40 [2018-11-22 22:04:14,894 INFO L226 Difference]: Without dead ends: 36 [2018-11-22 22:04:14,894 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-22 22:04:14,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-22 22:04:14,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2018-11-22 22:04:14,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-22 22:04:14,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2018-11-22 22:04:14,899 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 27 [2018-11-22 22:04:14,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:04:14,899 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2018-11-22 22:04:14,899 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-22 22:04:14,899 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-11-22 22:04:14,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-22 22:04:14,900 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:04:14,900 INFO L402 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] [2018-11-22 22:04:14,900 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 22:04:14,900 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:04:14,901 INFO L82 PathProgramCache]: Analyzing trace with hash 1255270795, now seen corresponding path program 1 times [2018-11-22 22:04:14,901 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 22:04:14,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:04:14,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:04:14,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:04:14,902 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 22:04:14,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:04:15,043 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-22 22:04:15,044 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 22:04:15,044 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-22 22:04:15,045 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 28 with the following transitions: [2018-11-22 22:04:15,046 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [7], [11], [12], [16], [18], [21], [23], [29], [32], [33], [35], [39], [40], [41], [42], [43], [44], [45], [47], [48], [49], [50] [2018-11-22 22:04:15,073 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-22 22:04:15,073 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-22 22:04:15,205 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-22 22:04:15,206 INFO L272 AbstractInterpreter]: Visited 24 different actions 56 times. Merged at 10 different actions 12 times. Never widened. Performed 100 root evaluator evaluations with a maximum evaluation depth of 4. Performed 100 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 2 fixpoints after 2 different actions. Largest state had 5 variables. [2018-11-22 22:04:15,226 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:04:15,226 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-22 22:04:15,291 INFO L227 lantSequenceWeakener]: Weakened 10 states. On average, predicates are now at 60% of their original sizes. [2018-11-22 22:04:15,291 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-22 22:04:15,353 INFO L415 sIntCurrentIteration]: We unified 26 AI predicates to 26 [2018-11-22 22:04:15,353 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-22 22:04:15,354 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-22 22:04:15,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [11] total 21 [2018-11-22 22:04:15,354 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 22:04:15,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-22 22:04:15,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-22 22:04:15,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-22 22:04:15,355 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 12 states. [2018-11-22 22:04:15,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:04:15,601 INFO L93 Difference]: Finished difference Result 62 states and 71 transitions. [2018-11-22 22:04:15,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-22 22:04:15,601 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 27 [2018-11-22 22:04:15,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:04:15,602 INFO L225 Difference]: With dead ends: 62 [2018-11-22 22:04:15,602 INFO L226 Difference]: Without dead ends: 46 [2018-11-22 22:04:15,602 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 33 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2018-11-22 22:04:15,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-22 22:04:15,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 38. [2018-11-22 22:04:15,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-22 22:04:15,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2018-11-22 22:04:15,606 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 27 [2018-11-22 22:04:15,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:04:15,606 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2018-11-22 22:04:15,606 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-22 22:04:15,606 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2018-11-22 22:04:15,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-22 22:04:15,607 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:04:15,607 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:04:15,607 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 22:04:15,607 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:04:15,607 INFO L82 PathProgramCache]: Analyzing trace with hash 709659056, now seen corresponding path program 1 times [2018-11-22 22:04:15,607 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 22:04:15,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:04:15,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:04:15,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:04:15,608 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 22:04:15,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:04:15,770 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-22 22:04:15,770 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 22:04:15,770 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-22 22:04:15,771 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 35 with the following transitions: [2018-11-22 22:04:15,771 INFO L202 CegarAbsIntRunner]: [0], [1], [4], [5], [7], [11], [12], [16], [18], [21], [23], [29], [33], [35], [39], [40], [41], [42], [43], [44], [45], [47], [48], [49], [50] [2018-11-22 22:04:15,773 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-22 22:04:15,774 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-22 22:04:15,796 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-22 22:04:15,796 INFO L272 AbstractInterpreter]: Visited 24 different actions 47 times. Merged at 8 different actions 8 times. Never widened. Performed 81 root evaluator evaluations with a maximum evaluation depth of 4. Performed 81 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 1 fixpoints after 1 different actions. Largest state had 5 variables. [2018-11-22 22:04:15,798 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:04:15,798 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-22 22:04:15,822 INFO L227 lantSequenceWeakener]: Weakened 14 states. On average, predicates are now at 57.14% of their original sizes. [2018-11-22 22:04:15,822 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-22 22:04:15,894 INFO L415 sIntCurrentIteration]: We unified 33 AI predicates to 33 [2018-11-22 22:04:15,894 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-22 22:04:15,894 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-22 22:04:15,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [14] total 28 [2018-11-22 22:04:15,895 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 22:04:15,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-22 22:04:15,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-22 22:04:15,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2018-11-22 22:04:15,895 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand 16 states. [2018-11-22 22:04:16,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:04:16,144 INFO L93 Difference]: Finished difference Result 74 states and 85 transitions. [2018-11-22 22:04:16,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-22 22:04:16,144 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 34 [2018-11-22 22:04:16,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:04:16,146 INFO L225 Difference]: With dead ends: 74 [2018-11-22 22:04:16,147 INFO L226 Difference]: Without dead ends: 50 [2018-11-22 22:04:16,147 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 43 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=561, Unknown=0, NotChecked=0, Total=650 [2018-11-22 22:04:16,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-22 22:04:16,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 46. [2018-11-22 22:04:16,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-22 22:04:16,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2018-11-22 22:04:16,153 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 51 transitions. Word has length 34 [2018-11-22 22:04:16,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:04:16,153 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 51 transitions. [2018-11-22 22:04:16,153 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-22 22:04:16,154 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2018-11-22 22:04:16,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-22 22:04:16,154 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:04:16,154 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:04:16,155 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 22:04:16,155 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:04:16,155 INFO L82 PathProgramCache]: Analyzing trace with hash -292228316, now seen corresponding path program 1 times [2018-11-22 22:04:16,155 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 22:04:16,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:04:16,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:04:16,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:04:16,156 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 22:04:16,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:04:16,208 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-22 22:04:16,208 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:04:16,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-22 22:04:16,209 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 22:04:16,209 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-22 22:04:16,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-22 22:04:16,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-22 22:04:16,210 INFO L87 Difference]: Start difference. First operand 46 states and 51 transitions. Second operand 5 states. [2018-11-22 22:04:16,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:04:16,221 INFO L93 Difference]: Finished difference Result 74 states and 83 transitions. [2018-11-22 22:04:16,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-22 22:04:16,221 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2018-11-22 22:04:16,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:04:16,221 INFO L225 Difference]: With dead ends: 74 [2018-11-22 22:04:16,222 INFO L226 Difference]: Without dead ends: 38 [2018-11-22 22:04:16,222 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-22 22:04:16,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-11-22 22:04:16,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-11-22 22:04:16,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-22 22:04:16,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2018-11-22 22:04:16,226 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 41 [2018-11-22 22:04:16,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:04:16,226 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2018-11-22 22:04:16,226 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-22 22:04:16,226 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2018-11-22 22:04:16,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-22 22:04:16,227 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:04:16,227 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:04:16,227 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 22:04:16,227 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:04:16,227 INFO L82 PathProgramCache]: Analyzing trace with hash 1496626328, now seen corresponding path program 2 times [2018-11-22 22:04:16,227 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 22:04:16,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:04:16,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:04:16,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:04:16,228 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 22:04:16,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:04:16,370 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 12 proven. 8 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-22 22:04:16,370 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 22:04:16,370 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-22 22:04:16,370 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-22 22:04:16,371 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-22 22:04:16,371 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 22:04:16,371 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f40ee94e-9340-4834-9208-ed9181763bf5/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-22 22:04:16,382 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-22 22:04:16,382 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-22 22:04:16,394 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2018-11-22 22:04:16,394 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-22 22:04:16,399 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:04:16,449 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-11-22 22:04:16,449 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-22 22:04:16,543 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-11-22 22:04:16,558 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-22 22:04:16,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [14] total 20 [2018-11-22 22:04:16,558 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 22:04:16,558 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-22 22:04:16,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-22 22:04:16,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=336, Unknown=0, NotChecked=0, Total=380 [2018-11-22 22:04:16,559 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand 5 states. [2018-11-22 22:04:16,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:04:16,562 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2018-11-22 22:04:16,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-22 22:04:16,562 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2018-11-22 22:04:16,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:04:16,563 INFO L225 Difference]: With dead ends: 38 [2018-11-22 22:04:16,563 INFO L226 Difference]: Without dead ends: 0 [2018-11-22 22:04:16,563 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=336, Unknown=0, NotChecked=0, Total=380 [2018-11-22 22:04:16,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-22 22:04:16,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-22 22:04:16,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-22 22:04:16,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-22 22:04:16,564 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 48 [2018-11-22 22:04:16,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:04:16,564 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-22 22:04:16,564 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-22 22:04:16,564 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-22 22:04:16,564 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-22 22:04:16,567 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-22 22:04:16,588 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-22 22:04:16,588 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-22 22:04:16,588 INFO L448 ceAbstractionStarter]: For program point L17(line 17) no Hoare annotation was computed. [2018-11-22 22:04:16,589 INFO L444 ceAbstractionStarter]: At program point L16(line 16) the Hoare annotation is: (not (= id2_~x 0)) [2018-11-22 22:04:16,589 INFO L448 ceAbstractionStarter]: For program point L15(line 15) no Hoare annotation was computed. [2018-11-22 22:04:16,589 INFO L448 ceAbstractionStarter]: For program point L16-1(line 16) no Hoare annotation was computed. [2018-11-22 22:04:16,589 INFO L448 ceAbstractionStarter]: For program point id2EXIT(lines 14 19) no Hoare annotation was computed. [2018-11-22 22:04:16,589 INFO L451 ceAbstractionStarter]: At program point id2ENTRY(lines 14 19) the Hoare annotation is: true [2018-11-22 22:04:16,589 INFO L448 ceAbstractionStarter]: For program point id2FINAL(lines 14 19) no Hoare annotation was computed. [2018-11-22 22:04:16,589 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-22 22:04:16,589 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-22 22:04:16,589 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-22 22:04:16,589 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-22 22:04:16,589 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 21 27) the Hoare annotation is: true [2018-11-22 22:04:16,589 INFO L448 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2018-11-22 22:04:16,590 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 21 27) no Hoare annotation was computed. [2018-11-22 22:04:16,590 INFO L448 ceAbstractionStarter]: For program point L24(lines 24 26) no Hoare annotation was computed. [2018-11-22 22:04:16,590 INFO L451 ceAbstractionStarter]: At program point L23(line 23) the Hoare annotation is: true [2018-11-22 22:04:16,590 INFO L448 ceAbstractionStarter]: For program point L23-1(line 23) no Hoare annotation was computed. [2018-11-22 22:04:16,590 INFO L448 ceAbstractionStarter]: For program point L24-2(lines 21 27) no Hoare annotation was computed. [2018-11-22 22:04:16,590 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 25) no Hoare annotation was computed. [2018-11-22 22:04:16,590 INFO L448 ceAbstractionStarter]: For program point idFINAL(lines 7 12) no Hoare annotation was computed. [2018-11-22 22:04:16,590 INFO L448 ceAbstractionStarter]: For program point idEXIT(lines 7 12) no Hoare annotation was computed. [2018-11-22 22:04:16,592 INFO L448 ceAbstractionStarter]: For program point L10(line 10) no Hoare annotation was computed. [2018-11-22 22:04:16,592 INFO L444 ceAbstractionStarter]: At program point L9(line 9) the Hoare annotation is: (not (= id_~x 0)) [2018-11-22 22:04:16,592 INFO L448 ceAbstractionStarter]: For program point L8(line 8) no Hoare annotation was computed. [2018-11-22 22:04:16,592 INFO L448 ceAbstractionStarter]: For program point L9-1(line 9) no Hoare annotation was computed. [2018-11-22 22:04:16,592 INFO L451 ceAbstractionStarter]: At program point idENTRY(lines 7 12) the Hoare annotation is: true [2018-11-22 22:04:16,595 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 10:04:16 BoogieIcfgContainer [2018-11-22 22:04:16,595 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-22 22:04:16,595 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-22 22:04:16,595 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-22 22:04:16,595 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-22 22:04:16,595 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:04:14" (3/4) ... [2018-11-22 22:04:16,598 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-22 22:04:16,601 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-22 22:04:16,601 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure id2 [2018-11-22 22:04:16,602 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-22 22:04:16,602 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure id [2018-11-22 22:04:16,604 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2018-11-22 22:04:16,604 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-22 22:04:16,604 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-22 22:04:16,633 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_f40ee94e-9340-4834-9208-ed9181763bf5/bin-2019/utaipan/witness.graphml [2018-11-22 22:04:16,633 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-22 22:04:16,634 INFO L168 Benchmark]: Toolchain (without parser) took 2898.54 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 220.7 MB). Free memory was 953.8 MB in the beginning and 1.1 GB in the end (delta: -186.5 MB). Peak memory consumption was 34.2 MB. Max. memory is 11.5 GB. [2018-11-22 22:04:16,635 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 22:04:16,635 INFO L168 Benchmark]: CACSL2BoogieTranslator took 197.74 ms. Allocated memory is still 1.0 GB. Free memory was 953.8 MB in the beginning and 943.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-22 22:04:16,635 INFO L168 Benchmark]: Boogie Procedure Inliner took 13.25 ms. Allocated memory is still 1.0 GB. Free memory was 943.0 MB in the beginning and 940.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-22 22:04:16,635 INFO L168 Benchmark]: Boogie Preprocessor took 11.42 ms. Allocated memory is still 1.0 GB. Free memory is still 940.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 22:04:16,636 INFO L168 Benchmark]: RCFGBuilder took 187.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 162.5 MB). Free memory was 940.3 MB in the beginning and 1.1 GB in the end (delta: -206.8 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. [2018-11-22 22:04:16,636 INFO L168 Benchmark]: TraceAbstraction took 2447.35 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 58.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.9 MB). Peak memory consumption was 60.1 MB. Max. memory is 11.5 GB. [2018-11-22 22:04:16,636 INFO L168 Benchmark]: Witness Printer took 38.20 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 4.9 MB). Peak memory consumption was 4.9 MB. Max. memory is 11.5 GB. [2018-11-22 22:04:16,641 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 197.74 ms. Allocated memory is still 1.0 GB. Free memory was 953.8 MB in the beginning and 943.0 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 13.25 ms. Allocated memory is still 1.0 GB. Free memory was 943.0 MB in the beginning and 940.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 11.42 ms. Allocated memory is still 1.0 GB. Free memory is still 940.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 187.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 162.5 MB). Free memory was 940.3 MB in the beginning and 1.1 GB in the end (delta: -206.8 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2447.35 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 58.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.9 MB). Peak memory consumption was 60.1 MB. Max. memory is 11.5 GB. * Witness Printer took 38.20 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 4.9 MB). Peak memory consumption was 4.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 25]: 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 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 28 locations, 1 error locations. SAFE Result, 2.4s OverallTime, 9 OverallIterations, 3 TraceHistogramMax, 0.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 260 SDtfs, 44 SDslu, 1332 SDs, 0 SdLazy, 95 SolverSat, 8 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 4 DeclaredPredicates, 219 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=46occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.2s AbstIntTime, 2 AbstIntIterations, 2 AbstIntStrong, 0.7542372881355932 AbsIntWeakeningRatio, 0.6271186440677966 AbsIntAvgWeakeningVarsNumRemoved, 0.1694915254237288 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 20 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 11 PreInvPairs, 11 NumberOfFragments, 15 HoareAnnotationTreeSize, 11 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 9 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 305 NumberOfCodeBlocks, 277 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 342 ConstructedInterpolants, 0 QuantifiedInterpolants, 27948 SizeOfPredicates, 3 NumberOfNonLiveVariables, 45 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 11 InterpolantComputations, 8 PerfectInterpolantSequences, 137/153 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...