./Ultimate.py --spec ../../sv-benchmarks/c/NoOverflows.prp --file ../../sv-benchmarks/c/termination-crafted/NestedRecursion_1c_true-no-overflow_true-termination_true-valid-memsafety.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_bb21b1b2-2f22-42ea-9098-f4ce5a1c76b5/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_bb21b1b2-2f22-42ea-9098-f4ce5a1c76b5/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_bb21b1b2-2f22-42ea-9098-f4ce5a1c76b5/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_bb21b1b2-2f22-42ea-9098-f4ce5a1c76b5/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/termination-crafted/NestedRecursion_1c_true-no-overflow_true-termination_true-valid-memsafety.c -s /tmp/vcloud-vcloud-master/worker/working_dir_bb21b1b2-2f22-42ea-9098-f4ce5a1c76b5/bin-2019/utaipan/config/svcomp-Overflow-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_bb21b1b2-2f22-42ea-9098-f4ce5a1c76b5/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 1b5ce1e17bce3e34a2c882b1080bdbc1a62cb801 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 11:51:15,996 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 11:51:15,997 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 11:51:16,004 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 11:51:16,004 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 11:51:16,005 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 11:51:16,005 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 11:51:16,006 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 11:51:16,008 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 11:51:16,008 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 11:51:16,009 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 11:51:16,009 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 11:51:16,010 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 11:51:16,011 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 11:51:16,012 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 11:51:16,012 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 11:51:16,013 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 11:51:16,014 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 11:51:16,016 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 11:51:16,017 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 11:51:16,018 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 11:51:16,019 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 11:51:16,021 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 11:51:16,021 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 11:51:16,021 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 11:51:16,022 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 11:51:16,022 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 11:51:16,023 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 11:51:16,024 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 11:51:16,025 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 11:51:16,025 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 11:51:16,025 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 11:51:16,025 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 11:51:16,026 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 11:51:16,026 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 11:51:16,026 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 11:51:16,027 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_bb21b1b2-2f22-42ea-9098-f4ce5a1c76b5/bin-2019/utaipan/config/svcomp-Overflow-64bit-Taipan_Default.epf [2018-11-10 11:51:16,038 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 11:51:16,038 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 11:51:16,038 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 11:51:16,039 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-10 11:51:16,039 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-10 11:51:16,039 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-10 11:51:16,039 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-10 11:51:16,039 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-10 11:51:16,039 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-10 11:51:16,040 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-10 11:51:16,040 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-10 11:51:16,040 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 11:51:16,040 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 11:51:16,040 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 11:51:16,041 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 11:51:16,041 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 11:51:16,041 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 11:51:16,041 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 11:51:16,041 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2018-11-10 11:51:16,041 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 11:51:16,041 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 11:51:16,042 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 11:51:16,042 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 11:51:16,042 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 11:51:16,042 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 11:51:16,042 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 11:51:16,042 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 11:51:16,042 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 11:51:16,042 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 11:51:16,043 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-10 11:51:16,043 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 11:51:16,043 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 11:51:16,043 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-10 11:51:16,043 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_bb21b1b2-2f22-42ea-9098-f4ce5a1c76b5/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 ! overflow) ) 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1b5ce1e17bce3e34a2c882b1080bdbc1a62cb801 [2018-11-10 11:51:16,066 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 11:51:16,075 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 11:51:16,077 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 11:51:16,078 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 11:51:16,078 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 11:51:16,079 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_bb21b1b2-2f22-42ea-9098-f4ce5a1c76b5/bin-2019/utaipan/../../sv-benchmarks/c/termination-crafted/NestedRecursion_1c_true-no-overflow_true-termination_true-valid-memsafety.c [2018-11-10 11:51:16,119 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_bb21b1b2-2f22-42ea-9098-f4ce5a1c76b5/bin-2019/utaipan/data/097e68847/8213c5627f1f461baa41444fabe3450d/FLAG4daf6ac24 [2018-11-10 11:51:16,466 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 11:51:16,467 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_bb21b1b2-2f22-42ea-9098-f4ce5a1c76b5/sv-benchmarks/c/termination-crafted/NestedRecursion_1c_true-no-overflow_true-termination_true-valid-memsafety.c [2018-11-10 11:51:16,472 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_bb21b1b2-2f22-42ea-9098-f4ce5a1c76b5/bin-2019/utaipan/data/097e68847/8213c5627f1f461baa41444fabe3450d/FLAG4daf6ac24 [2018-11-10 11:51:16,483 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_bb21b1b2-2f22-42ea-9098-f4ce5a1c76b5/bin-2019/utaipan/data/097e68847/8213c5627f1f461baa41444fabe3450d [2018-11-10 11:51:16,485 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 11:51:16,486 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 11:51:16,487 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 11:51:16,487 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 11:51:16,490 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 11:51:16,490 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 11:51:16" (1/1) ... [2018-11-10 11:51:16,492 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6fe532c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:51:16, skipping insertion in model container [2018-11-10 11:51:16,492 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 11:51:16" (1/1) ... [2018-11-10 11:51:16,499 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 11:51:16,510 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 11:51:16,612 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 11:51:16,615 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 11:51:16,625 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 11:51:16,636 INFO L193 MainTranslator]: Completed translation [2018-11-10 11:51:16,636 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:51:16 WrapperNode [2018-11-10 11:51:16,636 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 11:51:16,637 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 11:51:16,637 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 11:51:16,637 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 11:51:16,644 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:51:16" (1/1) ... [2018-11-10 11:51:16,647 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:51:16" (1/1) ... [2018-11-10 11:51:16,651 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 11:51:16,652 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 11:51:16,652 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 11:51:16,652 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 11:51:16,659 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:51:16" (1/1) ... [2018-11-10 11:51:16,659 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:51:16" (1/1) ... [2018-11-10 11:51:16,659 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:51:16" (1/1) ... [2018-11-10 11:51:16,659 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:51:16" (1/1) ... [2018-11-10 11:51:16,661 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:51:16" (1/1) ... [2018-11-10 11:51:16,663 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:51:16" (1/1) ... [2018-11-10 11:51:16,664 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:51:16" (1/1) ... [2018-11-10 11:51:16,665 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 11:51:16,665 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 11:51:16,665 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 11:51:16,665 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 11:51:16,666 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:51:16" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bb21b1b2-2f22-42ea-9098-f4ce5a1c76b5/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 11:51:16,764 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 11:51:16,764 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 11:51:16,764 INFO L130 BoogieDeclarations]: Found specification of procedure rec1 [2018-11-10 11:51:16,764 INFO L138 BoogieDeclarations]: Found implementation of procedure rec1 [2018-11-10 11:51:16,764 INFO L130 BoogieDeclarations]: Found specification of procedure rec2 [2018-11-10 11:51:16,764 INFO L138 BoogieDeclarations]: Found implementation of procedure rec2 [2018-11-10 11:51:16,764 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 11:51:16,765 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 11:51:16,765 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 11:51:16,765 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 11:51:16,909 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 11:51:16,909 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:51:16 BoogieIcfgContainer [2018-11-10 11:51:16,910 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 11:51:16,910 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 11:51:16,911 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 11:51:16,913 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 11:51:16,913 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 11:51:16" (1/3) ... [2018-11-10 11:51:16,914 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fe2326 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 11:51:16, skipping insertion in model container [2018-11-10 11:51:16,914 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:51:16" (2/3) ... [2018-11-10 11:51:16,915 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fe2326 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 11:51:16, skipping insertion in model container [2018-11-10 11:51:16,915 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:51:16" (3/3) ... [2018-11-10 11:51:16,916 INFO L112 eAbstractionObserver]: Analyzing ICFG NestedRecursion_1c_true-no-overflow_true-termination_true-valid-memsafety.c [2018-11-10 11:51:16,925 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 11:51:16,931 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 10 error locations. [2018-11-10 11:51:16,940 INFO L257 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2018-11-10 11:51:16,962 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 11:51:16,962 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 11:51:16,962 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 11:51:16,963 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 11:51:16,963 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 11:51:16,963 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 11:51:16,963 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 11:51:16,963 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 11:51:16,981 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states. [2018-11-10 11:51:16,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-10 11:51:16,985 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:51:16,986 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:51:16,988 INFO L424 AbstractCegarLoop]: === Iteration 1 === [rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 11:51:16,992 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:51:16,992 INFO L82 PathProgramCache]: Analyzing trace with hash -1147028286, now seen corresponding path program 1 times [2018-11-10 11:51:16,994 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:51:17,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:51:17,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:51:17,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:51:17,027 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:51:17,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:51:17,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:51:17,122 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:51:17,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 11:51:17,123 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:51:17,126 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 11:51:17,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 11:51:17,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 11:51:17,136 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 5 states. [2018-11-10 11:51:17,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:51:17,204 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2018-11-10 11:51:17,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 11:51:17,205 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2018-11-10 11:51:17,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:51:17,213 INFO L225 Difference]: With dead ends: 49 [2018-11-10 11:51:17,213 INFO L226 Difference]: Without dead ends: 43 [2018-11-10 11:51:17,216 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-10 11:51:17,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-10 11:51:17,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-11-10 11:51:17,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-10 11:51:17,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2018-11-10 11:51:17,251 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 9 [2018-11-10 11:51:17,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:51:17,252 INFO L481 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2018-11-10 11:51:17,252 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 11:51:17,252 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-11-10 11:51:17,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-10 11:51:17,253 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:51:17,253 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:51:17,253 INFO L424 AbstractCegarLoop]: === Iteration 2 === [rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 11:51:17,254 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:51:17,254 INFO L82 PathProgramCache]: Analyzing trace with hash -1198138435, now seen corresponding path program 1 times [2018-11-10 11:51:17,254 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:51:17,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:51:17,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:51:17,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:51:17,255 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:51:17,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:51:17,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:51:17,294 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:51:17,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 11:51:17,294 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:51:17,295 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 11:51:17,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 11:51:17,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 11:51:17,296 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 3 states. [2018-11-10 11:51:17,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:51:17,306 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2018-11-10 11:51:17,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 11:51:17,306 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-10 11:51:17,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:51:17,308 INFO L225 Difference]: With dead ends: 45 [2018-11-10 11:51:17,308 INFO L226 Difference]: Without dead ends: 44 [2018-11-10 11:51:17,309 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 11:51:17,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-10 11:51:17,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2018-11-10 11:51:17,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-10 11:51:17,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2018-11-10 11:51:17,316 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 10 [2018-11-10 11:51:17,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:51:17,317 INFO L481 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2018-11-10 11:51:17,317 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 11:51:17,317 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2018-11-10 11:51:17,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-10 11:51:17,317 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:51:17,317 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:51:17,318 INFO L424 AbstractCegarLoop]: === Iteration 3 === [rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 11:51:17,318 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:51:17,318 INFO L82 PathProgramCache]: Analyzing trace with hash 1097781535, now seen corresponding path program 1 times [2018-11-10 11:51:17,318 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:51:17,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:51:17,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:51:17,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:51:17,319 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:51:17,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:51:17,361 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 11:51:17,361 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:51:17,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 11:51:17,361 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:51:17,362 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 11:51:17,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 11:51:17,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 11:51:17,362 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand 5 states. [2018-11-10 11:51:17,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:51:17,486 INFO L93 Difference]: Finished difference Result 66 states and 78 transitions. [2018-11-10 11:51:17,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 11:51:17,487 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-11-10 11:51:17,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:51:17,488 INFO L225 Difference]: With dead ends: 66 [2018-11-10 11:51:17,488 INFO L226 Difference]: Without dead ends: 65 [2018-11-10 11:51:17,489 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-10 11:51:17,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-11-10 11:51:17,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 58. [2018-11-10 11:51:17,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-10 11:51:17,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 71 transitions. [2018-11-10 11:51:17,499 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 71 transitions. Word has length 20 [2018-11-10 11:51:17,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:51:17,500 INFO L481 AbstractCegarLoop]: Abstraction has 58 states and 71 transitions. [2018-11-10 11:51:17,500 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 11:51:17,500 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 71 transitions. [2018-11-10 11:51:17,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-10 11:51:17,501 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:51:17,501 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:51:17,501 INFO L424 AbstractCegarLoop]: === Iteration 4 === [rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 11:51:17,501 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:51:17,501 INFO L82 PathProgramCache]: Analyzing trace with hash -328510744, now seen corresponding path program 1 times [2018-11-10 11:51:17,502 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:51:17,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:51:17,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:51:17,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:51:17,503 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:51:17,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:51:17,538 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 11:51:17,539 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:51:17,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 11:51:17,539 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:51:17,539 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 11:51:17,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 11:51:17,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 11:51:17,540 INFO L87 Difference]: Start difference. First operand 58 states and 71 transitions. Second operand 3 states. [2018-11-10 11:51:17,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:51:17,552 INFO L93 Difference]: Finished difference Result 62 states and 80 transitions. [2018-11-10 11:51:17,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 11:51:17,553 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-10 11:51:17,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:51:17,553 INFO L225 Difference]: With dead ends: 62 [2018-11-10 11:51:17,553 INFO L226 Difference]: Without dead ends: 61 [2018-11-10 11:51:17,554 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 11:51:17,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-11-10 11:51:17,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 57. [2018-11-10 11:51:17,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-10 11:51:17,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 69 transitions. [2018-11-10 11:51:17,561 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 69 transitions. Word has length 21 [2018-11-10 11:51:17,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:51:17,561 INFO L481 AbstractCegarLoop]: Abstraction has 57 states and 69 transitions. [2018-11-10 11:51:17,561 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 11:51:17,561 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 69 transitions. [2018-11-10 11:51:17,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-10 11:51:17,562 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:51:17,562 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:51:17,562 INFO L424 AbstractCegarLoop]: === Iteration 5 === [rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 11:51:17,562 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:51:17,563 INFO L82 PathProgramCache]: Analyzing trace with hash 2128388042, now seen corresponding path program 1 times [2018-11-10 11:51:17,563 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:51:17,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:51:17,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:51:17,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:51:17,564 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:51:17,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:51:17,581 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 11:51:17,582 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:51:17,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 11:51:17,582 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:51:17,582 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 11:51:17,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 11:51:17,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 11:51:17,583 INFO L87 Difference]: Start difference. First operand 57 states and 69 transitions. Second operand 3 states. [2018-11-10 11:51:17,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:51:17,592 INFO L93 Difference]: Finished difference Result 57 states and 69 transitions. [2018-11-10 11:51:17,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 11:51:17,593 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-10 11:51:17,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:51:17,594 INFO L225 Difference]: With dead ends: 57 [2018-11-10 11:51:17,594 INFO L226 Difference]: Without dead ends: 56 [2018-11-10 11:51:17,594 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 11:51:17,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-11-10 11:51:17,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-11-10 11:51:17,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-10 11:51:17,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 68 transitions. [2018-11-10 11:51:17,599 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 68 transitions. Word has length 23 [2018-11-10 11:51:17,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:51:17,599 INFO L481 AbstractCegarLoop]: Abstraction has 56 states and 68 transitions. [2018-11-10 11:51:17,599 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 11:51:17,599 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 68 transitions. [2018-11-10 11:51:17,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-10 11:51:17,600 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:51:17,600 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:51:17,600 INFO L424 AbstractCegarLoop]: === Iteration 6 === [rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 11:51:17,600 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:51:17,601 INFO L82 PathProgramCache]: Analyzing trace with hash 178548671, now seen corresponding path program 1 times [2018-11-10 11:51:17,601 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:51:17,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:51:17,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:51:17,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:51:17,602 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:51:17,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:51:17,639 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-10 11:51:17,639 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:51:17,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 11:51:17,640 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:51:17,640 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 11:51:17,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 11:51:17,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 11:51:17,641 INFO L87 Difference]: Start difference. First operand 56 states and 68 transitions. Second operand 4 states. [2018-11-10 11:51:17,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:51:17,653 INFO L93 Difference]: Finished difference Result 64 states and 81 transitions. [2018-11-10 11:51:17,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 11:51:17,653 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2018-11-10 11:51:17,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:51:17,654 INFO L225 Difference]: With dead ends: 64 [2018-11-10 11:51:17,654 INFO L226 Difference]: Without dead ends: 63 [2018-11-10 11:51:17,655 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 11:51:17,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-11-10 11:51:17,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2018-11-10 11:51:17,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-11-10 11:51:17,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 74 transitions. [2018-11-10 11:51:17,661 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 74 transitions. Word has length 29 [2018-11-10 11:51:17,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:51:17,662 INFO L481 AbstractCegarLoop]: Abstraction has 61 states and 74 transitions. [2018-11-10 11:51:17,662 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 11:51:17,662 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 74 transitions. [2018-11-10 11:51:17,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-10 11:51:17,663 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:51:17,663 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:51:17,663 INFO L424 AbstractCegarLoop]: === Iteration 7 === [rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 11:51:17,663 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:51:17,664 INFO L82 PathProgramCache]: Analyzing trace with hash 1484175368, now seen corresponding path program 1 times [2018-11-10 11:51:17,664 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:51:17,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:51:17,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:51:17,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:51:17,665 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:51:17,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:51:17,683 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 11:51:17,683 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:51:17,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 11:51:17,683 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:51:17,683 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 11:51:17,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 11:51:17,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 11:51:17,684 INFO L87 Difference]: Start difference. First operand 61 states and 74 transitions. Second operand 3 states. [2018-11-10 11:51:17,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:51:17,690 INFO L93 Difference]: Finished difference Result 61 states and 74 transitions. [2018-11-10 11:51:17,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 11:51:17,690 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-10 11:51:17,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:51:17,691 INFO L225 Difference]: With dead ends: 61 [2018-11-10 11:51:17,691 INFO L226 Difference]: Without dead ends: 60 [2018-11-10 11:51:17,692 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 11:51:17,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-10 11:51:17,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-11-10 11:51:17,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-10 11:51:17,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 72 transitions. [2018-11-10 11:51:17,696 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 72 transitions. Word has length 28 [2018-11-10 11:51:17,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:51:17,697 INFO L481 AbstractCegarLoop]: Abstraction has 60 states and 72 transitions. [2018-11-10 11:51:17,697 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 11:51:17,697 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 72 transitions. [2018-11-10 11:51:17,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-10 11:51:17,698 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:51:17,698 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:51:17,698 INFO L424 AbstractCegarLoop]: === Iteration 8 === [rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 11:51:17,698 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:51:17,698 INFO L82 PathProgramCache]: Analyzing trace with hash -1235203803, now seen corresponding path program 1 times [2018-11-10 11:51:17,698 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:51:17,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:51:17,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:51:17,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:51:17,699 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:51:17,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:51:17,724 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 11:51:17,724 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:51:17,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 11:51:17,724 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:51:17,724 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 11:51:17,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 11:51:17,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 11:51:17,725 INFO L87 Difference]: Start difference. First operand 60 states and 72 transitions. Second operand 4 states. [2018-11-10 11:51:17,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:51:17,750 INFO L93 Difference]: Finished difference Result 83 states and 110 transitions. [2018-11-10 11:51:17,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 11:51:17,750 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2018-11-10 11:51:17,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:51:17,751 INFO L225 Difference]: With dead ends: 83 [2018-11-10 11:51:17,751 INFO L226 Difference]: Without dead ends: 82 [2018-11-10 11:51:17,751 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 11:51:17,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-11-10 11:51:17,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 68. [2018-11-10 11:51:17,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-10 11:51:17,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 84 transitions. [2018-11-10 11:51:17,759 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 84 transitions. Word has length 29 [2018-11-10 11:51:17,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:51:17,759 INFO L481 AbstractCegarLoop]: Abstraction has 68 states and 84 transitions. [2018-11-10 11:51:17,759 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 11:51:17,759 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 84 transitions. [2018-11-10 11:51:17,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-10 11:51:17,760 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:51:17,760 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:51:17,761 INFO L424 AbstractCegarLoop]: === Iteration 9 === [rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 11:51:17,761 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:51:17,761 INFO L82 PathProgramCache]: Analyzing trace with hash -1924993580, now seen corresponding path program 1 times [2018-11-10 11:51:17,761 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:51:17,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:51:17,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:51:17,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:51:17,762 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:51:17,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:51:17,791 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 11:51:17,791 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:51:17,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 11:51:17,791 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:51:17,792 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 11:51:17,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 11:51:17,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 11:51:17,792 INFO L87 Difference]: Start difference. First operand 68 states and 84 transitions. Second operand 5 states. [2018-11-10 11:51:17,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:51:17,878 INFO L93 Difference]: Finished difference Result 93 states and 114 transitions. [2018-11-10 11:51:17,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 11:51:17,879 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2018-11-10 11:51:17,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:51:17,880 INFO L225 Difference]: With dead ends: 93 [2018-11-10 11:51:17,880 INFO L226 Difference]: Without dead ends: 92 [2018-11-10 11:51:17,880 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-10 11:51:17,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-11-10 11:51:17,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 89. [2018-11-10 11:51:17,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-11-10 11:51:17,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 113 transitions. [2018-11-10 11:51:17,889 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 113 transitions. Word has length 33 [2018-11-10 11:51:17,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:51:17,889 INFO L481 AbstractCegarLoop]: Abstraction has 89 states and 113 transitions. [2018-11-10 11:51:17,889 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 11:51:17,889 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 113 transitions. [2018-11-10 11:51:17,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-10 11:51:17,890 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:51:17,890 INFO L375 BasicCegarLoop]: trace histogram [4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:51:17,891 INFO L424 AbstractCegarLoop]: === Iteration 10 === [rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 11:51:17,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:51:17,891 INFO L82 PathProgramCache]: Analyzing trace with hash -1290914449, now seen corresponding path program 1 times [2018-11-10 11:51:17,891 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:51:17,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:51:17,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:51:17,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:51:17,892 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:51:17,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:51:17,919 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-10 11:51:17,919 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:51:17,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 11:51:17,920 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:51:17,920 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 11:51:17,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 11:51:17,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 11:51:17,920 INFO L87 Difference]: Start difference. First operand 89 states and 113 transitions. Second operand 5 states. [2018-11-10 11:51:17,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:51:17,997 INFO L93 Difference]: Finished difference Result 92 states and 113 transitions. [2018-11-10 11:51:17,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 11:51:17,997 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2018-11-10 11:51:17,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:51:17,998 INFO L225 Difference]: With dead ends: 92 [2018-11-10 11:51:17,998 INFO L226 Difference]: Without dead ends: 91 [2018-11-10 11:51:17,999 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-10 11:51:17,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-11-10 11:51:18,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 88. [2018-11-10 11:51:18,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-11-10 11:51:18,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 112 transitions. [2018-11-10 11:51:18,009 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 112 transitions. Word has length 39 [2018-11-10 11:51:18,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:51:18,009 INFO L481 AbstractCegarLoop]: Abstraction has 88 states and 112 transitions. [2018-11-10 11:51:18,009 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 11:51:18,009 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 112 transitions. [2018-11-10 11:51:18,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-10 11:51:18,010 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:51:18,011 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:51:18,011 INFO L424 AbstractCegarLoop]: === Iteration 11 === [rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 11:51:18,011 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:51:18,012 INFO L82 PathProgramCache]: Analyzing trace with hash -495515594, now seen corresponding path program 1 times [2018-11-10 11:51:18,012 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:51:18,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:51:18,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:51:18,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:51:18,013 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:51:18,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:51:18,069 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-10 11:51:18,069 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:51:18,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 11:51:18,069 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:51:18,070 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 11:51:18,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 11:51:18,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 11:51:18,070 INFO L87 Difference]: Start difference. First operand 88 states and 112 transitions. Second operand 4 states. [2018-11-10 11:51:18,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:51:18,089 INFO L93 Difference]: Finished difference Result 98 states and 127 transitions. [2018-11-10 11:51:18,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 11:51:18,089 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2018-11-10 11:51:18,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:51:18,091 INFO L225 Difference]: With dead ends: 98 [2018-11-10 11:51:18,091 INFO L226 Difference]: Without dead ends: 97 [2018-11-10 11:51:18,092 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 11:51:18,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-11-10 11:51:18,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 94. [2018-11-10 11:51:18,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-11-10 11:51:18,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 118 transitions. [2018-11-10 11:51:18,101 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 118 transitions. Word has length 42 [2018-11-10 11:51:18,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:51:18,101 INFO L481 AbstractCegarLoop]: Abstraction has 94 states and 118 transitions. [2018-11-10 11:51:18,101 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 11:51:18,101 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 118 transitions. [2018-11-10 11:51:18,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-10 11:51:18,104 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:51:18,104 INFO L375 BasicCegarLoop]: trace histogram [5, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:51:18,104 INFO L424 AbstractCegarLoop]: === Iteration 12 === [rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 11:51:18,105 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:51:18,105 INFO L82 PathProgramCache]: Analyzing trace with hash 465451333, now seen corresponding path program 1 times [2018-11-10 11:51:18,105 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:51:18,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:51:18,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:51:18,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:51:18,106 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:51:18,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:51:18,157 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-11-10 11:51:18,158 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:51:18,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 11:51:18,158 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:51:18,158 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 11:51:18,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 11:51:18,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 11:51:18,159 INFO L87 Difference]: Start difference. First operand 94 states and 118 transitions. Second operand 3 states. [2018-11-10 11:51:18,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:51:18,183 INFO L93 Difference]: Finished difference Result 94 states and 118 transitions. [2018-11-10 11:51:18,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 11:51:18,184 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2018-11-10 11:51:18,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:51:18,185 INFO L225 Difference]: With dead ends: 94 [2018-11-10 11:51:18,185 INFO L226 Difference]: Without dead ends: 93 [2018-11-10 11:51:18,186 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 11:51:18,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-11-10 11:51:18,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-11-10 11:51:18,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-11-10 11:51:18,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 115 transitions. [2018-11-10 11:51:18,194 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 115 transitions. Word has length 48 [2018-11-10 11:51:18,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:51:18,194 INFO L481 AbstractCegarLoop]: Abstraction has 93 states and 115 transitions. [2018-11-10 11:51:18,194 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 11:51:18,195 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 115 transitions. [2018-11-10 11:51:18,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-10 11:51:18,196 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:51:18,196 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:51:18,196 INFO L424 AbstractCegarLoop]: === Iteration 13 === [rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 11:51:18,197 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:51:18,197 INFO L82 PathProgramCache]: Analyzing trace with hash -1523265789, now seen corresponding path program 1 times [2018-11-10 11:51:18,197 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:51:18,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:51:18,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:51:18,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:51:18,198 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:51:18,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:51:18,234 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-10 11:51:18,234 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:51:18,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 11:51:18,235 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:51:18,235 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 11:51:18,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 11:51:18,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 11:51:18,236 INFO L87 Difference]: Start difference. First operand 93 states and 115 transitions. Second operand 5 states. [2018-11-10 11:51:18,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:51:18,258 INFO L93 Difference]: Finished difference Result 93 states and 115 transitions. [2018-11-10 11:51:18,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 11:51:18,259 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2018-11-10 11:51:18,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:51:18,260 INFO L225 Difference]: With dead ends: 93 [2018-11-10 11:51:18,260 INFO L226 Difference]: Without dead ends: 92 [2018-11-10 11:51:18,261 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 11:51:18,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-11-10 11:51:18,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 89. [2018-11-10 11:51:18,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-11-10 11:51:18,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 111 transitions. [2018-11-10 11:51:18,269 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 111 transitions. Word has length 48 [2018-11-10 11:51:18,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:51:18,270 INFO L481 AbstractCegarLoop]: Abstraction has 89 states and 111 transitions. [2018-11-10 11:51:18,270 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 11:51:18,272 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 111 transitions. [2018-11-10 11:51:18,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-10 11:51:18,273 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:51:18,273 INFO L375 BasicCegarLoop]: trace histogram [6, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:51:18,273 INFO L424 AbstractCegarLoop]: === Iteration 14 === [rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 11:51:18,274 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:51:18,274 INFO L82 PathProgramCache]: Analyzing trace with hash -1633453199, now seen corresponding path program 1 times [2018-11-10 11:51:18,274 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:51:18,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:51:18,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:51:18,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:51:18,275 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:51:18,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:51:18,312 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-11-10 11:51:18,313 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:51:18,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 11:51:18,313 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:51:18,313 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 11:51:18,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 11:51:18,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 11:51:18,314 INFO L87 Difference]: Start difference. First operand 89 states and 111 transitions. Second operand 5 states. [2018-11-10 11:51:18,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:51:18,360 INFO L93 Difference]: Finished difference Result 89 states and 111 transitions. [2018-11-10 11:51:18,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 11:51:18,361 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2018-11-10 11:51:18,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:51:18,361 INFO L225 Difference]: With dead ends: 89 [2018-11-10 11:51:18,362 INFO L226 Difference]: Without dead ends: 88 [2018-11-10 11:51:18,362 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-10 11:51:18,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-11-10 11:51:18,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 75. [2018-11-10 11:51:18,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-11-10 11:51:18,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 91 transitions. [2018-11-10 11:51:18,370 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 91 transitions. Word has length 58 [2018-11-10 11:51:18,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:51:18,371 INFO L481 AbstractCegarLoop]: Abstraction has 75 states and 91 transitions. [2018-11-10 11:51:18,371 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 11:51:18,371 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 91 transitions. [2018-11-10 11:51:18,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-10 11:51:18,372 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:51:18,372 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:51:18,373 INFO L424 AbstractCegarLoop]: === Iteration 15 === [rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 11:51:18,373 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:51:18,373 INFO L82 PathProgramCache]: Analyzing trace with hash -2129870288, now seen corresponding path program 1 times [2018-11-10 11:51:18,373 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:51:18,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:51:18,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:51:18,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:51:18,374 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:51:18,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:51:18,420 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2018-11-10 11:51:18,421 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:51:18,421 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 11:51:18,421 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 67 with the following transitions: [2018-11-10 11:51:18,423 INFO L202 CegarAbsIntRunner]: [0], [1], [4], [5], [7], [9], [11], [13], [15], [17], [19], [20], [21], [23], [24], [25], [28], [29], [31], [33], [35], [42], [46], [50], [51], [52], [53], [54], [55], [56], [57], [58], [60], [61], [62], [64] [2018-11-10 11:51:18,457 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 11:51:18,457 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 11:51:18,591 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 11:51:18,593 INFO L272 AbstractInterpreter]: Visited 20 different actions 55 times. Never merged. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 6 variables. [2018-11-10 11:51:18,602 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:51:18,603 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 11:51:18,659 INFO L227 lantSequenceWeakener]: Weakened 10 states. On average, predicates are now at 56.67% of their original sizes. [2018-11-10 11:51:18,659 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 11:51:18,742 INFO L415 sIntCurrentIteration]: We unified 65 AI predicates to 65 [2018-11-10 11:51:18,742 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 11:51:18,743 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 11:51:18,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [6] total 16 [2018-11-10 11:51:18,743 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:51:18,744 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-10 11:51:18,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-10 11:51:18,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-11-10 11:51:18,744 INFO L87 Difference]: Start difference. First operand 75 states and 91 transitions. Second operand 12 states. [2018-11-10 11:51:19,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:51:19,312 INFO L93 Difference]: Finished difference Result 169 states and 207 transitions. [2018-11-10 11:51:19,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-10 11:51:19,313 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 66 [2018-11-10 11:51:19,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:51:19,314 INFO L225 Difference]: With dead ends: 169 [2018-11-10 11:51:19,314 INFO L226 Difference]: Without dead ends: 93 [2018-11-10 11:51:19,315 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 74 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=328, Unknown=0, NotChecked=0, Total=420 [2018-11-10 11:51:19,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-11-10 11:51:19,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 90. [2018-11-10 11:51:19,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-11-10 11:51:19,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 107 transitions. [2018-11-10 11:51:19,323 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 107 transitions. Word has length 66 [2018-11-10 11:51:19,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:51:19,324 INFO L481 AbstractCegarLoop]: Abstraction has 90 states and 107 transitions. [2018-11-10 11:51:19,324 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-10 11:51:19,324 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 107 transitions. [2018-11-10 11:51:19,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-11-10 11:51:19,325 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:51:19,326 INFO L375 BasicCegarLoop]: trace histogram [9, 7, 6, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:51:19,326 INFO L424 AbstractCegarLoop]: === Iteration 16 === [rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 11:51:19,326 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:51:19,326 INFO L82 PathProgramCache]: Analyzing trace with hash 1154618893, now seen corresponding path program 1 times [2018-11-10 11:51:19,327 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:51:19,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:51:19,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:51:19,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:51:19,329 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:51:19,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:51:19,385 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 31 proven. 13 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-11-10 11:51:19,385 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:51:19,385 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 11:51:19,386 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 88 with the following transitions: [2018-11-10 11:51:19,386 INFO L202 CegarAbsIntRunner]: [0], [1], [4], [5], [7], [9], [11], [13], [15], [17], [19], [20], [21], [23], [24], [25], [28], [29], [31], [33], [35], [37], [39], [41], [42], [46], [50], [51], [52], [53], [54], [55], [56], [57], [58], [59], [60], [61], [62], [64] [2018-11-10 11:51:19,390 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 11:51:19,391 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 11:51:19,438 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 11:51:19,438 INFO L272 AbstractInterpreter]: Visited 24 different actions 92 times. Merged at 7 different actions 16 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 6 variables. [2018-11-10 11:51:19,440 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:51:19,441 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 11:51:19,492 INFO L227 lantSequenceWeakener]: Weakened 24 states. On average, predicates are now at 60.07% of their original sizes. [2018-11-10 11:51:19,492 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 11:51:19,634 INFO L415 sIntCurrentIteration]: We unified 86 AI predicates to 86 [2018-11-10 11:51:19,634 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 11:51:19,634 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 11:51:19,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [6] total 21 [2018-11-10 11:51:19,634 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:51:19,635 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-10 11:51:19,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-10 11:51:19,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2018-11-10 11:51:19,635 INFO L87 Difference]: Start difference. First operand 90 states and 107 transitions. Second operand 17 states. [2018-11-10 11:51:20,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:51:20,439 INFO L93 Difference]: Finished difference Result 119 states and 144 transitions. [2018-11-10 11:51:20,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-10 11:51:20,439 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 87 [2018-11-10 11:51:20,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:51:20,439 INFO L225 Difference]: With dead ends: 119 [2018-11-10 11:51:20,440 INFO L226 Difference]: Without dead ends: 0 [2018-11-10 11:51:20,441 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 103 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=239, Invalid=883, Unknown=0, NotChecked=0, Total=1122 [2018-11-10 11:51:20,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-10 11:51:20,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-10 11:51:20,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-10 11:51:20,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-10 11:51:20,441 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 87 [2018-11-10 11:51:20,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:51:20,441 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 11:51:20,442 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-10 11:51:20,442 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-10 11:51:20,442 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-10 11:51:20,445 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-10 11:51:20,731 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-10 11:51:20,731 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-10 11:51:20,731 INFO L425 ceAbstractionStarter]: For program point rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2018-11-10 11:51:20,731 INFO L425 ceAbstractionStarter]: For program point rec1FINAL(lines 11 15) no Hoare annotation was computed. [2018-11-10 11:51:20,731 INFO L425 ceAbstractionStarter]: For program point rec1EXIT(lines 11 15) no Hoare annotation was computed. [2018-11-10 11:51:20,732 INFO L425 ceAbstractionStarter]: For program point rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2018-11-10 11:51:20,732 INFO L425 ceAbstractionStarter]: For program point L14(line 14) no Hoare annotation was computed. [2018-11-10 11:51:20,732 INFO L428 ceAbstractionStarter]: At program point rec1ENTRY(lines 11 15) the Hoare annotation is: true [2018-11-10 11:51:20,732 INFO L425 ceAbstractionStarter]: For program point L14-1(line 14) no Hoare annotation was computed. [2018-11-10 11:51:20,732 INFO L425 ceAbstractionStarter]: For program point L12(lines 12 13) no Hoare annotation was computed. [2018-11-10 11:51:20,732 INFO L421 ceAbstractionStarter]: At program point L14-2(line 14) the Hoare annotation is: (and (let ((.cse0 (+ (* 2 |rec1_#in~i|) 2))) (or (< 0 .cse0) (< .cse0 0))) (not (= |rec1_#in~i| 0))) [2018-11-10 11:51:20,732 INFO L425 ceAbstractionStarter]: For program point L14-3(line 14) no Hoare annotation was computed. [2018-11-10 11:51:20,732 INFO L425 ceAbstractionStarter]: For program point L14-4(line 14) no Hoare annotation was computed. [2018-11-10 11:51:20,732 INFO L425 ceAbstractionStarter]: For program point rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2018-11-10 11:51:20,732 INFO L425 ceAbstractionStarter]: For program point rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2018-11-10 11:51:20,733 INFO L425 ceAbstractionStarter]: For program point L14-5(line 14) no Hoare annotation was computed. [2018-11-10 11:51:20,733 INFO L421 ceAbstractionStarter]: At program point L14-6(line 14) the Hoare annotation is: (and (let ((.cse0 (+ (* 2 |rec1_#in~i|) 2))) (or (< 0 .cse0) (< .cse0 0))) (not (= |rec1_#in~i| 0))) [2018-11-10 11:51:20,733 INFO L425 ceAbstractionStarter]: For program point rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2018-11-10 11:51:20,733 INFO L425 ceAbstractionStarter]: For program point L14-7(line 14) no Hoare annotation was computed. [2018-11-10 11:51:20,733 INFO L425 ceAbstractionStarter]: For program point rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2018-11-10 11:51:20,733 INFO L421 ceAbstractionStarter]: At program point L14-8(line 14) the Hoare annotation is: (and (let ((.cse0 (+ (* 2 |rec1_#in~i|) 2))) (or (< 0 .cse0) (< .cse0 0))) (not (= |rec1_#in~i| 0))) [2018-11-10 11:51:20,733 INFO L425 ceAbstractionStarter]: For program point L14-9(line 14) no Hoare annotation was computed. [2018-11-10 11:51:20,733 INFO L425 ceAbstractionStarter]: For program point L14-10(line 14) no Hoare annotation was computed. [2018-11-10 11:51:20,733 INFO L425 ceAbstractionStarter]: For program point L14-11(line 14) no Hoare annotation was computed. [2018-11-10 11:51:20,733 INFO L425 ceAbstractionStarter]: For program point rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2018-11-10 11:51:20,733 INFO L425 ceAbstractionStarter]: For program point rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2018-11-10 11:51:20,734 INFO L425 ceAbstractionStarter]: For program point rec2FINAL(lines 17 21) no Hoare annotation was computed. [2018-11-10 11:51:20,734 INFO L425 ceAbstractionStarter]: For program point rec2EXIT(lines 17 21) no Hoare annotation was computed. [2018-11-10 11:51:20,734 INFO L425 ceAbstractionStarter]: For program point L20(line 20) no Hoare annotation was computed. [2018-11-10 11:51:20,734 INFO L425 ceAbstractionStarter]: For program point L20-1(line 20) no Hoare annotation was computed. [2018-11-10 11:51:20,734 INFO L425 ceAbstractionStarter]: For program point L18(lines 18 19) no Hoare annotation was computed. [2018-11-10 11:51:20,734 INFO L425 ceAbstractionStarter]: For program point rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2018-11-10 11:51:20,734 INFO L425 ceAbstractionStarter]: For program point rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2018-11-10 11:51:20,734 INFO L421 ceAbstractionStarter]: At program point L20-2(line 20) the Hoare annotation is: (let ((.cse2 (* 2 |rec2_#in~j|))) (let ((.cse0 (* 2 rec2_~j)) (.cse1 (< .cse2 0))) (and (or (<= .cse0 4294967292) .cse1 (< 4294967292 .cse2)) (or (<= .cse0 4294967290) .cse1 (< 4294967290 .cse2)) (or (< (+ .cse2 4294967296) 0) (and (<= rec2_~j 2147483647) (<= 1 rec2_~j)) (< 2147483647 |rec2_#in~j|))))) [2018-11-10 11:51:20,734 INFO L425 ceAbstractionStarter]: For program point L20-3(line 20) no Hoare annotation was computed. [2018-11-10 11:51:20,735 INFO L421 ceAbstractionStarter]: At program point L20-4(line 20) the Hoare annotation is: (let ((.cse2 (* 2 |rec2_#in~j|))) (let ((.cse0 (< .cse2 0)) (.cse1 (* 2 rec2_~j))) (and (or .cse0 (<= .cse1 4294967290) (< 4294967290 .cse2)) (or .cse0 (<= .cse1 4294967292) (< 4294967292 .cse2)) (or (< (+ .cse2 4294967296) 0) (and (or (= (+ |rec2_#t~ret3| 1) 0) (let ((.cse3 (* 2 |rec2_#t~ret3|))) (and (<= 0 .cse3) (<= .cse3 0)))) (<= rec2_~j 2147483647) (<= 1 rec2_~j)) (< 2147483647 |rec2_#in~j|))))) [2018-11-10 11:51:20,735 INFO L425 ceAbstractionStarter]: For program point L20-5(line 20) no Hoare annotation was computed. [2018-11-10 11:51:20,735 INFO L425 ceAbstractionStarter]: For program point L20-6(line 20) no Hoare annotation was computed. [2018-11-10 11:51:20,735 INFO L425 ceAbstractionStarter]: For program point L20-7(line 20) no Hoare annotation was computed. [2018-11-10 11:51:20,735 INFO L428 ceAbstractionStarter]: At program point rec2ENTRY(lines 17 21) the Hoare annotation is: true [2018-11-10 11:51:20,735 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-10 11:51:20,735 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-10 11:51:20,735 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-10 11:51:20,735 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-10 11:51:20,735 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 23 26) the Hoare annotation is: true [2018-11-10 11:51:20,735 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 23 26) no Hoare annotation was computed. [2018-11-10 11:51:20,735 INFO L421 ceAbstractionStarter]: At program point L25(line 25) the Hoare annotation is: (let ((.cse0 (* 2 main_~x~0))) (and (<= 0 (+ .cse0 4294967296)) (<= .cse0 4294967294))) [2018-11-10 11:51:20,736 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 23 26) no Hoare annotation was computed. [2018-11-10 11:51:20,736 INFO L425 ceAbstractionStarter]: For program point L25-1(line 25) no Hoare annotation was computed. [2018-11-10 11:51:20,738 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 11:51:20 BoogieIcfgContainer [2018-11-10 11:51:20,738 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 11:51:20,739 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 11:51:20,739 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 11:51:20,739 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 11:51:20,739 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:51:16" (3/4) ... [2018-11-10 11:51:20,743 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-10 11:51:20,748 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-10 11:51:20,748 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure rec1 [2018-11-10 11:51:20,749 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure rec2 [2018-11-10 11:51:20,749 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-10 11:51:20,753 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2018-11-10 11:51:20,754 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-10 11:51:20,754 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-10 11:51:20,791 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_bb21b1b2-2f22-42ea-9098-f4ce5a1c76b5/bin-2019/utaipan/witness.graphml [2018-11-10 11:51:20,791 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 11:51:20,792 INFO L168 Benchmark]: Toolchain (without parser) took 4306.64 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 191.4 MB). Free memory was 960.3 MB in the beginning and 1.1 GB in the end (delta: -152.1 MB). Peak memory consumption was 39.3 MB. Max. memory is 11.5 GB. [2018-11-10 11:51:20,793 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 11:51:20,794 INFO L168 Benchmark]: CACSL2BoogieTranslator took 149.75 ms. Allocated memory is still 1.0 GB. Free memory was 960.3 MB in the beginning and 949.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-10 11:51:20,794 INFO L168 Benchmark]: Boogie Procedure Inliner took 14.62 ms. Allocated memory is still 1.0 GB. Free memory is still 949.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 11:51:20,794 INFO L168 Benchmark]: Boogie Preprocessor took 13.30 ms. Allocated memory is still 1.0 GB. Free memory was 949.6 MB in the beginning and 946.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 11:51:20,795 INFO L168 Benchmark]: RCFGBuilder took 244.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.0 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -191.8 MB). Peak memory consumption was 19.9 MB. Max. memory is 11.5 GB. [2018-11-10 11:51:20,795 INFO L168 Benchmark]: TraceAbstraction took 3827.84 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 40.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.5 MB). Peak memory consumption was 61.9 MB. Max. memory is 11.5 GB. [2018-11-10 11:51:20,795 INFO L168 Benchmark]: Witness Printer took 52.99 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 4.8 MB). Peak memory consumption was 4.8 MB. Max. memory is 11.5 GB. [2018-11-10 11:51:20,797 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.13 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 149.75 ms. Allocated memory is still 1.0 GB. Free memory was 960.3 MB in the beginning and 949.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 14.62 ms. Allocated memory is still 1.0 GB. Free memory is still 949.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 13.30 ms. Allocated memory is still 1.0 GB. Free memory was 949.6 MB in the beginning and 946.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 244.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.0 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -191.8 MB). Peak memory consumption was 19.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3827.84 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 40.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.5 MB). Peak memory consumption was 61.9 MB. Max. memory is 11.5 GB. * Witness Printer took 52.99 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 4.8 MB). Peak memory consumption was 4.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - AllSpecificationsHoldResult: All specifications hold 10 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 49 locations, 10 error locations. SAFE Result, 3.7s OverallTime, 16 OverallIterations, 9 TraceHistogramMax, 1.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 660 SDtfs, 339 SDslu, 1379 SDs, 0 SdLazy, 259 SolverSat, 127 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 4 DeclaredPredicates, 230 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=94occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.2s AbstIntTime, 2 AbstIntIterations, 2 AbstIntStrong, 0.962030905077263 AbsIntWeakeningRatio, 0.5364238410596026 AbsIntAvgWeakeningVarsNumRemoved, 0.9735099337748344 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 57 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 125 PreInvPairs, 133 NumberOfFragments, 216 HoareAnnotationTreeSize, 125 FomulaSimplifications, 431 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 12 FomulaSimplificationsInter, 776 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 590 NumberOfCodeBlocks, 590 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 574 ConstructedInterpolants, 0 QuantifiedInterpolants, 36466 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 14 PerfectInterpolantSequences, 377/411 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...