./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/loop-new/nested_true-unreach-call_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_6463a22f-dd8d-4e3b-9af9-d4da25143050/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_6463a22f-dd8d-4e3b-9af9-d4da25143050/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_6463a22f-dd8d-4e3b-9af9-d4da25143050/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_6463a22f-dd8d-4e3b-9af9-d4da25143050/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/loop-new/nested_true-unreach-call_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_6463a22f-dd8d-4e3b-9af9-d4da25143050/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_6463a22f-dd8d-4e3b-9af9-d4da25143050/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 a881e1073186594f4727f809fbe5d917ff145543 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-10-26 20:39:24,233 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 20:39:24,234 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 20:39:24,244 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 20:39:24,244 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 20:39:24,245 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 20:39:24,246 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 20:39:24,247 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 20:39:24,249 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 20:39:24,250 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 20:39:24,250 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 20:39:24,250 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 20:39:24,251 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 20:39:24,252 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 20:39:24,253 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 20:39:24,253 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 20:39:24,254 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 20:39:24,260 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 20:39:24,264 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 20:39:24,265 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 20:39:24,265 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 20:39:24,266 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 20:39:24,271 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 20:39:24,271 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 20:39:24,271 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 20:39:24,272 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 20:39:24,272 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 20:39:24,273 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 20:39:24,273 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 20:39:24,274 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 20:39:24,274 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 20:39:24,279 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 20:39:24,279 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 20:39:24,280 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 20:39:24,280 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 20:39:24,281 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 20:39:24,281 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_6463a22f-dd8d-4e3b-9af9-d4da25143050/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-10-26 20:39:24,297 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 20:39:24,298 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 20:39:24,299 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 20:39:24,299 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-26 20:39:24,300 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-26 20:39:24,300 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-26 20:39:24,300 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-26 20:39:24,301 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-26 20:39:24,301 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-26 20:39:24,301 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-26 20:39:24,301 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-26 20:39:24,302 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 20:39:24,304 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-26 20:39:24,304 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-26 20:39:24,304 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-26 20:39:24,304 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 20:39:24,304 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 20:39:24,304 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 20:39:24,304 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 20:39:24,305 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-26 20:39:24,305 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 20:39:24,305 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 20:39:24,305 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 20:39:24,305 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-26 20:39:24,305 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 20:39:24,306 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-26 20:39:24,306 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 20:39:24,306 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 20:39:24,306 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 20:39:24,306 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 20:39:24,306 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-26 20:39:24,306 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 20:39:24,307 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-26 20:39:24,307 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-26 20:39:24,307 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_6463a22f-dd8d-4e3b-9af9-d4da25143050/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 -> a881e1073186594f4727f809fbe5d917ff145543 [2018-10-26 20:39:24,340 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 20:39:24,350 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 20:39:24,353 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 20:39:24,354 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 20:39:24,354 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 20:39:24,355 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_6463a22f-dd8d-4e3b-9af9-d4da25143050/bin-2019/utaipan/../../sv-benchmarks/c/loop-new/nested_true-unreach-call_true-termination.i [2018-10-26 20:39:24,404 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6463a22f-dd8d-4e3b-9af9-d4da25143050/bin-2019/utaipan/data/5fea7c2e3/dd739ec409864b98a2affcad15f93784/FLAG2c24e1c0f [2018-10-26 20:39:24,779 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 20:39:24,780 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_6463a22f-dd8d-4e3b-9af9-d4da25143050/sv-benchmarks/c/loop-new/nested_true-unreach-call_true-termination.i [2018-10-26 20:39:24,785 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6463a22f-dd8d-4e3b-9af9-d4da25143050/bin-2019/utaipan/data/5fea7c2e3/dd739ec409864b98a2affcad15f93784/FLAG2c24e1c0f [2018-10-26 20:39:24,795 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_6463a22f-dd8d-4e3b-9af9-d4da25143050/bin-2019/utaipan/data/5fea7c2e3/dd739ec409864b98a2affcad15f93784 [2018-10-26 20:39:24,798 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 20:39:24,799 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-26 20:39:24,800 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 20:39:24,800 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 20:39:24,804 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 20:39:24,804 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 08:39:24" (1/1) ... [2018-10-26 20:39:24,807 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30bf22ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:39:24, skipping insertion in model container [2018-10-26 20:39:24,807 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 08:39:24" (1/1) ... [2018-10-26 20:39:24,816 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 20:39:24,831 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 20:39:24,954 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 20:39:24,957 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 20:39:24,969 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 20:39:24,979 INFO L193 MainTranslator]: Completed translation [2018-10-26 20:39:24,979 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:39:24 WrapperNode [2018-10-26 20:39:24,979 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 20:39:24,981 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-26 20:39:24,981 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-26 20:39:24,981 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-26 20:39:24,989 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:39:24" (1/1) ... [2018-10-26 20:39:24,995 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:39:24" (1/1) ... [2018-10-26 20:39:25,001 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-26 20:39:25,001 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 20:39:25,001 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 20:39:25,001 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 20:39:25,012 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:39:24" (1/1) ... [2018-10-26 20:39:25,012 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:39:24" (1/1) ... [2018-10-26 20:39:25,013 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:39:24" (1/1) ... [2018-10-26 20:39:25,013 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:39:24" (1/1) ... [2018-10-26 20:39:25,017 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:39:24" (1/1) ... [2018-10-26 20:39:25,025 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:39:24" (1/1) ... [2018-10-26 20:39:25,026 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:39:24" (1/1) ... [2018-10-26 20:39:25,027 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 20:39:25,028 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 20:39:25,028 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 20:39:25,028 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 20:39:25,029 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:39:24" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6463a22f-dd8d-4e3b-9af9-d4da25143050/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-10-26 20:39:25,194 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-26 20:39:25,194 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-26 20:39:25,195 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 20:39:25,195 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 20:39:25,195 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-26 20:39:25,195 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-26 20:39:25,195 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-10-26 20:39:25,195 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-10-26 20:39:25,567 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 20:39:25,568 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 08:39:25 BoogieIcfgContainer [2018-10-26 20:39:25,568 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 20:39:25,569 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-26 20:39:25,569 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-26 20:39:25,573 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-26 20:39:25,573 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 08:39:24" (1/3) ... [2018-10-26 20:39:25,574 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@404680cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 08:39:25, skipping insertion in model container [2018-10-26 20:39:25,575 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:39:24" (2/3) ... [2018-10-26 20:39:25,575 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@404680cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 08:39:25, skipping insertion in model container [2018-10-26 20:39:25,576 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 08:39:25" (3/3) ... [2018-10-26 20:39:25,578 INFO L112 eAbstractionObserver]: Analyzing ICFG nested_true-unreach-call_true-termination.i [2018-10-26 20:39:25,588 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-26 20:39:25,597 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-26 20:39:25,617 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-26 20:39:25,660 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-26 20:39:25,660 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-26 20:39:25,660 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-26 20:39:25,660 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-26 20:39:25,661 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-26 20:39:25,662 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-26 20:39:25,662 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-26 20:39:25,662 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-26 20:39:25,684 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2018-10-26 20:39:25,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-26 20:39:25,698 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:39:25,699 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:39:25,701 INFO L424 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:39:25,709 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:39:25,710 INFO L82 PathProgramCache]: Analyzing trace with hash -702630595, now seen corresponding path program 1 times [2018-10-26 20:39:25,713 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:39:25,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:39:25,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:39:25,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:39:25,765 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:39:25,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:39:25,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:39:25,854 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:39:25,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-26 20:39:25,855 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:39:25,860 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-10-26 20:39:25,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-26 20:39:25,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-26 20:39:25,877 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 2 states. [2018-10-26 20:39:25,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:39:25,916 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2018-10-26 20:39:25,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-26 20:39:25,917 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2018-10-26 20:39:25,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:39:25,929 INFO L225 Difference]: With dead ends: 43 [2018-10-26 20:39:25,934 INFO L226 Difference]: Without dead ends: 18 [2018-10-26 20:39:25,938 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-26 20:39:25,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-10-26 20:39:25,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-10-26 20:39:25,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-10-26 20:39:25,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2018-10-26 20:39:25,991 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 12 [2018-10-26 20:39:25,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:39:25,992 INFO L481 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2018-10-26 20:39:25,992 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-10-26 20:39:25,993 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2018-10-26 20:39:25,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-26 20:39:25,994 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:39:25,994 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:39:25,995 INFO L424 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:39:25,996 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:39:25,996 INFO L82 PathProgramCache]: Analyzing trace with hash -972126638, now seen corresponding path program 1 times [2018-10-26 20:39:25,996 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:39:25,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:39:25,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:39:25,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:39:25,999 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:39:26,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:39:26,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:39:26,089 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:39:26,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 20:39:26,089 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:39:26,090 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:39:26,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:39:26,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:39:26,091 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 4 states. [2018-10-26 20:39:26,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:39:26,188 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2018-10-26 20:39:26,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:39:26,190 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-10-26 20:39:26,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:39:26,191 INFO L225 Difference]: With dead ends: 29 [2018-10-26 20:39:26,191 INFO L226 Difference]: Without dead ends: 24 [2018-10-26 20:39:26,192 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-26 20:39:26,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-10-26 20:39:26,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 20. [2018-10-26 20:39:26,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-10-26 20:39:26,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2018-10-26 20:39:26,198 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 13 [2018-10-26 20:39:26,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:39:26,199 INFO L481 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2018-10-26 20:39:26,199 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:39:26,199 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2018-10-26 20:39:26,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-26 20:39:26,200 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:39:26,202 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:39:26,203 INFO L424 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:39:26,203 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:39:26,203 INFO L82 PathProgramCache]: Analyzing trace with hash 1998515670, now seen corresponding path program 1 times [2018-10-26 20:39:26,203 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:39:26,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:39:26,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:39:26,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:39:26,205 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:39:26,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:39:26,273 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:39:26,273 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:39:26,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 20:39:26,279 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:39:26,279 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:39:26,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:39:26,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:39:26,280 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 4 states. [2018-10-26 20:39:26,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:39:26,357 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2018-10-26 20:39:26,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:39:26,359 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-10-26 20:39:26,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:39:26,359 INFO L225 Difference]: With dead ends: 34 [2018-10-26 20:39:26,360 INFO L226 Difference]: Without dead ends: 23 [2018-10-26 20:39:26,360 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-26 20:39:26,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-10-26 20:39:26,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2018-10-26 20:39:26,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-10-26 20:39:26,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2018-10-26 20:39:26,368 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 18 [2018-10-26 20:39:26,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:39:26,369 INFO L481 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2018-10-26 20:39:26,369 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:39:26,369 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2018-10-26 20:39:26,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-26 20:39:26,369 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:39:26,370 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:39:26,370 INFO L424 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:39:26,370 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:39:26,370 INFO L82 PathProgramCache]: Analyzing trace with hash -1293803971, now seen corresponding path program 1 times [2018-10-26 20:39:26,372 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:39:26,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:39:26,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:39:26,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:39:26,373 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:39:26,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:39:26,438 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:39:26,438 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:39:26,438 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 20:39:26,439 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 22 with the following transitions: [2018-10-26 20:39:26,441 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [16], [19], [21], [25], [28], [30], [32], [36], [43], [46], [48], [54], [55], [56], [58] [2018-10-26 20:39:26,490 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 20:39:26,490 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 20:39:27,635 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-26 20:39:27,637 INFO L272 AbstractInterpreter]: Visited 19 different actions 599 times. Merged at 8 different actions 374 times. Widened at 3 different actions 105 times. Found 61 fixpoints after 6 different actions. Largest state had 10 variables. [2018-10-26 20:39:27,667 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:39:27,668 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-26 20:39:27,668 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:39:27,668 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6463a22f-dd8d-4e3b-9af9-d4da25143050/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-10-26 20:39:27,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:39:27,677 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-26 20:39:27,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:39:27,712 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:39:27,892 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:39:27,892 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 20:39:28,083 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:39:28,101 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-26 20:39:28,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2018-10-26 20:39:28,102 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-26 20:39:28,102 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 20:39:28,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 20:39:28,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2018-10-26 20:39:28,103 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand 7 states. [2018-10-26 20:39:28,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:39:28,174 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2018-10-26 20:39:28,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 20:39:28,176 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2018-10-26 20:39:28,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:39:28,176 INFO L225 Difference]: With dead ends: 39 [2018-10-26 20:39:28,177 INFO L226 Difference]: Without dead ends: 26 [2018-10-26 20:39:28,177 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2018-10-26 20:39:28,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-10-26 20:39:28,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2018-10-26 20:39:28,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-10-26 20:39:28,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2018-10-26 20:39:28,184 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 21 [2018-10-26 20:39:28,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:39:28,185 INFO L481 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2018-10-26 20:39:28,185 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 20:39:28,185 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2018-10-26 20:39:28,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-26 20:39:28,186 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:39:28,186 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:39:28,186 INFO L424 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:39:28,188 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:39:28,188 INFO L82 PathProgramCache]: Analyzing trace with hash 1379909750, now seen corresponding path program 2 times [2018-10-26 20:39:28,188 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:39:28,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:39:28,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:39:28,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:39:28,190 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:39:28,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:39:28,307 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:39:28,307 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:39:28,307 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 20:39:28,308 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-26 20:39:28,308 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-26 20:39:28,308 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:39:28,308 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6463a22f-dd8d-4e3b-9af9-d4da25143050/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-10-26 20:39:28,317 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-26 20:39:28,318 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-26 20:39:28,353 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-10-26 20:39:28,353 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 20:39:28,355 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:39:28,514 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-26 20:39:28,514 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 20:39:28,614 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-26 20:39:28,634 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-26 20:39:28,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 12 [2018-10-26 20:39:28,634 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-26 20:39:28,635 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-26 20:39:28,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-26 20:39:28,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2018-10-26 20:39:28,636 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 9 states. [2018-10-26 20:39:29,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:39:29,183 INFO L93 Difference]: Finished difference Result 73 states and 81 transitions. [2018-10-26 20:39:29,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-26 20:39:29,184 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2018-10-26 20:39:29,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:39:29,185 INFO L225 Difference]: With dead ends: 73 [2018-10-26 20:39:29,185 INFO L226 Difference]: Without dead ends: 57 [2018-10-26 20:39:29,186 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=189, Invalid=363, Unknown=0, NotChecked=0, Total=552 [2018-10-26 20:39:29,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-10-26 20:39:29,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 42. [2018-10-26 20:39:29,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-10-26 20:39:29,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2018-10-26 20:39:29,194 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 24 [2018-10-26 20:39:29,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:39:29,194 INFO L481 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2018-10-26 20:39:29,194 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-26 20:39:29,194 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2018-10-26 20:39:29,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-10-26 20:39:29,195 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:39:29,195 INFO L375 BasicCegarLoop]: trace histogram [8, 6, 6, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:39:29,196 INFO L424 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:39:29,196 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:39:29,196 INFO L82 PathProgramCache]: Analyzing trace with hash -1699386968, now seen corresponding path program 3 times [2018-10-26 20:39:29,196 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:39:29,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:39:29,197 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 20:39:29,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:39:29,197 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:39:29,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:39:29,295 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 45 proven. 15 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-26 20:39:29,296 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:39:29,296 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 20:39:29,296 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-26 20:39:29,296 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-26 20:39:29,296 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:39:29,296 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6463a22f-dd8d-4e3b-9af9-d4da25143050/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-10-26 20:39:29,308 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-26 20:39:29,308 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-10-26 20:39:29,322 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-26 20:39:29,323 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 20:39:29,324 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:39:29,385 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 45 proven. 15 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-26 20:39:29,385 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 20:39:29,485 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 45 proven. 15 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-26 20:39:29,502 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-26 20:39:29,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2018-10-26 20:39:29,503 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-26 20:39:29,503 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-26 20:39:29,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-26 20:39:29,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=142, Unknown=0, NotChecked=0, Total=240 [2018-10-26 20:39:29,504 INFO L87 Difference]: Start difference. First operand 42 states and 44 transitions. Second operand 11 states. [2018-10-26 20:39:29,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:39:29,556 INFO L93 Difference]: Finished difference Result 72 states and 77 transitions. [2018-10-26 20:39:29,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 20:39:29,563 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 41 [2018-10-26 20:39:29,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:39:29,564 INFO L225 Difference]: With dead ends: 72 [2018-10-26 20:39:29,564 INFO L226 Difference]: Without dead ends: 50 [2018-10-26 20:39:29,564 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=98, Invalid=142, Unknown=0, NotChecked=0, Total=240 [2018-10-26 20:39:29,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-10-26 20:39:29,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2018-10-26 20:39:29,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-10-26 20:39:29,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2018-10-26 20:39:29,572 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 41 [2018-10-26 20:39:29,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:39:29,572 INFO L481 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2018-10-26 20:39:29,573 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-26 20:39:29,573 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2018-10-26 20:39:29,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-10-26 20:39:29,573 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:39:29,574 INFO L375 BasicCegarLoop]: trace histogram [10, 8, 8, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:39:29,574 INFO L424 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:39:29,574 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:39:29,574 INFO L82 PathProgramCache]: Analyzing trace with hash -1734727982, now seen corresponding path program 4 times [2018-10-26 20:39:29,574 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:39:29,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:39:29,578 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 20:39:29,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:39:29,578 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:39:29,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:39:29,688 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 70 proven. 26 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-10-26 20:39:29,688 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:39:29,688 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 20:39:29,688 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-26 20:39:29,688 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-26 20:39:29,689 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:39:29,689 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6463a22f-dd8d-4e3b-9af9-d4da25143050/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-10-26 20:39:29,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:39:29,696 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-26 20:39:29,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:39:29,714 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:39:29,812 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 70 proven. 26 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-10-26 20:39:29,812 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 20:39:29,887 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 70 proven. 26 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-10-26 20:39:29,904 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-26 20:39:29,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2018-10-26 20:39:29,905 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-26 20:39:29,906 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-26 20:39:29,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-26 20:39:29,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=201, Unknown=0, NotChecked=0, Total=342 [2018-10-26 20:39:29,906 INFO L87 Difference]: Start difference. First operand 48 states and 50 transitions. Second operand 13 states. [2018-10-26 20:39:29,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:39:29,940 INFO L93 Difference]: Finished difference Result 81 states and 86 transitions. [2018-10-26 20:39:29,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-26 20:39:29,943 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 47 [2018-10-26 20:39:29,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:39:29,944 INFO L225 Difference]: With dead ends: 81 [2018-10-26 20:39:29,944 INFO L226 Difference]: Without dead ends: 56 [2018-10-26 20:39:29,944 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=141, Invalid=201, Unknown=0, NotChecked=0, Total=342 [2018-10-26 20:39:29,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-10-26 20:39:29,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2018-10-26 20:39:29,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-10-26 20:39:29,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 56 transitions. [2018-10-26 20:39:29,952 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 56 transitions. Word has length 47 [2018-10-26 20:39:29,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:39:29,953 INFO L481 AbstractCegarLoop]: Abstraction has 54 states and 56 transitions. [2018-10-26 20:39:29,953 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-26 20:39:29,953 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 56 transitions. [2018-10-26 20:39:29,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-10-26 20:39:29,954 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:39:29,954 INFO L375 BasicCegarLoop]: trace histogram [12, 10, 10, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:39:29,954 INFO L424 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:39:29,956 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:39:29,957 INFO L82 PathProgramCache]: Analyzing trace with hash 2050902056, now seen corresponding path program 5 times [2018-10-26 20:39:29,957 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:39:29,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:39:29,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:39:29,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:39:29,958 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:39:29,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:39:30,149 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 101 proven. 40 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-10-26 20:39:30,150 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:39:30,150 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 20:39:30,150 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-26 20:39:30,150 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-26 20:39:30,150 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:39:30,150 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6463a22f-dd8d-4e3b-9af9-d4da25143050/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-10-26 20:39:30,161 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-26 20:39:30,161 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-26 20:39:30,178 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-10-26 20:39:30,179 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 20:39:30,181 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:39:30,233 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 0 proven. 104 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-10-26 20:39:30,233 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 20:39:30,274 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 0 proven. 104 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-10-26 20:39:30,291 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-26 20:39:30,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 17 [2018-10-26 20:39:30,291 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-26 20:39:30,291 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-26 20:39:30,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-26 20:39:30,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-10-26 20:39:30,292 INFO L87 Difference]: Start difference. First operand 54 states and 56 transitions. Second operand 13 states. [2018-10-26 20:39:31,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:39:31,069 INFO L93 Difference]: Finished difference Result 136 states and 146 transitions. [2018-10-26 20:39:31,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-26 20:39:31,070 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 53 [2018-10-26 20:39:31,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:39:31,071 INFO L225 Difference]: With dead ends: 136 [2018-10-26 20:39:31,071 INFO L226 Difference]: Without dead ends: 108 [2018-10-26 20:39:31,072 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 461 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=649, Invalid=1331, Unknown=0, NotChecked=0, Total=1980 [2018-10-26 20:39:31,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-10-26 20:39:31,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 83. [2018-10-26 20:39:31,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-10-26 20:39:31,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 86 transitions. [2018-10-26 20:39:31,082 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 86 transitions. Word has length 53 [2018-10-26 20:39:31,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:39:31,082 INFO L481 AbstractCegarLoop]: Abstraction has 83 states and 86 transitions. [2018-10-26 20:39:31,082 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-26 20:39:31,082 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 86 transitions. [2018-10-26 20:39:31,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-10-26 20:39:31,083 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:39:31,083 INFO L375 BasicCegarLoop]: trace histogram [21, 18, 18, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:39:31,084 INFO L424 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:39:31,084 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:39:31,084 INFO L82 PathProgramCache]: Analyzing trace with hash -1138844106, now seen corresponding path program 6 times [2018-10-26 20:39:31,084 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:39:31,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:39:31,085 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 20:39:31,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:39:31,085 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:39:31,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:39:31,201 INFO L134 CoverageAnalysis]: Checked inductivity of 588 backedges. 274 proven. 57 refuted. 0 times theorem prover too weak. 257 trivial. 0 not checked. [2018-10-26 20:39:31,201 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:39:31,201 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 20:39:31,201 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-26 20:39:31,201 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-26 20:39:31,202 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:39:31,202 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6463a22f-dd8d-4e3b-9af9-d4da25143050/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-10-26 20:39:31,208 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-26 20:39:31,208 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-10-26 20:39:31,238 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-26 20:39:31,239 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 20:39:31,241 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:39:31,343 INFO L134 CoverageAnalysis]: Checked inductivity of 588 backedges. 274 proven. 57 refuted. 0 times theorem prover too weak. 257 trivial. 0 not checked. [2018-10-26 20:39:31,349 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 20:39:31,602 INFO L134 CoverageAnalysis]: Checked inductivity of 588 backedges. 274 proven. 57 refuted. 0 times theorem prover too weak. 257 trivial. 0 not checked. [2018-10-26 20:39:31,618 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-26 20:39:31,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 21 [2018-10-26 20:39:31,618 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-26 20:39:31,619 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-26 20:39:31,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-26 20:39:31,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=251, Unknown=0, NotChecked=0, Total=420 [2018-10-26 20:39:31,619 INFO L87 Difference]: Start difference. First operand 83 states and 86 transitions. Second operand 17 states. [2018-10-26 20:39:31,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:39:31,660 INFO L93 Difference]: Finished difference Result 149 states and 157 transitions. [2018-10-26 20:39:31,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-26 20:39:31,661 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 82 [2018-10-26 20:39:31,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:39:31,662 INFO L225 Difference]: With dead ends: 149 [2018-10-26 20:39:31,662 INFO L226 Difference]: Without dead ends: 95 [2018-10-26 20:39:31,663 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 150 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=169, Invalid=251, Unknown=0, NotChecked=0, Total=420 [2018-10-26 20:39:31,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-10-26 20:39:31,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 92. [2018-10-26 20:39:31,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-10-26 20:39:31,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 95 transitions. [2018-10-26 20:39:31,670 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 95 transitions. Word has length 82 [2018-10-26 20:39:31,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:39:31,680 INFO L481 AbstractCegarLoop]: Abstraction has 92 states and 95 transitions. [2018-10-26 20:39:31,680 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-26 20:39:31,680 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 95 transitions. [2018-10-26 20:39:31,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-10-26 20:39:31,681 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:39:31,681 INFO L375 BasicCegarLoop]: trace histogram [24, 21, 21, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:39:31,681 INFO L424 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:39:31,681 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:39:31,681 INFO L82 PathProgramCache]: Analyzing trace with hash -2009672909, now seen corresponding path program 7 times [2018-10-26 20:39:31,682 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:39:31,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:39:31,682 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 20:39:31,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:39:31,683 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:39:31,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:39:31,805 INFO L134 CoverageAnalysis]: Checked inductivity of 777 backedges. 360 proven. 77 refuted. 0 times theorem prover too weak. 340 trivial. 0 not checked. [2018-10-26 20:39:31,805 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:39:31,805 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 20:39:31,805 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-26 20:39:31,806 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-26 20:39:31,806 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:39:31,806 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6463a22f-dd8d-4e3b-9af9-d4da25143050/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-10-26 20:39:31,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:39:31,813 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-26 20:39:31,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:39:31,850 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:39:32,109 INFO L134 CoverageAnalysis]: Checked inductivity of 777 backedges. 360 proven. 77 refuted. 0 times theorem prover too weak. 340 trivial. 0 not checked. [2018-10-26 20:39:32,109 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 20:39:32,208 INFO L134 CoverageAnalysis]: Checked inductivity of 777 backedges. 360 proven. 77 refuted. 0 times theorem prover too weak. 340 trivial. 0 not checked. [2018-10-26 20:39:32,224 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-26 20:39:32,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 22 [2018-10-26 20:39:32,224 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-26 20:39:32,225 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-26 20:39:32,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-26 20:39:32,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=279, Unknown=0, NotChecked=0, Total=462 [2018-10-26 20:39:32,225 INFO L87 Difference]: Start difference. First operand 92 states and 95 transitions. Second operand 19 states. [2018-10-26 20:39:32,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:39:32,327 INFO L93 Difference]: Finished difference Result 164 states and 172 transitions. [2018-10-26 20:39:32,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-26 20:39:32,328 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 91 [2018-10-26 20:39:32,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:39:32,329 INFO L225 Difference]: With dead ends: 164 [2018-10-26 20:39:32,329 INFO L226 Difference]: Without dead ends: 104 [2018-10-26 20:39:32,329 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 166 SyntacticMatches, 6 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=183, Invalid=279, Unknown=0, NotChecked=0, Total=462 [2018-10-26 20:39:32,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-10-26 20:39:32,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 101. [2018-10-26 20:39:32,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-10-26 20:39:32,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 104 transitions. [2018-10-26 20:39:32,345 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 104 transitions. Word has length 91 [2018-10-26 20:39:32,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:39:32,346 INFO L481 AbstractCegarLoop]: Abstraction has 101 states and 104 transitions. [2018-10-26 20:39:32,346 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-26 20:39:32,346 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 104 transitions. [2018-10-26 20:39:32,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-10-26 20:39:32,347 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:39:32,347 INFO L375 BasicCegarLoop]: trace histogram [27, 24, 24, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:39:32,347 INFO L424 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:39:32,347 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:39:32,348 INFO L82 PathProgramCache]: Analyzing trace with hash 1289095638, now seen corresponding path program 8 times [2018-10-26 20:39:32,348 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:39:32,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:39:32,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:39:32,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:39:32,351 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:39:32,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:39:32,446 INFO L134 CoverageAnalysis]: Checked inductivity of 993 backedges. 458 proven. 100 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2018-10-26 20:39:32,446 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:39:32,447 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 20:39:32,447 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-26 20:39:32,447 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-26 20:39:32,447 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:39:32,447 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6463a22f-dd8d-4e3b-9af9-d4da25143050/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-10-26 20:39:32,455 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-26 20:39:32,455 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-26 20:39:32,516 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-10-26 20:39:32,516 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 20:39:32,519 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:39:32,658 INFO L134 CoverageAnalysis]: Checked inductivity of 993 backedges. 460 proven. 100 refuted. 0 times theorem prover too weak. 433 trivial. 0 not checked. [2018-10-26 20:39:32,658 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 20:39:32,807 INFO L134 CoverageAnalysis]: Checked inductivity of 993 backedges. 8 proven. 552 refuted. 0 times theorem prover too weak. 433 trivial. 0 not checked. [2018-10-26 20:39:32,823 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-26 20:39:32,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2018-10-26 20:39:32,823 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-26 20:39:32,824 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-26 20:39:32,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-26 20:39:32,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=309, Unknown=0, NotChecked=0, Total=506 [2018-10-26 20:39:32,825 INFO L87 Difference]: Start difference. First operand 101 states and 104 transitions. Second operand 21 states. [2018-10-26 20:39:32,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:39:32,902 INFO L93 Difference]: Finished difference Result 179 states and 187 transitions. [2018-10-26 20:39:32,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-26 20:39:32,903 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 100 [2018-10-26 20:39:32,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:39:32,903 INFO L225 Difference]: With dead ends: 179 [2018-10-26 20:39:32,903 INFO L226 Difference]: Without dead ends: 113 [2018-10-26 20:39:32,904 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 182 SyntacticMatches, 8 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=197, Invalid=309, Unknown=0, NotChecked=0, Total=506 [2018-10-26 20:39:32,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-10-26 20:39:32,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 110. [2018-10-26 20:39:32,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-10-26 20:39:32,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 113 transitions. [2018-10-26 20:39:32,915 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 113 transitions. Word has length 100 [2018-10-26 20:39:32,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:39:32,915 INFO L481 AbstractCegarLoop]: Abstraction has 110 states and 113 transitions. [2018-10-26 20:39:32,916 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-26 20:39:32,916 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 113 transitions. [2018-10-26 20:39:32,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-10-26 20:39:32,917 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:39:32,917 INFO L375 BasicCegarLoop]: trace histogram [30, 27, 27, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:39:32,917 INFO L424 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:39:32,917 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:39:32,917 INFO L82 PathProgramCache]: Analyzing trace with hash -340366701, now seen corresponding path program 9 times [2018-10-26 20:39:32,917 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:39:32,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:39:32,918 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 20:39:32,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:39:32,918 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:39:32,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:39:33,035 INFO L134 CoverageAnalysis]: Checked inductivity of 1236 backedges. 568 proven. 126 refuted. 0 times theorem prover too weak. 542 trivial. 0 not checked. [2018-10-26 20:39:33,036 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:39:33,036 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 20:39:33,036 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-26 20:39:33,036 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-26 20:39:33,036 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:39:33,036 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6463a22f-dd8d-4e3b-9af9-d4da25143050/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-10-26 20:39:33,043 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-26 20:39:33,043 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-10-26 20:39:33,069 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-26 20:39:33,070 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 20:39:33,073 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:39:33,175 INFO L134 CoverageAnalysis]: Checked inductivity of 1236 backedges. 568 proven. 126 refuted. 0 times theorem prover too weak. 542 trivial. 0 not checked. [2018-10-26 20:39:33,175 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 20:39:33,314 INFO L134 CoverageAnalysis]: Checked inductivity of 1236 backedges. 568 proven. 126 refuted. 0 times theorem prover too weak. 542 trivial. 0 not checked. [2018-10-26 20:39:33,331 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-26 20:39:33,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 23 [2018-10-26 20:39:33,331 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-26 20:39:33,331 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-26 20:39:33,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-26 20:39:33,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=308, Unknown=0, NotChecked=0, Total=506 [2018-10-26 20:39:33,332 INFO L87 Difference]: Start difference. First operand 110 states and 113 transitions. Second operand 23 states. [2018-10-26 20:39:33,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:39:33,507 INFO L93 Difference]: Finished difference Result 194 states and 202 transitions. [2018-10-26 20:39:33,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-26 20:39:33,515 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 109 [2018-10-26 20:39:33,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:39:33,516 INFO L225 Difference]: With dead ends: 194 [2018-10-26 20:39:33,516 INFO L226 Difference]: Without dead ends: 122 [2018-10-26 20:39:33,516 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 198 SyntacticMatches, 11 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 399 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=212, Invalid=340, Unknown=0, NotChecked=0, Total=552 [2018-10-26 20:39:33,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-10-26 20:39:33,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 119. [2018-10-26 20:39:33,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-10-26 20:39:33,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 122 transitions. [2018-10-26 20:39:33,529 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 122 transitions. Word has length 109 [2018-10-26 20:39:33,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:39:33,529 INFO L481 AbstractCegarLoop]: Abstraction has 119 states and 122 transitions. [2018-10-26 20:39:33,529 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-26 20:39:33,529 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 122 transitions. [2018-10-26 20:39:33,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-10-26 20:39:33,532 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:39:33,532 INFO L375 BasicCegarLoop]: trace histogram [33, 30, 30, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:39:33,533 INFO L424 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:39:33,533 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:39:33,533 INFO L82 PathProgramCache]: Analyzing trace with hash 2030161270, now seen corresponding path program 10 times [2018-10-26 20:39:33,533 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:39:33,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:39:33,534 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 20:39:33,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:39:33,534 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:39:33,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:39:33,640 INFO L134 CoverageAnalysis]: Checked inductivity of 1506 backedges. 0 proven. 1041 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2018-10-26 20:39:33,640 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:39:33,640 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 20:39:33,640 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-26 20:39:33,640 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-26 20:39:33,640 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:39:33,640 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6463a22f-dd8d-4e3b-9af9-d4da25143050/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-10-26 20:39:33,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:39:33,647 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-26 20:39:33,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:39:33,690 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:39:33,775 INFO L134 CoverageAnalysis]: Checked inductivity of 1506 backedges. 0 proven. 1041 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2018-10-26 20:39:33,775 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 20:39:33,815 INFO L134 CoverageAnalysis]: Checked inductivity of 1506 backedges. 0 proven. 1041 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2018-10-26 20:39:33,832 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-26 20:39:33,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2018-10-26 20:39:33,832 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-26 20:39:33,832 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-26 20:39:33,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-26 20:39:33,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=142, Unknown=0, NotChecked=0, Total=240 [2018-10-26 20:39:33,833 INFO L87 Difference]: Start difference. First operand 119 states and 122 transitions. Second operand 11 states. [2018-10-26 20:39:33,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:39:33,860 INFO L93 Difference]: Finished difference Result 192 states and 197 transitions. [2018-10-26 20:39:33,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 20:39:33,863 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 118 [2018-10-26 20:39:33,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:39:33,864 INFO L225 Difference]: With dead ends: 192 [2018-10-26 20:39:33,864 INFO L226 Difference]: Without dead ends: 187 [2018-10-26 20:39:33,865 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=98, Invalid=142, Unknown=0, NotChecked=0, Total=240 [2018-10-26 20:39:33,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-10-26 20:39:33,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 154. [2018-10-26 20:39:33,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-10-26 20:39:33,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 158 transitions. [2018-10-26 20:39:33,880 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 158 transitions. Word has length 118 [2018-10-26 20:39:33,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:39:33,881 INFO L481 AbstractCegarLoop]: Abstraction has 154 states and 158 transitions. [2018-10-26 20:39:33,881 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-26 20:39:33,881 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 158 transitions. [2018-10-26 20:39:33,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-10-26 20:39:33,885 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:39:33,885 INFO L375 BasicCegarLoop]: trace histogram [44, 40, 40, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:39:33,885 INFO L424 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:39:33,885 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:39:33,886 INFO L82 PathProgramCache]: Analyzing trace with hash -969563822, now seen corresponding path program 11 times [2018-10-26 20:39:33,886 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:39:33,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:39:33,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:39:33,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:39:33,887 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:39:33,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:39:34,135 INFO L134 CoverageAnalysis]: Checked inductivity of 2698 backedges. 0 proven. 2078 refuted. 0 times theorem prover too weak. 620 trivial. 0 not checked. [2018-10-26 20:39:34,135 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:39:34,135 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 20:39:34,135 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-26 20:39:34,136 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-26 20:39:34,136 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:39:34,136 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6463a22f-dd8d-4e3b-9af9-d4da25143050/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-10-26 20:39:34,142 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-26 20:39:34,142 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-26 20:39:34,194 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 35 check-sat command(s) [2018-10-26 20:39:34,194 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 20:39:34,197 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:39:34,468 INFO L134 CoverageAnalysis]: Checked inductivity of 2698 backedges. 0 proven. 2078 refuted. 0 times theorem prover too weak. 620 trivial. 0 not checked. [2018-10-26 20:39:34,468 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 20:39:34,539 INFO L134 CoverageAnalysis]: Checked inductivity of 2698 backedges. 0 proven. 2078 refuted. 0 times theorem prover too weak. 620 trivial. 0 not checked. [2018-10-26 20:39:34,556 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-26 20:39:34,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2018-10-26 20:39:34,556 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-26 20:39:34,556 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-26 20:39:34,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-26 20:39:34,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=201, Unknown=0, NotChecked=0, Total=342 [2018-10-26 20:39:34,557 INFO L87 Difference]: Start difference. First operand 154 states and 158 transitions. Second operand 13 states. [2018-10-26 20:39:34,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:39:34,689 INFO L93 Difference]: Finished difference Result 227 states and 233 transitions. [2018-10-26 20:39:34,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-26 20:39:34,690 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 153 [2018-10-26 20:39:34,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:39:34,691 INFO L225 Difference]: With dead ends: 227 [2018-10-26 20:39:34,691 INFO L226 Difference]: Without dead ends: 222 [2018-10-26 20:39:34,691 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 296 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=141, Invalid=201, Unknown=0, NotChecked=0, Total=342 [2018-10-26 20:39:34,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-10-26 20:39:34,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 189. [2018-10-26 20:39:34,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-10-26 20:39:34,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 194 transitions. [2018-10-26 20:39:34,705 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 194 transitions. Word has length 153 [2018-10-26 20:39:34,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:39:34,705 INFO L481 AbstractCegarLoop]: Abstraction has 189 states and 194 transitions. [2018-10-26 20:39:34,705 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-26 20:39:34,705 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 194 transitions. [2018-10-26 20:39:34,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-10-26 20:39:34,707 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:39:34,707 INFO L375 BasicCegarLoop]: trace histogram [55, 50, 50, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:39:34,708 INFO L424 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:39:34,708 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:39:34,708 INFO L82 PathProgramCache]: Analyzing trace with hash -1779605514, now seen corresponding path program 12 times [2018-10-26 20:39:34,708 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:39:34,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:39:34,709 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 20:39:34,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:39:34,709 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:39:34,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:39:35,141 INFO L134 CoverageAnalysis]: Checked inductivity of 4235 backedges. 0 proven. 3460 refuted. 0 times theorem prover too weak. 775 trivial. 0 not checked. [2018-10-26 20:39:35,141 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:39:35,141 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 20:39:35,141 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-26 20:39:35,141 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-26 20:39:35,141 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:39:35,141 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6463a22f-dd8d-4e3b-9af9-d4da25143050/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-10-26 20:39:35,148 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-26 20:39:35,148 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-10-26 20:39:35,182 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-26 20:39:35,182 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 20:39:35,184 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:39:35,299 INFO L134 CoverageAnalysis]: Checked inductivity of 4235 backedges. 0 proven. 3460 refuted. 0 times theorem prover too weak. 775 trivial. 0 not checked. [2018-10-26 20:39:35,299 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 20:39:35,370 INFO L134 CoverageAnalysis]: Checked inductivity of 4235 backedges. 0 proven. 3460 refuted. 0 times theorem prover too weak. 775 trivial. 0 not checked. [2018-10-26 20:39:35,387 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-26 20:39:35,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2018-10-26 20:39:35,387 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-26 20:39:35,387 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-26 20:39:35,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-26 20:39:35,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=225, Unknown=0, NotChecked=0, Total=380 [2018-10-26 20:39:35,388 INFO L87 Difference]: Start difference. First operand 189 states and 194 transitions. Second operand 15 states. [2018-10-26 20:39:35,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:39:35,662 INFO L93 Difference]: Finished difference Result 262 states and 269 transitions. [2018-10-26 20:39:35,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-26 20:39:35,666 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 188 [2018-10-26 20:39:35,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:39:35,667 INFO L225 Difference]: With dead ends: 262 [2018-10-26 20:39:35,667 INFO L226 Difference]: Without dead ends: 257 [2018-10-26 20:39:35,668 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 364 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=155, Invalid=225, Unknown=0, NotChecked=0, Total=380 [2018-10-26 20:39:35,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2018-10-26 20:39:35,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 224. [2018-10-26 20:39:35,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2018-10-26 20:39:35,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 230 transitions. [2018-10-26 20:39:35,687 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 230 transitions. Word has length 188 [2018-10-26 20:39:35,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:39:35,687 INFO L481 AbstractCegarLoop]: Abstraction has 224 states and 230 transitions. [2018-10-26 20:39:35,687 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-26 20:39:35,687 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 230 transitions. [2018-10-26 20:39:35,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2018-10-26 20:39:35,690 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:39:35,690 INFO L375 BasicCegarLoop]: trace histogram [66, 60, 60, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:39:35,690 INFO L424 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:39:35,691 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:39:35,691 INFO L82 PathProgramCache]: Analyzing trace with hash 388824786, now seen corresponding path program 13 times [2018-10-26 20:39:35,691 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:39:35,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:39:35,692 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 20:39:35,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:39:35,692 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:39:35,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:39:36,394 INFO L134 CoverageAnalysis]: Checked inductivity of 6117 backedges. 0 proven. 5187 refuted. 0 times theorem prover too weak. 930 trivial. 0 not checked. [2018-10-26 20:39:36,394 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:39:36,395 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 20:39:36,395 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-26 20:39:36,395 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-26 20:39:36,395 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:39:36,395 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6463a22f-dd8d-4e3b-9af9-d4da25143050/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-10-26 20:39:36,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:39:36,403 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-26 20:39:36,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:39:36,442 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:39:36,565 INFO L134 CoverageAnalysis]: Checked inductivity of 6117 backedges. 0 proven. 5187 refuted. 0 times theorem prover too weak. 930 trivial. 0 not checked. [2018-10-26 20:39:36,565 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 20:39:36,702 INFO L134 CoverageAnalysis]: Checked inductivity of 6117 backedges. 0 proven. 5187 refuted. 0 times theorem prover too weak. 930 trivial. 0 not checked. [2018-10-26 20:39:36,717 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-26 20:39:36,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 21 [2018-10-26 20:39:36,718 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-26 20:39:36,718 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-26 20:39:36,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-26 20:39:36,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=251, Unknown=0, NotChecked=0, Total=420 [2018-10-26 20:39:36,719 INFO L87 Difference]: Start difference. First operand 224 states and 230 transitions. Second operand 17 states. [2018-10-26 20:39:36,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:39:36,793 INFO L93 Difference]: Finished difference Result 297 states and 305 transitions. [2018-10-26 20:39:36,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-26 20:39:36,795 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 223 [2018-10-26 20:39:36,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:39:36,796 INFO L225 Difference]: With dead ends: 297 [2018-10-26 20:39:36,796 INFO L226 Difference]: Without dead ends: 292 [2018-10-26 20:39:36,797 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 455 GetRequests, 432 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=169, Invalid=251, Unknown=0, NotChecked=0, Total=420 [2018-10-26 20:39:36,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2018-10-26 20:39:36,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 259. [2018-10-26 20:39:36,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2018-10-26 20:39:36,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 266 transitions. [2018-10-26 20:39:36,817 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 266 transitions. Word has length 223 [2018-10-26 20:39:36,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:39:36,817 INFO L481 AbstractCegarLoop]: Abstraction has 259 states and 266 transitions. [2018-10-26 20:39:36,817 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-26 20:39:36,817 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 266 transitions. [2018-10-26 20:39:36,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2018-10-26 20:39:36,822 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:39:36,823 INFO L375 BasicCegarLoop]: trace histogram [77, 70, 70, 8, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:39:36,823 INFO L424 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:39:36,823 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:39:36,823 INFO L82 PathProgramCache]: Analyzing trace with hash -1062399370, now seen corresponding path program 14 times [2018-10-26 20:39:36,823 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:39:36,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:39:36,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:39:36,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:39:36,824 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:39:36,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:39:37,053 INFO L134 CoverageAnalysis]: Checked inductivity of 8344 backedges. 0 proven. 7259 refuted. 0 times theorem prover too weak. 1085 trivial. 0 not checked. [2018-10-26 20:39:37,054 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:39:37,054 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 20:39:37,054 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-26 20:39:37,054 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-26 20:39:37,054 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:39:37,054 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6463a22f-dd8d-4e3b-9af9-d4da25143050/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-10-26 20:39:37,062 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-26 20:39:37,062 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-26 20:39:37,179 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 38 check-sat command(s) [2018-10-26 20:39:37,179 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 20:39:37,182 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:39:37,498 INFO L134 CoverageAnalysis]: Checked inductivity of 8344 backedges. 0 proven. 7259 refuted. 0 times theorem prover too weak. 1085 trivial. 0 not checked. [2018-10-26 20:39:37,499 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 20:39:37,637 INFO L134 CoverageAnalysis]: Checked inductivity of 8344 backedges. 0 proven. 7259 refuted. 0 times theorem prover too weak. 1085 trivial. 0 not checked. [2018-10-26 20:39:37,654 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-26 20:39:37,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 22 [2018-10-26 20:39:37,654 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-26 20:39:37,654 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-26 20:39:37,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-26 20:39:37,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=279, Unknown=0, NotChecked=0, Total=462 [2018-10-26 20:39:37,655 INFO L87 Difference]: Start difference. First operand 259 states and 266 transitions. Second operand 19 states. [2018-10-26 20:39:37,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:39:37,719 INFO L93 Difference]: Finished difference Result 332 states and 341 transitions. [2018-10-26 20:39:37,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-26 20:39:37,719 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 258 [2018-10-26 20:39:37,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:39:37,721 INFO L225 Difference]: With dead ends: 332 [2018-10-26 20:39:37,721 INFO L226 Difference]: Without dead ends: 327 [2018-10-26 20:39:37,721 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 526 GetRequests, 500 SyntacticMatches, 6 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=183, Invalid=279, Unknown=0, NotChecked=0, Total=462 [2018-10-26 20:39:37,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2018-10-26 20:39:37,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 294. [2018-10-26 20:39:37,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2018-10-26 20:39:37,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 302 transitions. [2018-10-26 20:39:37,747 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 302 transitions. Word has length 258 [2018-10-26 20:39:37,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:39:37,748 INFO L481 AbstractCegarLoop]: Abstraction has 294 states and 302 transitions. [2018-10-26 20:39:37,748 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-26 20:39:37,748 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 302 transitions. [2018-10-26 20:39:37,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2018-10-26 20:39:37,751 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:39:37,751 INFO L375 BasicCegarLoop]: trace histogram [88, 80, 80, 9, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:39:37,751 INFO L424 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:39:37,752 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:39:37,752 INFO L82 PathProgramCache]: Analyzing trace with hash -790873006, now seen corresponding path program 15 times [2018-10-26 20:39:37,752 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:39:37,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:39:37,753 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 20:39:37,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:39:37,753 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:39:37,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:39:38,075 INFO L134 CoverageAnalysis]: Checked inductivity of 10916 backedges. 0 proven. 9676 refuted. 0 times theorem prover too weak. 1240 trivial. 0 not checked. [2018-10-26 20:39:38,075 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:39:38,075 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 20:39:38,075 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-26 20:39:38,075 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-26 20:39:38,076 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:39:38,076 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6463a22f-dd8d-4e3b-9af9-d4da25143050/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-10-26 20:39:38,082 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-26 20:39:38,082 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-10-26 20:39:38,134 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-26 20:39:38,135 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 20:39:38,138 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:39:38,319 INFO L134 CoverageAnalysis]: Checked inductivity of 10916 backedges. 0 proven. 9676 refuted. 0 times theorem prover too weak. 1240 trivial. 0 not checked. [2018-10-26 20:39:38,319 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 20:39:38,495 INFO L134 CoverageAnalysis]: Checked inductivity of 10916 backedges. 0 proven. 9676 refuted. 0 times theorem prover too weak. 1240 trivial. 0 not checked. [2018-10-26 20:39:38,527 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-26 20:39:38,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2018-10-26 20:39:38,527 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-26 20:39:38,527 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-26 20:39:38,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-26 20:39:38,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=309, Unknown=0, NotChecked=0, Total=506 [2018-10-26 20:39:38,528 INFO L87 Difference]: Start difference. First operand 294 states and 302 transitions. Second operand 21 states. [2018-10-26 20:39:38,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:39:38,622 INFO L93 Difference]: Finished difference Result 367 states and 377 transitions. [2018-10-26 20:39:38,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-26 20:39:38,623 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 293 [2018-10-26 20:39:38,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:39:38,624 INFO L225 Difference]: With dead ends: 367 [2018-10-26 20:39:38,624 INFO L226 Difference]: Without dead ends: 362 [2018-10-26 20:39:38,624 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 597 GetRequests, 568 SyntacticMatches, 8 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=197, Invalid=309, Unknown=0, NotChecked=0, Total=506 [2018-10-26 20:39:38,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2018-10-26 20:39:38,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 329. [2018-10-26 20:39:38,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2018-10-26 20:39:38,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 338 transitions. [2018-10-26 20:39:38,658 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 338 transitions. Word has length 293 [2018-10-26 20:39:38,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:39:38,659 INFO L481 AbstractCegarLoop]: Abstraction has 329 states and 338 transitions. [2018-10-26 20:39:38,659 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-26 20:39:38,659 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 338 transitions. [2018-10-26 20:39:38,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2018-10-26 20:39:38,662 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:39:38,663 INFO L375 BasicCegarLoop]: trace histogram [99, 90, 90, 10, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:39:38,663 INFO L424 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:39:38,663 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:39:38,663 INFO L82 PathProgramCache]: Analyzing trace with hash 547939574, now seen corresponding path program 16 times [2018-10-26 20:39:38,663 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:39:38,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:39:38,666 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 20:39:38,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:39:38,666 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:39:38,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:39:38,986 INFO L134 CoverageAnalysis]: Checked inductivity of 13833 backedges. 0 proven. 12438 refuted. 0 times theorem prover too weak. 1395 trivial. 0 not checked. [2018-10-26 20:39:38,986 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:39:38,986 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 20:39:38,986 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-26 20:39:38,986 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-26 20:39:38,987 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:39:38,987 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6463a22f-dd8d-4e3b-9af9-d4da25143050/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-10-26 20:39:38,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:39:38,994 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-26 20:39:39,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:39:39,069 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:39:39,328 INFO L134 CoverageAnalysis]: Checked inductivity of 13833 backedges. 0 proven. 12438 refuted. 0 times theorem prover too weak. 1395 trivial. 0 not checked. [2018-10-26 20:39:39,328 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 20:39:39,457 INFO L134 CoverageAnalysis]: Checked inductivity of 13833 backedges. 0 proven. 12438 refuted. 0 times theorem prover too weak. 1395 trivial. 0 not checked. [2018-10-26 20:39:39,473 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-26 20:39:39,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 23 [2018-10-26 20:39:39,473 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-26 20:39:39,474 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-26 20:39:39,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-26 20:39:39,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=308, Unknown=0, NotChecked=0, Total=506 [2018-10-26 20:39:39,474 INFO L87 Difference]: Start difference. First operand 329 states and 338 transitions. Second operand 23 states. [2018-10-26 20:39:39,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:39:39,691 INFO L93 Difference]: Finished difference Result 402 states and 413 transitions. [2018-10-26 20:39:39,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-26 20:39:39,692 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 328 [2018-10-26 20:39:39,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:39:39,694 INFO L225 Difference]: With dead ends: 402 [2018-10-26 20:39:39,694 INFO L226 Difference]: Without dead ends: 397 [2018-10-26 20:39:39,694 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 669 GetRequests, 636 SyntacticMatches, 11 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 399 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=212, Invalid=340, Unknown=0, NotChecked=0, Total=552 [2018-10-26 20:39:39,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2018-10-26 20:39:39,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 364. [2018-10-26 20:39:39,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2018-10-26 20:39:39,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 374 transitions. [2018-10-26 20:39:39,732 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 374 transitions. Word has length 328 [2018-10-26 20:39:39,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:39:39,733 INFO L481 AbstractCegarLoop]: Abstraction has 364 states and 374 transitions. [2018-10-26 20:39:39,733 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-26 20:39:39,733 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 374 transitions. [2018-10-26 20:39:39,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 364 [2018-10-26 20:39:39,734 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:39:39,737 INFO L375 BasicCegarLoop]: trace histogram [110, 100, 100, 11, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:39:39,737 INFO L424 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:39:39,737 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:39:39,737 INFO L82 PathProgramCache]: Analyzing trace with hash 1390107090, now seen corresponding path program 17 times [2018-10-26 20:39:39,737 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:39:39,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:39:39,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:39:39,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:39:39,738 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:39:39,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:39:43,604 INFO L134 CoverageAnalysis]: Checked inductivity of 17095 backedges. 17077 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-26 20:39:43,605 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:39:43,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [105] imperfect sequences [] total 105 [2018-10-26 20:39:43,605 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:39:43,605 INFO L460 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-10-26 20:39:43,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-10-26 20:39:43,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5257, Invalid=5663, Unknown=0, NotChecked=0, Total=10920 [2018-10-26 20:39:43,608 INFO L87 Difference]: Start difference. First operand 364 states and 374 transitions. Second operand 105 states. [2018-10-26 20:39:46,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:39:46,466 INFO L93 Difference]: Finished difference Result 14899 states and 15359 transitions. [2018-10-26 20:39:46,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-10-26 20:39:46,466 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 363 [2018-10-26 20:39:46,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:39:46,467 INFO L225 Difference]: With dead ends: 14899 [2018-10-26 20:39:46,467 INFO L226 Difference]: Without dead ends: 0 [2018-10-26 20:39:46,487 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5261, Invalid=5869, Unknown=0, NotChecked=0, Total=11130 [2018-10-26 20:39:46,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-26 20:39:46,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-26 20:39:46,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-26 20:39:46,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-26 20:39:46,488 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 363 [2018-10-26 20:39:46,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:39:46,488 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-26 20:39:46,488 INFO L482 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-10-26 20:39:46,488 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-26 20:39:46,488 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-26 20:39:46,496 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-26 20:39:48,258 WARN L179 SmtUtils]: Spent 1.74 s on a formula simplification. DAG size of input: 673 DAG size of output: 664 [2018-10-26 20:39:51,366 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:39:53,176 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:39:53,179 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:39:53,200 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:39:53,220 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:39:53,233 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:39:53,307 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:39:53,423 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:39:53,481 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:39:53,512 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:39:53,534 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:39:53,583 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:39:53,605 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:39:53,659 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:39:53,700 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:39:53,772 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:39:53,785 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:39:53,928 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:39:54,012 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:39:54,018 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:39:54,046 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:39:54,177 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:39:54,195 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:39:54,218 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:39:54,298 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:39:54,420 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:39:54,499 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:39:54,590 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:39:54,633 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:39:54,725 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:39:54,963 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:39:55,034 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:39:55,048 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:39:55,281 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:39:55,363 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:39:55,455 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:39:55,550 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:39:55,656 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:39:55,763 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:39:55,771 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:39:56,160 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:39:56,286 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:39:56,592 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:39:56,653 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:39:56,736 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:39:56,811 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:39:57,231 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:39:57,241 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:39:57,329 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:39:57,383 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:39:57,433 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:39:57,547 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:39:57,584 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:39:57,718 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:39:57,911 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:39:58,259 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:39:58,329 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:39:58,336 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:39:58,344 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:39:58,507 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:39:58,653 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:39:58,676 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:39:58,691 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:39:58,747 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:39:58,759 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:39:58,855 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:39:59,007 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:39:59,113 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:39:59,203 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:39:59,766 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:39:59,921 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:40:00,140 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:40:00,173 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:40:00,240 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:40:00,766 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:40:00,947 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:40:00,974 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:40:01,009 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:40:01,376 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:40:01,405 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:40:01,547 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:40:02,193 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:40:02,267 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:40:02,528 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:40:02,617 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:40:02,786 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:40:03,187 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:40:03,320 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:40:03,388 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:40:03,877 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:40:03,907 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:40:03,917 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:40:04,066 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:40:04,148 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:40:04,394 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:40:04,573 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:40:04,885 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:40:05,409 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:40:06,107 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:40:06,651 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:40:06,799 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:40:07,346 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:40:07,943 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:40:08,486 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:40:08,797 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:40:09,482 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:40:09,520 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:40:09,870 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:40:09,948 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:40:10,198 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:40:10,225 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:40:10,343 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:40:10,412 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:40:10,442 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:40:10,909 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:40:11,652 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:40:11,719 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:40:11,786 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:40:11,923 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:40:12,139 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:40:12,716 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:40:12,813 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:40:13,078 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:40:13,106 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:40:13,927 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:40:14,012 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:40:15,611 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:40:15,671 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:40:15,807 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:40:16,497 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:40:17,386 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:40:17,560 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:40:18,356 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:40:18,776 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:40:19,082 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:40:19,115 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:40:19,148 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:40:19,585 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:40:20,606 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:40:21,331 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:40:22,000 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:40:22,442 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:40:22,637 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:40:22,871 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:40:22,961 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:40:23,828 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:40:24,752 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:40:24,803 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:40:25,504 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:40:26,619 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:40:26,855 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:40:28,422 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:40:29,198 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:40:29,693 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:40:32,083 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:40:32,122 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:40:32,427 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:40:32,657 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:40:32,738 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:40:32,758 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:40:33,080 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:40:34,180 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:40:35,498 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:40:37,586 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:40:43,457 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:40:43,966 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:40:45,695 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:40:47,893 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:40:47,958 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:40:48,157 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:40:48,308 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:40:48,675 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:40:51,961 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:40:52,051 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 20:41:04,246 WARN L179 SmtUtils]: Spent 1.27 m on a formula simplification. DAG size of input: 5167 DAG size of output: 2220 [2018-10-26 20:41:08,253 WARN L179 SmtUtils]: Spent 3.98 s on a formula simplification. DAG size of input: 664 DAG size of output: 59 [2018-10-26 20:42:04,664 WARN L179 SmtUtils]: Spent 56.40 s on a formula simplification. DAG size of input: 2199 DAG size of output: 362 [2018-10-26 20:42:04,667 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-10-26 20:42:04,667 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-10-26 20:42:04,667 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-26 20:42:04,668 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-10-26 20:42:04,668 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-10-26 20:42:04,668 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-26 20:42:04,668 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 10 24) no Hoare annotation was computed. [2018-10-26 20:42:04,668 INFO L425 ceAbstractionStarter]: For program point L17-1(lines 17 21) no Hoare annotation was computed. [2018-10-26 20:42:04,668 INFO L425 ceAbstractionStarter]: For program point L15(line 15) no Hoare annotation was computed. [2018-10-26 20:42:04,668 INFO L425 ceAbstractionStarter]: For program point L17-3(lines 17 21) no Hoare annotation was computed. [2018-10-26 20:42:04,668 INFO L421 ceAbstractionStarter]: At program point L17-4(lines 17 21) the Hoare annotation is: (let ((.cse0 (<= 10 main_~m~0)) (.cse1 (<= 10 main_~n~0))) (or (and (<= 30 main_~k~0) (<= main_~i~0 3) .cse0 .cse1) (and .cse0 (<= 100 main_~k~0) .cse1) (and .cse0 (<= 40 main_~k~0) (<= main_~i~0 4) .cse1) (and .cse0 (<= 0 main_~k~0) (<= main_~i~0 0) .cse1) (and .cse0 (<= 60 main_~k~0) (<= main_~i~0 6) .cse1) (and .cse0 (<= 10 main_~k~0) (<= main_~i~0 1) .cse1) (and (<= 80 main_~k~0) .cse0 (<= main_~i~0 8) .cse1) (and (<= 50 main_~k~0) .cse0 (<= main_~i~0 5) .cse1) (and .cse0 (<= main_~i~0 9) .cse1 (<= 90 main_~k~0)) (and (<= 70 main_~k~0) .cse0 (<= main_~i~0 7) .cse1) (and .cse0 (<= 20 main_~k~0) (<= main_~i~0 2) .cse1))) [2018-10-26 20:42:04,668 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 10 24) no Hoare annotation was computed. [2018-10-26 20:42:04,669 INFO L421 ceAbstractionStarter]: At program point L17-5(lines 17 21) the Hoare annotation is: (and (<= 10 main_~m~0) (<= 100 main_~k~0) (<= 10 main_~n~0)) [2018-10-26 20:42:04,669 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 10 24) the Hoare annotation is: true [2018-10-26 20:42:04,669 INFO L425 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2018-10-26 20:42:04,669 INFO L425 ceAbstractionStarter]: For program point L18-1(lines 18 20) no Hoare annotation was computed. [2018-10-26 20:42:04,669 INFO L425 ceAbstractionStarter]: For program point L16(line 16) no Hoare annotation was computed. [2018-10-26 20:42:04,669 INFO L425 ceAbstractionStarter]: For program point L18-3(lines 18 20) no Hoare annotation was computed. [2018-10-26 20:42:04,670 INFO L421 ceAbstractionStarter]: At program point L18-4(lines 18 20) the Hoare annotation is: (let ((.cse27 (<= main_~j~0 4)) (.cse40 (<= main_~j~0 5)) (.cse37 (<= main_~j~0 2)) (.cse25 (<= main_~j~0 6)) (.cse8 (<= main_~j~0 0)) (.cse31 (<= main_~j~0 1)) (.cse30 (<= main_~j~0 9)) (.cse10 (<= main_~j~0 7)) (.cse15 (<= main_~j~0 8)) (.cse4 (<= 10 main_~n~0)) (.cse3 (<= 10 main_~m~0)) (.cse12 (<= main_~j~0 3))) (let ((.cse36 (<= 10 main_~k~0)) (.cse38 (<= 30 main_~k~0)) (.cse16 (<= main_~i~0 0)) (.cse23 (<= 70 main_~k~0)) (.cse14 (and .cse3 .cse12)) (.cse7 (<= 60 main_~k~0)) (.cse35 (<= 90 main_~k~0)) (.cse32 (<= 20 main_~k~0)) (.cse20 (and .cse15 .cse3 .cse4)) (.cse6 (and .cse3 .cse10 .cse4)) (.cse29 (<= 50 main_~k~0)) (.cse18 (and .cse3 .cse30)) (.cse24 (<= main_~i~0 7)) (.cse0 (and .cse3 .cse31 .cse4)) (.cse39 (<= 80 main_~k~0)) (.cse5 (<= main_~i~0 8)) (.cse34 (and .cse3 .cse8 .cse4)) (.cse11 (<= main_~i~0 3)) (.cse26 (and .cse3 .cse4 .cse25)) (.cse19 (and .cse3 .cse37)) (.cse9 (<= main_~i~0 1)) (.cse28 (<= main_~i~0 2)) (.cse13 (<= main_~i~0 5)) (.cse21 (and .cse40 .cse3)) (.cse1 (<= main_~i~0 6)) (.cse2 (<= (+ main_~i~0 1) main_~n~0)) (.cse17 (and .cse3 .cse27)) (.cse33 (<= 40 main_~k~0)) (.cse22 (<= main_~i~0 4))) (or (and .cse0 .cse1 (<= 61 main_~k~0)) (and (<= 100 main_~k~0) (and .cse2 .cse3 .cse4)) (and .cse5 .cse6 (<= 87 main_~k~0)) (and .cse3 .cse7 .cse8 .cse1 .cse4) (and .cse3 .cse9 (<= 17 main_~k~0) .cse10 .cse4) (and (<= 33 main_~k~0) .cse11 .cse3 .cse12 .cse4) (and (<= 53 main_~k~0) .cse13 .cse14 .cse4) (and .cse13 .cse0 (<= 51 main_~k~0)) (and .cse15 .cse3 (<= 8 main_~k~0) .cse16 .cse4) (and (<= 64 main_~k~0) .cse1 .cse4 .cse17) (and (<= 99 main_~k~0) (and .cse2 .cse18 .cse4)) (and (<= 82 main_~k~0) .cse19 .cse5 .cse4) (and (<= 89 main_~k~0) .cse18 .cse5 .cse4) (and (<= 69 main_~k~0) .cse18 .cse1 .cse4) (and .cse3 .cse12 (<= 3 main_~k~0) .cse16 .cse4) (and .cse20 .cse5 (<= 88 main_~k~0)) (and .cse21 (<= 45 main_~k~0) .cse22 .cse4) (and .cse23 .cse3 .cse8 .cse24 .cse4) (and .cse3 (<= 6 main_~k~0) .cse16 .cse4 .cse25) (and (and .cse2 .cse26) (<= 96 main_~k~0)) (and (<= 63 main_~k~0) .cse14 .cse1 .cse4) (and .cse3 (<= 0 main_~k~0) .cse8 .cse16 .cse4) (and .cse11 .cse3 .cse27 (<= 34 main_~k~0) .cse4) (and .cse15 (<= 28 main_~k~0) .cse3 .cse28 .cse4) (and .cse13 (<= 52 main_~k~0) .cse19 .cse4) (and .cse29 .cse22 .cse3 .cse4) (and .cse3 (<= 9 main_~k~0) .cse30 .cse16 .cse4) (and (<= 21 main_~k~0) .cse3 .cse31 .cse28 .cse4) (and .cse22 .cse26 (<= 46 main_~k~0)) (and .cse11 .cse3 (<= 39 main_~k~0) .cse30 .cse4) (and (<= 67 main_~k~0) .cse6 .cse1) (and .cse22 .cse19 (<= 42 main_~k~0) .cse4) (and .cse3 .cse12 .cse9 (<= 13 main_~k~0) .cse4) (and .cse22 (<= 43 main_~k~0) .cse14 .cse4) (and .cse3 .cse32 .cse9 .cse4) (and (<= 97 main_~k~0) (and .cse2 .cse6)) (and .cse11 (<= 32 main_~k~0) .cse19 .cse4) (and (<= 58 main_~k~0) .cse13 .cse20) (and .cse11 .cse3 .cse33 .cse4) (and .cse19 .cse24 (<= 72 main_~k~0) .cse4) (and (and .cse2 .cse34) .cse35) (and .cse3 .cse36 .cse16 .cse4) (and .cse3 .cse31 .cse16 .cse4 (<= 1 main_~k~0)) (and .cse3 (<= 22 main_~k~0) .cse28 .cse37 .cse4) (and (<= 11 main_~k~0) .cse3 .cse31 .cse9 .cse4) (and .cse38 .cse11 .cse3 .cse8 .cse4) (and .cse39 .cse3 .cse24 .cse4) (and .cse40 .cse3 (<= 5 main_~k~0) .cse16 .cse4) (and (<= 75 main_~k~0) .cse21 .cse24 .cse4) (and .cse3 (<= 29 main_~k~0) .cse28 .cse30 .cse4) (and .cse40 .cse3 (<= 25 main_~k~0) .cse28 .cse4) (and .cse3 (<= 26 main_~k~0) .cse28 .cse4 .cse25) (and .cse3 .cse36 .cse9 .cse8 .cse4) (and .cse11 .cse0 (<= 31 main_~k~0)) (and (<= 66 main_~k~0) .cse26 .cse1) (and (<= 83 main_~k~0) .cse5 .cse14 .cse4) (and .cse3 .cse22 .cse27 (<= 44 main_~k~0) .cse4) (and .cse3 (<= 7 main_~k~0) .cse10 .cse16 .cse4) (and .cse22 .cse6 (<= 47 main_~k~0)) (and (<= 2 main_~k~0) .cse3 .cse37 .cse16 .cse4) (and .cse24 .cse14 .cse4 (<= 73 main_~k~0)) (and .cse26 .cse24 (<= 76 main_~k~0)) (and (<= 23 main_~k~0) .cse3 .cse12 .cse28 .cse4) (and (<= 78 main_~k~0) .cse20 .cse24) (and .cse3 .cse22 .cse30 (<= 49 main_~k~0) .cse4) (and .cse3 .cse28 .cse27 .cse4 (<= 24 main_~k~0)) (and (<= 84 main_~k~0) .cse5 .cse4 .cse17) (and .cse38 .cse3 .cse28 .cse4) (and .cse11 .cse3 (<= 36 main_~k~0) .cse4 .cse25) (and .cse3 .cse27 .cse16 (<= 4 main_~k~0) .cse4) (and .cse23 .cse3 .cse1 .cse4) (and (and .cse2 .cse14 .cse4) (<= 93 main_~k~0)) (and (<= 37 main_~k~0) .cse11 .cse3 .cse10 .cse4) (and .cse13 .cse6 (<= 57 main_~k~0)) (and (<= 95 main_~k~0) (and .cse2 .cse21 .cse4)) (and .cse0 (<= 81 main_~k~0) .cse5) (and (<= 68 main_~k~0) .cse20 .cse1) (and .cse7 .cse3 .cse13 .cse4) (and .cse20 .cse22 (<= 48 main_~k~0)) (and (<= 59 main_~k~0) .cse13 .cse18 .cse4) (and .cse5 .cse3 .cse4 .cse35) (and .cse3 .cse9 .cse37 (<= 12 main_~k~0) .cse4) (and .cse11 .cse40 .cse3 (<= 35 main_~k~0) .cse4) (and .cse3 .cse32 .cse28 .cse8 .cse4) (and (and .cse2 .cse20) (<= 98 main_~k~0)) (and .cse6 .cse24 (<= 77 main_~k~0)) (and .cse29 .cse3 .cse13 .cse8 .cse4) (and (<= 85 main_~k~0) .cse21 .cse5 .cse4) (and .cse22 .cse0 (<= 41 main_~k~0)) (and .cse3 .cse9 .cse30 .cse4 (<= 19 main_~k~0)) (and .cse40 .cse3 (<= 15 main_~k~0) .cse9 .cse4) (and .cse18 .cse24 (<= 79 main_~k~0) .cse4) (and (<= 54 main_~k~0) .cse13 .cse4 .cse17) (and (<= 74 main_~k~0) .cse24 .cse4 .cse17) (and .cse0 (<= 71 main_~k~0) .cse24) (and (<= 86 main_~k~0) .cse5 .cse26) (and (and .cse2 .cse19 .cse4) (<= 92 main_~k~0)) (and .cse15 .cse3 (<= 18 main_~k~0) .cse9 .cse4) (and (<= 91 main_~k~0) (and .cse2 .cse0)) (and .cse39 .cse5 .cse34) (and (<= 16 main_~k~0) .cse3 .cse9 .cse4 .cse25) (and .cse11 .cse15 .cse3 (<= 38 main_~k~0) .cse4) (and (<= 56 main_~k~0) .cse26 .cse13) (and .cse19 (<= 62 main_~k~0) .cse1 .cse4) (and (<= 14 main_~k~0) .cse3 .cse9 .cse27 .cse4) (and .cse3 .cse28 .cse10 .cse4 (<= 27 main_~k~0)) (and .cse21 (<= 55 main_~k~0) .cse13 .cse4) (and .cse21 (<= 65 main_~k~0) .cse1 .cse4) (and (and .cse2 .cse4 .cse17) (<= 94 main_~k~0)) (and .cse3 .cse33 .cse22 .cse8 .cse4)))) [2018-10-26 20:42:04,671 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-10-26 20:42:04,671 INFO L428 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2018-10-26 20:42:04,671 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2018-10-26 20:42:04,671 INFO L425 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-10-26 20:42:04,671 INFO L425 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-10-26 20:42:04,671 INFO L425 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2018-10-26 20:42:04,698 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.10 08:42:04 BoogieIcfgContainer [2018-10-26 20:42:04,698 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-26 20:42:04,699 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-26 20:42:04,699 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-26 20:42:04,699 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-26 20:42:04,699 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 08:39:25" (3/4) ... [2018-10-26 20:42:04,703 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-10-26 20:42:04,708 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-10-26 20:42:04,709 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-10-26 20:42:04,709 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-10-26 20:42:04,713 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2018-10-26 20:42:04,714 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-10-26 20:42:04,714 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-10-26 20:42:04,763 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_6463a22f-dd8d-4e3b-9af9-d4da25143050/bin-2019/utaipan/witness.graphml [2018-10-26 20:42:04,763 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-26 20:42:04,764 INFO L168 Benchmark]: Toolchain (without parser) took 159965.34 ms. Allocated memory was 1.0 GB in the beginning and 4.8 GB in the end (delta: 3.8 GB). Free memory was 959.3 MB in the beginning and 1.1 GB in the end (delta: -156.7 MB). Peak memory consumption was 3.6 GB. Max. memory is 11.5 GB. [2018-10-26 20:42:04,764 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 20:42:04,765 INFO L168 Benchmark]: CACSL2BoogieTranslator took 179.81 ms. Allocated memory is still 1.0 GB. Free memory was 959.3 MB in the beginning and 948.4 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 11.5 GB. [2018-10-26 20:42:04,765 INFO L168 Benchmark]: Boogie Procedure Inliner took 20.44 ms. Allocated memory is still 1.0 GB. Free memory is still 948.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 20:42:04,765 INFO L168 Benchmark]: Boogie Preprocessor took 26.01 ms. Allocated memory is still 1.0 GB. Free memory was 948.4 MB in the beginning and 945.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-10-26 20:42:04,766 INFO L168 Benchmark]: RCFGBuilder took 540.32 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 159.9 MB). Free memory was 945.7 MB in the beginning and 1.1 GB in the end (delta: -191.1 MB). Peak memory consumption was 20.1 MB. Max. memory is 11.5 GB. [2018-10-26 20:42:04,766 INFO L168 Benchmark]: TraceAbstraction took 159129.54 ms. Allocated memory was 1.2 GB in the beginning and 4.8 GB in the end (delta: 3.6 GB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.8 MB). Peak memory consumption was 4.2 GB. Max. memory is 11.5 GB. [2018-10-26 20:42:04,770 INFO L168 Benchmark]: Witness Printer took 64.38 ms. Allocated memory is still 4.8 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 20:42:04,772 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.21 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 179.81 ms. Allocated memory is still 1.0 GB. Free memory was 959.3 MB in the beginning and 948.4 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 20.44 ms. Allocated memory is still 1.0 GB. Free memory is still 948.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 26.01 ms. Allocated memory is still 1.0 GB. Free memory was 948.4 MB in the beginning and 945.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 540.32 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 159.9 MB). Free memory was 945.7 MB in the beginning and 1.1 GB in the end (delta: -191.1 MB). Peak memory consumption was 20.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 159129.54 ms. Allocated memory was 1.2 GB in the beginning and 4.8 GB in the end (delta: 3.6 GB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.8 MB). Peak memory consumption was 4.2 GB. Max. memory is 11.5 GB. * Witness Printer took 64.38 ms. Allocated memory is still 4.8 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: ((((((((((((30 <= k && i <= 3) && 10 <= m) && 10 <= n) || ((10 <= m && 100 <= k) && 10 <= n)) || (((10 <= m && 40 <= k) && i <= 4) && 10 <= n)) || (((10 <= m && 0 <= k) && i <= 0) && 10 <= n)) || (((10 <= m && 60 <= k) && i <= 6) && 10 <= n)) || (((10 <= m && 10 <= k) && i <= 1) && 10 <= n)) || (((80 <= k && 10 <= m) && i <= 8) && 10 <= n)) || (((50 <= k && 10 <= m) && i <= 5) && 10 <= n)) || (((10 <= m && i <= 9) && 10 <= n) && 90 <= k)) || (((70 <= k && 10 <= m) && i <= 7) && 10 <= n)) || (((10 <= m && 20 <= k) && i <= 2) && 10 <= n) - InvariantResult [Line: 18]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((10 <= m && j <= 1) && 10 <= n) && i <= 6) && 61 <= k) || (100 <= k && (i + 1 <= n && 10 <= m) && 10 <= n)) || ((i <= 8 && (10 <= m && j <= 7) && 10 <= n) && 87 <= k)) || ((((10 <= m && 60 <= k) && j <= 0) && i <= 6) && 10 <= n)) || ((((10 <= m && i <= 1) && 17 <= k) && j <= 7) && 10 <= n)) || ((((33 <= k && i <= 3) && 10 <= m) && j <= 3) && 10 <= n)) || (((53 <= k && i <= 5) && 10 <= m && j <= 3) && 10 <= n)) || ((i <= 5 && (10 <= m && j <= 1) && 10 <= n) && 51 <= k)) || ((((j <= 8 && 10 <= m) && 8 <= k) && i <= 0) && 10 <= n)) || (((64 <= k && i <= 6) && 10 <= n) && 10 <= m && j <= 4)) || (99 <= k && (i + 1 <= n && 10 <= m && j <= 9) && 10 <= n)) || (((82 <= k && 10 <= m && j <= 2) && i <= 8) && 10 <= n)) || (((89 <= k && 10 <= m && j <= 9) && i <= 8) && 10 <= n)) || (((69 <= k && 10 <= m && j <= 9) && i <= 6) && 10 <= n)) || ((((10 <= m && j <= 3) && 3 <= k) && i <= 0) && 10 <= n)) || ((((j <= 8 && 10 <= m) && 10 <= n) && i <= 8) && 88 <= k)) || ((((j <= 5 && 10 <= m) && 45 <= k) && i <= 4) && 10 <= n)) || ((((70 <= k && 10 <= m) && j <= 0) && i <= 7) && 10 <= n)) || ((((10 <= m && 6 <= k) && i <= 0) && 10 <= n) && j <= 6)) || ((i + 1 <= n && (10 <= m && 10 <= n) && j <= 6) && 96 <= k)) || (((63 <= k && 10 <= m && j <= 3) && i <= 6) && 10 <= n)) || ((((10 <= m && 0 <= k) && j <= 0) && i <= 0) && 10 <= n)) || ((((i <= 3 && 10 <= m) && j <= 4) && 34 <= k) && 10 <= n)) || ((((j <= 8 && 28 <= k) && 10 <= m) && i <= 2) && 10 <= n)) || (((i <= 5 && 52 <= k) && 10 <= m && j <= 2) && 10 <= n)) || (((50 <= k && i <= 4) && 10 <= m) && 10 <= n)) || ((((10 <= m && 9 <= k) && j <= 9) && i <= 0) && 10 <= n)) || ((((21 <= k && 10 <= m) && j <= 1) && i <= 2) && 10 <= n)) || ((i <= 4 && (10 <= m && 10 <= n) && j <= 6) && 46 <= k)) || ((((i <= 3 && 10 <= m) && 39 <= k) && j <= 9) && 10 <= n)) || ((67 <= k && (10 <= m && j <= 7) && 10 <= n) && i <= 6)) || (((i <= 4 && 10 <= m && j <= 2) && 42 <= k) && 10 <= n)) || ((((10 <= m && j <= 3) && i <= 1) && 13 <= k) && 10 <= n)) || (((i <= 4 && 43 <= k) && 10 <= m && j <= 3) && 10 <= n)) || (((10 <= m && 20 <= k) && i <= 1) && 10 <= n)) || (97 <= k && i + 1 <= n && (10 <= m && j <= 7) && 10 <= n)) || (((i <= 3 && 32 <= k) && 10 <= m && j <= 2) && 10 <= n)) || ((58 <= k && i <= 5) && (j <= 8 && 10 <= m) && 10 <= n)) || (((i <= 3 && 10 <= m) && 40 <= k) && 10 <= n)) || ((((10 <= m && j <= 2) && i <= 7) && 72 <= k) && 10 <= n)) || ((i + 1 <= n && (10 <= m && j <= 0) && 10 <= n) && 90 <= k)) || (((10 <= m && 10 <= k) && i <= 0) && 10 <= n)) || ((((10 <= m && j <= 1) && i <= 0) && 10 <= n) && 1 <= k)) || ((((10 <= m && 22 <= k) && i <= 2) && j <= 2) && 10 <= n)) || ((((11 <= k && 10 <= m) && j <= 1) && i <= 1) && 10 <= n)) || ((((30 <= k && i <= 3) && 10 <= m) && j <= 0) && 10 <= n)) || (((80 <= k && 10 <= m) && i <= 7) && 10 <= n)) || ((((j <= 5 && 10 <= m) && 5 <= k) && i <= 0) && 10 <= n)) || (((75 <= k && j <= 5 && 10 <= m) && i <= 7) && 10 <= n)) || ((((10 <= m && 29 <= k) && i <= 2) && j <= 9) && 10 <= n)) || ((((j <= 5 && 10 <= m) && 25 <= k) && i <= 2) && 10 <= n)) || ((((10 <= m && 26 <= k) && i <= 2) && 10 <= n) && j <= 6)) || ((((10 <= m && 10 <= k) && i <= 1) && j <= 0) && 10 <= n)) || ((i <= 3 && (10 <= m && j <= 1) && 10 <= n) && 31 <= k)) || ((66 <= k && (10 <= m && 10 <= n) && j <= 6) && i <= 6)) || (((83 <= k && i <= 8) && 10 <= m && j <= 3) && 10 <= n)) || ((((10 <= m && i <= 4) && j <= 4) && 44 <= k) && 10 <= n)) || ((((10 <= m && 7 <= k) && j <= 7) && i <= 0) && 10 <= n)) || ((i <= 4 && (10 <= m && j <= 7) && 10 <= n) && 47 <= k)) || ((((2 <= k && 10 <= m) && j <= 2) && i <= 0) && 10 <= n)) || (((i <= 7 && 10 <= m && j <= 3) && 10 <= n) && 73 <= k)) || ((((10 <= m && 10 <= n) && j <= 6) && i <= 7) && 76 <= k)) || ((((23 <= k && 10 <= m) && j <= 3) && i <= 2) && 10 <= n)) || ((78 <= k && (j <= 8 && 10 <= m) && 10 <= n) && i <= 7)) || ((((10 <= m && i <= 4) && j <= 9) && 49 <= k) && 10 <= n)) || ((((10 <= m && i <= 2) && j <= 4) && 10 <= n) && 24 <= k)) || (((84 <= k && i <= 8) && 10 <= n) && 10 <= m && j <= 4)) || (((30 <= k && 10 <= m) && i <= 2) && 10 <= n)) || ((((i <= 3 && 10 <= m) && 36 <= k) && 10 <= n) && j <= 6)) || ((((10 <= m && j <= 4) && i <= 0) && 4 <= k) && 10 <= n)) || (((70 <= k && 10 <= m) && i <= 6) && 10 <= n)) || (((i + 1 <= n && 10 <= m && j <= 3) && 10 <= n) && 93 <= k)) || ((((37 <= k && i <= 3) && 10 <= m) && j <= 7) && 10 <= n)) || ((i <= 5 && (10 <= m && j <= 7) && 10 <= n) && 57 <= k)) || (95 <= k && (i + 1 <= n && j <= 5 && 10 <= m) && 10 <= n)) || ((((10 <= m && j <= 1) && 10 <= n) && 81 <= k) && i <= 8)) || ((68 <= k && (j <= 8 && 10 <= m) && 10 <= n) && i <= 6)) || (((60 <= k && 10 <= m) && i <= 5) && 10 <= n)) || ((((j <= 8 && 10 <= m) && 10 <= n) && i <= 4) && 48 <= k)) || (((59 <= k && i <= 5) && 10 <= m && j <= 9) && 10 <= n)) || (((i <= 8 && 10 <= m) && 10 <= n) && 90 <= k)) || ((((10 <= m && i <= 1) && j <= 2) && 12 <= k) && 10 <= n)) || ((((i <= 3 && j <= 5) && 10 <= m) && 35 <= k) && 10 <= n)) || ((((10 <= m && 20 <= k) && i <= 2) && j <= 0) && 10 <= n)) || ((i + 1 <= n && (j <= 8 && 10 <= m) && 10 <= n) && 98 <= k)) || ((((10 <= m && j <= 7) && 10 <= n) && i <= 7) && 77 <= k)) || ((((50 <= k && 10 <= m) && i <= 5) && j <= 0) && 10 <= n)) || (((85 <= k && j <= 5 && 10 <= m) && i <= 8) && 10 <= n)) || ((i <= 4 && (10 <= m && j <= 1) && 10 <= n) && 41 <= k)) || ((((10 <= m && i <= 1) && j <= 9) && 10 <= n) && 19 <= k)) || ((((j <= 5 && 10 <= m) && 15 <= k) && i <= 1) && 10 <= n)) || ((((10 <= m && j <= 9) && i <= 7) && 79 <= k) && 10 <= n)) || (((54 <= k && i <= 5) && 10 <= n) && 10 <= m && j <= 4)) || (((74 <= k && i <= 7) && 10 <= n) && 10 <= m && j <= 4)) || ((((10 <= m && j <= 1) && 10 <= n) && 71 <= k) && i <= 7)) || ((86 <= k && i <= 8) && (10 <= m && 10 <= n) && j <= 6)) || (((i + 1 <= n && 10 <= m && j <= 2) && 10 <= n) && 92 <= k)) || ((((j <= 8 && 10 <= m) && 18 <= k) && i <= 1) && 10 <= n)) || (91 <= k && i + 1 <= n && (10 <= m && j <= 1) && 10 <= n)) || ((80 <= k && i <= 8) && (10 <= m && j <= 0) && 10 <= n)) || ((((16 <= k && 10 <= m) && i <= 1) && 10 <= n) && j <= 6)) || ((((i <= 3 && j <= 8) && 10 <= m) && 38 <= k) && 10 <= n)) || ((56 <= k && (10 <= m && 10 <= n) && j <= 6) && i <= 5)) || ((((10 <= m && j <= 2) && 62 <= k) && i <= 6) && 10 <= n)) || ((((14 <= k && 10 <= m) && i <= 1) && j <= 4) && 10 <= n)) || ((((10 <= m && i <= 2) && j <= 7) && 10 <= n) && 27 <= k)) || ((((j <= 5 && 10 <= m) && 55 <= k) && i <= 5) && 10 <= n)) || ((((j <= 5 && 10 <= m) && 65 <= k) && i <= 6) && 10 <= n)) || (((i + 1 <= n && 10 <= n) && 10 <= m && j <= 4) && 94 <= k)) || ((((10 <= m && 40 <= k) && i <= 4) && j <= 0) && 10 <= n) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 25 locations, 1 error locations. SAFE Result, 159.0s OverallTime, 20 OverallIterations, 110 TraceHistogramMax, 5.9s AutomataDifference, 0.0s DeadEndRemovalTime, 138.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 886 SDtfs, 1449 SDslu, 3450 SDs, 0 SdLazy, 1174 SolverSat, 233 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4553 GetRequests, 4066 SyntacticMatches, 60 SemanticMatches, 427 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3884 ImplicationChecksByTransitivity, 10.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=364occurred in iteration=19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.2s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 20 MinimizatonAttempts, 293 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 27 PreInvPairs, 5144 NumberOfFragments, 1976 HoareAnnotationTreeSize, 27 FomulaSimplifications, 6058176 FormulaSimplificationTreeSizeReduction, 77.7s HoareSimplificationTime, 8 FomulaSimplificationsInter, 175756 FormulaSimplificationTreeSizeReductionInter, 60.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 11.2s InterpolantComputationTime, 4664 NumberOfCodeBlocks, 4518 NumberOfCodeBlocksAsserted, 124 NumberOfCheckSat, 6741 ConstructedInterpolants, 0 QuantifiedInterpolants, 6960361 SizeOfPredicates, 46 NumberOfNonLiveVariables, 4020 ConjunctsInSsa, 131 ConjunctsInUnsatCore, 52 InterpolantComputations, 4 PerfectInterpolantSequences, 46689/172026 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...