./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.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 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_8f07fc83-c046-4d6e-a05f-5f89a4cce0f2/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_8f07fc83-c046-4d6e-a05f-5f89a4cce0f2/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_8f07fc83-c046-4d6e-a05f-5f89a4cce0f2/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_8f07fc83-c046-4d6e-a05f-5f89a4cce0f2/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_8f07fc83-c046-4d6e-a05f-5f89a4cce0f2/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_8f07fc83-c046-4d6e-a05f-5f89a4cce0f2/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-5842f4b [2018-11-18 09:34:19,468 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 09:34:19,469 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 09:34:19,477 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 09:34:19,477 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 09:34:19,478 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 09:34:19,478 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 09:34:19,479 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 09:34:19,480 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 09:34:19,480 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 09:34:19,480 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 09:34:19,481 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 09:34:19,481 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 09:34:19,482 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 09:34:19,482 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 09:34:19,483 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 09:34:19,483 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 09:34:19,484 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 09:34:19,486 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 09:34:19,486 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 09:34:19,487 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 09:34:19,488 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 09:34:19,490 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 09:34:19,490 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 09:34:19,490 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 09:34:19,491 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 09:34:19,491 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 09:34:19,491 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 09:34:19,492 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 09:34:19,493 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 09:34:19,493 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 09:34:19,494 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 09:34:19,494 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 09:34:19,495 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 09:34:19,495 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 09:34:19,496 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 09:34:19,496 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_8f07fc83-c046-4d6e-a05f-5f89a4cce0f2/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-18 09:34:19,506 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 09:34:19,506 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 09:34:19,506 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 09:34:19,507 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-18 09:34:19,507 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-18 09:34:19,507 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-18 09:34:19,507 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-18 09:34:19,507 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-18 09:34:19,507 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-18 09:34:19,507 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-18 09:34:19,507 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-18 09:34:19,507 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-18 09:34:19,507 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-18 09:34:19,508 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 09:34:19,508 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 09:34:19,508 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 09:34:19,508 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 09:34:19,508 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 09:34:19,508 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 09:34:19,508 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 09:34:19,509 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 09:34:19,509 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 09:34:19,509 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 09:34:19,509 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 09:34:19,509 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 09:34:19,509 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 09:34:19,509 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 09:34:19,510 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 09:34:19,510 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 09:34:19,510 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 09:34:19,510 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 09:34:19,510 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 09:34:19,510 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 09:34:19,510 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-18 09:34:19,510 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 09:34:19,510 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 09:34:19,510 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 09:34:19,510 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_8f07fc83-c046-4d6e-a05f-5f89a4cce0f2/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-18 09:34:19,533 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 09:34:19,542 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 09:34:19,544 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 09:34:19,545 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 09:34:19,546 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 09:34:19,546 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_8f07fc83-c046-4d6e-a05f-5f89a4cce0f2/bin-2019/utaipan/../../sv-benchmarks/c/recursive-simple/id2_b3_o5_true-unreach-call_true-termination_true-no-overflow.c [2018-11-18 09:34:19,590 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8f07fc83-c046-4d6e-a05f-5f89a4cce0f2/bin-2019/utaipan/data/0d127c87e/642dda43faf24bc889024455e90f6e7b/FLAGc64e3150c [2018-11-18 09:34:19,976 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 09:34:19,976 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_8f07fc83-c046-4d6e-a05f-5f89a4cce0f2/sv-benchmarks/c/recursive-simple/id2_b3_o5_true-unreach-call_true-termination_true-no-overflow.c [2018-11-18 09:34:19,980 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8f07fc83-c046-4d6e-a05f-5f89a4cce0f2/bin-2019/utaipan/data/0d127c87e/642dda43faf24bc889024455e90f6e7b/FLAGc64e3150c [2018-11-18 09:34:19,988 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_8f07fc83-c046-4d6e-a05f-5f89a4cce0f2/bin-2019/utaipan/data/0d127c87e/642dda43faf24bc889024455e90f6e7b [2018-11-18 09:34:19,990 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 09:34:19,991 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 09:34:19,991 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 09:34:19,991 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 09:34:19,993 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 09:34:19,994 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:34:19" (1/1) ... [2018-11-18 09:34:19,995 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17a96ca9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:34:19, skipping insertion in model container [2018-11-18 09:34:19,995 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:34:19" (1/1) ... [2018-11-18 09:34:20,001 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 09:34:20,011 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 09:34:20,115 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 09:34:20,117 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 09:34:20,127 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 09:34:20,135 INFO L195 MainTranslator]: Completed translation [2018-11-18 09:34:20,135 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:34:20 WrapperNode [2018-11-18 09:34:20,135 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 09:34:20,136 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 09:34:20,136 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 09:34:20,136 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 09:34:20,142 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:34:20" (1/1) ... [2018-11-18 09:34:20,147 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:34:20" (1/1) ... [2018-11-18 09:34:20,152 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 09:34:20,152 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 09:34:20,152 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 09:34:20,152 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 09:34:20,160 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:34:20" (1/1) ... [2018-11-18 09:34:20,160 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:34:20" (1/1) ... [2018-11-18 09:34:20,161 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:34:20" (1/1) ... [2018-11-18 09:34:20,161 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:34:20" (1/1) ... [2018-11-18 09:34:20,164 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:34:20" (1/1) ... [2018-11-18 09:34:20,166 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:34:20" (1/1) ... [2018-11-18 09:34:20,166 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:34:20" (1/1) ... [2018-11-18 09:34:20,167 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 09:34:20,168 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 09:34:20,168 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 09:34:20,168 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 09:34:20,168 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:34:20" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8f07fc83-c046-4d6e-a05f-5f89a4cce0f2/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-18 09:34:20,241 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 09:34:20,241 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 09:34:20,241 INFO L130 BoogieDeclarations]: Found specification of procedure id2 [2018-11-18 09:34:20,241 INFO L138 BoogieDeclarations]: Found implementation of procedure id2 [2018-11-18 09:34:20,242 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 09:34:20,242 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 09:34:20,242 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 09:34:20,242 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 09:34:20,242 INFO L130 BoogieDeclarations]: Found specification of procedure id [2018-11-18 09:34:20,242 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2018-11-18 09:34:20,382 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 09:34:20,382 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:34:20 BoogieIcfgContainer [2018-11-18 09:34:20,382 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 09:34:20,383 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 09:34:20,383 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 09:34:20,386 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 09:34:20,386 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 09:34:19" (1/3) ... [2018-11-18 09:34:20,387 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ab1012e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 09:34:20, skipping insertion in model container [2018-11-18 09:34:20,387 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:34:20" (2/3) ... [2018-11-18 09:34:20,387 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ab1012e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 09:34:20, skipping insertion in model container [2018-11-18 09:34:20,387 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:34:20" (3/3) ... [2018-11-18 09:34:20,389 INFO L112 eAbstractionObserver]: Analyzing ICFG id2_b3_o5_true-unreach-call_true-termination_true-no-overflow.c [2018-11-18 09:34:20,397 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 09:34:20,403 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 09:34:20,416 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 09:34:20,442 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 09:34:20,442 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 09:34:20,442 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 09:34:20,442 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 09:34:20,442 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 09:34:20,443 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 09:34:20,443 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 09:34:20,443 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 09:34:20,459 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2018-11-18 09:34:20,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-18 09:34:20,463 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:34:20,464 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:34:20,466 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:34:20,470 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:34:20,470 INFO L82 PathProgramCache]: Analyzing trace with hash 128923731, now seen corresponding path program 1 times [2018-11-18 09:34:20,472 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 09:34:20,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:34:20,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:34:20,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:34:20,512 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 09:34:20,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:34:20,651 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-18 09:34:20,652 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:34:20,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 09:34:20,652 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 09:34:20,655 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 09:34:20,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 09:34:20,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 09:34:20,665 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 5 states. [2018-11-18 09:34:20,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:34:20,701 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2018-11-18 09:34:20,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 09:34:20,702 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-11-18 09:34:20,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:34:20,707 INFO L225 Difference]: With dead ends: 40 [2018-11-18 09:34:20,708 INFO L226 Difference]: Without dead ends: 26 [2018-11-18 09:34:20,710 INFO L604 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-18 09:34:20,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-18 09:34:20,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-11-18 09:34:20,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-18 09:34:20,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2018-11-18 09:34:20,739 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 13 [2018-11-18 09:34:20,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:34:20,740 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2018-11-18 09:34:20,740 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 09:34:20,740 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2018-11-18 09:34:20,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-18 09:34:20,741 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:34:20,741 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] [2018-11-18 09:34:20,742 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:34:20,742 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:34:20,742 INFO L82 PathProgramCache]: Analyzing trace with hash 1945633833, now seen corresponding path program 1 times [2018-11-18 09:34:20,742 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 09:34:20,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:34:20,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:34:20,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:34:20,743 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 09:34:20,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:34:20,812 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-18 09:34:20,812 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:34:20,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 09:34:20,813 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 09:34:20,814 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 09:34:20,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 09:34:20,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 09:34:20,814 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand 5 states. [2018-11-18 09:34:20,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:34:20,847 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2018-11-18 09:34:20,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 09:34:20,847 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-11-18 09:34:20,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:34:20,848 INFO L225 Difference]: With dead ends: 44 [2018-11-18 09:34:20,848 INFO L226 Difference]: Without dead ends: 32 [2018-11-18 09:34:20,849 INFO L604 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-18 09:34:20,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-18 09:34:20,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2018-11-18 09:34:20,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-18 09:34:20,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2018-11-18 09:34:20,852 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 20 [2018-11-18 09:34:20,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:34:20,852 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2018-11-18 09:34:20,853 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 09:34:20,853 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2018-11-18 09:34:20,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-18 09:34:20,853 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:34:20,853 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] [2018-11-18 09:34:20,854 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:34:20,854 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:34:20,854 INFO L82 PathProgramCache]: Analyzing trace with hash 1974262984, now seen corresponding path program 1 times [2018-11-18 09:34:20,854 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 09:34:20,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:34:20,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:34:20,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:34:20,855 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 09:34:20,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:34:20,958 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-18 09:34:20,958 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:34:20,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-18 09:34:20,959 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 09:34:20,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 09:34:20,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 09:34:20,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-18 09:34:20,959 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 8 states. [2018-11-18 09:34:20,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:34:20,991 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2018-11-18 09:34:20,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 09:34:20,992 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-11-18 09:34:20,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:34:20,992 INFO L225 Difference]: With dead ends: 36 [2018-11-18 09:34:20,992 INFO L226 Difference]: Without dead ends: 32 [2018-11-18 09:34:20,993 INFO L604 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-18 09:34:20,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-18 09:34:20,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2018-11-18 09:34:20,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-18 09:34:20,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2018-11-18 09:34:20,996 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 20 [2018-11-18 09:34:20,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:34:20,997 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2018-11-18 09:34:20,997 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 09:34:20,997 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2018-11-18 09:34:20,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-18 09:34:20,997 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:34:20,997 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] [2018-11-18 09:34:20,997 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:34:20,998 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:34:20,998 INFO L82 PathProgramCache]: Analyzing trace with hash 1423155149, now seen corresponding path program 1 times [2018-11-18 09:34:20,998 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 09:34:20,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:34:20,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:34:20,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:34:20,998 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 09:34:21,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:34:21,050 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-18 09:34:21,050 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:34:21,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 09:34:21,050 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 09:34:21,051 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 09:34:21,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 09:34:21,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 09:34:21,051 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 5 states. [2018-11-18 09:34:21,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:34:21,075 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2018-11-18 09:34:21,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 09:34:21,075 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-11-18 09:34:21,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:34:21,076 INFO L225 Difference]: With dead ends: 48 [2018-11-18 09:34:21,076 INFO L226 Difference]: Without dead ends: 36 [2018-11-18 09:34:21,076 INFO L604 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-18 09:34:21,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-18 09:34:21,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2018-11-18 09:34:21,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-18 09:34:21,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2018-11-18 09:34:21,081 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 27 [2018-11-18 09:34:21,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:34:21,081 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2018-11-18 09:34:21,081 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 09:34:21,081 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-11-18 09:34:21,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-18 09:34:21,082 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:34:21,082 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] [2018-11-18 09:34:21,082 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:34:21,082 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:34:21,082 INFO L82 PathProgramCache]: Analyzing trace with hash 1226641644, now seen corresponding path program 1 times [2018-11-18 09:34:21,082 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 09:34:21,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:34:21,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:34:21,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:34:21,083 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 09:34:21,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:34:21,141 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-18 09:34:21,141 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:34:21,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 09:34:21,141 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 09:34:21,142 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 09:34:21,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 09:34:21,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 09:34:21,142 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 5 states. [2018-11-18 09:34:21,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:34:21,149 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2018-11-18 09:34:21,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 09:34:21,150 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-11-18 09:34:21,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:34:21,150 INFO L225 Difference]: With dead ends: 40 [2018-11-18 09:34:21,151 INFO L226 Difference]: Without dead ends: 36 [2018-11-18 09:34:21,151 INFO L604 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-18 09:34:21,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-18 09:34:21,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2018-11-18 09:34:21,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-18 09:34:21,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2018-11-18 09:34:21,155 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 27 [2018-11-18 09:34:21,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:34:21,155 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2018-11-18 09:34:21,155 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 09:34:21,155 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-11-18 09:34:21,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-18 09:34:21,156 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:34:21,156 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] [2018-11-18 09:34:21,156 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:34:21,156 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:34:21,156 INFO L82 PathProgramCache]: Analyzing trace with hash 1255270795, now seen corresponding path program 1 times [2018-11-18 09:34:21,157 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 09:34:21,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:34:21,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:34:21,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:34:21,157 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 09:34:21,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:34:21,290 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-18 09:34:21,290 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 09:34:21,290 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 09:34:21,291 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 28 with the following transitions: [2018-11-18 09:34:21,292 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-18 09:34:21,326 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 09:34:21,326 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 09:34:21,464 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 09:34:21,465 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-18 09:34:21,470 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:34:21,470 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 09:34:21,520 INFO L227 lantSequenceWeakener]: Weakened 10 states. On average, predicates are now at 60% of their original sizes. [2018-11-18 09:34:21,520 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 09:34:21,577 INFO L415 sIntCurrentIteration]: We unified 26 AI predicates to 26 [2018-11-18 09:34:21,578 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 09:34:21,578 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 09:34:21,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [11] total 21 [2018-11-18 09:34:21,578 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 09:34:21,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-18 09:34:21,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-18 09:34:21,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-18 09:34:21,579 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 12 states. [2018-11-18 09:34:21,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:34:21,804 INFO L93 Difference]: Finished difference Result 62 states and 71 transitions. [2018-11-18 09:34:21,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-18 09:34:21,804 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 27 [2018-11-18 09:34:21,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:34:21,805 INFO L225 Difference]: With dead ends: 62 [2018-11-18 09:34:21,805 INFO L226 Difference]: Without dead ends: 46 [2018-11-18 09:34:21,805 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 33 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2018-11-18 09:34:21,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-18 09:34:21,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 38. [2018-11-18 09:34:21,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-18 09:34:21,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2018-11-18 09:34:21,808 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 27 [2018-11-18 09:34:21,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:34:21,809 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2018-11-18 09:34:21,809 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-18 09:34:21,809 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2018-11-18 09:34:21,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-18 09:34:21,809 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:34:21,809 INFO L375 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-18 09:34:21,810 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:34:21,810 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:34:21,810 INFO L82 PathProgramCache]: Analyzing trace with hash 709659056, now seen corresponding path program 1 times [2018-11-18 09:34:21,810 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 09:34:21,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:34:21,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:34:21,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:34:21,811 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 09:34:21,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:34:21,963 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-18 09:34:21,963 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 09:34:21,963 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 09:34:21,963 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 35 with the following transitions: [2018-11-18 09:34:21,964 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-18 09:34:21,965 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 09:34:21,965 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 09:34:21,985 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 09:34:21,985 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-18 09:34:21,987 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:34:21,987 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 09:34:22,011 INFO L227 lantSequenceWeakener]: Weakened 14 states. On average, predicates are now at 57.14% of their original sizes. [2018-11-18 09:34:22,011 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 09:34:22,075 INFO L415 sIntCurrentIteration]: We unified 33 AI predicates to 33 [2018-11-18 09:34:22,075 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 09:34:22,075 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 09:34:22,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [14] total 28 [2018-11-18 09:34:22,075 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 09:34:22,076 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-18 09:34:22,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-18 09:34:22,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2018-11-18 09:34:22,076 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand 16 states. [2018-11-18 09:34:22,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:34:22,327 INFO L93 Difference]: Finished difference Result 74 states and 85 transitions. [2018-11-18 09:34:22,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-18 09:34:22,327 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 34 [2018-11-18 09:34:22,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:34:22,328 INFO L225 Difference]: With dead ends: 74 [2018-11-18 09:34:22,328 INFO L226 Difference]: Without dead ends: 50 [2018-11-18 09:34:22,329 INFO L604 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-18 09:34:22,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-18 09:34:22,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 46. [2018-11-18 09:34:22,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-18 09:34:22,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2018-11-18 09:34:22,333 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 51 transitions. Word has length 34 [2018-11-18 09:34:22,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:34:22,333 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 51 transitions. [2018-11-18 09:34:22,333 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-18 09:34:22,333 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2018-11-18 09:34:22,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-18 09:34:22,334 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:34:22,334 INFO L375 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-18 09:34:22,334 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:34:22,334 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:34:22,334 INFO L82 PathProgramCache]: Analyzing trace with hash -292228316, now seen corresponding path program 1 times [2018-11-18 09:34:22,334 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 09:34:22,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:34:22,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:34:22,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:34:22,335 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 09:34:22,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:34:22,379 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-18 09:34:22,379 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:34:22,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 09:34:22,382 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 09:34:22,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 09:34:22,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 09:34:22,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 09:34:22,383 INFO L87 Difference]: Start difference. First operand 46 states and 51 transitions. Second operand 5 states. [2018-11-18 09:34:22,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:34:22,403 INFO L93 Difference]: Finished difference Result 74 states and 83 transitions. [2018-11-18 09:34:22,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 09:34:22,403 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2018-11-18 09:34:22,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:34:22,404 INFO L225 Difference]: With dead ends: 74 [2018-11-18 09:34:22,404 INFO L226 Difference]: Without dead ends: 38 [2018-11-18 09:34:22,404 INFO L604 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-18 09:34:22,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-11-18 09:34:22,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-11-18 09:34:22,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-18 09:34:22,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2018-11-18 09:34:22,407 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 41 [2018-11-18 09:34:22,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:34:22,407 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2018-11-18 09:34:22,408 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 09:34:22,408 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2018-11-18 09:34:22,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-18 09:34:22,408 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:34:22,408 INFO L375 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-18 09:34:22,409 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:34:22,409 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:34:22,409 INFO L82 PathProgramCache]: Analyzing trace with hash 1496626328, now seen corresponding path program 2 times [2018-11-18 09:34:22,409 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 09:34:22,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:34:22,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:34:22,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:34:22,410 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 09:34:22,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:34:22,525 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-18 09:34:22,525 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 09:34:22,525 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 09:34:22,526 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-18 09:34:22,527 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-18 09:34:22,527 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 09:34:22,527 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8f07fc83-c046-4d6e-a05f-5f89a4cce0f2/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-18 09:34:22,539 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 09:34:22,539 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-18 09:34:22,550 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2018-11-18 09:34:22,550 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 09:34:22,555 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:34:22,636 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-18 09:34:22,636 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 09:34:22,725 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-18 09:34:22,740 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-18 09:34:22,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [14] total 20 [2018-11-18 09:34:22,741 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 09:34:22,741 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 09:34:22,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 09:34:22,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=336, Unknown=0, NotChecked=0, Total=380 [2018-11-18 09:34:22,741 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand 5 states. [2018-11-18 09:34:22,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:34:22,745 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2018-11-18 09:34:22,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 09:34:22,745 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2018-11-18 09:34:22,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:34:22,745 INFO L225 Difference]: With dead ends: 38 [2018-11-18 09:34:22,746 INFO L226 Difference]: Without dead ends: 0 [2018-11-18 09:34:22,746 INFO L604 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-18 09:34:22,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-18 09:34:22,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-18 09:34:22,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-18 09:34:22,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-18 09:34:22,747 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 48 [2018-11-18 09:34:22,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:34:22,747 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 09:34:22,747 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 09:34:22,747 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-18 09:34:22,747 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 09:34:22,750 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-18 09:34:22,767 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-18 09:34:22,767 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-18 09:34:22,767 INFO L425 ceAbstractionStarter]: For program point L17(line 17) no Hoare annotation was computed. [2018-11-18 09:34:22,767 INFO L421 ceAbstractionStarter]: At program point L16(line 16) the Hoare annotation is: (not (= id2_~x 0)) [2018-11-18 09:34:22,767 INFO L425 ceAbstractionStarter]: For program point L15(line 15) no Hoare annotation was computed. [2018-11-18 09:34:22,767 INFO L425 ceAbstractionStarter]: For program point L16-1(line 16) no Hoare annotation was computed. [2018-11-18 09:34:22,767 INFO L425 ceAbstractionStarter]: For program point id2EXIT(lines 14 19) no Hoare annotation was computed. [2018-11-18 09:34:22,767 INFO L428 ceAbstractionStarter]: At program point id2ENTRY(lines 14 19) the Hoare annotation is: true [2018-11-18 09:34:22,767 INFO L425 ceAbstractionStarter]: For program point id2FINAL(lines 14 19) no Hoare annotation was computed. [2018-11-18 09:34:22,767 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-18 09:34:22,767 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-18 09:34:22,767 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-18 09:34:22,767 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-18 09:34:22,768 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 21 27) the Hoare annotation is: true [2018-11-18 09:34:22,768 INFO L425 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2018-11-18 09:34:22,768 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 25) no Hoare annotation was computed. [2018-11-18 09:34:22,768 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 21 27) no Hoare annotation was computed. [2018-11-18 09:34:22,768 INFO L425 ceAbstractionStarter]: For program point L24(lines 24 26) no Hoare annotation was computed. [2018-11-18 09:34:22,768 INFO L428 ceAbstractionStarter]: At program point L23(line 23) the Hoare annotation is: true [2018-11-18 09:34:22,768 INFO L425 ceAbstractionStarter]: For program point L23-1(line 23) no Hoare annotation was computed. [2018-11-18 09:34:22,768 INFO L425 ceAbstractionStarter]: For program point L24-2(lines 21 27) no Hoare annotation was computed. [2018-11-18 09:34:22,768 INFO L425 ceAbstractionStarter]: For program point idFINAL(lines 7 12) no Hoare annotation was computed. [2018-11-18 09:34:22,768 INFO L425 ceAbstractionStarter]: For program point idEXIT(lines 7 12) no Hoare annotation was computed. [2018-11-18 09:34:22,768 INFO L425 ceAbstractionStarter]: For program point L10(line 10) no Hoare annotation was computed. [2018-11-18 09:34:22,768 INFO L421 ceAbstractionStarter]: At program point L9(line 9) the Hoare annotation is: (not (= id_~x 0)) [2018-11-18 09:34:22,768 INFO L425 ceAbstractionStarter]: For program point L8(line 8) no Hoare annotation was computed. [2018-11-18 09:34:22,768 INFO L425 ceAbstractionStarter]: For program point L9-1(line 9) no Hoare annotation was computed. [2018-11-18 09:34:22,768 INFO L428 ceAbstractionStarter]: At program point idENTRY(lines 7 12) the Hoare annotation is: true [2018-11-18 09:34:22,770 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 09:34:22 BoogieIcfgContainer [2018-11-18 09:34:22,770 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 09:34:22,770 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 09:34:22,770 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 09:34:22,770 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 09:34:22,771 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:34:20" (3/4) ... [2018-11-18 09:34:22,773 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-18 09:34:22,776 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-18 09:34:22,776 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure id2 [2018-11-18 09:34:22,777 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-18 09:34:22,777 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure id [2018-11-18 09:34:22,779 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2018-11-18 09:34:22,779 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-18 09:34:22,779 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-18 09:34:22,806 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_8f07fc83-c046-4d6e-a05f-5f89a4cce0f2/bin-2019/utaipan/witness.graphml [2018-11-18 09:34:22,806 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 09:34:22,806 INFO L168 Benchmark]: Toolchain (without parser) took 2816.38 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 223.9 MB). Free memory was 959.2 MB in the beginning and 1.2 GB in the end (delta: -195.6 MB). Peak memory consumption was 28.3 MB. Max. memory is 11.5 GB. [2018-11-18 09:34:22,807 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 09:34:22,807 INFO L168 Benchmark]: CACSL2BoogieTranslator took 144.52 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 948.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-18 09:34:22,808 INFO L168 Benchmark]: Boogie Procedure Inliner took 16.21 ms. Allocated memory is still 1.0 GB. Free memory is still 948.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 09:34:22,808 INFO L168 Benchmark]: Boogie Preprocessor took 15.19 ms. Allocated memory is still 1.0 GB. Free memory was 948.5 MB in the beginning and 945.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-18 09:34:22,808 INFO L168 Benchmark]: RCFGBuilder took 215.02 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.3 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -195.2 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. [2018-11-18 09:34:22,808 INFO L168 Benchmark]: TraceAbstraction took 2386.93 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 66.6 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -19.0 MB). Peak memory consumption was 47.6 MB. Max. memory is 11.5 GB. [2018-11-18 09:34:22,809 INFO L168 Benchmark]: Witness Printer took 35.69 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 5.2 MB). Peak memory consumption was 5.2 MB. Max. memory is 11.5 GB. [2018-11-18 09:34:22,810 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 144.52 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 948.5 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 16.21 ms. Allocated memory is still 1.0 GB. Free memory is still 948.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.19 ms. Allocated memory is still 1.0 GB. Free memory was 948.5 MB in the beginning and 945.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 215.02 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.3 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -195.2 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2386.93 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 66.6 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -19.0 MB). Peak memory consumption was 47.6 MB. Max. memory is 11.5 GB. * Witness Printer took 35.69 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 5.2 MB). Peak memory consumption was 5.2 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.3s 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...