./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive-simple/sum_25x0_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_eb3572e4-9295-46cb-b171-11a0da54e0d5/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_eb3572e4-9295-46cb-b171-11a0da54e0d5/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_eb3572e4-9295-46cb-b171-11a0da54e0d5/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_eb3572e4-9295-46cb-b171-11a0da54e0d5/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursive-simple/sum_25x0_false-unreach-call_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_eb3572e4-9295-46cb-b171-11a0da54e0d5/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_eb3572e4-9295-46cb-b171-11a0da54e0d5/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 59acfc6d5178664a3f2144603274c2b6e876292a ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 02:49:46,350 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 02:49:46,351 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 02:49:46,357 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 02:49:46,358 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 02:49:46,358 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 02:49:46,359 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 02:49:46,360 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 02:49:46,361 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 02:49:46,362 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 02:49:46,362 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 02:49:46,363 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 02:49:46,363 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 02:49:46,364 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 02:49:46,364 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 02:49:46,365 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 02:49:46,365 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 02:49:46,366 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 02:49:46,367 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 02:49:46,368 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 02:49:46,368 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 02:49:46,369 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 02:49:46,370 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 02:49:46,370 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 02:49:46,370 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 02:49:46,370 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 02:49:46,371 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 02:49:46,371 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 02:49:46,371 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 02:49:46,372 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 02:49:46,372 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 02:49:46,372 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 02:49:46,372 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 02:49:46,373 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 02:49:46,373 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 02:49:46,373 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 02:49:46,373 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_eb3572e4-9295-46cb-b171-11a0da54e0d5/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-09 02:49:46,380 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 02:49:46,380 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 02:49:46,381 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 02:49:46,381 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 02:49:46,381 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 02:49:46,381 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 02:49:46,381 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 02:49:46,382 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 02:49:46,382 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 02:49:46,382 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 02:49:46,382 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 02:49:46,382 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 02:49:46,382 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 02:49:46,383 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 02:49:46,383 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 02:49:46,383 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 02:49:46,383 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 02:49:46,384 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 02:49:46,384 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 02:49:46,384 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 02:49:46,384 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 02:49:46,384 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 02:49:46,384 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 02:49:46,384 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 02:49:46,385 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 02:49:46,385 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 02:49:46,385 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 02:49:46,385 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 02:49:46,385 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 02:49:46,385 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 02:49:46,385 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 02:49:46,385 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 02:49:46,386 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 02:49:46,386 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 02:49:46,386 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 02:49:46,386 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-09 02:49:46,386 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_eb3572e4-9295-46cb-b171-11a0da54e0d5/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 -> 59acfc6d5178664a3f2144603274c2b6e876292a [2018-12-09 02:49:46,409 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 02:49:46,416 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 02:49:46,418 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 02:49:46,419 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 02:49:46,419 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 02:49:46,420 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_eb3572e4-9295-46cb-b171-11a0da54e0d5/bin-2019/utaipan/../../sv-benchmarks/c/recursive-simple/sum_25x0_false-unreach-call_true-termination.c [2018-12-09 02:49:46,457 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_eb3572e4-9295-46cb-b171-11a0da54e0d5/bin-2019/utaipan/data/adadf842f/689ca8c5d32c4b29a954199fb2f1931f/FLAG6b9c1ef3e [2018-12-09 02:49:46,765 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 02:49:46,766 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_eb3572e4-9295-46cb-b171-11a0da54e0d5/sv-benchmarks/c/recursive-simple/sum_25x0_false-unreach-call_true-termination.c [2018-12-09 02:49:46,769 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_eb3572e4-9295-46cb-b171-11a0da54e0d5/bin-2019/utaipan/data/adadf842f/689ca8c5d32c4b29a954199fb2f1931f/FLAG6b9c1ef3e [2018-12-09 02:49:46,779 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_eb3572e4-9295-46cb-b171-11a0da54e0d5/bin-2019/utaipan/data/adadf842f/689ca8c5d32c4b29a954199fb2f1931f [2018-12-09 02:49:46,781 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 02:49:46,782 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 02:49:46,783 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 02:49:46,783 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 02:49:46,785 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 02:49:46,786 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 02:49:46" (1/1) ... [2018-12-09 02:49:46,788 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73973e64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:49:46, skipping insertion in model container [2018-12-09 02:49:46,788 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 02:49:46" (1/1) ... [2018-12-09 02:49:46,794 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 02:49:46,806 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 02:49:46,894 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 02:49:46,896 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 02:49:46,904 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 02:49:46,912 INFO L195 MainTranslator]: Completed translation [2018-12-09 02:49:46,912 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:49:46 WrapperNode [2018-12-09 02:49:46,912 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 02:49:46,913 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 02:49:46,913 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 02:49:46,913 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 02:49:46,918 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:49:46" (1/1) ... [2018-12-09 02:49:46,920 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:49:46" (1/1) ... [2018-12-09 02:49:46,924 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 02:49:46,924 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 02:49:46,924 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 02:49:46,924 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 02:49:46,929 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:49:46" (1/1) ... [2018-12-09 02:49:46,929 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:49:46" (1/1) ... [2018-12-09 02:49:46,929 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:49:46" (1/1) ... [2018-12-09 02:49:46,929 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:49:46" (1/1) ... [2018-12-09 02:49:46,931 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:49:46" (1/1) ... [2018-12-09 02:49:46,932 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:49:46" (1/1) ... [2018-12-09 02:49:46,933 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:49:46" (1/1) ... [2018-12-09 02:49:46,933 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 02:49:46,934 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 02:49:46,934 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 02:49:46,934 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 02:49:46,934 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:49:46" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_eb3572e4-9295-46cb-b171-11a0da54e0d5/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 02:49:46,993 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 02:49:46,993 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 02:49:46,993 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 02:49:46,993 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 02:49:46,993 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2018-12-09 02:49:46,994 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2018-12-09 02:49:46,994 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 02:49:46,994 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 02:49:47,066 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 02:49:47,066 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-09 02:49:47,067 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 02:49:47 BoogieIcfgContainer [2018-12-09 02:49:47,067 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 02:49:47,067 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 02:49:47,067 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 02:49:47,069 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 02:49:47,069 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 02:49:46" (1/3) ... [2018-12-09 02:49:47,070 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4515e744 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 02:49:47, skipping insertion in model container [2018-12-09 02:49:47,070 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:49:46" (2/3) ... [2018-12-09 02:49:47,070 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4515e744 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 02:49:47, skipping insertion in model container [2018-12-09 02:49:47,070 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 02:49:47" (3/3) ... [2018-12-09 02:49:47,071 INFO L112 eAbstractionObserver]: Analyzing ICFG sum_25x0_false-unreach-call_true-termination.c [2018-12-09 02:49:47,077 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 02:49:47,080 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-09 02:49:47,089 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-09 02:49:47,106 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 02:49:47,106 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 02:49:47,106 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 02:49:47,106 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 02:49:47,106 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 02:49:47,106 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 02:49:47,106 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 02:49:47,106 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 02:49:47,116 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2018-12-09 02:49:47,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-09 02:49:47,119 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:49:47,120 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 02:49:47,121 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:49:47,124 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:49:47,125 INFO L82 PathProgramCache]: Analyzing trace with hash 2001781660, now seen corresponding path program 1 times [2018-12-09 02:49:47,126 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:49:47,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:49:47,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:49:47,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:49:47,153 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:49:47,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:49:47,216 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 02:49:47,217 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:49:47,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 02:49:47,217 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:49:47,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 02:49:47,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 02:49:47,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 02:49:47,229 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 5 states. [2018-12-09 02:49:47,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:49:47,273 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2018-12-09 02:49:47,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 02:49:47,275 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-12-09 02:49:47,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:49:47,280 INFO L225 Difference]: With dead ends: 30 [2018-12-09 02:49:47,280 INFO L226 Difference]: Without dead ends: 18 [2018-12-09 02:49:47,282 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 02:49:47,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-12-09 02:49:47,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-12-09 02:49:47,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-09 02:49:47,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2018-12-09 02:49:47,305 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 13 [2018-12-09 02:49:47,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:49:47,306 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2018-12-09 02:49:47,306 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 02:49:47,306 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2018-12-09 02:49:47,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-09 02:49:47,307 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:49:47,307 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 02:49:47,307 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:49:47,307 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:49:47,308 INFO L82 PathProgramCache]: Analyzing trace with hash -118151420, now seen corresponding path program 1 times [2018-12-09 02:49:47,308 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:49:47,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:49:47,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:49:47,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:49:47,309 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:49:47,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:49:47,355 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 02:49:47,355 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 02:49:47,355 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 02:49:47,356 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 20 with the following transitions: [2018-12-09 02:49:47,357 INFO L205 CegarAbsIntRunner]: [0], [4], [7], [8], [10], [11], [12], [14], [17], [19], [25], [26], [27], [29], [30], [31], [32] [2018-12-09 02:49:47,378 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 02:49:47,378 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 02:49:47,477 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 02:49:47,478 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 02:49:47,484 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:49:47,485 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 02:49:47,485 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 02:49:47,485 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_eb3572e4-9295-46cb-b171-11a0da54e0d5/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 02:49:47,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:49:47,492 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 02:49:47,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:49:47,509 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 02:49:47,529 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 02:49:47,529 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 02:49:47,645 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 02:49:47,660 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 02:49:47,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 9 [2018-12-09 02:49:47,660 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 02:49:47,661 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 02:49:47,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 02:49:47,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-12-09 02:49:47,661 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 6 states. [2018-12-09 02:49:47,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:49:47,693 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2018-12-09 02:49:47,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 02:49:47,693 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-12-09 02:49:47,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:49:47,693 INFO L225 Difference]: With dead ends: 25 [2018-12-09 02:49:47,693 INFO L226 Difference]: Without dead ends: 21 [2018-12-09 02:49:47,694 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 02:49:47,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-12-09 02:49:47,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-12-09 02:49:47,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-09 02:49:47,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-12-09 02:49:47,697 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 19 [2018-12-09 02:49:47,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:49:47,697 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2018-12-09 02:49:47,697 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 02:49:47,697 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2018-12-09 02:49:47,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-09 02:49:47,698 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:49:47,698 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 02:49:47,698 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:49:47,698 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:49:47,698 INFO L82 PathProgramCache]: Analyzing trace with hash 764931548, now seen corresponding path program 2 times [2018-12-09 02:49:47,698 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:49:47,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:49:47,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:49:47,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:49:47,699 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:49:47,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:49:47,735 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 02:49:47,736 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 02:49:47,736 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 02:49:47,736 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 02:49:47,736 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 02:49:47,736 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 02:49:47,736 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_eb3572e4-9295-46cb-b171-11a0da54e0d5/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 02:49:47,742 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 02:49:47,742 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-09 02:49:47,751 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-09 02:49:47,751 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 02:49:47,752 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 02:49:47,758 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 02:49:47,758 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 02:49:47,923 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 02:49:47,938 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 02:49:47,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 9] total 11 [2018-12-09 02:49:47,938 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 02:49:47,938 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 02:49:47,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 02:49:47,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-12-09 02:49:47,939 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 7 states. [2018-12-09 02:49:47,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:49:47,979 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2018-12-09 02:49:47,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 02:49:47,980 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2018-12-09 02:49:47,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:49:47,980 INFO L225 Difference]: With dead ends: 28 [2018-12-09 02:49:47,981 INFO L226 Difference]: Without dead ends: 24 [2018-12-09 02:49:47,981 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 02:49:47,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-12-09 02:49:47,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-12-09 02:49:47,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-12-09 02:49:47,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2018-12-09 02:49:47,984 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 25 [2018-12-09 02:49:47,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:49:47,984 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2018-12-09 02:49:47,985 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 02:49:47,985 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2018-12-09 02:49:47,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-09 02:49:47,985 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:49:47,985 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 02:49:47,986 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:49:47,986 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:49:47,986 INFO L82 PathProgramCache]: Analyzing trace with hash 601942852, now seen corresponding path program 3 times [2018-12-09 02:49:47,986 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:49:47,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:49:47,987 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 02:49:47,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:49:47,987 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:49:47,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:49:48,051 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 02:49:48,052 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 02:49:48,052 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 02:49:48,052 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 02:49:48,052 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 02:49:48,052 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 02:49:48,052 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_eb3572e4-9295-46cb-b171-11a0da54e0d5/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 02:49:48,061 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-09 02:49:48,061 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-09 02:49:48,071 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-09 02:49:48,071 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 02:49:48,073 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 02:49:48,083 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 02:49:48,083 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 02:49:48,338 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 02:49:48,352 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 02:49:48,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 11] total 13 [2018-12-09 02:49:48,352 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 02:49:48,353 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 02:49:48,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 02:49:48,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2018-12-09 02:49:48,353 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 8 states. [2018-12-09 02:49:48,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:49:48,397 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2018-12-09 02:49:48,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 02:49:48,397 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2018-12-09 02:49:48,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:49:48,398 INFO L225 Difference]: With dead ends: 31 [2018-12-09 02:49:48,398 INFO L226 Difference]: Without dead ends: 27 [2018-12-09 02:49:48,398 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 02:49:48,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-09 02:49:48,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-12-09 02:49:48,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-09 02:49:48,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-12-09 02:49:48,401 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 31 [2018-12-09 02:49:48,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:49:48,402 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-12-09 02:49:48,402 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 02:49:48,402 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-12-09 02:49:48,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-09 02:49:48,402 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:49:48,402 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 02:49:48,402 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:49:48,403 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:49:48,403 INFO L82 PathProgramCache]: Analyzing trace with hash -183109604, now seen corresponding path program 4 times [2018-12-09 02:49:48,403 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:49:48,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:49:48,403 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 02:49:48,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:49:48,404 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:49:48,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:49:48,467 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 02:49:48,467 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 02:49:48,467 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 02:49:48,467 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 02:49:48,467 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 02:49:48,467 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 02:49:48,468 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_eb3572e4-9295-46cb-b171-11a0da54e0d5/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 02:49:48,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:49:48,477 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 02:49:48,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:49:48,489 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 02:49:48,495 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 02:49:48,495 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 02:49:48,879 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 02:49:48,893 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 02:49:48,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 13] total 15 [2018-12-09 02:49:48,893 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 02:49:48,893 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 02:49:48,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 02:49:48,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2018-12-09 02:49:48,894 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 9 states. [2018-12-09 02:49:48,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:49:48,946 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2018-12-09 02:49:48,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 02:49:48,946 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 37 [2018-12-09 02:49:48,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:49:48,946 INFO L225 Difference]: With dead ends: 34 [2018-12-09 02:49:48,946 INFO L226 Difference]: Without dead ends: 30 [2018-12-09 02:49:48,947 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 02:49:48,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-09 02:49:48,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-12-09 02:49:48,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-09 02:49:48,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2018-12-09 02:49:48,949 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 37 [2018-12-09 02:49:48,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:49:48,950 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2018-12-09 02:49:48,950 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 02:49:48,950 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2018-12-09 02:49:48,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-09 02:49:48,950 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:49:48,950 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 02:49:48,950 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:49:48,950 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:49:48,951 INFO L82 PathProgramCache]: Analyzing trace with hash -155447420, now seen corresponding path program 5 times [2018-12-09 02:49:48,951 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:49:48,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:49:48,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:49:48,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:49:48,951 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:49:48,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:49:49,012 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 02:49:49,012 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 02:49:49,012 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 02:49:49,013 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 02:49:49,013 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 02:49:49,013 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 02:49:49,013 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_eb3572e4-9295-46cb-b171-11a0da54e0d5/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 02:49:49,019 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 02:49:49,019 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-09 02:49:49,030 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-12-09 02:49:49,030 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 02:49:49,031 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 02:49:49,038 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 02:49:49,038 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 02:49:49,602 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 02:49:49,616 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 02:49:49,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 15] total 17 [2018-12-09 02:49:49,616 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 02:49:49,617 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 02:49:49,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 02:49:49,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2018-12-09 02:49:49,617 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 10 states. [2018-12-09 02:49:49,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:49:49,676 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2018-12-09 02:49:49,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 02:49:49,677 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 43 [2018-12-09 02:49:49,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:49:49,677 INFO L225 Difference]: With dead ends: 37 [2018-12-09 02:49:49,677 INFO L226 Difference]: Without dead ends: 33 [2018-12-09 02:49:49,678 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 02:49:49,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-09 02:49:49,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-12-09 02:49:49,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-09 02:49:49,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2018-12-09 02:49:49,683 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 43 [2018-12-09 02:49:49,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:49:49,683 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2018-12-09 02:49:49,683 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 02:49:49,683 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2018-12-09 02:49:49,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-09 02:49:49,684 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:49:49,684 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 02:49:49,684 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:49:49,684 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:49:49,685 INFO L82 PathProgramCache]: Analyzing trace with hash 1716183644, now seen corresponding path program 6 times [2018-12-09 02:49:49,685 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:49:49,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:49:49,685 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 02:49:49,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:49:49,686 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:49:49,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:49:49,749 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 02:49:49,749 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 02:49:49,749 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 02:49:49,749 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 02:49:49,749 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 02:49:49,749 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 02:49:49,749 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_eb3572e4-9295-46cb-b171-11a0da54e0d5/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 02:49:49,755 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-09 02:49:49,755 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-09 02:49:49,765 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-09 02:49:49,766 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 02:49:49,767 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 02:49:49,775 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 02:49:49,775 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 02:49:50,601 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 02:49:50,616 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 02:49:50,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 17] total 19 [2018-12-09 02:49:50,616 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 02:49:50,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-09 02:49:50,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-09 02:49:50,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2018-12-09 02:49:50,617 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 11 states. [2018-12-09 02:49:50,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:49:50,689 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2018-12-09 02:49:50,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 02:49:50,690 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 49 [2018-12-09 02:49:50,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:49:50,690 INFO L225 Difference]: With dead ends: 40 [2018-12-09 02:49:50,690 INFO L226 Difference]: Without dead ends: 36 [2018-12-09 02:49:50,691 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 02:49:50,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-09 02:49:50,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-12-09 02:49:50,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-09 02:49:50,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2018-12-09 02:49:50,694 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 49 [2018-12-09 02:49:50,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:49:50,694 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2018-12-09 02:49:50,694 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-09 02:49:50,694 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2018-12-09 02:49:50,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-09 02:49:50,695 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:49:50,695 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 02:49:50,695 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:49:50,695 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:49:50,695 INFO L82 PathProgramCache]: Analyzing trace with hash -1079602236, now seen corresponding path program 7 times [2018-12-09 02:49:50,695 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:49:50,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:49:50,696 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 02:49:50,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:49:50,696 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:49:50,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:49:50,764 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 02:49:50,764 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 02:49:50,764 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 02:49:50,764 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 02:49:50,765 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 02:49:50,765 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 02:49:50,765 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_eb3572e4-9295-46cb-b171-11a0da54e0d5/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 02:49:50,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:49:50,770 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 02:49:50,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:49:50,784 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 02:49:50,792 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 02:49:50,792 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 02:49:51,859 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 02:49:51,874 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 02:49:51,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 19] total 21 [2018-12-09 02:49:51,874 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 02:49:51,874 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-09 02:49:51,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-09 02:49:51,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2018-12-09 02:49:51,875 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand 12 states. [2018-12-09 02:49:51,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:49:51,952 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2018-12-09 02:49:51,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 02:49:51,953 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 55 [2018-12-09 02:49:51,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:49:51,953 INFO L225 Difference]: With dead ends: 43 [2018-12-09 02:49:51,953 INFO L226 Difference]: Without dead ends: 39 [2018-12-09 02:49:51,954 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 02:49:51,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-12-09 02:49:51,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-12-09 02:49:51,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-09 02:49:51,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2018-12-09 02:49:51,957 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 55 [2018-12-09 02:49:51,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:49:51,957 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2018-12-09 02:49:51,957 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-09 02:49:51,957 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2018-12-09 02:49:51,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-09 02:49:51,958 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:49:51,958 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 02:49:51,958 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:49:51,959 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:49:51,959 INFO L82 PathProgramCache]: Analyzing trace with hash 1035381916, now seen corresponding path program 8 times [2018-12-09 02:49:51,959 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:49:51,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:49:51,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:49:51,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:49:51,960 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:49:51,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:49:52,035 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 02:49:52,035 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 02:49:52,035 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 02:49:52,035 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 02:49:52,035 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 02:49:52,035 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 02:49:52,035 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_eb3572e4-9295-46cb-b171-11a0da54e0d5/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 02:49:52,041 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 02:49:52,041 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-09 02:49:52,057 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-12-09 02:49:52,057 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 02:49:52,058 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 02:49:52,068 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 02:49:52,069 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 02:49:53,511 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 02:49:53,525 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 02:49:53,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 21] total 23 [2018-12-09 02:49:53,525 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 02:49:53,526 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-09 02:49:53,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-09 02:49:53,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2018-12-09 02:49:53,526 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 13 states. [2018-12-09 02:49:53,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:49:53,600 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2018-12-09 02:49:53,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-09 02:49:53,601 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 61 [2018-12-09 02:49:53,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:49:53,601 INFO L225 Difference]: With dead ends: 46 [2018-12-09 02:49:53,601 INFO L226 Difference]: Without dead ends: 42 [2018-12-09 02:49:53,602 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 02:49:53,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-12-09 02:49:53,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-12-09 02:49:53,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-09 02:49:53,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2018-12-09 02:49:53,604 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 61 [2018-12-09 02:49:53,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:49:53,605 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2018-12-09 02:49:53,605 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-09 02:49:53,605 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2018-12-09 02:49:53,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-09 02:49:53,605 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:49:53,605 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 02:49:53,605 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:49:53,605 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:49:53,606 INFO L82 PathProgramCache]: Analyzing trace with hash 952137732, now seen corresponding path program 9 times [2018-12-09 02:49:53,606 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:49:53,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:49:53,606 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 02:49:53,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:49:53,606 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:49:53,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:49:53,689 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 02:49:53,690 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 02:49:53,690 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 02:49:53,690 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 02:49:53,690 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 02:49:53,690 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 02:49:53,690 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_eb3572e4-9295-46cb-b171-11a0da54e0d5/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 02:49:53,695 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-09 02:49:53,696 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-09 02:49:53,709 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-09 02:49:53,709 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 02:49:53,711 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 02:49:53,719 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 02:49:53,719 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 02:49:55,639 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 02:49:55,653 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 02:49:55,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 23] total 25 [2018-12-09 02:49:55,654 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 02:49:55,654 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-09 02:49:55,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-09 02:49:55,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=442, Unknown=0, NotChecked=0, Total=600 [2018-12-09 02:49:55,654 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 14 states. [2018-12-09 02:49:55,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:49:55,735 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2018-12-09 02:49:55,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 02:49:55,735 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 67 [2018-12-09 02:49:55,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:49:55,735 INFO L225 Difference]: With dead ends: 49 [2018-12-09 02:49:55,736 INFO L226 Difference]: Without dead ends: 45 [2018-12-09 02:49:55,736 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 113 SyntacticMatches, 20 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=388, Invalid=802, Unknown=0, NotChecked=0, Total=1190 [2018-12-09 02:49:55,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-12-09 02:49:55,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-12-09 02:49:55,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-09 02:49:55,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2018-12-09 02:49:55,739 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 67 [2018-12-09 02:49:55,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:49:55,739 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2018-12-09 02:49:55,739 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-09 02:49:55,739 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2018-12-09 02:49:55,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-09 02:49:55,740 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:49:55,740 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 02:49:55,740 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:49:55,740 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:49:55,740 INFO L82 PathProgramCache]: Analyzing trace with hash 1540970204, now seen corresponding path program 10 times [2018-12-09 02:49:55,740 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:49:55,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:49:55,741 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 02:49:55,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:49:55,741 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:49:55,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:49:55,841 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2018-12-09 02:49:55,841 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 02:49:55,841 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 02:49:55,841 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 02:49:55,841 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 02:49:55,841 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 02:49:55,841 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_eb3572e4-9295-46cb-b171-11a0da54e0d5/bin-2019/utaipan/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 02:49:55,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:49:55,848 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 02:49:55,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:49:55,863 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 02:49:55,871 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2018-12-09 02:49:55,871 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 02:49:58,349 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 255 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-12-09 02:49:58,363 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 02:49:58,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 25] total 27 [2018-12-09 02:49:58,364 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 02:49:58,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-09 02:49:58,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-09 02:49:58,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=518, Unknown=0, NotChecked=0, Total=702 [2018-12-09 02:49:58,364 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 15 states. [2018-12-09 02:49:58,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:49:58,467 INFO L93 Difference]: Finished difference Result 52 states and 53 transitions. [2018-12-09 02:49:58,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-09 02:49:58,467 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 73 [2018-12-09 02:49:58,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:49:58,468 INFO L225 Difference]: With dead ends: 52 [2018-12-09 02:49:58,468 INFO L226 Difference]: Without dead ends: 48 [2018-12-09 02:49:58,468 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 123 SyntacticMatches, 22 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 352 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=459, Invalid=947, Unknown=0, NotChecked=0, Total=1406 [2018-12-09 02:49:58,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-12-09 02:49:58,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-12-09 02:49:58,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-12-09 02:49:58,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2018-12-09 02:49:58,471 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 73 [2018-12-09 02:49:58,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:49:58,472 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2018-12-09 02:49:58,472 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-09 02:49:58,472 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2018-12-09 02:49:58,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-09 02:49:58,473 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:49:58,473 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 02:49:58,473 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:49:58,473 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:49:58,473 INFO L82 PathProgramCache]: Analyzing trace with hash -2010530748, now seen corresponding path program 11 times [2018-12-09 02:49:58,473 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:49:58,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:49:58,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:49:58,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:49:58,474 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:49:58,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:49:58,548 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2018-12-09 02:49:58,548 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 02:49:58,548 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 02:49:58,548 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 02:49:58,548 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 02:49:58,548 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 02:49:58,548 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_eb3572e4-9295-46cb-b171-11a0da54e0d5/bin-2019/utaipan/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 02:49:58,554 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 02:49:58,554 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-09 02:49:58,572 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-12-09 02:49:58,573 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 02:49:58,574 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 02:49:58,582 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2018-12-09 02:49:58,583 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 02:50:02,032 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 308 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-12-09 02:50:02,047 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 02:50:02,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 27] total 29 [2018-12-09 02:50:02,047 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 02:50:02,047 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-09 02:50:02,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-09 02:50:02,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=600, Unknown=0, NotChecked=0, Total=812 [2018-12-09 02:50:02,048 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand 16 states. [2018-12-09 02:50:02,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:50:02,165 INFO L93 Difference]: Finished difference Result 55 states and 56 transitions. [2018-12-09 02:50:02,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-09 02:50:02,165 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 79 [2018-12-09 02:50:02,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:50:02,166 INFO L225 Difference]: With dead ends: 55 [2018-12-09 02:50:02,166 INFO L226 Difference]: Without dead ends: 51 [2018-12-09 02:50:02,166 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 133 SyntacticMatches, 24 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 420 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=536, Invalid=1104, Unknown=0, NotChecked=0, Total=1640 [2018-12-09 02:50:02,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-12-09 02:50:02,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-12-09 02:50:02,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-12-09 02:50:02,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2018-12-09 02:50:02,170 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 79 [2018-12-09 02:50:02,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:50:02,171 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2018-12-09 02:50:02,171 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-09 02:50:02,171 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2018-12-09 02:50:02,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-09 02:50:02,171 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:50:02,171 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 02:50:02,172 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:50:02,172 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:50:02,172 INFO L82 PathProgramCache]: Analyzing trace with hash -986521316, now seen corresponding path program 12 times [2018-12-09 02:50:02,172 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:50:02,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:50:02,173 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 02:50:02,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:50:02,173 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:50:02,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:50:02,282 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2018-12-09 02:50:02,282 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 02:50:02,282 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 02:50:02,282 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 02:50:02,282 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 02:50:02,282 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 02:50:02,282 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_eb3572e4-9295-46cb-b171-11a0da54e0d5/bin-2019/utaipan/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 02:50:02,288 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-09 02:50:02,288 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-09 02:50:02,303 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-09 02:50:02,303 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 02:50:02,305 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 02:50:02,318 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2018-12-09 02:50:02,319 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 02:50:06,388 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 366 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-12-09 02:50:06,402 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 02:50:06,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 29] total 31 [2018-12-09 02:50:06,403 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 02:50:06,403 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-09 02:50:06,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-09 02:50:06,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=688, Unknown=0, NotChecked=0, Total=930 [2018-12-09 02:50:06,403 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 17 states. [2018-12-09 02:50:06,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:50:06,527 INFO L93 Difference]: Finished difference Result 58 states and 59 transitions. [2018-12-09 02:50:06,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-09 02:50:06,527 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 85 [2018-12-09 02:50:06,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:50:06,528 INFO L225 Difference]: With dead ends: 58 [2018-12-09 02:50:06,528 INFO L226 Difference]: Without dead ends: 54 [2018-12-09 02:50:06,529 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 143 SyntacticMatches, 26 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 494 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=619, Invalid=1273, Unknown=0, NotChecked=0, Total=1892 [2018-12-09 02:50:06,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-12-09 02:50:06,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-12-09 02:50:06,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-12-09 02:50:06,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2018-12-09 02:50:06,532 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 85 [2018-12-09 02:50:06,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:50:06,532 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2018-12-09 02:50:06,532 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-09 02:50:06,532 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2018-12-09 02:50:06,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-09 02:50:06,533 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:50:06,533 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 02:50:06,533 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:50:06,533 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:50:06,533 INFO L82 PathProgramCache]: Analyzing trace with hash 1073897604, now seen corresponding path program 13 times [2018-12-09 02:50:06,534 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:50:06,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:50:06,534 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 02:50:06,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:50:06,534 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:50:06,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:50:06,626 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2018-12-09 02:50:06,626 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 02:50:06,626 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 02:50:06,626 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 02:50:06,626 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 02:50:06,627 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 02:50:06,627 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_eb3572e4-9295-46cb-b171-11a0da54e0d5/bin-2019/utaipan/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 02:50:06,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:50:06,635 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 02:50:06,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:50:06,653 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 02:50:06,664 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2018-12-09 02:50:06,664 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 02:50:11,858 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 429 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-12-09 02:50:11,872 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 02:50:11,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 31] total 33 [2018-12-09 02:50:11,872 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 02:50:11,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-09 02:50:11,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-09 02:50:11,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=274, Invalid=782, Unknown=0, NotChecked=0, Total=1056 [2018-12-09 02:50:11,873 INFO L87 Difference]: Start difference. First operand 54 states and 55 transitions. Second operand 18 states. [2018-12-09 02:50:12,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:50:12,007 INFO L93 Difference]: Finished difference Result 61 states and 62 transitions. [2018-12-09 02:50:12,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-09 02:50:12,007 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 91 [2018-12-09 02:50:12,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:50:12,007 INFO L225 Difference]: With dead ends: 61 [2018-12-09 02:50:12,008 INFO L226 Difference]: Without dead ends: 57 [2018-12-09 02:50:12,008 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 153 SyntacticMatches, 28 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 574 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=708, Invalid=1454, Unknown=0, NotChecked=0, Total=2162 [2018-12-09 02:50:12,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-12-09 02:50:12,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-12-09 02:50:12,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-12-09 02:50:12,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2018-12-09 02:50:12,011 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 91 [2018-12-09 02:50:12,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:50:12,011 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2018-12-09 02:50:12,011 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-09 02:50:12,011 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2018-12-09 02:50:12,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-09 02:50:12,012 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:50:12,012 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 02:50:12,012 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:50:12,012 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:50:12,012 INFO L82 PathProgramCache]: Analyzing trace with hash -1572648100, now seen corresponding path program 14 times [2018-12-09 02:50:12,012 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:50:12,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:50:12,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:50:12,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:50:12,012 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:50:12,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:50:12,132 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2018-12-09 02:50:12,132 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 02:50:12,133 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 02:50:12,133 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 02:50:12,133 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 02:50:12,133 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 02:50:12,133 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_eb3572e4-9295-46cb-b171-11a0da54e0d5/bin-2019/utaipan/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 02:50:12,138 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 02:50:12,139 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-09 02:50:12,162 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-12-09 02:50:12,162 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 02:50:12,164 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 02:50:12,174 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2018-12-09 02:50:12,174 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 02:50:18,719 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 497 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-12-09 02:50:18,733 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 02:50:18,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 33] total 35 [2018-12-09 02:50:18,733 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 02:50:18,734 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-09 02:50:18,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-09 02:50:18,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=308, Invalid=882, Unknown=0, NotChecked=0, Total=1190 [2018-12-09 02:50:18,734 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 19 states. [2018-12-09 02:50:18,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:50:18,881 INFO L93 Difference]: Finished difference Result 64 states and 65 transitions. [2018-12-09 02:50:18,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-09 02:50:18,882 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 97 [2018-12-09 02:50:18,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:50:18,882 INFO L225 Difference]: With dead ends: 64 [2018-12-09 02:50:18,882 INFO L226 Difference]: Without dead ends: 60 [2018-12-09 02:50:18,883 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 163 SyntacticMatches, 30 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 660 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=803, Invalid=1647, Unknown=0, NotChecked=0, Total=2450 [2018-12-09 02:50:18,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-12-09 02:50:18,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-12-09 02:50:18,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-12-09 02:50:18,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2018-12-09 02:50:18,886 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 97 [2018-12-09 02:50:18,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:50:18,886 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2018-12-09 02:50:18,886 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-09 02:50:18,886 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2018-12-09 02:50:18,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-09 02:50:18,887 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:50:18,887 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 02:50:18,887 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:50:18,888 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:50:18,888 INFO L82 PathProgramCache]: Analyzing trace with hash 1584030916, now seen corresponding path program 15 times [2018-12-09 02:50:18,888 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:50:18,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:50:18,888 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 02:50:18,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:50:18,888 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:50:18,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:50:18,995 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2018-12-09 02:50:18,995 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 02:50:18,995 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 02:50:18,995 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 02:50:18,995 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 02:50:18,995 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 02:50:18,995 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_eb3572e4-9295-46cb-b171-11a0da54e0d5/bin-2019/utaipan/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 02:50:19,001 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-09 02:50:19,001 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-09 02:50:19,019 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-09 02:50:19,019 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 02:50:19,021 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 02:50:19,031 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2018-12-09 02:50:19,031 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 02:50:27,542 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 570 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-12-09 02:50:27,559 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 02:50:27,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 35] total 37 [2018-12-09 02:50:27,560 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 02:50:27,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-09 02:50:27,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-09 02:50:27,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=344, Invalid=988, Unknown=0, NotChecked=0, Total=1332 [2018-12-09 02:50:27,561 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand 20 states. [2018-12-09 02:50:27,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:50:27,732 INFO L93 Difference]: Finished difference Result 67 states and 68 transitions. [2018-12-09 02:50:27,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-09 02:50:27,732 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 103 [2018-12-09 02:50:27,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:50:27,733 INFO L225 Difference]: With dead ends: 67 [2018-12-09 02:50:27,733 INFO L226 Difference]: Without dead ends: 63 [2018-12-09 02:50:27,733 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 173 SyntacticMatches, 32 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 752 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=904, Invalid=1852, Unknown=0, NotChecked=0, Total=2756 [2018-12-09 02:50:27,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-12-09 02:50:27,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-12-09 02:50:27,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-12-09 02:50:27,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2018-12-09 02:50:27,736 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 103 [2018-12-09 02:50:27,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:50:27,736 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2018-12-09 02:50:27,736 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-09 02:50:27,736 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2018-12-09 02:50:27,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-12-09 02:50:27,737 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:50:27,737 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 02:50:27,737 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:50:27,737 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:50:27,737 INFO L82 PathProgramCache]: Analyzing trace with hash 1066046876, now seen corresponding path program 16 times [2018-12-09 02:50:27,737 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:50:27,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:50:27,738 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 02:50:27,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:50:27,738 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:50:27,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:50:27,858 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2018-12-09 02:50:27,858 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 02:50:27,858 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 02:50:27,858 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 02:50:27,858 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 02:50:27,858 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 02:50:27,858 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_eb3572e4-9295-46cb-b171-11a0da54e0d5/bin-2019/utaipan/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 02:50:27,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:50:27,864 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 02:50:27,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:50:27,885 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 02:50:27,902 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2018-12-09 02:50:27,903 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 02:50:37,651 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 648 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-12-09 02:50:37,672 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 02:50:37,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 37] total 39 [2018-12-09 02:50:37,672 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 02:50:37,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-09 02:50:37,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-09 02:50:37,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=382, Invalid=1100, Unknown=0, NotChecked=0, Total=1482 [2018-12-09 02:50:37,673 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 21 states. [2018-12-09 02:50:37,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:50:37,834 INFO L93 Difference]: Finished difference Result 70 states and 71 transitions. [2018-12-09 02:50:37,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-09 02:50:37,834 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 109 [2018-12-09 02:50:37,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:50:37,834 INFO L225 Difference]: With dead ends: 70 [2018-12-09 02:50:37,834 INFO L226 Difference]: Without dead ends: 66 [2018-12-09 02:50:37,835 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 183 SyntacticMatches, 34 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 850 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1011, Invalid=2069, Unknown=0, NotChecked=0, Total=3080 [2018-12-09 02:50:37,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-12-09 02:50:37,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-12-09 02:50:37,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-12-09 02:50:37,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 67 transitions. [2018-12-09 02:50:37,837 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 67 transitions. Word has length 109 [2018-12-09 02:50:37,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:50:37,838 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 67 transitions. [2018-12-09 02:50:37,838 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-09 02:50:37,838 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 67 transitions. [2018-12-09 02:50:37,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-09 02:50:37,838 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:50:37,838 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 02:50:37,838 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:50:37,838 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:50:37,838 INFO L82 PathProgramCache]: Analyzing trace with hash 1300351236, now seen corresponding path program 17 times [2018-12-09 02:50:37,838 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:50:37,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:50:37,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:50:37,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:50:37,839 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:50:37,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:50:37,971 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2018-12-09 02:50:37,971 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 02:50:37,972 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 02:50:37,972 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 02:50:37,972 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 02:50:37,972 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 02:50:37,972 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_eb3572e4-9295-46cb-b171-11a0da54e0d5/bin-2019/utaipan/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 02:50:37,978 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 02:50:37,978 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-09 02:50:38,006 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2018-12-09 02:50:38,006 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 02:50:38,008 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 02:50:38,021 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2018-12-09 02:50:38,021 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 02:50:51,853 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 731 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2018-12-09 02:50:51,868 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 02:50:51,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 39] total 41 [2018-12-09 02:50:51,868 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 02:50:51,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-09 02:50:51,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-09 02:50:51,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=422, Invalid=1218, Unknown=0, NotChecked=0, Total=1640 [2018-12-09 02:50:51,869 INFO L87 Difference]: Start difference. First operand 66 states and 67 transitions. Second operand 22 states. [2018-12-09 02:50:52,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:50:52,023 INFO L93 Difference]: Finished difference Result 73 states and 74 transitions. [2018-12-09 02:50:52,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-09 02:50:52,023 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 115 [2018-12-09 02:50:52,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:50:52,023 INFO L225 Difference]: With dead ends: 73 [2018-12-09 02:50:52,023 INFO L226 Difference]: Without dead ends: 69 [2018-12-09 02:50:52,024 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 193 SyntacticMatches, 36 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 954 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1124, Invalid=2298, Unknown=0, NotChecked=0, Total=3422 [2018-12-09 02:50:52,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-12-09 02:50:52,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-12-09 02:50:52,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-12-09 02:50:52,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2018-12-09 02:50:52,026 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 115 [2018-12-09 02:50:52,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:50:52,026 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2018-12-09 02:50:52,026 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-09 02:50:52,026 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2018-12-09 02:50:52,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-12-09 02:50:52,027 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:50:52,027 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 02:50:52,027 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:50:52,027 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:50:52,027 INFO L82 PathProgramCache]: Analyzing trace with hash 227065820, now seen corresponding path program 18 times [2018-12-09 02:50:52,027 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:50:52,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:50:52,028 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 02:50:52,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:50:52,028 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:50:52,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:50:52,172 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2018-12-09 02:50:52,172 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 02:50:52,172 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 02:50:52,172 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 02:50:52,172 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 02:50:52,172 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 02:50:52,172 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_eb3572e4-9295-46cb-b171-11a0da54e0d5/bin-2019/utaipan/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 02:50:52,178 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-09 02:50:52,178 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-09 02:50:52,199 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-09 02:50:52,199 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 02:50:52,201 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 02:50:52,213 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2018-12-09 02:50:52,213 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 02:50:56,039 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2018-12-09 02:50:56,161 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2018-12-09 02:50:56,285 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2018-12-09 02:50:56,410 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2018-12-09 02:50:56,534 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2018-12-09 02:50:59,061 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2018-12-09 02:50:59,170 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2018-12-09 02:50:59,278 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2018-12-09 02:50:59,384 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2018-12-09 02:50:59,501 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2018-12-09 02:50:59,611 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2018-12-09 02:51:08,627 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 819 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2018-12-09 02:51:08,641 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 02:51:08,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 41] total 43 [2018-12-09 02:51:08,642 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 02:51:08,642 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-09 02:51:08,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-09 02:51:08,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=464, Invalid=1342, Unknown=0, NotChecked=0, Total=1806 [2018-12-09 02:51:08,642 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand 23 states. [2018-12-09 02:51:08,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:51:08,837 INFO L93 Difference]: Finished difference Result 76 states and 77 transitions. [2018-12-09 02:51:08,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-09 02:51:08,837 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 121 [2018-12-09 02:51:08,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:51:08,838 INFO L225 Difference]: With dead ends: 76 [2018-12-09 02:51:08,838 INFO L226 Difference]: Without dead ends: 72 [2018-12-09 02:51:08,838 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 203 SyntacticMatches, 38 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1064 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1243, Invalid=2539, Unknown=0, NotChecked=0, Total=3782 [2018-12-09 02:51:08,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-12-09 02:51:08,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-12-09 02:51:08,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-12-09 02:51:08,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2018-12-09 02:51:08,841 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 73 transitions. Word has length 121 [2018-12-09 02:51:08,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:51:08,841 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 73 transitions. [2018-12-09 02:51:08,841 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-09 02:51:08,841 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 73 transitions. [2018-12-09 02:51:08,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-09 02:51:08,841 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:51:08,842 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 02:51:08,842 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:51:08,842 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:51:08,842 INFO L82 PathProgramCache]: Analyzing trace with hash -479687356, now seen corresponding path program 19 times [2018-12-09 02:51:08,842 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:51:08,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:51:08,842 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 02:51:08,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:51:08,842 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:51:08,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:51:08,996 INFO L134 CoverageAnalysis]: Checked inductivity of 1102 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2018-12-09 02:51:08,997 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 02:51:08,997 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 02:51:08,997 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 02:51:08,997 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 02:51:08,997 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 02:51:08,997 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_eb3572e4-9295-46cb-b171-11a0da54e0d5/bin-2019/utaipan/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 02:51:09,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:51:09,003 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 02:51:09,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:51:09,024 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 02:51:09,038 INFO L134 CoverageAnalysis]: Checked inductivity of 1102 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2018-12-09 02:51:09,038 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 02:51:10,975 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2018-12-09 02:51:28,011 INFO L134 CoverageAnalysis]: Checked inductivity of 1102 backedges. 0 proven. 912 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2018-12-09 02:51:28,025 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 02:51:28,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 43] total 45 [2018-12-09 02:51:28,026 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 02:51:28,026 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-09 02:51:28,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-09 02:51:28,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=508, Invalid=1472, Unknown=0, NotChecked=0, Total=1980 [2018-12-09 02:51:28,026 INFO L87 Difference]: Start difference. First operand 72 states and 73 transitions. Second operand 24 states. [2018-12-09 02:51:28,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:51:28,218 INFO L93 Difference]: Finished difference Result 79 states and 80 transitions. [2018-12-09 02:51:28,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-09 02:51:28,218 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 127 [2018-12-09 02:51:28,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:51:28,219 INFO L225 Difference]: With dead ends: 79 [2018-12-09 02:51:28,219 INFO L226 Difference]: Without dead ends: 75 [2018-12-09 02:51:28,219 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 213 SyntacticMatches, 40 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1180 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1368, Invalid=2792, Unknown=0, NotChecked=0, Total=4160 [2018-12-09 02:51:28,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-12-09 02:51:28,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-12-09 02:51:28,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-12-09 02:51:28,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2018-12-09 02:51:28,221 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 127 [2018-12-09 02:51:28,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:51:28,222 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2018-12-09 02:51:28,222 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-09 02:51:28,222 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2018-12-09 02:51:28,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-12-09 02:51:28,222 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:51:28,222 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 02:51:28,222 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:51:28,222 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:51:28,222 INFO L82 PathProgramCache]: Analyzing trace with hash -1598174692, now seen corresponding path program 20 times [2018-12-09 02:51:28,223 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:51:28,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:51:28,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:51:28,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:51:28,223 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:51:28,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:51:28,381 INFO L134 CoverageAnalysis]: Checked inductivity of 1220 backedges. 0 proven. 610 refuted. 0 times theorem prover too weak. 610 trivial. 0 not checked. [2018-12-09 02:51:28,382 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 02:51:28,382 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 02:51:28,382 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 02:51:28,382 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 02:51:28,382 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 02:51:28,382 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_eb3572e4-9295-46cb-b171-11a0da54e0d5/bin-2019/utaipan/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 02:51:28,388 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 02:51:28,388 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-09 02:51:28,422 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2018-12-09 02:51:28,422 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 02:51:28,424 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 02:51:28,439 INFO L134 CoverageAnalysis]: Checked inductivity of 1220 backedges. 0 proven. 610 refuted. 0 times theorem prover too weak. 610 trivial. 0 not checked. [2018-12-09 02:51:28,439 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 02:51:48,584 INFO L134 CoverageAnalysis]: Checked inductivity of 1220 backedges. 0 proven. 1010 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-12-09 02:51:48,599 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 02:51:48,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 45] total 47 [2018-12-09 02:51:48,599 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 02:51:48,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-12-09 02:51:48,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-12-09 02:51:48,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=554, Invalid=1608, Unknown=0, NotChecked=0, Total=2162 [2018-12-09 02:51:48,600 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand 25 states. [2018-12-09 02:51:48,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:51:48,825 INFO L93 Difference]: Finished difference Result 82 states and 83 transitions. [2018-12-09 02:51:48,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-09 02:51:48,825 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 133 [2018-12-09 02:51:48,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:51:48,826 INFO L225 Difference]: With dead ends: 82 [2018-12-09 02:51:48,826 INFO L226 Difference]: Without dead ends: 78 [2018-12-09 02:51:48,826 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 223 SyntacticMatches, 42 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1302 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1499, Invalid=3057, Unknown=0, NotChecked=0, Total=4556 [2018-12-09 02:51:48,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-12-09 02:51:48,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-12-09 02:51:48,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-12-09 02:51:48,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 79 transitions. [2018-12-09 02:51:48,829 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 79 transitions. Word has length 133 [2018-12-09 02:51:48,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:51:48,829 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 79 transitions. [2018-12-09 02:51:48,829 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-12-09 02:51:48,830 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 79 transitions. [2018-12-09 02:51:48,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-12-09 02:51:48,830 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:51:48,830 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 02:51:48,831 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:51:48,831 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:51:48,831 INFO L82 PathProgramCache]: Analyzing trace with hash 1648275844, now seen corresponding path program 21 times [2018-12-09 02:51:48,831 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:51:48,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:51:48,831 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 02:51:48,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:51:48,832 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:51:48,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:51:49,015 INFO L134 CoverageAnalysis]: Checked inductivity of 1344 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 672 trivial. 0 not checked. [2018-12-09 02:51:49,015 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 02:51:49,015 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 02:51:49,015 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 02:51:49,015 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 02:51:49,016 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 02:51:49,016 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_eb3572e4-9295-46cb-b171-11a0da54e0d5/bin-2019/utaipan/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 02:51:49,026 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-09 02:51:49,026 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-09 02:51:49,049 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-09 02:51:49,050 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 02:51:49,052 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 02:51:49,067 INFO L134 CoverageAnalysis]: Checked inductivity of 1344 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 672 trivial. 0 not checked. [2018-12-09 02:51:49,067 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 02:51:58,608 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2018-12-09 02:51:58,747 WARN L180 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2018-12-09 02:51:58,894 WARN L180 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2018-12-09 02:51:59,034 WARN L180 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2018-12-09 02:52:08,152 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2018-12-09 02:52:08,258 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2018-12-09 02:52:15,279 INFO L134 CoverageAnalysis]: Checked inductivity of 1344 backedges. 0 proven. 1113 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2018-12-09 02:52:15,295 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 02:52:15,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 47] total 49 [2018-12-09 02:52:15,295 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 02:52:15,296 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-09 02:52:15,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-09 02:52:15,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=602, Invalid=1750, Unknown=0, NotChecked=0, Total=2352 [2018-12-09 02:52:15,297 INFO L87 Difference]: Start difference. First operand 78 states and 79 transitions. Second operand 26 states. [2018-12-09 02:52:15,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:52:15,569 INFO L93 Difference]: Finished difference Result 85 states and 86 transitions. [2018-12-09 02:52:15,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-09 02:52:15,569 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 139 [2018-12-09 02:52:15,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:52:15,570 INFO L225 Difference]: With dead ends: 85 [2018-12-09 02:52:15,570 INFO L226 Difference]: Without dead ends: 81 [2018-12-09 02:52:15,571 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 346 GetRequests, 233 SyntacticMatches, 44 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1430 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1636, Invalid=3334, Unknown=0, NotChecked=0, Total=4970 [2018-12-09 02:52:15,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-12-09 02:52:15,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-12-09 02:52:15,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-12-09 02:52:15,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2018-12-09 02:52:15,574 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 139 [2018-12-09 02:52:15,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:52:15,575 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 82 transitions. [2018-12-09 02:52:15,575 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-09 02:52:15,575 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2018-12-09 02:52:15,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-12-09 02:52:15,576 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:52:15,576 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 02:52:15,576 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:52:15,576 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:52:15,576 INFO L82 PathProgramCache]: Analyzing trace with hash -1314278308, now seen corresponding path program 22 times [2018-12-09 02:52:15,576 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:52:15,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:52:15,577 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 02:52:15,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:52:15,577 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:52:15,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:52:15,773 INFO L134 CoverageAnalysis]: Checked inductivity of 1474 backedges. 0 proven. 737 refuted. 0 times theorem prover too weak. 737 trivial. 0 not checked. [2018-12-09 02:52:15,773 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 02:52:15,773 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 02:52:15,773 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 02:52:15,773 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 02:52:15,773 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 02:52:15,773 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_eb3572e4-9295-46cb-b171-11a0da54e0d5/bin-2019/utaipan/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 02:52:15,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:52:15,779 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 02:52:15,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:52:15,808 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 02:52:15,835 INFO L134 CoverageAnalysis]: Checked inductivity of 1474 backedges. 0 proven. 737 refuted. 0 times theorem prover too weak. 737 trivial. 0 not checked. [2018-12-09 02:52:15,835 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 02:52:18,585 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2018-12-09 02:52:18,706 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2018-12-09 02:52:18,821 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2018-12-09 02:52:18,961 WARN L180 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2018-12-09 02:52:19,100 WARN L180 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2018-12-09 02:52:19,259 WARN L180 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 117 [2018-12-09 02:52:19,439 WARN L180 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 117 [2018-12-09 02:52:19,623 WARN L180 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2018-12-09 02:52:19,804 WARN L180 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2018-12-09 02:52:28,280 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2018-12-09 02:52:28,386 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2018-12-09 02:52:28,497 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2018-12-09 02:52:28,608 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2018-12-09 02:52:28,727 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2018-12-09 02:52:28,840 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2018-12-09 02:52:28,961 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2018-12-09 02:52:29,088 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2018-12-09 02:52:46,430 INFO L134 CoverageAnalysis]: Checked inductivity of 1474 backedges. 0 proven. 1221 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2018-12-09 02:52:46,459 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 02:52:46,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 49] total 51 [2018-12-09 02:52:46,462 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 02:52:46,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-12-09 02:52:46,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-12-09 02:52:46,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=652, Invalid=1898, Unknown=0, NotChecked=0, Total=2550 [2018-12-09 02:52:46,463 INFO L87 Difference]: Start difference. First operand 81 states and 82 transitions. Second operand 27 states. [2018-12-09 02:52:46,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:52:46,737 INFO L93 Difference]: Finished difference Result 88 states and 89 transitions. [2018-12-09 02:52:46,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-09 02:52:46,737 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 145 [2018-12-09 02:52:46,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:52:46,738 INFO L225 Difference]: With dead ends: 88 [2018-12-09 02:52:46,738 INFO L226 Difference]: Without dead ends: 84 [2018-12-09 02:52:46,738 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 361 GetRequests, 243 SyntacticMatches, 46 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1564 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1779, Invalid=3623, Unknown=0, NotChecked=0, Total=5402 [2018-12-09 02:52:46,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-12-09 02:52:46,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-12-09 02:52:46,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-12-09 02:52:46,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 85 transitions. [2018-12-09 02:52:46,740 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 85 transitions. Word has length 145 [2018-12-09 02:52:46,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:52:46,740 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 85 transitions. [2018-12-09 02:52:46,741 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-12-09 02:52:46,741 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 85 transitions. [2018-12-09 02:52:46,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-12-09 02:52:46,741 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:52:46,741 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 02:52:46,741 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:52:46,741 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:52:46,741 INFO L82 PathProgramCache]: Analyzing trace with hash 2015638980, now seen corresponding path program 23 times [2018-12-09 02:52:46,741 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:52:46,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:52:46,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:52:46,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:52:46,742 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:52:46,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:52:46,945 INFO L134 CoverageAnalysis]: Checked inductivity of 1610 backedges. 0 proven. 805 refuted. 0 times theorem prover too weak. 805 trivial. 0 not checked. [2018-12-09 02:52:46,945 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 02:52:46,945 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 02:52:46,946 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 02:52:46,946 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 02:52:46,946 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 02:52:46,946 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_eb3572e4-9295-46cb-b171-11a0da54e0d5/bin-2019/utaipan/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 02:52:46,952 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 02:52:46,952 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-09 02:52:46,992 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2018-12-09 02:52:46,992 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 02:52:46,995 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 02:52:47,024 INFO L134 CoverageAnalysis]: Checked inductivity of 1610 backedges. 0 proven. 805 refuted. 0 times theorem prover too weak. 805 trivial. 0 not checked. [2018-12-09 02:52:47,024 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 02:52:50,917 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2018-12-09 02:52:55,524 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2018-12-09 02:52:55,635 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2018-12-09 02:53:01,087 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2018-12-09 02:53:07,012 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2018-12-09 02:53:09,942 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2018-12-09 02:53:10,058 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2018-12-09 02:53:10,166 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2018-12-09 02:53:10,281 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2018-12-09 02:53:10,391 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2018-12-09 02:53:10,514 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2018-12-09 02:53:10,634 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2018-12-09 02:53:10,758 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2018-12-09 02:53:10,887 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2018-12-09 02:53:22,517 INFO L134 CoverageAnalysis]: Checked inductivity of 1610 backedges. 0 proven. 1334 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2018-12-09 02:53:22,537 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 02:53:22,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 51] total 53 [2018-12-09 02:53:22,538 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 02:53:22,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-12-09 02:53:22,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-12-09 02:53:22,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=704, Invalid=2052, Unknown=0, NotChecked=0, Total=2756 [2018-12-09 02:53:22,539 INFO L87 Difference]: Start difference. First operand 84 states and 85 transitions. Second operand 28 states. [2018-12-09 02:53:22,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:53:22,859 INFO L93 Difference]: Finished difference Result 91 states and 92 transitions. [2018-12-09 02:53:22,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-09 02:53:22,859 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 151 [2018-12-09 02:53:22,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:53:22,860 INFO L225 Difference]: With dead ends: 91 [2018-12-09 02:53:22,860 INFO L226 Difference]: Without dead ends: 87 [2018-12-09 02:53:22,860 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 376 GetRequests, 253 SyntacticMatches, 48 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1704 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1928, Invalid=3924, Unknown=0, NotChecked=0, Total=5852 [2018-12-09 02:53:22,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-12-09 02:53:22,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-12-09 02:53:22,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-12-09 02:53:22,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2018-12-09 02:53:22,862 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 151 [2018-12-09 02:53:22,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:53:22,862 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2018-12-09 02:53:22,862 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-12-09 02:53:22,862 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2018-12-09 02:53:22,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-12-09 02:53:22,863 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:53:22,863 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 02:53:22,863 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:53:22,863 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:53:22,863 INFO L82 PathProgramCache]: Analyzing trace with hash 483163804, now seen corresponding path program 24 times [2018-12-09 02:53:22,863 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:53:22,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:53:22,864 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 02:53:22,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:53:22,864 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:53:22,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:53:23,082 INFO L134 CoverageAnalysis]: Checked inductivity of 1752 backedges. 0 proven. 876 refuted. 0 times theorem prover too weak. 876 trivial. 0 not checked. [2018-12-09 02:53:23,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 02:53:23,083 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 02:53:23,083 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 02:53:23,083 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 02:53:23,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 02:53:23,083 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_eb3572e4-9295-46cb-b171-11a0da54e0d5/bin-2019/utaipan/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 02:53:23,088 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-09 02:53:23,088 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-09 02:53:23,117 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-09 02:53:23,117 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 02:53:23,120 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 02:53:23,138 INFO L134 CoverageAnalysis]: Checked inductivity of 1752 backedges. 0 proven. 876 refuted. 0 times theorem prover too weak. 876 trivial. 0 not checked. [2018-12-09 02:53:23,138 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 02:53:26,613 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2018-12-09 02:53:26,724 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2018-12-09 02:53:26,849 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2018-12-09 02:53:26,965 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2018-12-09 02:53:27,091 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 125 [2018-12-09 02:53:27,226 WARN L180 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 125 [2018-12-09 02:53:27,371 WARN L180 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 127 [2018-12-09 02:53:27,512 WARN L180 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 127 [2018-12-09 02:53:27,665 WARN L180 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2018-12-09 02:53:27,812 WARN L180 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2018-12-09 02:53:45,823 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2018-12-09 02:53:45,929 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2018-12-09 02:53:46,035 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2018-12-09 02:53:46,147 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2018-12-09 02:53:46,265 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2018-12-09 02:53:46,385 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2018-12-09 02:53:46,500 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2018-12-09 02:53:46,622 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2018-12-09 02:53:46,745 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2018-12-09 02:53:46,876 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2018-12-09 02:53:47,012 WARN L180 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2018-12-09 02:53:47,151 WARN L180 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2018-12-09 02:53:47,284 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2018-12-09 02:53:50,016 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2018-12-09 02:53:50,121 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2018-12-09 02:53:50,230 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2018-12-09 02:53:50,342 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2018-12-09 02:53:50,456 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2018-12-09 02:53:50,574 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2018-12-09 02:53:50,682 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2018-12-09 02:53:50,809 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2018-12-09 02:53:50,922 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2018-12-09 02:53:51,039 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2018-12-09 02:54:02,181 INFO L134 CoverageAnalysis]: Checked inductivity of 1752 backedges. 0 proven. 1452 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2018-12-09 02:54:02,198 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 02:54:02,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 53] total 54 [2018-12-09 02:54:02,198 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 02:54:02,199 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-12-09 02:54:02,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-12-09 02:54:02,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=755, Invalid=2107, Unknown=0, NotChecked=0, Total=2862 [2018-12-09 02:54:02,199 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand 29 states. [2018-12-09 02:54:02,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:54:02,547 INFO L93 Difference]: Finished difference Result 94 states and 95 transitions. [2018-12-09 02:54:02,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-09 02:54:02,548 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 157 [2018-12-09 02:54:02,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:54:02,548 INFO L225 Difference]: With dead ends: 94 [2018-12-09 02:54:02,548 INFO L226 Difference]: Without dead ends: 90 [2018-12-09 02:54:02,549 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 391 GetRequests, 263 SyntacticMatches, 51 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1776 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=2080, Invalid=4082, Unknown=0, NotChecked=0, Total=6162 [2018-12-09 02:54:02,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-12-09 02:54:02,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2018-12-09 02:54:02,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-12-09 02:54:02,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 91 transitions. [2018-12-09 02:54:02,551 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 91 transitions. Word has length 157 [2018-12-09 02:54:02,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:54:02,551 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 91 transitions. [2018-12-09 02:54:02,551 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-12-09 02:54:02,552 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 91 transitions. [2018-12-09 02:54:02,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-12-09 02:54:02,552 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:54:02,552 INFO L402 BasicCegarLoop]: trace histogram [26, 26, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 02:54:02,552 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:54:02,552 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:54:02,552 INFO L82 PathProgramCache]: Analyzing trace with hash 1060706820, now seen corresponding path program 25 times [2018-12-09 02:54:02,553 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:54:02,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:54:02,553 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 02:54:02,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:54:02,553 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:54:02,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 02:54:02,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 02:54:02,603 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-09 02:54:02,630 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 02:54:02 BoogieIcfgContainer [2018-12-09 02:54:02,630 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 02:54:02,631 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 02:54:02,631 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 02:54:02,631 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 02:54:02,631 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 02:49:47" (3/4) ... [2018-12-09 02:54:02,632 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-09 02:54:02,671 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_eb3572e4-9295-46cb-b171-11a0da54e0d5/bin-2019/utaipan/witness.graphml [2018-12-09 02:54:02,671 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 02:54:02,672 INFO L168 Benchmark]: Toolchain (without parser) took 255890.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 953.3 MB in the beginning and 992.8 MB in the end (delta: -39.5 MB). Peak memory consumption was 98.4 MB. Max. memory is 11.5 GB. [2018-12-09 02:54:02,672 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 02:54:02,672 INFO L168 Benchmark]: CACSL2BoogieTranslator took 129.52 ms. Allocated memory is still 1.0 GB. Free memory was 953.3 MB in the beginning and 945.3 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 11.5 GB. [2018-12-09 02:54:02,672 INFO L168 Benchmark]: Boogie Procedure Inliner took 10.96 ms. Allocated memory is still 1.0 GB. Free memory is still 942.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 02:54:02,672 INFO L168 Benchmark]: Boogie Preprocessor took 9.58 ms. Allocated memory is still 1.0 GB. Free memory is still 942.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 02:54:02,673 INFO L168 Benchmark]: RCFGBuilder took 133.38 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 100.7 MB). Free memory was 942.6 MB in the beginning and 1.1 GB in the end (delta: -146.0 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. [2018-12-09 02:54:02,673 INFO L168 Benchmark]: TraceAbstraction took 255563.16 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 37.2 MB). Free memory was 1.1 GB in the beginning and 999.5 MB in the end (delta: 86.4 MB). Peak memory consumption was 123.6 MB. Max. memory is 11.5 GB. [2018-12-09 02:54:02,673 INFO L168 Benchmark]: Witness Printer took 40.47 ms. Allocated memory is still 1.2 GB. Free memory was 999.5 MB in the beginning and 992.8 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2018-12-09 02:54:02,674 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 129.52 ms. Allocated memory is still 1.0 GB. Free memory was 953.3 MB in the beginning and 945.3 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 10.96 ms. Allocated memory is still 1.0 GB. Free memory is still 942.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 9.58 ms. Allocated memory is still 1.0 GB. Free memory is still 942.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 133.38 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 100.7 MB). Free memory was 942.6 MB in the beginning and 1.1 GB in the end (delta: -146.0 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 255563.16 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 37.2 MB). Free memory was 1.1 GB in the beginning and 999.5 MB in the end (delta: 86.4 MB). Peak memory consumption was 123.6 MB. Max. memory is 11.5 GB. * Witness Printer took 40.47 ms. Allocated memory is still 1.2 GB. Free memory was 999.5 MB in the beginning and 992.8 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 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 = 25; [L13] int b = 0; VAL [a=25, b=0] [L14] CALL, EXPR sum(a, b) VAL [\old(m)=0, \old(n)=25] [L4] COND FALSE !(n <= 0) VAL [\old(m)=0, \old(n)=25, m=0, n=25] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=1, \old(n)=24] [L4] COND FALSE !(n <= 0) VAL [\old(m)=1, \old(n)=24, m=1, n=24] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=2, \old(n)=23] [L4] COND FALSE !(n <= 0) VAL [\old(m)=2, \old(n)=23, m=2, n=23] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=3, \old(n)=22] [L4] COND FALSE !(n <= 0) VAL [\old(m)=3, \old(n)=22, m=3, n=22] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=4, \old(n)=21] [L4] COND FALSE !(n <= 0) VAL [\old(m)=4, \old(n)=21, m=4, n=21] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=5, \old(n)=20] [L4] COND FALSE !(n <= 0) VAL [\old(m)=5, \old(n)=20, m=5, n=20] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=6, \old(n)=19] [L4] COND FALSE !(n <= 0) VAL [\old(m)=6, \old(n)=19, m=6, n=19] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=7, \old(n)=18] [L4] COND FALSE !(n <= 0) VAL [\old(m)=7, \old(n)=18, m=7, n=18] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=8, \old(n)=17] [L4] COND FALSE !(n <= 0) VAL [\old(m)=8, \old(n)=17, m=8, n=17] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=9, \old(n)=16] [L4] COND FALSE !(n <= 0) VAL [\old(m)=9, \old(n)=16, m=9, n=16] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=10, \old(n)=15] [L4] COND FALSE !(n <= 0) VAL [\old(m)=10, \old(n)=15, m=10, n=15] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=11, \old(n)=14] [L4] COND FALSE !(n <= 0) VAL [\old(m)=11, \old(n)=14, m=11, n=14] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=12, \old(n)=13] [L4] COND FALSE !(n <= 0) VAL [\old(m)=12, \old(n)=13, m=12, n=13] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=13, \old(n)=12] [L4] COND FALSE !(n <= 0) VAL [\old(m)=13, \old(n)=12, m=13, n=12] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=14, \old(n)=11] [L4] COND FALSE !(n <= 0) VAL [\old(m)=14, \old(n)=11, m=14, n=11] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=15, \old(n)=10] [L4] COND FALSE !(n <= 0) VAL [\old(m)=15, \old(n)=10, m=15, n=10] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=16, \old(n)=9] [L4] COND FALSE !(n <= 0) VAL [\old(m)=16, \old(n)=9, m=16, n=9] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=17, \old(n)=8] [L4] COND FALSE !(n <= 0) VAL [\old(m)=17, \old(n)=8, m=17, n=8] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=18, \old(n)=7] [L4] COND FALSE !(n <= 0) VAL [\old(m)=18, \old(n)=7, m=18, n=7] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=19, \old(n)=6] [L4] COND FALSE !(n <= 0) VAL [\old(m)=19, \old(n)=6, m=19, n=6] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=20, \old(n)=5] [L4] COND FALSE !(n <= 0) VAL [\old(m)=20, \old(n)=5, m=20, n=5] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=21, \old(n)=4] [L4] COND FALSE !(n <= 0) VAL [\old(m)=21, \old(n)=4, m=21, n=4] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=22, \old(n)=3] [L4] COND FALSE !(n <= 0) VAL [\old(m)=22, \old(n)=3, m=22, n=3] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=23, \old(n)=2] [L4] COND FALSE !(n <= 0) VAL [\old(m)=23, \old(n)=2, m=23, n=2] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=24, \old(n)=1] [L4] COND FALSE !(n <= 0) VAL [\old(m)=24, \old(n)=1, m=24, n=1] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=25, \old(n)=0] [L4] COND TRUE n <= 0 [L5] return m + n; VAL [\old(m)=25, \old(n)=0, \result=25, m=25, n=0] [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=24, \old(n)=1, m=24, n=1, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=23, \old(n)=2, m=23, n=2, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=22, \old(n)=3, m=22, n=3, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=21, \old(n)=4, m=21, n=4, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=20, \old(n)=5, m=20, n=5, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=19, \old(n)=6, m=19, n=6, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=18, \old(n)=7, m=18, n=7, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=17, \old(n)=8, m=17, n=8, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=16, \old(n)=9, m=16, n=9, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=15, \old(n)=10, m=15, n=10, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=14, \old(n)=11, m=14, n=11, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=13, \old(n)=12, m=13, n=12, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=12, \old(n)=13, m=12, n=13, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=11, \old(n)=14, m=11, n=14, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=10, \old(n)=15, m=10, n=15, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=9, \old(n)=16, m=9, n=16, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=8, \old(n)=17, m=8, n=17, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=7, \old(n)=18, m=7, n=18, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=6, \old(n)=19, m=6, n=19, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=5, \old(n)=20, m=5, n=20, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=4, \old(n)=21, m=4, n=21, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=3, \old(n)=22, m=3, n=22, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=2, \old(n)=23, m=2, n=23, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=1, \old(n)=24, m=1, n=24, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=0, \old(n)=25, m=0, n=25, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L14] RET, EXPR sum(a, b) VAL [a=25, b=0, sum(a, b)=25] [L14] int result = sum(a, b); [L15] COND TRUE result == a + b VAL [a=25, b=0, result=25] [L16] __VERIFIER_error() VAL [a=25, b=0, result=25] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 20 locations, 1 error locations. UNSAFE Result, 255.5s OverallTime, 26 OverallIterations, 26 TraceHistogramMax, 3.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 303 SDtfs, 778 SDslu, 2748 SDs, 0 SdLazy, 2123 SolverSat, 33 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5250 GetRequests, 3554 SyntacticMatches, 649 SemanticMatches, 1047 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16174 ImplicationChecksByTransitivity, 11.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=90occurred in iteration=25, 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, 25 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 250.2s InterpolantComputationTime, 4400 NumberOfCodeBlocks, 4400 NumberOfCodeBlocksAsserted, 158 NumberOfCheckSat, 6276 ConstructedInterpolants, 0 QuantifiedInterpolants, 1981872 SizeOfPredicates, 348 NumberOfNonLiveVariables, 6288 ConjunctsInSsa, 696 ConjunctsInUnsatCore, 73 InterpolantComputations, 1 PerfectInterpolantSequences, 17600/45000 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...