./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive-simple/sum_10x0_false-unreach-call_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_ae4f19de-1c6b-4bc5-9fa4-3192c5fb6e01/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_ae4f19de-1c6b-4bc5-9fa4-3192c5fb6e01/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_ae4f19de-1c6b-4bc5-9fa4-3192c5fb6e01/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_ae4f19de-1c6b-4bc5-9fa4-3192c5fb6e01/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursive-simple/sum_10x0_false-unreach-call_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_ae4f19de-1c6b-4bc5-9fa4-3192c5fb6e01/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_ae4f19de-1c6b-4bc5-9fa4-3192c5fb6e01/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 03b834537fd67eba3e98faa1fce1fca3851f5bba ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 11:18:57,300 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 11:18:57,301 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 11:18:57,307 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 11:18:57,307 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 11:18:57,307 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 11:18:57,308 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 11:18:57,309 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 11:18:57,309 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 11:18:57,310 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 11:18:57,310 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 11:18:57,310 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 11:18:57,311 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 11:18:57,311 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 11:18:57,312 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 11:18:57,312 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 11:18:57,312 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 11:18:57,313 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 11:18:57,314 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 11:18:57,315 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 11:18:57,315 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 11:18:57,316 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 11:18:57,317 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 11:18:57,317 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 11:18:57,317 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 11:18:57,318 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 11:18:57,318 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 11:18:57,319 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 11:18:57,319 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 11:18:57,319 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 11:18:57,320 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 11:18:57,320 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 11:18:57,320 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 11:18:57,320 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 11:18:57,321 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 11:18:57,321 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 11:18:57,321 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_ae4f19de-1c6b-4bc5-9fa4-3192c5fb6e01/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-09 11:18:57,328 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 11:18:57,328 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 11:18:57,329 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 11:18:57,329 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 11:18:57,329 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 11:18:57,329 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 11:18:57,329 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 11:18:57,329 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 11:18:57,329 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 11:18:57,330 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 11:18:57,330 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 11:18:57,330 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 11:18:57,330 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 11:18:57,330 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 11:18:57,330 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 11:18:57,330 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 11:18:57,330 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 11:18:57,331 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 11:18:57,331 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 11:18:57,331 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 11:18:57,331 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 11:18:57,331 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 11:18:57,331 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 11:18:57,331 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 11:18:57,331 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 11:18:57,331 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 11:18:57,331 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 11:18:57,331 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 11:18:57,332 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 11:18:57,332 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 11:18:57,332 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 11:18:57,332 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 11:18:57,332 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 11:18:57,332 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 11:18:57,332 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 11:18:57,332 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-09 11:18:57,332 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_ae4f19de-1c6b-4bc5-9fa4-3192c5fb6e01/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 -> 03b834537fd67eba3e98faa1fce1fca3851f5bba [2018-12-09 11:18:57,350 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 11:18:57,358 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 11:18:57,361 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 11:18:57,362 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 11:18:57,362 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 11:18:57,363 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_ae4f19de-1c6b-4bc5-9fa4-3192c5fb6e01/bin-2019/utaipan/../../sv-benchmarks/c/recursive-simple/sum_10x0_false-unreach-call_true-termination.c [2018-12-09 11:18:57,398 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ae4f19de-1c6b-4bc5-9fa4-3192c5fb6e01/bin-2019/utaipan/data/b9b3abfd9/9196e9ed28f042c5b44832a929bd780a/FLAG6ae5789fa [2018-12-09 11:18:57,716 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 11:18:57,717 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_ae4f19de-1c6b-4bc5-9fa4-3192c5fb6e01/sv-benchmarks/c/recursive-simple/sum_10x0_false-unreach-call_true-termination.c [2018-12-09 11:18:57,720 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ae4f19de-1c6b-4bc5-9fa4-3192c5fb6e01/bin-2019/utaipan/data/b9b3abfd9/9196e9ed28f042c5b44832a929bd780a/FLAG6ae5789fa [2018-12-09 11:18:58,136 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_ae4f19de-1c6b-4bc5-9fa4-3192c5fb6e01/bin-2019/utaipan/data/b9b3abfd9/9196e9ed28f042c5b44832a929bd780a [2018-12-09 11:18:58,138 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 11:18:58,139 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 11:18:58,140 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 11:18:58,140 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 11:18:58,142 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 11:18:58,143 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 11:18:58" (1/1) ... [2018-12-09 11:18:58,144 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7084b22b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:18:58, skipping insertion in model container [2018-12-09 11:18:58,144 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 11:18:58" (1/1) ... [2018-12-09 11:18:58,149 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 11:18:58,158 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 11:18:58,249 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 11:18:58,251 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 11:18:58,259 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 11:18:58,267 INFO L195 MainTranslator]: Completed translation [2018-12-09 11:18:58,267 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:18:58 WrapperNode [2018-12-09 11:18:58,268 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 11:18:58,268 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 11:18:58,268 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 11:18:58,268 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 11:18:58,273 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:18:58" (1/1) ... [2018-12-09 11:18:58,276 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:18:58" (1/1) ... [2018-12-09 11:18:58,280 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 11:18:58,280 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 11:18:58,280 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 11:18:58,280 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 11:18:58,285 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:18:58" (1/1) ... [2018-12-09 11:18:58,285 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:18:58" (1/1) ... [2018-12-09 11:18:58,286 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:18:58" (1/1) ... [2018-12-09 11:18:58,286 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:18:58" (1/1) ... [2018-12-09 11:18:58,288 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:18:58" (1/1) ... [2018-12-09 11:18:58,289 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:18:58" (1/1) ... [2018-12-09 11:18:58,289 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:18:58" (1/1) ... [2018-12-09 11:18:58,290 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 11:18:58,290 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 11:18:58,290 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 11:18:58,290 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 11:18:58,291 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:18:58" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ae4f19de-1c6b-4bc5-9fa4-3192c5fb6e01/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-12-09 11:18:58,353 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 11:18:58,353 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 11:18:58,353 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 11:18:58,353 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 11:18:58,353 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2018-12-09 11:18:58,353 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2018-12-09 11:18:58,353 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 11:18:58,354 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 11:18:58,427 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 11:18:58,427 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-09 11:18:58,428 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 11:18:58 BoogieIcfgContainer [2018-12-09 11:18:58,428 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 11:18:58,428 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 11:18:58,428 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 11:18:58,430 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 11:18:58,430 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 11:18:58" (1/3) ... [2018-12-09 11:18:58,430 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d6084fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 11:18:58, skipping insertion in model container [2018-12-09 11:18:58,431 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:18:58" (2/3) ... [2018-12-09 11:18:58,431 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d6084fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 11:18:58, skipping insertion in model container [2018-12-09 11:18:58,431 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 11:18:58" (3/3) ... [2018-12-09 11:18:58,432 INFO L112 eAbstractionObserver]: Analyzing ICFG sum_10x0_false-unreach-call_true-termination.c [2018-12-09 11:18:58,437 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 11:18:58,441 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-09 11:18:58,450 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-09 11:18:58,467 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 11:18:58,467 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 11:18:58,467 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 11:18:58,467 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 11:18:58,467 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 11:18:58,467 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 11:18:58,468 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 11:18:58,468 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 11:18:58,478 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2018-12-09 11:18:58,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-09 11:18:58,483 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:18:58,483 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:18:58,484 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:18:58,488 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:18:58,488 INFO L82 PathProgramCache]: Analyzing trace with hash 2001781660, now seen corresponding path program 1 times [2018-12-09 11:18:58,489 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 11:18:58,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:18:58,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:18:58,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:18:58,519 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 11:18:58,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:18:58,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:18:58,588 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:18:58,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 11:18:58,588 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 11:18:58,591 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 11:18:58,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 11:18:58,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 11:18:58,599 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 5 states. [2018-12-09 11:18:58,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:18:58,641 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2018-12-09 11:18:58,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 11:18:58,642 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-12-09 11:18:58,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:18:58,647 INFO L225 Difference]: With dead ends: 30 [2018-12-09 11:18:58,648 INFO L226 Difference]: Without dead ends: 18 [2018-12-09 11:18:58,649 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 11:18:58,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-12-09 11:18:58,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-12-09 11:18:58,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-09 11:18:58,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2018-12-09 11:18:58,672 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 13 [2018-12-09 11:18:58,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:18:58,672 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2018-12-09 11:18:58,672 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 11:18:58,672 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2018-12-09 11:18:58,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-09 11:18:58,673 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:18:58,673 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:18:58,674 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:18:58,674 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:18:58,674 INFO L82 PathProgramCache]: Analyzing trace with hash -118151420, now seen corresponding path program 1 times [2018-12-09 11:18:58,674 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 11:18:58,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:18:58,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:18:58,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:18:58,675 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 11:18:58,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:18:58,714 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-09 11:18:58,714 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 11:18:58,715 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 11:18:58,715 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 20 with the following transitions: [2018-12-09 11:18:58,716 INFO L205 CegarAbsIntRunner]: [0], [4], [7], [8], [10], [11], [12], [14], [17], [19], [25], [26], [27], [29], [30], [31], [32] [2018-12-09 11:18:58,734 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 11:18:58,735 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 11:18:58,827 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 11:18:58,828 INFO L272 AbstractInterpreter]: Visited 17 different actions 50 times. Never merged. Widened at 1 different actions 2 times. Performed 130 root evaluator evaluations with a maximum evaluation depth of 4. Performed 130 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 2 fixpoints after 2 different actions. Largest state had 6 variables. [2018-12-09 11:18:58,832 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:18:58,833 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 11:18:58,833 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 11:18:58,833 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ae4f19de-1c6b-4bc5-9fa4-3192c5fb6e01/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-12-09 11:18:58,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:18:58,839 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 11:18:58,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:18:58,856 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 11:18:58,876 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-09 11:18:58,876 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 11:18:58,969 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 11:18:58,986 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 11:18:58,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 9 [2018-12-09 11:18:58,986 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 11:18:58,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 11:18:58,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 11:18:58,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-12-09 11:18:58,987 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 6 states. [2018-12-09 11:18:59,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:18:59,022 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2018-12-09 11:18:59,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 11:18:59,022 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-12-09 11:18:59,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:18:59,023 INFO L225 Difference]: With dead ends: 25 [2018-12-09 11:18:59,023 INFO L226 Difference]: Without dead ends: 21 [2018-12-09 11:18:59,023 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 33 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2018-12-09 11:18:59,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-12-09 11:18:59,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-12-09 11:18:59,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-09 11:18:59,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-12-09 11:18:59,026 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 19 [2018-12-09 11:18:59,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:18:59,026 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2018-12-09 11:18:59,026 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 11:18:59,027 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2018-12-09 11:18:59,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-09 11:18:59,027 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:18:59,027 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:18:59,027 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:18:59,027 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:18:59,027 INFO L82 PathProgramCache]: Analyzing trace with hash 764931548, now seen corresponding path program 2 times [2018-12-09 11:18:59,028 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 11:18:59,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:18:59,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:18:59,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:18:59,028 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 11:18:59,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:18:59,075 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-09 11:18:59,075 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 11:18:59,076 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 11:18:59,076 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 11:18:59,076 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 11:18:59,076 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 11:18:59,076 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ae4f19de-1c6b-4bc5-9fa4-3192c5fb6e01/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 11:18:59,082 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 11:18:59,083 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-09 11:18:59,095 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-09 11:18:59,095 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 11:18:59,096 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 11:18:59,102 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-09 11:18:59,103 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 11:18:59,279 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-09 11:18:59,298 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 11:18:59,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 9] total 11 [2018-12-09 11:18:59,298 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 11:18:59,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 11:18:59,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 11:18:59,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-12-09 11:18:59,299 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 7 states. [2018-12-09 11:18:59,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:18:59,341 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2018-12-09 11:18:59,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 11:18:59,342 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2018-12-09 11:18:59,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:18:59,342 INFO L225 Difference]: With dead ends: 28 [2018-12-09 11:18:59,342 INFO L226 Difference]: Without dead ends: 24 [2018-12-09 11:18:59,343 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 43 SyntacticMatches, 6 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2018-12-09 11:18:59,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-12-09 11:18:59,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-12-09 11:18:59,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-12-09 11:18:59,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2018-12-09 11:18:59,346 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 25 [2018-12-09 11:18:59,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:18:59,347 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2018-12-09 11:18:59,347 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 11:18:59,347 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2018-12-09 11:18:59,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-09 11:18:59,347 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:18:59,347 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:18:59,348 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:18:59,348 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:18:59,348 INFO L82 PathProgramCache]: Analyzing trace with hash 601942852, now seen corresponding path program 3 times [2018-12-09 11:18:59,348 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 11:18:59,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:18:59,349 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 11:18:59,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:18:59,349 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 11:18:59,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:18:59,406 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-09 11:18:59,406 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 11:18:59,406 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 11:18:59,406 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 11:18:59,407 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 11:18:59,407 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 11:18:59,407 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ae4f19de-1c6b-4bc5-9fa4-3192c5fb6e01/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 11:18:59,412 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-09 11:18:59,413 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-09 11:18:59,420 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-09 11:18:59,421 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 11:18:59,422 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 11:18:59,430 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-09 11:18:59,430 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 11:18:59,697 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-09 11:18:59,710 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 11:18:59,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 11] total 13 [2018-12-09 11:18:59,711 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 11:18:59,711 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 11:18:59,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 11:18:59,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2018-12-09 11:18:59,711 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 8 states. [2018-12-09 11:18:59,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:18:59,765 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2018-12-09 11:18:59,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 11:18:59,766 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2018-12-09 11:18:59,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:18:59,766 INFO L225 Difference]: With dead ends: 31 [2018-12-09 11:18:59,766 INFO L226 Difference]: Without dead ends: 27 [2018-12-09 11:18:59,766 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 53 SyntacticMatches, 8 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2018-12-09 11:18:59,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-09 11:18:59,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-12-09 11:18:59,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-09 11:18:59,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-12-09 11:18:59,769 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 31 [2018-12-09 11:18:59,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:18:59,769 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-12-09 11:18:59,770 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 11:18:59,770 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-12-09 11:18:59,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-09 11:18:59,770 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:18:59,770 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:18:59,770 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:18:59,770 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:18:59,771 INFO L82 PathProgramCache]: Analyzing trace with hash -183109604, now seen corresponding path program 4 times [2018-12-09 11:18:59,771 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 11:18:59,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:18:59,771 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 11:18:59,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:18:59,771 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 11:18:59,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:18:59,838 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-12-09 11:18:59,838 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 11:18:59,839 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 11:18:59,839 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 11:18:59,839 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 11:18:59,839 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 11:18:59,839 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ae4f19de-1c6b-4bc5-9fa4-3192c5fb6e01/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 11:18:59,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:18:59,847 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 11:18:59,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:18:59,857 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 11:18:59,864 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-12-09 11:18:59,864 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 11:19:00,248 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-09 11:19:00,266 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 11:19:00,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 13] total 15 [2018-12-09 11:19:00,267 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 11:19:00,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 11:19:00,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 11:19:00,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2018-12-09 11:19:00,267 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 9 states. [2018-12-09 11:19:00,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:19:00,332 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2018-12-09 11:19:00,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 11:19:00,332 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 37 [2018-12-09 11:19:00,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:19:00,333 INFO L225 Difference]: With dead ends: 34 [2018-12-09 11:19:00,333 INFO L226 Difference]: Without dead ends: 30 [2018-12-09 11:19:00,333 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 63 SyntacticMatches, 10 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=123, Invalid=257, Unknown=0, NotChecked=0, Total=380 [2018-12-09 11:19:00,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-09 11:19:00,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-12-09 11:19:00,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-09 11:19:00,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2018-12-09 11:19:00,336 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 37 [2018-12-09 11:19:00,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:19:00,337 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2018-12-09 11:19:00,337 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 11:19:00,337 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2018-12-09 11:19:00,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-09 11:19:00,338 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:19:00,338 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:19:00,338 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:19:00,338 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:19:00,338 INFO L82 PathProgramCache]: Analyzing trace with hash -155447420, now seen corresponding path program 5 times [2018-12-09 11:19:00,338 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 11:19:00,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:19:00,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:19:00,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:19:00,339 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 11:19:00,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:19:00,391 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-12-09 11:19:00,391 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 11:19:00,391 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 11:19:00,391 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 11:19:00,392 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 11:19:00,392 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 11:19:00,392 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ae4f19de-1c6b-4bc5-9fa4-3192c5fb6e01/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 11:19:00,397 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 11:19:00,397 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-09 11:19:00,408 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-12-09 11:19:00,409 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 11:19:00,410 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 11:19:00,417 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-12-09 11:19:00,417 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 11:19:01,032 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-09 11:19:01,047 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 11:19:01,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 15] total 17 [2018-12-09 11:19:01,047 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 11:19:01,047 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 11:19:01,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 11:19:01,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2018-12-09 11:19:01,048 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 10 states. [2018-12-09 11:19:01,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:19:01,101 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2018-12-09 11:19:01,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 11:19:01,101 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 43 [2018-12-09 11:19:01,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:19:01,102 INFO L225 Difference]: With dead ends: 37 [2018-12-09 11:19:01,102 INFO L226 Difference]: Without dead ends: 33 [2018-12-09 11:19:01,102 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 73 SyntacticMatches, 12 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=164, Invalid=342, Unknown=0, NotChecked=0, Total=506 [2018-12-09 11:19:01,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-09 11:19:01,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-12-09 11:19:01,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-09 11:19:01,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2018-12-09 11:19:01,105 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 43 [2018-12-09 11:19:01,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:19:01,105 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2018-12-09 11:19:01,105 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 11:19:01,105 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2018-12-09 11:19:01,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-09 11:19:01,106 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:19:01,106 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:19:01,106 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:19:01,106 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:19:01,106 INFO L82 PathProgramCache]: Analyzing trace with hash 1716183644, now seen corresponding path program 6 times [2018-12-09 11:19:01,106 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 11:19:01,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:19:01,107 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 11:19:01,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:19:01,107 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 11:19:01,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:19:01,174 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-12-09 11:19:01,175 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 11:19:01,175 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 11:19:01,175 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 11:19:01,175 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 11:19:01,175 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 11:19:01,175 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ae4f19de-1c6b-4bc5-9fa4-3192c5fb6e01/bin-2019/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 11:19:01,181 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-09 11:19:01,181 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-09 11:19:01,193 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-09 11:19:01,193 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 11:19:01,195 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 11:19:01,204 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-12-09 11:19:01,204 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 11:19:01,994 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-09 11:19:02,009 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 11:19:02,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 17] total 19 [2018-12-09 11:19:02,009 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 11:19:02,009 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-09 11:19:02,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-09 11:19:02,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2018-12-09 11:19:02,010 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 11 states. [2018-12-09 11:19:02,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:19:02,073 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2018-12-09 11:19:02,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 11:19:02,074 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 49 [2018-12-09 11:19:02,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:19:02,074 INFO L225 Difference]: With dead ends: 40 [2018-12-09 11:19:02,074 INFO L226 Difference]: Without dead ends: 36 [2018-12-09 11:19:02,075 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 83 SyntacticMatches, 14 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=211, Invalid=439, Unknown=0, NotChecked=0, Total=650 [2018-12-09 11:19:02,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-09 11:19:02,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-12-09 11:19:02,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-09 11:19:02,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2018-12-09 11:19:02,077 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 49 [2018-12-09 11:19:02,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:19:02,078 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2018-12-09 11:19:02,078 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-09 11:19:02,078 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2018-12-09 11:19:02,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-09 11:19:02,078 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:19:02,078 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:19:02,078 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:19:02,078 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:19:02,078 INFO L82 PathProgramCache]: Analyzing trace with hash -1079602236, now seen corresponding path program 7 times [2018-12-09 11:19:02,079 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 11:19:02,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:19:02,079 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 11:19:02,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:19:02,079 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 11:19:02,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:19:02,144 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2018-12-09 11:19:02,144 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 11:19:02,144 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 11:19:02,144 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 11:19:02,144 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 11:19:02,144 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 11:19:02,144 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ae4f19de-1c6b-4bc5-9fa4-3192c5fb6e01/bin-2019/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 11:19:02,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:19:02,150 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 11:19:02,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:19:02,161 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 11:19:02,169 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2018-12-09 11:19:02,169 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 11:19:03,229 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-12-09 11:19:03,243 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 11:19:03,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 19] total 21 [2018-12-09 11:19:03,243 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 11:19:03,244 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-09 11:19:03,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-09 11:19:03,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2018-12-09 11:19:03,244 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand 12 states. [2018-12-09 11:19:03,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:19:03,320 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2018-12-09 11:19:03,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 11:19:03,320 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 55 [2018-12-09 11:19:03,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:19:03,320 INFO L225 Difference]: With dead ends: 43 [2018-12-09 11:19:03,320 INFO L226 Difference]: Without dead ends: 39 [2018-12-09 11:19:03,321 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 93 SyntacticMatches, 16 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=264, Invalid=548, Unknown=0, NotChecked=0, Total=812 [2018-12-09 11:19:03,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-12-09 11:19:03,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-12-09 11:19:03,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-09 11:19:03,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2018-12-09 11:19:03,324 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 55 [2018-12-09 11:19:03,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:19:03,324 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2018-12-09 11:19:03,324 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-09 11:19:03,324 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2018-12-09 11:19:03,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-09 11:19:03,325 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:19:03,325 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:19:03,325 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:19:03,325 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:19:03,325 INFO L82 PathProgramCache]: Analyzing trace with hash 1035381916, now seen corresponding path program 8 times [2018-12-09 11:19:03,325 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 11:19:03,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:19:03,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:19:03,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:19:03,325 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 11:19:03,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:19:03,405 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-12-09 11:19:03,405 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 11:19:03,405 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 11:19:03,405 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 11:19:03,406 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 11:19:03,406 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 11:19:03,406 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ae4f19de-1c6b-4bc5-9fa4-3192c5fb6e01/bin-2019/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 11:19:03,412 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 11:19:03,412 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-09 11:19:03,428 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-12-09 11:19:03,429 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 11:19:03,430 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 11:19:03,438 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-12-09 11:19:03,438 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 11:19:04,901 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 164 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-09 11:19:04,915 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 11:19:04,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 21] total 23 [2018-12-09 11:19:04,916 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 11:19:04,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-09 11:19:04,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-09 11:19:04,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2018-12-09 11:19:04,916 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 13 states. [2018-12-09 11:19:04,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:19:04,993 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2018-12-09 11:19:04,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-09 11:19:04,993 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 61 [2018-12-09 11:19:04,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:19:04,994 INFO L225 Difference]: With dead ends: 46 [2018-12-09 11:19:04,994 INFO L226 Difference]: Without dead ends: 42 [2018-12-09 11:19:04,994 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 103 SyntacticMatches, 18 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=323, Invalid=669, Unknown=0, NotChecked=0, Total=992 [2018-12-09 11:19:04,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-12-09 11:19:04,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-12-09 11:19:04,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-09 11:19:04,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2018-12-09 11:19:04,997 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 61 [2018-12-09 11:19:04,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:19:04,997 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2018-12-09 11:19:04,997 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-09 11:19:04,998 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2018-12-09 11:19:04,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-09 11:19:04,998 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:19:04,998 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:19:04,998 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:19:04,998 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:19:04,998 INFO L82 PathProgramCache]: Analyzing trace with hash 952137732, now seen corresponding path program 9 times [2018-12-09 11:19:04,998 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 11:19:04,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:19:04,999 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 11:19:04,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:19:04,999 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 11:19:05,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:19:05,067 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-12-09 11:19:05,067 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 11:19:05,068 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 11:19:05,068 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 11:19:05,068 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 11:19:05,068 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 11:19:05,068 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ae4f19de-1c6b-4bc5-9fa4-3192c5fb6e01/bin-2019/utaipan/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 11:19:05,073 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-09 11:19:05,073 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-09 11:19:05,084 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-09 11:19:05,084 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 11:19:05,085 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 11:19:05,093 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-12-09 11:19:05,093 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 11:19:07,125 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 207 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-12-09 11:19:07,147 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 11:19:07,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 23] total 24 [2018-12-09 11:19:07,147 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 11:19:07,147 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-09 11:19:07,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-09 11:19:07,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2018-12-09 11:19:07,148 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 14 states. [2018-12-09 11:19:07,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:19:07,226 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2018-12-09 11:19:07,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 11:19:07,227 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 67 [2018-12-09 11:19:07,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:19:07,228 INFO L225 Difference]: With dead ends: 49 [2018-12-09 11:19:07,228 INFO L226 Difference]: Without dead ends: 45 [2018-12-09 11:19:07,228 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 113 SyntacticMatches, 21 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=385, Invalid=737, Unknown=0, NotChecked=0, Total=1122 [2018-12-09 11:19:07,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-12-09 11:19:07,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-12-09 11:19:07,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-09 11:19:07,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2018-12-09 11:19:07,231 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 67 [2018-12-09 11:19:07,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:19:07,232 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2018-12-09 11:19:07,232 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-09 11:19:07,232 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2018-12-09 11:19:07,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-09 11:19:07,233 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:19:07,233 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:19:07,233 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:19:07,233 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:19:07,233 INFO L82 PathProgramCache]: Analyzing trace with hash 1540970204, now seen corresponding path program 10 times [2018-12-09 11:19:07,233 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 11:19:07,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:19:07,234 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 11:19:07,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:19:07,234 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 11:19:07,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 11:19:07,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 11:19:07,256 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-09 11:19:07,276 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 11:19:07 BoogieIcfgContainer [2018-12-09 11:19:07,276 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 11:19:07,277 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 11:19:07,277 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 11:19:07,277 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 11:19:07,277 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 11:18:58" (3/4) ... [2018-12-09 11:19:07,279 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-09 11:19:07,310 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_ae4f19de-1c6b-4bc5-9fa4-3192c5fb6e01/bin-2019/utaipan/witness.graphml [2018-12-09 11:19:07,310 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 11:19:07,311 INFO L168 Benchmark]: Toolchain (without parser) took 9172.19 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 262.7 MB). Free memory was 949.7 MB in the beginning and 1.2 GB in the end (delta: -269.0 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 11:19:07,312 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 11:19:07,312 INFO L168 Benchmark]: CACSL2BoogieTranslator took 127.76 ms. Allocated memory is still 1.0 GB. Free memory was 949.7 MB in the beginning and 939.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-09 11:19:07,312 INFO L168 Benchmark]: Boogie Procedure Inliner took 11.64 ms. Allocated memory is still 1.0 GB. Free memory is still 939.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 11:19:07,313 INFO L168 Benchmark]: Boogie Preprocessor took 10.14 ms. Allocated memory is still 1.0 GB. Free memory is still 939.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 11:19:07,313 INFO L168 Benchmark]: RCFGBuilder took 137.79 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 87.6 MB). Free memory was 939.0 MB in the beginning and 1.1 GB in the end (delta: -135.0 MB). Peak memory consumption was 15.4 MB. Max. memory is 11.5 GB. [2018-12-09 11:19:07,313 INFO L168 Benchmark]: TraceAbstraction took 8848.24 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 175.1 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -156.4 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. [2018-12-09 11:19:07,313 INFO L168 Benchmark]: Witness Printer took 33.52 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: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 11.5 GB. [2018-12-09 11:19:07,315 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 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 127.76 ms. Allocated memory is still 1.0 GB. Free memory was 949.7 MB in the beginning and 939.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 11.64 ms. Allocated memory is still 1.0 GB. Free memory is still 939.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 10.14 ms. Allocated memory is still 1.0 GB. Free memory is still 939.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 137.79 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 87.6 MB). Free memory was 939.0 MB in the beginning and 1.1 GB in the end (delta: -135.0 MB). Peak memory consumption was 15.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 8848.24 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 175.1 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -156.4 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. * Witness Printer took 33.52 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: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 16]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L12] int a = 10; [L13] int b = 0; VAL [a=10, b=0] [L14] CALL, EXPR sum(a, b) VAL [\old(m)=0, \old(n)=10] [L4] COND FALSE !(n <= 0) VAL [\old(m)=0, \old(n)=10, m=0, n=10] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=1, \old(n)=9] [L4] COND FALSE !(n <= 0) VAL [\old(m)=1, \old(n)=9, m=1, n=9] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=2, \old(n)=8] [L4] COND FALSE !(n <= 0) VAL [\old(m)=2, \old(n)=8, m=2, n=8] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=3, \old(n)=7] [L4] COND FALSE !(n <= 0) VAL [\old(m)=3, \old(n)=7, m=3, n=7] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=4, \old(n)=6] [L4] COND FALSE !(n <= 0) VAL [\old(m)=4, \old(n)=6, m=4, n=6] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=5, \old(n)=5] [L4] COND FALSE !(n <= 0) VAL [\old(m)=5, \old(n)=5, m=5, n=5] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=6, \old(n)=4] [L4] COND FALSE !(n <= 0) VAL [\old(m)=6, \old(n)=4, m=6, n=4] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=7, \old(n)=3] [L4] COND FALSE !(n <= 0) VAL [\old(m)=7, \old(n)=3, m=7, n=3] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=8, \old(n)=2] [L4] COND FALSE !(n <= 0) VAL [\old(m)=8, \old(n)=2, m=8, n=2] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=9, \old(n)=1] [L4] COND FALSE !(n <= 0) VAL [\old(m)=9, \old(n)=1, m=9, n=1] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=10, \old(n)=0] [L4] COND TRUE n <= 0 [L5] return m + n; VAL [\old(m)=10, \old(n)=0, \result=10, m=10, n=0] [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=9, \old(n)=1, m=9, n=1, sum(n - 1, m + 1)=10] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=8, \old(n)=2, m=8, n=2, sum(n - 1, m + 1)=10] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=7, \old(n)=3, m=7, n=3, sum(n - 1, m + 1)=10] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=6, \old(n)=4, m=6, n=4, sum(n - 1, m + 1)=10] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=5, \old(n)=5, m=5, n=5, sum(n - 1, m + 1)=10] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=4, \old(n)=6, m=4, n=6, sum(n - 1, m + 1)=10] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=3, \old(n)=7, m=3, n=7, sum(n - 1, m + 1)=10] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=2, \old(n)=8, m=2, n=8, sum(n - 1, m + 1)=10] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=1, \old(n)=9, m=1, n=9, sum(n - 1, m + 1)=10] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=0, \old(n)=10, m=0, n=10, sum(n - 1, m + 1)=10] [L7] return sum(n - 1, m + 1); [L14] RET, EXPR sum(a, b) VAL [a=10, b=0, sum(a, b)=10] [L14] int result = sum(a, b); [L15] COND TRUE result == a + b VAL [a=10, b=0, result=10] [L16] __VERIFIER_error() VAL [a=10, b=0, result=10] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 20 locations, 1 error locations. UNSAFE Result, 8.8s OverallTime, 11 OverallIterations, 11 TraceHistogramMax, 0.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 123 SDtfs, 163 SDslu, 569 SDs, 0 SdLazy, 446 SolverSat, 12 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 960 GetRequests, 659 SyntacticMatches, 109 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1069 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=45occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.1s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 7.4s InterpolantComputationTime, 860 NumberOfCodeBlocks, 839 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 1146 ConstructedInterpolants, 0 QuantifiedInterpolants, 150432 SizeOfPredicates, 63 NumberOfNonLiveVariables, 1059 ConjunctsInSsa, 126 ConjunctsInUnsatCore, 28 InterpolantComputations, 1 PerfectInterpolantSequences, 1065/2700 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...