./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/termination-crafted/NestedRecursion_1b_true-no-overflow_true-termination_true-valid-memsafety.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_af4afe2c-4e52-4a37-a794-e79dae011079/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_af4afe2c-4e52-4a37-a794-e79dae011079/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_af4afe2c-4e52-4a37-a794-e79dae011079/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_af4afe2c-4e52-4a37-a794-e79dae011079/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/termination-crafted/NestedRecursion_1b_true-no-overflow_true-termination_true-valid-memsafety.c -s /tmp/vcloud-vcloud-master/worker/working_dir_af4afe2c-4e52-4a37-a794-e79dae011079/bin-2019/utaipan/config/svcomp-Overflow-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_af4afe2c-4e52-4a37-a794-e79dae011079/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 cb528549fa76ae8087cf7043645dfa20323a0116 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-03 00:36:32,489 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 00:36:32,490 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 00:36:32,498 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 00:36:32,499 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 00:36:32,499 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 00:36:32,500 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 00:36:32,501 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 00:36:32,503 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 00:36:32,503 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 00:36:32,504 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 00:36:32,504 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 00:36:32,505 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 00:36:32,505 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 00:36:32,506 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 00:36:32,507 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 00:36:32,507 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 00:36:32,509 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 00:36:32,510 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 00:36:32,511 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 00:36:32,512 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 00:36:32,513 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 00:36:32,515 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 00:36:32,515 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 00:36:32,515 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 00:36:32,516 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 00:36:32,516 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 00:36:32,517 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 00:36:32,518 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 00:36:32,518 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 00:36:32,519 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 00:36:32,519 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 00:36:32,519 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 00:36:32,519 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 00:36:32,520 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 00:36:32,520 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 00:36:32,521 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_af4afe2c-4e52-4a37-a794-e79dae011079/bin-2019/utaipan/config/svcomp-Overflow-64bit-Taipan_Default.epf [2018-12-03 00:36:32,531 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 00:36:32,531 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 00:36:32,532 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 00:36:32,532 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 00:36:32,532 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 00:36:32,532 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 00:36:32,532 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 00:36:32,532 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 00:36:32,532 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 00:36:32,533 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-03 00:36:32,533 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 00:36:32,533 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-03 00:36:32,533 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 00:36:32,533 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 00:36:32,534 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-03 00:36:32,534 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 00:36:32,534 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 00:36:32,534 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 00:36:32,534 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 00:36:32,534 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 00:36:32,534 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2018-12-03 00:36:32,534 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 00:36:32,535 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 00:36:32,535 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 00:36:32,535 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 00:36:32,535 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-03 00:36:32,535 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 00:36:32,535 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 00:36:32,535 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 00:36:32,535 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 00:36:32,535 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 00:36:32,535 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 00:36:32,535 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 00:36:32,536 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 00:36:32,536 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 00:36:32,536 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_af4afe2c-4e52-4a37-a794-e79dae011079/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 -> cb528549fa76ae8087cf7043645dfa20323a0116 [2018-12-03 00:36:32,558 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 00:36:32,566 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 00:36:32,568 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 00:36:32,569 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-03 00:36:32,569 INFO L276 PluginConnector]: CDTParser initialized [2018-12-03 00:36:32,569 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_af4afe2c-4e52-4a37-a794-e79dae011079/bin-2019/utaipan/../../sv-benchmarks/c/termination-crafted/NestedRecursion_1b_true-no-overflow_true-termination_true-valid-memsafety.c [2018-12-03 00:36:32,603 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_af4afe2c-4e52-4a37-a794-e79dae011079/bin-2019/utaipan/data/cdee52559/ffe7e2fe1bfa4375948e3546f8308168/FLAGde16f3893 [2018-12-03 00:36:32,931 INFO L307 CDTParser]: Found 1 translation units. [2018-12-03 00:36:32,931 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_af4afe2c-4e52-4a37-a794-e79dae011079/sv-benchmarks/c/termination-crafted/NestedRecursion_1b_true-no-overflow_true-termination_true-valid-memsafety.c [2018-12-03 00:36:32,935 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_af4afe2c-4e52-4a37-a794-e79dae011079/bin-2019/utaipan/data/cdee52559/ffe7e2fe1bfa4375948e3546f8308168/FLAGde16f3893 [2018-12-03 00:36:33,341 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_af4afe2c-4e52-4a37-a794-e79dae011079/bin-2019/utaipan/data/cdee52559/ffe7e2fe1bfa4375948e3546f8308168 [2018-12-03 00:36:33,343 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 00:36:33,344 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-03 00:36:33,345 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-03 00:36:33,345 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-03 00:36:33,348 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-03 00:36:33,349 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 12:36:33" (1/1) ... [2018-12-03 00:36:33,351 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c93d57c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:36:33, skipping insertion in model container [2018-12-03 00:36:33,351 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 12:36:33" (1/1) ... [2018-12-03 00:36:33,358 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-03 00:36:33,367 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-03 00:36:33,447 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 00:36:33,449 INFO L191 MainTranslator]: Completed pre-run [2018-12-03 00:36:33,457 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 00:36:33,465 INFO L195 MainTranslator]: Completed translation [2018-12-03 00:36:33,465 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:36:33 WrapperNode [2018-12-03 00:36:33,466 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-03 00:36:33,466 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 00:36:33,466 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 00:36:33,466 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 00:36:33,471 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:36:33" (1/1) ... [2018-12-03 00:36:33,474 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:36:33" (1/1) ... [2018-12-03 00:36:33,477 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 00:36:33,478 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 00:36:33,478 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 00:36:33,478 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 00:36:33,483 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:36:33" (1/1) ... [2018-12-03 00:36:33,483 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:36:33" (1/1) ... [2018-12-03 00:36:33,484 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:36:33" (1/1) ... [2018-12-03 00:36:33,484 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:36:33" (1/1) ... [2018-12-03 00:36:33,486 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:36:33" (1/1) ... [2018-12-03 00:36:33,487 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:36:33" (1/1) ... [2018-12-03 00:36:33,488 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:36:33" (1/1) ... [2018-12-03 00:36:33,488 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 00:36:33,488 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 00:36:33,489 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 00:36:33,489 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 00:36:33,489 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:36:33" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_af4afe2c-4e52-4a37-a794-e79dae011079/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 00:36:33,554 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-03 00:36:33,554 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-03 00:36:33,554 INFO L130 BoogieDeclarations]: Found specification of procedure rec1 [2018-12-03 00:36:33,554 INFO L138 BoogieDeclarations]: Found implementation of procedure rec1 [2018-12-03 00:36:33,554 INFO L130 BoogieDeclarations]: Found specification of procedure rec2 [2018-12-03 00:36:33,554 INFO L138 BoogieDeclarations]: Found implementation of procedure rec2 [2018-12-03 00:36:33,554 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 00:36:33,554 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 00:36:33,555 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-03 00:36:33,555 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-03 00:36:33,663 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 00:36:33,663 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-03 00:36:33,663 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 12:36:33 BoogieIcfgContainer [2018-12-03 00:36:33,663 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 00:36:33,664 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 00:36:33,664 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 00:36:33,666 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 00:36:33,666 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.12 12:36:33" (1/3) ... [2018-12-03 00:36:33,667 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63a72beb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 12:36:33, skipping insertion in model container [2018-12-03 00:36:33,667 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 12:36:33" (2/3) ... [2018-12-03 00:36:33,667 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63a72beb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 12:36:33, skipping insertion in model container [2018-12-03 00:36:33,667 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 12:36:33" (3/3) ... [2018-12-03 00:36:33,668 INFO L112 eAbstractionObserver]: Analyzing ICFG NestedRecursion_1b_true-no-overflow_true-termination_true-valid-memsafety.c [2018-12-03 00:36:33,674 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 00:36:33,678 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 10 error locations. [2018-12-03 00:36:33,688 INFO L257 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2018-12-03 00:36:33,706 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 00:36:33,706 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 00:36:33,706 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 00:36:33,706 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 00:36:33,706 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 00:36:33,706 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 00:36:33,707 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 00:36:33,707 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 00:36:33,718 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states. [2018-12-03 00:36:33,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 00:36:33,722 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 00:36:33,722 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 00:36:33,724 INFO L423 AbstractCegarLoop]: === Iteration 1 === [rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-03 00:36:33,727 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:36:33,727 INFO L82 PathProgramCache]: Analyzing trace with hash -1147028286, now seen corresponding path program 1 times [2018-12-03 00:36:33,728 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 00:36:33,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:36:33,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:36:33,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:36:33,760 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 00:36:33,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:36:33,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 00:36:33,847 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 00:36:33,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 00:36:33,847 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 00:36:33,850 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 00:36:33,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 00:36:33,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 00:36:33,859 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 5 states. [2018-12-03 00:36:33,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 00:36:33,919 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2018-12-03 00:36:33,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 00:36:33,920 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2018-12-03 00:36:33,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 00:36:33,926 INFO L225 Difference]: With dead ends: 67 [2018-12-03 00:36:33,926 INFO L226 Difference]: Without dead ends: 59 [2018-12-03 00:36:33,928 INFO L631 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-12-03 00:36:33,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-12-03 00:36:33,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 54. [2018-12-03 00:36:33,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-12-03 00:36:33,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2018-12-03 00:36:33,956 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 63 transitions. Word has length 9 [2018-12-03 00:36:33,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 00:36:33,956 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 63 transitions. [2018-12-03 00:36:33,956 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 00:36:33,956 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2018-12-03 00:36:33,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 00:36:33,956 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 00:36:33,956 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 00:36:33,957 INFO L423 AbstractCegarLoop]: === Iteration 2 === [rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-03 00:36:33,957 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:36:33,957 INFO L82 PathProgramCache]: Analyzing trace with hash -1198138435, now seen corresponding path program 1 times [2018-12-03 00:36:33,957 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 00:36:33,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:36:33,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:36:33,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:36:33,958 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 00:36:33,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:36:33,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 00:36:33,968 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 00:36:33,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 00:36:33,968 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 00:36:33,969 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 00:36:33,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 00:36:33,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 00:36:33,969 INFO L87 Difference]: Start difference. First operand 54 states and 63 transitions. Second operand 3 states. [2018-12-03 00:36:33,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 00:36:33,978 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2018-12-03 00:36:33,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 00:36:33,979 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-12-03 00:36:33,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 00:36:33,980 INFO L225 Difference]: With dead ends: 56 [2018-12-03 00:36:33,980 INFO L226 Difference]: Without dead ends: 55 [2018-12-03 00:36:33,980 INFO L631 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-12-03 00:36:33,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-12-03 00:36:33,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2018-12-03 00:36:33,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-12-03 00:36:33,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 61 transitions. [2018-12-03 00:36:33,986 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 61 transitions. Word has length 10 [2018-12-03 00:36:33,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 00:36:33,986 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 61 transitions. [2018-12-03 00:36:33,986 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 00:36:33,986 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2018-12-03 00:36:33,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 00:36:33,987 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 00:36:33,987 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 00:36:33,987 INFO L423 AbstractCegarLoop]: === Iteration 3 === [rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-03 00:36:33,987 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:36:33,987 INFO L82 PathProgramCache]: Analyzing trace with hash 2126464488, now seen corresponding path program 1 times [2018-12-03 00:36:33,988 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 00:36:33,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:36:33,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:36:33,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:36:33,988 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 00:36:33,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:36:34,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 00:36:34,014 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 00:36:34,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 00:36:34,014 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 00:36:34,014 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 00:36:34,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 00:36:34,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 00:36:34,015 INFO L87 Difference]: Start difference. First operand 53 states and 61 transitions. Second operand 5 states. [2018-12-03 00:36:34,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 00:36:34,062 INFO L93 Difference]: Finished difference Result 77 states and 92 transitions. [2018-12-03 00:36:34,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 00:36:34,062 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-12-03 00:36:34,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 00:36:34,063 INFO L225 Difference]: With dead ends: 77 [2018-12-03 00:36:34,063 INFO L226 Difference]: Without dead ends: 76 [2018-12-03 00:36:34,063 INFO L631 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-12-03 00:36:34,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-12-03 00:36:34,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 69. [2018-12-03 00:36:34,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-12-03 00:36:34,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 85 transitions. [2018-12-03 00:36:34,070 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 85 transitions. Word has length 14 [2018-12-03 00:36:34,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 00:36:34,070 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 85 transitions. [2018-12-03 00:36:34,070 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 00:36:34,070 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 85 transitions. [2018-12-03 00:36:34,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 00:36:34,071 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 00:36:34,071 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 00:36:34,071 INFO L423 AbstractCegarLoop]: === Iteration 4 === [rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-03 00:36:34,071 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:36:34,071 INFO L82 PathProgramCache]: Analyzing trace with hash 1495889727, now seen corresponding path program 1 times [2018-12-03 00:36:34,071 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 00:36:34,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:36:34,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:36:34,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:36:34,072 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 00:36:34,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:36:34,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 00:36:34,086 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 00:36:34,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 00:36:34,086 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 00:36:34,087 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 00:36:34,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 00:36:34,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 00:36:34,087 INFO L87 Difference]: Start difference. First operand 69 states and 85 transitions. Second operand 3 states. [2018-12-03 00:36:34,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 00:36:34,099 INFO L93 Difference]: Finished difference Result 73 states and 95 transitions. [2018-12-03 00:36:34,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 00:36:34,099 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-12-03 00:36:34,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 00:36:34,101 INFO L225 Difference]: With dead ends: 73 [2018-12-03 00:36:34,101 INFO L226 Difference]: Without dead ends: 72 [2018-12-03 00:36:34,101 INFO L631 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-12-03 00:36:34,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-12-03 00:36:34,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 68. [2018-12-03 00:36:34,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-12-03 00:36:34,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 83 transitions. [2018-12-03 00:36:34,108 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 83 transitions. Word has length 15 [2018-12-03 00:36:34,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 00:36:34,108 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 83 transitions. [2018-12-03 00:36:34,108 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 00:36:34,108 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 83 transitions. [2018-12-03 00:36:34,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 00:36:34,108 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 00:36:34,108 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 00:36:34,109 INFO L423 AbstractCegarLoop]: === Iteration 5 === [rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-03 00:36:34,109 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:36:34,109 INFO L82 PathProgramCache]: Analyzing trace with hash -440899931, now seen corresponding path program 1 times [2018-12-03 00:36:34,109 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 00:36:34,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:36:34,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:36:34,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:36:34,110 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 00:36:34,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:36:34,136 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 00:36:34,136 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 00:36:34,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 00:36:34,136 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 00:36:34,136 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 00:36:34,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 00:36:34,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 00:36:34,137 INFO L87 Difference]: Start difference. First operand 68 states and 83 transitions. Second operand 5 states. [2018-12-03 00:36:34,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 00:36:34,172 INFO L93 Difference]: Finished difference Result 70 states and 83 transitions. [2018-12-03 00:36:34,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 00:36:34,173 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-12-03 00:36:34,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 00:36:34,173 INFO L225 Difference]: With dead ends: 70 [2018-12-03 00:36:34,174 INFO L226 Difference]: Without dead ends: 69 [2018-12-03 00:36:34,174 INFO L631 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-12-03 00:36:34,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-12-03 00:36:34,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2018-12-03 00:36:34,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-12-03 00:36:34,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 82 transitions. [2018-12-03 00:36:34,181 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 82 transitions. Word has length 20 [2018-12-03 00:36:34,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 00:36:34,181 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 82 transitions. [2018-12-03 00:36:34,181 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 00:36:34,181 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 82 transitions. [2018-12-03 00:36:34,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-03 00:36:34,182 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 00:36:34,182 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 00:36:34,182 INFO L423 AbstractCegarLoop]: === Iteration 6 === [rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-03 00:36:34,182 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:36:34,182 INFO L82 PathProgramCache]: Analyzing trace with hash -1311878191, now seen corresponding path program 1 times [2018-12-03 00:36:34,183 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 00:36:34,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:36:34,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:36:34,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:36:34,184 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 00:36:34,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:36:34,201 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 00:36:34,202 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 00:36:34,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 00:36:34,202 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 00:36:34,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 00:36:34,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 00:36:34,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 00:36:34,203 INFO L87 Difference]: Start difference. First operand 67 states and 82 transitions. Second operand 3 states. [2018-12-03 00:36:34,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 00:36:34,211 INFO L93 Difference]: Finished difference Result 67 states and 82 transitions. [2018-12-03 00:36:34,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 00:36:34,212 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-12-03 00:36:34,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 00:36:34,213 INFO L225 Difference]: With dead ends: 67 [2018-12-03 00:36:34,213 INFO L226 Difference]: Without dead ends: 66 [2018-12-03 00:36:34,213 INFO L631 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-12-03 00:36:34,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-12-03 00:36:34,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-12-03 00:36:34,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-12-03 00:36:34,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 80 transitions. [2018-12-03 00:36:34,220 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 80 transitions. Word has length 22 [2018-12-03 00:36:34,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 00:36:34,220 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 80 transitions. [2018-12-03 00:36:34,220 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 00:36:34,220 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 80 transitions. [2018-12-03 00:36:34,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-03 00:36:34,221 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 00:36:34,221 INFO L402 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-12-03 00:36:34,221 INFO L423 AbstractCegarLoop]: === Iteration 7 === [rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-03 00:36:34,222 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:36:34,222 INFO L82 PathProgramCache]: Analyzing trace with hash -840361398, now seen corresponding path program 1 times [2018-12-03 00:36:34,222 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 00:36:34,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:36:34,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:36:34,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:36:34,223 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 00:36:34,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:36:34,237 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 00:36:34,237 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 00:36:34,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 00:36:34,237 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 00:36:34,238 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 00:36:34,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 00:36:34,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 00:36:34,238 INFO L87 Difference]: Start difference. First operand 66 states and 80 transitions. Second operand 3 states. [2018-12-03 00:36:34,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 00:36:34,246 INFO L93 Difference]: Finished difference Result 66 states and 80 transitions. [2018-12-03 00:36:34,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 00:36:34,246 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-12-03 00:36:34,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 00:36:34,247 INFO L225 Difference]: With dead ends: 66 [2018-12-03 00:36:34,247 INFO L226 Difference]: Without dead ends: 65 [2018-12-03 00:36:34,247 INFO L631 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-12-03 00:36:34,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-12-03 00:36:34,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-12-03 00:36:34,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-12-03 00:36:34,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 78 transitions. [2018-12-03 00:36:34,253 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 78 transitions. Word has length 23 [2018-12-03 00:36:34,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 00:36:34,253 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 78 transitions. [2018-12-03 00:36:34,253 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 00:36:34,253 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 78 transitions. [2018-12-03 00:36:34,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-03 00:36:34,254 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 00:36:34,254 INFO L402 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-12-03 00:36:34,254 INFO L423 AbstractCegarLoop]: === Iteration 8 === [rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-03 00:36:34,254 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:36:34,254 INFO L82 PathProgramCache]: Analyzing trace with hash -2013518212, now seen corresponding path program 1 times [2018-12-03 00:36:34,255 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 00:36:34,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:36:34,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:36:34,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:36:34,255 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 00:36:34,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:36:34,273 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 00:36:34,273 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 00:36:34,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 00:36:34,273 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 00:36:34,273 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 00:36:34,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 00:36:34,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 00:36:34,274 INFO L87 Difference]: Start difference. First operand 65 states and 78 transitions. Second operand 4 states. [2018-12-03 00:36:34,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 00:36:34,283 INFO L93 Difference]: Finished difference Result 90 states and 120 transitions. [2018-12-03 00:36:34,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 00:36:34,284 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-12-03 00:36:34,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 00:36:34,284 INFO L225 Difference]: With dead ends: 90 [2018-12-03 00:36:34,285 INFO L226 Difference]: Without dead ends: 89 [2018-12-03 00:36:34,285 INFO L631 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-12-03 00:36:34,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-12-03 00:36:34,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 75. [2018-12-03 00:36:34,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-12-03 00:36:34,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 94 transitions. [2018-12-03 00:36:34,290 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 94 transitions. Word has length 23 [2018-12-03 00:36:34,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 00:36:34,290 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 94 transitions. [2018-12-03 00:36:34,290 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 00:36:34,290 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 94 transitions. [2018-12-03 00:36:34,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-03 00:36:34,291 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 00:36:34,291 INFO L402 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, 1] [2018-12-03 00:36:34,291 INFO L423 AbstractCegarLoop]: === Iteration 9 === [rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-03 00:36:34,291 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:36:34,291 INFO L82 PathProgramCache]: Analyzing trace with hash -281399491, now seen corresponding path program 1 times [2018-12-03 00:36:34,291 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 00:36:34,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:36:34,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:36:34,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:36:34,292 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 00:36:34,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:36:34,309 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 00:36:34,309 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 00:36:34,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 00:36:34,309 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 00:36:34,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 00:36:34,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 00:36:34,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 00:36:34,310 INFO L87 Difference]: Start difference. First operand 75 states and 94 transitions. Second operand 4 states. [2018-12-03 00:36:34,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 00:36:34,319 INFO L93 Difference]: Finished difference Result 84 states and 104 transitions. [2018-12-03 00:36:34,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 00:36:34,319 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2018-12-03 00:36:34,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 00:36:34,320 INFO L225 Difference]: With dead ends: 84 [2018-12-03 00:36:34,320 INFO L226 Difference]: Without dead ends: 80 [2018-12-03 00:36:34,320 INFO L631 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-12-03 00:36:34,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-12-03 00:36:34,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-12-03 00:36:34,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-12-03 00:36:34,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 99 transitions. [2018-12-03 00:36:34,325 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 99 transitions. Word has length 24 [2018-12-03 00:36:34,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 00:36:34,325 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 99 transitions. [2018-12-03 00:36:34,325 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 00:36:34,325 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 99 transitions. [2018-12-03 00:36:34,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-03 00:36:34,325 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 00:36:34,325 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 00:36:34,326 INFO L423 AbstractCegarLoop]: === Iteration 10 === [rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-03 00:36:34,326 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:36:34,326 INFO L82 PathProgramCache]: Analyzing trace with hash 1215449003, now seen corresponding path program 1 times [2018-12-03 00:36:34,326 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 00:36:34,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:36:34,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:36:34,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:36:34,326 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 00:36:34,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:36:34,342 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 00:36:34,343 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 00:36:34,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 00:36:34,343 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 00:36:34,343 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 00:36:34,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 00:36:34,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 00:36:34,343 INFO L87 Difference]: Start difference. First operand 80 states and 99 transitions. Second operand 5 states. [2018-12-03 00:36:34,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 00:36:34,389 INFO L93 Difference]: Finished difference Result 105 states and 129 transitions. [2018-12-03 00:36:34,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 00:36:34,389 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-12-03 00:36:34,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 00:36:34,390 INFO L225 Difference]: With dead ends: 105 [2018-12-03 00:36:34,390 INFO L226 Difference]: Without dead ends: 104 [2018-12-03 00:36:34,391 INFO L631 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-12-03 00:36:34,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-12-03 00:36:34,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 101. [2018-12-03 00:36:34,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-12-03 00:36:34,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 128 transitions. [2018-12-03 00:36:34,398 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 128 transitions. Word has length 27 [2018-12-03 00:36:34,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 00:36:34,398 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 128 transitions. [2018-12-03 00:36:34,398 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 00:36:34,398 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 128 transitions. [2018-12-03 00:36:34,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-03 00:36:34,399 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 00:36:34,399 INFO L402 BasicCegarLoop]: trace histogram [5, 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] [2018-12-03 00:36:34,400 INFO L423 AbstractCegarLoop]: === Iteration 11 === [rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-03 00:36:34,400 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:36:34,400 INFO L82 PathProgramCache]: Analyzing trace with hash 505515198, now seen corresponding path program 1 times [2018-12-03 00:36:34,400 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 00:36:34,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:36:34,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:36:34,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:36:34,401 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 00:36:34,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:36:34,425 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-12-03 00:36:34,425 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 00:36:34,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 00:36:34,425 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 00:36:34,425 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 00:36:34,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 00:36:34,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 00:36:34,426 INFO L87 Difference]: Start difference. First operand 101 states and 128 transitions. Second operand 5 states. [2018-12-03 00:36:34,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 00:36:34,473 INFO L93 Difference]: Finished difference Result 104 states and 128 transitions. [2018-12-03 00:36:34,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 00:36:34,474 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2018-12-03 00:36:34,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 00:36:34,474 INFO L225 Difference]: With dead ends: 104 [2018-12-03 00:36:34,474 INFO L226 Difference]: Without dead ends: 103 [2018-12-03 00:36:34,475 INFO L631 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-12-03 00:36:34,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-12-03 00:36:34,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 100. [2018-12-03 00:36:34,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-12-03 00:36:34,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 127 transitions. [2018-12-03 00:36:34,480 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 127 transitions. Word has length 38 [2018-12-03 00:36:34,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 00:36:34,480 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 127 transitions. [2018-12-03 00:36:34,480 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 00:36:34,480 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 127 transitions. [2018-12-03 00:36:34,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-03 00:36:34,481 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 00:36:34,481 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 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-12-03 00:36:34,481 INFO L423 AbstractCegarLoop]: === Iteration 12 === [rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-03 00:36:34,481 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:36:34,481 INFO L82 PathProgramCache]: Analyzing trace with hash -30814145, now seen corresponding path program 1 times [2018-12-03 00:36:34,481 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 00:36:34,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:36:34,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:36:34,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:36:34,482 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 00:36:34,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:36:34,496 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-12-03 00:36:34,496 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 00:36:34,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 00:36:34,496 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 00:36:34,496 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 00:36:34,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 00:36:34,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 00:36:34,497 INFO L87 Difference]: Start difference. First operand 100 states and 127 transitions. Second operand 4 states. [2018-12-03 00:36:34,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 00:36:34,506 INFO L93 Difference]: Finished difference Result 110 states and 142 transitions. [2018-12-03 00:36:34,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 00:36:34,507 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2018-12-03 00:36:34,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 00:36:34,508 INFO L225 Difference]: With dead ends: 110 [2018-12-03 00:36:34,508 INFO L226 Difference]: Without dead ends: 109 [2018-12-03 00:36:34,508 INFO L631 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-12-03 00:36:34,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-12-03 00:36:34,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 106. [2018-12-03 00:36:34,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-12-03 00:36:34,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 133 transitions. [2018-12-03 00:36:34,514 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 133 transitions. Word has length 36 [2018-12-03 00:36:34,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 00:36:34,514 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 133 transitions. [2018-12-03 00:36:34,514 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 00:36:34,514 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 133 transitions. [2018-12-03 00:36:34,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-03 00:36:34,515 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 00:36:34,515 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 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-12-03 00:36:34,515 INFO L423 AbstractCegarLoop]: === Iteration 13 === [rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-03 00:36:34,515 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:36:34,515 INFO L82 PathProgramCache]: Analyzing trace with hash -955238442, now seen corresponding path program 1 times [2018-12-03 00:36:34,516 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 00:36:34,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:36:34,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:36:34,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:36:34,516 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 00:36:34,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:36:34,533 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 00:36:34,534 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 00:36:34,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 00:36:34,534 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 00:36:34,534 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 00:36:34,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 00:36:34,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 00:36:34,535 INFO L87 Difference]: Start difference. First operand 106 states and 133 transitions. Second operand 3 states. [2018-12-03 00:36:34,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 00:36:34,547 INFO L93 Difference]: Finished difference Result 106 states and 133 transitions. [2018-12-03 00:36:34,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 00:36:34,548 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-12-03 00:36:34,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 00:36:34,549 INFO L225 Difference]: With dead ends: 106 [2018-12-03 00:36:34,549 INFO L226 Difference]: Without dead ends: 105 [2018-12-03 00:36:34,549 INFO L631 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-12-03 00:36:34,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-12-03 00:36:34,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2018-12-03 00:36:34,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-12-03 00:36:34,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 130 transitions. [2018-12-03 00:36:34,554 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 130 transitions. Word has length 37 [2018-12-03 00:36:34,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 00:36:34,554 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 130 transitions. [2018-12-03 00:36:34,555 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 00:36:34,555 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 130 transitions. [2018-12-03 00:36:34,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-03 00:36:34,555 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 00:36:34,556 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 00:36:34,556 INFO L423 AbstractCegarLoop]: === Iteration 14 === [rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-03 00:36:34,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:36:34,556 INFO L82 PathProgramCache]: Analyzing trace with hash -1915961670, now seen corresponding path program 1 times [2018-12-03 00:36:34,556 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 00:36:34,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:36:34,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:36:34,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:36:34,557 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 00:36:34,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:36:34,599 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-03 00:36:34,600 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 00:36:34,600 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 00:36:34,600 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 41 with the following transitions: [2018-12-03 00:36:34,601 INFO L205 CegarAbsIntRunner]: [0], [1], [4], [24], [25], [28], [29], [31], [33], [35], [37], [39], [40], [41], [42], [46], [56], [57], [58], [59], [60], [61], [62], [64] [2018-12-03 00:36:34,621 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 00:36:34,621 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 00:36:34,699 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 00:36:34,699 INFO L272 AbstractInterpreter]: Visited 24 different actions 29 times. Merged at 2 different actions 2 times. Never widened. Performed 54 root evaluator evaluations with a maximum evaluation depth of 3. Performed 54 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 5 variables. [2018-12-03 00:36:34,704 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:36:34,704 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 00:36:34,737 INFO L227 lantSequenceWeakener]: Weakened 8 states. On average, predicates are now at 60.42% of their original sizes. [2018-12-03 00:36:34,738 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 00:36:34,763 INFO L418 sIntCurrentIteration]: We unified 39 AI predicates to 39 [2018-12-03 00:36:34,764 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 00:36:34,764 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 00:36:34,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [6] total 13 [2018-12-03 00:36:34,764 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 00:36:34,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 00:36:34,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 00:36:34,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-03 00:36:34,765 INFO L87 Difference]: Start difference. First operand 105 states and 130 transitions. Second operand 9 states. [2018-12-03 00:36:34,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 00:36:34,945 INFO L93 Difference]: Finished difference Result 208 states and 260 transitions. [2018-12-03 00:36:34,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 00:36:34,945 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 40 [2018-12-03 00:36:34,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 00:36:34,946 INFO L225 Difference]: With dead ends: 208 [2018-12-03 00:36:34,946 INFO L226 Difference]: Without dead ends: 114 [2018-12-03 00:36:34,947 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 44 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2018-12-03 00:36:34,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-12-03 00:36:34,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 111. [2018-12-03 00:36:34,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-12-03 00:36:34,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 135 transitions. [2018-12-03 00:36:34,953 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 135 transitions. Word has length 40 [2018-12-03 00:36:34,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 00:36:34,953 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 135 transitions. [2018-12-03 00:36:34,953 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 00:36:34,953 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 135 transitions. [2018-12-03 00:36:34,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-03 00:36:34,954 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 00:36:34,955 INFO L402 BasicCegarLoop]: trace histogram [6, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 00:36:34,955 INFO L423 AbstractCegarLoop]: === Iteration 15 === [rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-03 00:36:34,955 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:36:34,955 INFO L82 PathProgramCache]: Analyzing trace with hash -1581313670, now seen corresponding path program 1 times [2018-12-03 00:36:34,956 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 00:36:34,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:36:34,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:36:34,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:36:34,957 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 00:36:34,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:36:34,986 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-12-03 00:36:34,987 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 00:36:34,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 00:36:34,987 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 00:36:34,987 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 00:36:34,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 00:36:34,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 00:36:34,987 INFO L87 Difference]: Start difference. First operand 111 states and 135 transitions. Second operand 5 states. [2018-12-03 00:36:35,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 00:36:35,009 INFO L93 Difference]: Finished difference Result 111 states and 135 transitions. [2018-12-03 00:36:35,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 00:36:35,009 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2018-12-03 00:36:35,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 00:36:35,010 INFO L225 Difference]: With dead ends: 111 [2018-12-03 00:36:35,010 INFO L226 Difference]: Without dead ends: 110 [2018-12-03 00:36:35,010 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-03 00:36:35,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-12-03 00:36:35,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 99. [2018-12-03 00:36:35,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-12-03 00:36:35,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 118 transitions. [2018-12-03 00:36:35,016 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 118 transitions. Word has length 52 [2018-12-03 00:36:35,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 00:36:35,016 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 118 transitions. [2018-12-03 00:36:35,016 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 00:36:35,016 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 118 transitions. [2018-12-03 00:36:35,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-03 00:36:35,017 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 00:36:35,017 INFO L402 BasicCegarLoop]: trace histogram [11, 10, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 00:36:35,017 INFO L423 AbstractCegarLoop]: === Iteration 16 === [rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-03 00:36:35,017 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:36:35,017 INFO L82 PathProgramCache]: Analyzing trace with hash 814042608, now seen corresponding path program 1 times [2018-12-03 00:36:35,018 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 00:36:35,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:36:35,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:36:35,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:36:35,018 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 00:36:35,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:36:35,065 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 58 proven. 13 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2018-12-03 00:36:35,065 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 00:36:35,065 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 00:36:35,065 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 96 with the following transitions: [2018-12-03 00:36:35,066 INFO L205 CegarAbsIntRunner]: [0], [1], [4], [5], [7], [9], [11], [13], [15], [17], [19], [20], [21], [23], [24], [25], [29], [31], [33], [35], [46], [50], [51], [52], [53], [54], [55], [56], [57], [58], [60], [61], [62], [64] [2018-12-03 00:36:35,067 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 00:36:35,067 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 00:36:35,142 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 00:36:35,142 INFO L272 AbstractInterpreter]: Visited 34 different actions 169 times. Merged at 13 different actions 26 times. Never widened. Performed 431 root evaluator evaluations with a maximum evaluation depth of 3. Performed 431 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 2 different actions. Largest state had 6 variables. [2018-12-03 00:36:35,144 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:36:35,144 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 00:36:35,191 INFO L227 lantSequenceWeakener]: Weakened 26 states. On average, predicates are now at 56.73% of their original sizes. [2018-12-03 00:36:35,191 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 00:36:35,296 INFO L418 sIntCurrentIteration]: We unified 94 AI predicates to 94 [2018-12-03 00:36:35,296 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 00:36:35,296 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 00:36:35,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [6] total 21 [2018-12-03 00:36:35,296 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 00:36:35,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-03 00:36:35,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-03 00:36:35,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2018-12-03 00:36:35,298 INFO L87 Difference]: Start difference. First operand 99 states and 118 transitions. Second operand 17 states. [2018-12-03 00:36:35,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 00:36:35,839 INFO L93 Difference]: Finished difference Result 153 states and 181 transitions. [2018-12-03 00:36:35,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-03 00:36:35,839 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 95 [2018-12-03 00:36:35,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 00:36:35,840 INFO L225 Difference]: With dead ends: 153 [2018-12-03 00:36:35,840 INFO L226 Difference]: Without dead ends: 63 [2018-12-03 00:36:35,842 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 107 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=700, Unknown=0, NotChecked=0, Total=812 [2018-12-03 00:36:35,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-12-03 00:36:35,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-12-03 00:36:35,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-12-03 00:36:35,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2018-12-03 00:36:35,846 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 95 [2018-12-03 00:36:35,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 00:36:35,847 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2018-12-03 00:36:35,847 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-03 00:36:35,847 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2018-12-03 00:36:35,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-03 00:36:35,848 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 00:36:35,848 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 00:36:35,848 INFO L423 AbstractCegarLoop]: === Iteration 17 === [rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-03 00:36:35,848 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:36:35,849 INFO L82 PathProgramCache]: Analyzing trace with hash 77369472, now seen corresponding path program 1 times [2018-12-03 00:36:35,849 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 00:36:35,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:36:35,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 00:36:35,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 00:36:35,850 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 00:36:35,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 00:36:35,879 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-12-03 00:36:35,879 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 00:36:35,880 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 00:36:35,880 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 65 with the following transitions: [2018-12-03 00:36:35,880 INFO L205 CegarAbsIntRunner]: [0], [1], [4], [5], [7], [9], [11], [13], [15], [17], [19], [21], [23], [24], [25], [28], [29], [31], [33], [35], [37], [39], [40], [41], [42], [46], [50], [51], [52], [53], [54], [55], [56], [57], [58], [59], [60], [61], [62], [64] [2018-12-03 00:36:35,881 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 00:36:35,881 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 00:36:35,921 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 00:36:35,921 INFO L272 AbstractInterpreter]: Visited 40 different actions 191 times. Merged at 18 different actions 35 times. Never widened. Performed 498 root evaluator evaluations with a maximum evaluation depth of 3. Performed 498 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 3 different actions. Largest state had 6 variables. [2018-12-03 00:36:35,928 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 00:36:35,928 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 00:36:35,950 INFO L227 lantSequenceWeakener]: Weakened 41 states. On average, predicates are now at 60.57% of their original sizes. [2018-12-03 00:36:35,950 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 00:36:36,087 INFO L418 sIntCurrentIteration]: We unified 63 AI predicates to 63 [2018-12-03 00:36:36,088 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 00:36:36,088 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 00:36:36,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [5] total 27 [2018-12-03 00:36:36,088 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 00:36:36,088 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-03 00:36:36,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-03 00:36:36,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=497, Unknown=0, NotChecked=0, Total=552 [2018-12-03 00:36:36,089 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 24 states. [2018-12-03 00:36:36,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 00:36:36,670 INFO L93 Difference]: Finished difference Result 63 states and 64 transitions. [2018-12-03 00:36:36,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-03 00:36:36,671 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 64 [2018-12-03 00:36:36,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 00:36:36,671 INFO L225 Difference]: With dead ends: 63 [2018-12-03 00:36:36,671 INFO L226 Difference]: Without dead ends: 0 [2018-12-03 00:36:36,672 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 80 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=179, Invalid=1461, Unknown=0, NotChecked=0, Total=1640 [2018-12-03 00:36:36,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-03 00:36:36,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-03 00:36:36,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-03 00:36:36,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-03 00:36:36,672 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 64 [2018-12-03 00:36:36,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 00:36:36,672 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-03 00:36:36,673 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-03 00:36:36,673 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-03 00:36:36,673 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-03 00:36:36,676 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-03 00:36:36,948 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-12-03 00:36:36,948 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-03 00:36:36,948 INFO L448 ceAbstractionStarter]: For program point rec1FINAL(lines 11 15) no Hoare annotation was computed. [2018-12-03 00:36:36,948 INFO L448 ceAbstractionStarter]: For program point rec1EXIT(lines 11 15) no Hoare annotation was computed. [2018-12-03 00:36:36,948 INFO L448 ceAbstractionStarter]: For program point rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2018-12-03 00:36:36,948 INFO L448 ceAbstractionStarter]: For program point rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2018-12-03 00:36:36,948 INFO L448 ceAbstractionStarter]: For program point rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2018-12-03 00:36:36,948 INFO L448 ceAbstractionStarter]: For program point rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2018-12-03 00:36:36,948 INFO L448 ceAbstractionStarter]: For program point L14(line 14) no Hoare annotation was computed. [2018-12-03 00:36:36,949 INFO L451 ceAbstractionStarter]: At program point rec1ENTRY(lines 11 15) the Hoare annotation is: true [2018-12-03 00:36:36,949 INFO L448 ceAbstractionStarter]: For program point L14-1(line 14) no Hoare annotation was computed. [2018-12-03 00:36:36,949 INFO L448 ceAbstractionStarter]: For program point L12(lines 12 13) no Hoare annotation was computed. [2018-12-03 00:36:36,949 INFO L444 ceAbstractionStarter]: At program point L14-2(line 14) the Hoare annotation is: (and (not (= (+ |rec1_#in~i| 1) 0)) (or (and (<= rec1_~i 2147483647) (<= 1 rec1_~i)) (< 2147483647 |rec1_#in~i|)) (not (= |rec1_#in~i| 0))) [2018-12-03 00:36:36,949 INFO L448 ceAbstractionStarter]: For program point L14-3(line 14) no Hoare annotation was computed. [2018-12-03 00:36:36,949 INFO L448 ceAbstractionStarter]: For program point L14-4(line 14) no Hoare annotation was computed. [2018-12-03 00:36:36,949 INFO L448 ceAbstractionStarter]: For program point L14-5(line 14) no Hoare annotation was computed. [2018-12-03 00:36:36,949 INFO L448 ceAbstractionStarter]: For program point rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2018-12-03 00:36:36,949 INFO L444 ceAbstractionStarter]: At program point L14-6(line 14) the Hoare annotation is: (and (not (= (+ |rec1_#in~i| 1) 0)) (not (= |rec1_#in~i| 0)) (or (and (or (= |rec1_#t~ret0| 0) (= |rec1_#t~ret0| 1)) (<= rec1_~i 2147483647) (<= 1 rec1_~i)) (< 2147483647 |rec1_#in~i|))) [2018-12-03 00:36:36,949 INFO L448 ceAbstractionStarter]: For program point rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2018-12-03 00:36:36,949 INFO L448 ceAbstractionStarter]: For program point L14-7(line 14) no Hoare annotation was computed. [2018-12-03 00:36:36,950 INFO L444 ceAbstractionStarter]: At program point L14-8(line 14) the Hoare annotation is: (and (not (= (+ |rec1_#in~i| 1) 0)) (not (= |rec1_#in~i| 0)) (or (and (or (= |rec1_#t~ret0| 0) (= |rec1_#t~ret0| 1)) (= |rec1_#t~ret1| 0) (<= rec1_~i 2147483647) (<= 1 rec1_~i)) (< 2147483647 |rec1_#in~i|))) [2018-12-03 00:36:36,950 INFO L448 ceAbstractionStarter]: For program point L14-9(line 14) no Hoare annotation was computed. [2018-12-03 00:36:36,950 INFO L448 ceAbstractionStarter]: For program point L14-10(line 14) no Hoare annotation was computed. [2018-12-03 00:36:36,950 INFO L448 ceAbstractionStarter]: For program point L14-11(line 14) no Hoare annotation was computed. [2018-12-03 00:36:36,950 INFO L448 ceAbstractionStarter]: For program point rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2018-12-03 00:36:36,950 INFO L448 ceAbstractionStarter]: For program point rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2018-12-03 00:36:36,950 INFO L448 ceAbstractionStarter]: For program point rec2FINAL(lines 17 21) no Hoare annotation was computed. [2018-12-03 00:36:36,950 INFO L448 ceAbstractionStarter]: For program point rec2EXIT(lines 17 21) no Hoare annotation was computed. [2018-12-03 00:36:36,950 INFO L448 ceAbstractionStarter]: For program point L20(line 20) no Hoare annotation was computed. [2018-12-03 00:36:36,950 INFO L448 ceAbstractionStarter]: For program point L20-1(line 20) no Hoare annotation was computed. [2018-12-03 00:36:36,950 INFO L448 ceAbstractionStarter]: For program point L18(lines 18 19) no Hoare annotation was computed. [2018-12-03 00:36:36,950 INFO L444 ceAbstractionStarter]: At program point L20-2(line 20) the Hoare annotation is: (and (or (and (<= rec2_~j 2147483647) (<= 1 rec2_~j)) (< 2147483647 |rec2_#in~j|)) (or (= rec2_~j 1) (not (= |rec2_#in~j| 1))) (not (= |rec2_#in~j| 0))) [2018-12-03 00:36:36,951 INFO L448 ceAbstractionStarter]: For program point L20-3(line 20) no Hoare annotation was computed. [2018-12-03 00:36:36,951 INFO L444 ceAbstractionStarter]: At program point L20-4(line 20) the Hoare annotation is: (let ((.cse0 (= |rec2_#t~ret3| 0))) (and (or (and (<= rec2_~j 2147483647) (<= 1 rec2_~j) (or .cse0 (= |rec2_#t~ret3| 1))) (< 2147483647 |rec2_#in~j|)) (or (and .cse0 (= rec2_~j 1)) (not (= |rec2_#in~j| 1))) (not (= |rec2_#in~j| 0)))) [2018-12-03 00:36:36,951 INFO L448 ceAbstractionStarter]: For program point L20-5(line 20) no Hoare annotation was computed. [2018-12-03 00:36:36,951 INFO L448 ceAbstractionStarter]: For program point L20-6(line 20) no Hoare annotation was computed. [2018-12-03 00:36:36,951 INFO L448 ceAbstractionStarter]: For program point L20-7(line 20) no Hoare annotation was computed. [2018-12-03 00:36:36,951 INFO L451 ceAbstractionStarter]: At program point rec2ENTRY(lines 17 21) the Hoare annotation is: true [2018-12-03 00:36:36,951 INFO L448 ceAbstractionStarter]: For program point rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2018-12-03 00:36:36,951 INFO L448 ceAbstractionStarter]: For program point rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2018-12-03 00:36:36,951 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-03 00:36:36,951 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-12-03 00:36:36,951 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-03 00:36:36,951 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-03 00:36:36,951 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 23 26) the Hoare annotation is: true [2018-12-03 00:36:36,951 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 23 26) no Hoare annotation was computed. [2018-12-03 00:36:36,951 INFO L444 ceAbstractionStarter]: At program point L25(line 25) the Hoare annotation is: (<= main_~x~0 2147483647) [2018-12-03 00:36:36,951 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 23 26) no Hoare annotation was computed. [2018-12-03 00:36:36,951 INFO L448 ceAbstractionStarter]: For program point L25-1(line 25) no Hoare annotation was computed. [2018-12-03 00:36:36,953 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 12:36:36 BoogieIcfgContainer [2018-12-03 00:36:36,953 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 00:36:36,954 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-03 00:36:36,954 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-03 00:36:36,954 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-03 00:36:36,954 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 12:36:33" (3/4) ... [2018-12-03 00:36:36,956 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-03 00:36:36,960 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-03 00:36:36,961 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure rec1 [2018-12-03 00:36:36,961 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure rec2 [2018-12-03 00:36:36,961 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-03 00:36:36,964 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2018-12-03 00:36:36,964 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-12-03 00:36:36,964 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-03 00:36:36,995 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_af4afe2c-4e52-4a37-a794-e79dae011079/bin-2019/utaipan/witness.graphml [2018-12-03 00:36:36,995 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-03 00:36:36,996 INFO L168 Benchmark]: Toolchain (without parser) took 3652.03 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 295.7 MB). Free memory was 960.3 MB in the beginning and 1.3 GB in the end (delta: -306.5 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 00:36:36,997 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 00:36:36,997 INFO L168 Benchmark]: CACSL2BoogieTranslator took 120.54 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-12-03 00:36:36,997 INFO L168 Benchmark]: Boogie Procedure Inliner took 11.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-12-03 00:36:36,998 INFO L168 Benchmark]: Boogie Preprocessor took 10.67 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-12-03 00:36:36,998 INFO L168 Benchmark]: RCFGBuilder took 174.97 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 109.6 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -139.1 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2018-12-03 00:36:36,998 INFO L168 Benchmark]: TraceAbstraction took 3289.57 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 186.1 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -178.1 MB). Peak memory consumption was 405.8 MB. Max. memory is 11.5 GB. [2018-12-03 00:36:36,998 INFO L168 Benchmark]: Witness Printer took 41.51 ms. Allocated memory is still 1.3 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 00:36:37,000 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 120.54 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 11.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 10.67 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. * RCFGBuilder took 174.97 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 109.6 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -139.1 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3289.57 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 186.1 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -178.1 MB). Peak memory consumption was 405.8 MB. Max. memory is 11.5 GB. * Witness Printer took 41.51 ms. Allocated memory is still 1.3 GB. Free memory is still 1.3 GB. There was no memory consumed. 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.2s OverallTime, 17 OverallIterations, 11 TraceHistogramMax, 1.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 721 SDtfs, 345 SDslu, 1976 SDs, 0 SdLazy, 336 SolverSat, 105 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 6 DeclaredPredicates, 287 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 379 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=111occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.2s AbstIntTime, 3 AbstIntIterations, 3 AbstIntStrong, 0.8460884353741496 AbsIntWeakeningRatio, 0.5357142857142857 AbsIntAvgWeakeningVarsNumRemoved, 0.27040816326530615 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 17 MinimizatonAttempts, 57 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 129 PreInvPairs, 136 NumberOfFragments, 159 HoareAnnotationTreeSize, 129 FomulaSimplifications, 118 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 12 FomulaSimplificationsInter, 243 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 549 NumberOfCodeBlocks, 549 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 532 ConstructedInterpolants, 0 QuantifiedInterpolants, 34512 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 14 PerfectInterpolantSequences, 427/450 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...