./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/termination-crafted/NestedRecursion_1b.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_c5cc408f-43c8-485b-8216-8871e76fd419/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_c5cc408f-43c8-485b-8216-8871e76fd419/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_c5cc408f-43c8-485b-8216-8871e76fd419/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_c5cc408f-43c8-485b-8216-8871e76fd419/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/termination-crafted/NestedRecursion_1b.c -s /tmp/vcloud-vcloud-master/worker/run_dir_c5cc408f-43c8-485b-8216-8871e76fd419/bin/utaipan/config/svcomp-Overflow-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_c5cc408f-43c8-485b-8216-8871e76fd419/bin/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.25-f470102 [2019-12-07 21:02:26,531 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 21:02:26,532 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 21:02:26,540 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 21:02:26,540 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 21:02:26,541 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 21:02:26,542 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 21:02:26,543 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 21:02:26,545 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 21:02:26,545 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 21:02:26,546 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 21:02:26,547 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 21:02:26,547 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 21:02:26,548 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 21:02:26,548 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 21:02:26,549 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 21:02:26,550 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 21:02:26,551 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 21:02:26,552 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 21:02:26,553 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 21:02:26,555 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 21:02:26,556 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 21:02:26,556 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 21:02:26,557 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 21:02:26,559 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 21:02:26,559 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 21:02:26,559 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 21:02:26,560 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 21:02:26,560 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 21:02:26,561 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 21:02:26,561 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 21:02:26,561 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 21:02:26,562 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 21:02:26,562 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 21:02:26,563 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 21:02:26,563 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 21:02:26,564 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 21:02:26,564 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 21:02:26,564 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 21:02:26,565 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 21:02:26,567 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 21:02:26,567 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_c5cc408f-43c8-485b-8216-8871e76fd419/bin/utaipan/config/svcomp-Overflow-64bit-Taipan_Default.epf [2019-12-07 21:02:26,579 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 21:02:26,580 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 21:02:26,580 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 21:02:26,580 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 21:02:26,580 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 21:02:26,580 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 21:02:26,581 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 21:02:26,581 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 21:02:26,581 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 21:02:26,581 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 21:02:26,581 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 21:02:26,581 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 21:02:26,581 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 21:02:26,582 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 21:02:26,582 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 21:02:26,582 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 21:02:26,582 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 21:02:26,582 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 21:02:26,582 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 21:02:26,583 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 21:02:26,583 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 21:02:26,583 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 21:02:26,583 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2019-12-07 21:02:26,583 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 21:02:26,583 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 21:02:26,583 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 21:02:26,583 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 21:02:26,583 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 21:02:26,584 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 21:02:26,584 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 21:02:26,584 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 21:02:26,584 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 21:02:26,584 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 21:02:26,584 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 21:02:26,584 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 21:02:26,584 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 21:02:26,584 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 21:02:26,584 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 21:02:26,585 INFO L138 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/run_dir_c5cc408f-43c8-485b-8216-8871e76fd419/bin/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 [2019-12-07 21:02:26,680 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 21:02:26,688 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 21:02:26,690 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 21:02:26,691 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 21:02:26,691 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 21:02:26,692 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_c5cc408f-43c8-485b-8216-8871e76fd419/bin/utaipan/../../sv-benchmarks/c/termination-crafted/NestedRecursion_1b.c [2019-12-07 21:02:26,728 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c5cc408f-43c8-485b-8216-8871e76fd419/bin/utaipan/data/25768c774/bee6166ea02d4a58a7073f25f44fc094/FLAG35d6a14fc [2019-12-07 21:02:27,048 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 21:02:27,049 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_c5cc408f-43c8-485b-8216-8871e76fd419/sv-benchmarks/c/termination-crafted/NestedRecursion_1b.c [2019-12-07 21:02:27,053 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c5cc408f-43c8-485b-8216-8871e76fd419/bin/utaipan/data/25768c774/bee6166ea02d4a58a7073f25f44fc094/FLAG35d6a14fc [2019-12-07 21:02:27,062 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_c5cc408f-43c8-485b-8216-8871e76fd419/bin/utaipan/data/25768c774/bee6166ea02d4a58a7073f25f44fc094 [2019-12-07 21:02:27,064 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 21:02:27,065 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 21:02:27,065 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 21:02:27,065 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 21:02:27,068 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 21:02:27,068 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 09:02:27" (1/1) ... [2019-12-07 21:02:27,070 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@503a86d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:02:27, skipping insertion in model container [2019-12-07 21:02:27,070 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 09:02:27" (1/1) ... [2019-12-07 21:02:27,075 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 21:02:27,085 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 21:02:27,180 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 21:02:27,182 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 21:02:27,227 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 21:02:27,236 INFO L208 MainTranslator]: Completed translation [2019-12-07 21:02:27,236 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:02:27 WrapperNode [2019-12-07 21:02:27,237 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 21:02:27,237 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 21:02:27,237 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 21:02:27,237 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 21:02:27,243 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:02:27" (1/1) ... [2019-12-07 21:02:27,246 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:02:27" (1/1) ... [2019-12-07 21:02:27,257 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 21:02:27,257 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 21:02:27,257 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 21:02:27,258 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 21:02:27,264 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:02:27" (1/1) ... [2019-12-07 21:02:27,264 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:02:27" (1/1) ... [2019-12-07 21:02:27,265 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:02:27" (1/1) ... [2019-12-07 21:02:27,265 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:02:27" (1/1) ... [2019-12-07 21:02:27,266 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:02:27" (1/1) ... [2019-12-07 21:02:27,268 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:02:27" (1/1) ... [2019-12-07 21:02:27,268 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:02:27" (1/1) ... [2019-12-07 21:02:27,269 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 21:02:27,269 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 21:02:27,269 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 21:02:27,270 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 21:02:27,270 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:02:27" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c5cc408f-43c8-485b-8216-8871e76fd419/bin/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 [2019-12-07 21:02:27,310 INFO L130 BoogieDeclarations]: Found specification of procedure rec1 [2019-12-07 21:02:27,310 INFO L138 BoogieDeclarations]: Found implementation of procedure rec1 [2019-12-07 21:02:27,310 INFO L130 BoogieDeclarations]: Found specification of procedure rec2 [2019-12-07 21:02:27,310 INFO L138 BoogieDeclarations]: Found implementation of procedure rec2 [2019-12-07 21:02:27,310 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 21:02:27,310 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 21:02:27,438 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 21:02:27,439 INFO L287 CfgBuilder]: Removed 4 assume(true) statements. [2019-12-07 21:02:27,439 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 09:02:27 BoogieIcfgContainer [2019-12-07 21:02:27,440 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 21:02:27,440 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 21:02:27,440 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 21:02:27,442 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 21:02:27,442 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 09:02:27" (1/3) ... [2019-12-07 21:02:27,443 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@601c1bf4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 09:02:27, skipping insertion in model container [2019-12-07 21:02:27,443 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:02:27" (2/3) ... [2019-12-07 21:02:27,443 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@601c1bf4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 09:02:27, skipping insertion in model container [2019-12-07 21:02:27,443 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 09:02:27" (3/3) ... [2019-12-07 21:02:27,444 INFO L109 eAbstractionObserver]: Analyzing ICFG NestedRecursion_1b.c [2019-12-07 21:02:27,451 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 21:02:27,455 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 10 error locations. [2019-12-07 21:02:27,462 INFO L249 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2019-12-07 21:02:27,477 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 21:02:27,478 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 21:02:27,478 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 21:02:27,478 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 21:02:27,478 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 21:02:27,478 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 21:02:27,478 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 21:02:27,478 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 21:02:27,491 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states. [2019-12-07 21:02:27,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 21:02:27,494 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:02:27,495 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-07 21:02:27,495 INFO L410 AbstractCegarLoop]: === Iteration 1 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 21:02:27,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:02:27,499 INFO L82 PathProgramCache]: Analyzing trace with hash 70122184, now seen corresponding path program 1 times [2019-12-07 21:02:27,505 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:02:27,505 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331890850] [2019-12-07 21:02:27,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:02:27,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:02:27,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:02:27,603 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331890850] [2019-12-07 21:02:27,604 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:02:27,604 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 21:02:27,605 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989874905] [2019-12-07 21:02:27,608 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 21:02:27,608 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:02:27,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 21:02:27,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 21:02:27,618 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 5 states. [2019-12-07 21:02:27,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:02:27,680 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2019-12-07 21:02:27,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 21:02:27,681 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-12-07 21:02:27,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:02:27,688 INFO L225 Difference]: With dead ends: 60 [2019-12-07 21:02:27,688 INFO L226 Difference]: Without dead ends: 55 [2019-12-07 21:02:27,690 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 21:02:27,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-12-07 21:02:27,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 50. [2019-12-07 21:02:27,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-12-07 21:02:27,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 59 transitions. [2019-12-07 21:02:27,723 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 59 transitions. Word has length 5 [2019-12-07 21:02:27,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:02:27,724 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 59 transitions. [2019-12-07 21:02:27,724 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 21:02:27,724 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 59 transitions. [2019-12-07 21:02:27,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-12-07 21:02:27,724 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:02:27,724 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-12-07 21:02:27,724 INFO L410 AbstractCegarLoop]: === Iteration 2 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 21:02:27,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:02:27,725 INFO L82 PathProgramCache]: Analyzing trace with hash -2121179530, now seen corresponding path program 1 times [2019-12-07 21:02:27,725 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:02:27,725 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121808281] [2019-12-07 21:02:27,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:02:27,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:02:27,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:02:27,737 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121808281] [2019-12-07 21:02:27,737 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:02:27,737 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 21:02:27,738 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809338443] [2019-12-07 21:02:27,738 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:02:27,739 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:02:27,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:02:27,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:02:27,739 INFO L87 Difference]: Start difference. First operand 50 states and 59 transitions. Second operand 3 states. [2019-12-07 21:02:27,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:02:27,749 INFO L93 Difference]: Finished difference Result 52 states and 62 transitions. [2019-12-07 21:02:27,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:02:27,750 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2019-12-07 21:02:27,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:02:27,751 INFO L225 Difference]: With dead ends: 52 [2019-12-07 21:02:27,751 INFO L226 Difference]: Without dead ends: 51 [2019-12-07 21:02:27,751 INFO L630 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 [2019-12-07 21:02:27,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-12-07 21:02:27,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2019-12-07 21:02:27,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-12-07 21:02:27,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 57 transitions. [2019-12-07 21:02:27,759 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 57 transitions. Word has length 6 [2019-12-07 21:02:27,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:02:27,760 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 57 transitions. [2019-12-07 21:02:27,760 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:02:27,760 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2019-12-07 21:02:27,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 21:02:27,760 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:02:27,760 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:02:27,760 INFO L410 AbstractCegarLoop]: === Iteration 3 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 21:02:27,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:02:27,761 INFO L82 PathProgramCache]: Analyzing trace with hash -2074588191, now seen corresponding path program 1 times [2019-12-07 21:02:27,761 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:02:27,761 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400933584] [2019-12-07 21:02:27,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:02:27,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:02:27,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:02:27,796 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400933584] [2019-12-07 21:02:27,796 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:02:27,796 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 21:02:27,796 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149646002] [2019-12-07 21:02:27,797 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 21:02:27,797 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:02:27,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 21:02:27,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 21:02:27,797 INFO L87 Difference]: Start difference. First operand 49 states and 57 transitions. Second operand 7 states. [2019-12-07 21:02:27,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:02:27,877 INFO L93 Difference]: Finished difference Result 77 states and 92 transitions. [2019-12-07 21:02:27,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 21:02:27,878 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2019-12-07 21:02:27,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:02:27,879 INFO L225 Difference]: With dead ends: 77 [2019-12-07 21:02:27,879 INFO L226 Difference]: Without dead ends: 76 [2019-12-07 21:02:27,879 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-07 21:02:27,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-12-07 21:02:27,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 65. [2019-12-07 21:02:27,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-12-07 21:02:27,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 81 transitions. [2019-12-07 21:02:27,889 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 81 transitions. Word has length 10 [2019-12-07 21:02:27,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:02:27,889 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 81 transitions. [2019-12-07 21:02:27,889 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 21:02:27,889 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 81 transitions. [2019-12-07 21:02:27,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 21:02:27,890 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:02:27,890 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:02:27,890 INFO L410 AbstractCegarLoop]: === Iteration 4 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 21:02:27,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:02:27,890 INFO L82 PathProgramCache]: Analyzing trace with hash 112275557, now seen corresponding path program 1 times [2019-12-07 21:02:27,890 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:02:27,891 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837847326] [2019-12-07 21:02:27,891 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:02:27,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:02:27,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:02:27,903 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837847326] [2019-12-07 21:02:27,904 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:02:27,904 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 21:02:27,904 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669644461] [2019-12-07 21:02:27,904 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:02:27,904 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:02:27,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:02:27,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:02:27,905 INFO L87 Difference]: Start difference. First operand 65 states and 81 transitions. Second operand 3 states. [2019-12-07 21:02:27,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:02:27,914 INFO L93 Difference]: Finished difference Result 69 states and 91 transitions. [2019-12-07 21:02:27,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:02:27,914 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-07 21:02:27,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:02:27,915 INFO L225 Difference]: With dead ends: 69 [2019-12-07 21:02:27,915 INFO L226 Difference]: Without dead ends: 68 [2019-12-07 21:02:27,915 INFO L630 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 [2019-12-07 21:02:27,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-12-07 21:02:27,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 64. [2019-12-07 21:02:27,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-12-07 21:02:27,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 79 transitions. [2019-12-07 21:02:27,924 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 79 transitions. Word has length 11 [2019-12-07 21:02:27,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:02:27,924 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 79 transitions. [2019-12-07 21:02:27,924 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:02:27,925 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 79 transitions. [2019-12-07 21:02:27,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 21:02:27,925 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:02:27,925 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:02:27,925 INFO L410 AbstractCegarLoop]: === Iteration 5 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 21:02:27,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:02:27,926 INFO L82 PathProgramCache]: Analyzing trace with hash -2048531074, now seen corresponding path program 1 times [2019-12-07 21:02:27,926 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:02:27,926 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328559082] [2019-12-07 21:02:27,926 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:02:27,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:02:27,958 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:02:27,959 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328559082] [2019-12-07 21:02:27,959 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:02:27,959 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 21:02:27,959 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772767958] [2019-12-07 21:02:27,959 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 21:02:27,959 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:02:27,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 21:02:27,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 21:02:27,960 INFO L87 Difference]: Start difference. First operand 64 states and 79 transitions. Second operand 6 states. [2019-12-07 21:02:27,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:02:27,993 INFO L93 Difference]: Finished difference Result 125 states and 160 transitions. [2019-12-07 21:02:27,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 21:02:27,994 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-12-07 21:02:27,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:02:27,995 INFO L225 Difference]: With dead ends: 125 [2019-12-07 21:02:27,995 INFO L226 Difference]: Without dead ends: 86 [2019-12-07 21:02:27,996 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-07 21:02:27,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-12-07 21:02:28,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 76. [2019-12-07 21:02:28,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-12-07 21:02:28,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 98 transitions. [2019-12-07 21:02:28,005 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 98 transitions. Word has length 16 [2019-12-07 21:02:28,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:02:28,006 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 98 transitions. [2019-12-07 21:02:28,006 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 21:02:28,006 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 98 transitions. [2019-12-07 21:02:28,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 21:02:28,006 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:02:28,007 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:02:28,007 INFO L410 AbstractCegarLoop]: === Iteration 6 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 21:02:28,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:02:28,007 INFO L82 PathProgramCache]: Analyzing trace with hash -57180086, now seen corresponding path program 1 times [2019-12-07 21:02:28,007 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:02:28,007 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029083946] [2019-12-07 21:02:28,008 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:02:28,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:02:28,021 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 21:02:28,021 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029083946] [2019-12-07 21:02:28,021 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:02:28,021 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 21:02:28,022 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371009335] [2019-12-07 21:02:28,022 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:02:28,022 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:02:28,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:02:28,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:02:28,022 INFO L87 Difference]: Start difference. First operand 76 states and 98 transitions. Second operand 3 states. [2019-12-07 21:02:28,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:02:28,031 INFO L93 Difference]: Finished difference Result 76 states and 98 transitions. [2019-12-07 21:02:28,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:02:28,031 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-07 21:02:28,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:02:28,032 INFO L225 Difference]: With dead ends: 76 [2019-12-07 21:02:28,032 INFO L226 Difference]: Without dead ends: 75 [2019-12-07 21:02:28,033 INFO L630 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 [2019-12-07 21:02:28,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-12-07 21:02:28,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-12-07 21:02:28,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-12-07 21:02:28,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 96 transitions. [2019-12-07 21:02:28,041 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 96 transitions. Word has length 18 [2019-12-07 21:02:28,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:02:28,041 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 96 transitions. [2019-12-07 21:02:28,041 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:02:28,041 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 96 transitions. [2019-12-07 21:02:28,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 21:02:28,042 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:02:28,042 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:02:28,042 INFO L410 AbstractCegarLoop]: === Iteration 7 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 21:02:28,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:02:28,042 INFO L82 PathProgramCache]: Analyzing trace with hash -599425808, now seen corresponding path program 1 times [2019-12-07 21:02:28,043 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:02:28,043 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371961877] [2019-12-07 21:02:28,043 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:02:28,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:02:28,056 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 21:02:28,056 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371961877] [2019-12-07 21:02:28,057 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:02:28,057 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 21:02:28,057 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401291659] [2019-12-07 21:02:28,057 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:02:28,057 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:02:28,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:02:28,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:02:28,057 INFO L87 Difference]: Start difference. First operand 75 states and 96 transitions. Second operand 3 states. [2019-12-07 21:02:28,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:02:28,064 INFO L93 Difference]: Finished difference Result 75 states and 96 transitions. [2019-12-07 21:02:28,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:02:28,065 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-12-07 21:02:28,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:02:28,065 INFO L225 Difference]: With dead ends: 75 [2019-12-07 21:02:28,066 INFO L226 Difference]: Without dead ends: 74 [2019-12-07 21:02:28,066 INFO L630 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 [2019-12-07 21:02:28,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-12-07 21:02:28,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-12-07 21:02:28,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-12-07 21:02:28,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 94 transitions. [2019-12-07 21:02:28,073 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 94 transitions. Word has length 19 [2019-12-07 21:02:28,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:02:28,073 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 94 transitions. [2019-12-07 21:02:28,073 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:02:28,073 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 94 transitions. [2019-12-07 21:02:28,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 21:02:28,074 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:02:28,074 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:02:28,074 INFO L410 AbstractCegarLoop]: === Iteration 8 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 21:02:28,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:02:28,074 INFO L82 PathProgramCache]: Analyzing trace with hash -1772582622, now seen corresponding path program 1 times [2019-12-07 21:02:28,074 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:02:28,075 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925174928] [2019-12-07 21:02:28,075 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:02:28,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:02:28,090 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 21:02:28,090 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925174928] [2019-12-07 21:02:28,090 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:02:28,090 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 21:02:28,091 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63670015] [2019-12-07 21:02:28,091 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 21:02:28,091 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:02:28,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 21:02:28,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:02:28,091 INFO L87 Difference]: Start difference. First operand 74 states and 94 transitions. Second operand 4 states. [2019-12-07 21:02:28,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:02:28,104 INFO L93 Difference]: Finished difference Result 95 states and 126 transitions. [2019-12-07 21:02:28,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 21:02:28,104 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-07 21:02:28,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:02:28,105 INFO L225 Difference]: With dead ends: 95 [2019-12-07 21:02:28,105 INFO L226 Difference]: Without dead ends: 94 [2019-12-07 21:02:28,106 INFO L630 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 [2019-12-07 21:02:28,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-12-07 21:02:28,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 80. [2019-12-07 21:02:28,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-12-07 21:02:28,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 100 transitions. [2019-12-07 21:02:28,113 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 100 transitions. Word has length 19 [2019-12-07 21:02:28,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:02:28,113 INFO L462 AbstractCegarLoop]: Abstraction has 80 states and 100 transitions. [2019-12-07 21:02:28,113 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 21:02:28,113 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 100 transitions. [2019-12-07 21:02:28,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 21:02:28,114 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:02:28,114 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:02:28,114 INFO L410 AbstractCegarLoop]: === Iteration 9 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 21:02:28,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:02:28,114 INFO L82 PathProgramCache]: Analyzing trace with hash -1402330794, now seen corresponding path program 1 times [2019-12-07 21:02:28,114 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:02:28,115 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73966379] [2019-12-07 21:02:28,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:02:28,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:02:28,130 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 21:02:28,130 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73966379] [2019-12-07 21:02:28,131 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:02:28,131 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 21:02:28,131 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896897541] [2019-12-07 21:02:28,131 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 21:02:28,131 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:02:28,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 21:02:28,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:02:28,132 INFO L87 Difference]: Start difference. First operand 80 states and 100 transitions. Second operand 4 states. [2019-12-07 21:02:28,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:02:28,141 INFO L93 Difference]: Finished difference Result 89 states and 110 transitions. [2019-12-07 21:02:28,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 21:02:28,142 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-12-07 21:02:28,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:02:28,142 INFO L225 Difference]: With dead ends: 89 [2019-12-07 21:02:28,143 INFO L226 Difference]: Without dead ends: 83 [2019-12-07 21:02:28,143 INFO L630 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 [2019-12-07 21:02:28,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-12-07 21:02:28,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-12-07 21:02:28,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-12-07 21:02:28,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 101 transitions. [2019-12-07 21:02:28,149 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 101 transitions. Word has length 20 [2019-12-07 21:02:28,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:02:28,150 INFO L462 AbstractCegarLoop]: Abstraction has 83 states and 101 transitions. [2019-12-07 21:02:28,150 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 21:02:28,150 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 101 transitions. [2019-12-07 21:02:28,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 21:02:28,150 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:02:28,150 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:02:28,151 INFO L410 AbstractCegarLoop]: === Iteration 10 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 21:02:28,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:02:28,151 INFO L82 PathProgramCache]: Analyzing trace with hash 921726737, now seen corresponding path program 1 times [2019-12-07 21:02:28,151 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:02:28,151 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750473537] [2019-12-07 21:02:28,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:02:28,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:02:28,177 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 21:02:28,177 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750473537] [2019-12-07 21:02:28,177 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:02:28,178 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 21:02:28,178 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162684980] [2019-12-07 21:02:28,178 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 21:02:28,178 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:02:28,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 21:02:28,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 21:02:28,179 INFO L87 Difference]: Start difference. First operand 83 states and 101 transitions. Second operand 6 states. [2019-12-07 21:02:28,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:02:28,224 INFO L93 Difference]: Finished difference Result 167 states and 222 transitions. [2019-12-07 21:02:28,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 21:02:28,224 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2019-12-07 21:02:28,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:02:28,226 INFO L225 Difference]: With dead ends: 167 [2019-12-07 21:02:28,226 INFO L226 Difference]: Without dead ends: 101 [2019-12-07 21:02:28,229 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-07 21:02:28,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-12-07 21:02:28,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 89. [2019-12-07 21:02:28,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-12-07 21:02:28,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 108 transitions. [2019-12-07 21:02:28,238 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 108 transitions. Word has length 23 [2019-12-07 21:02:28,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:02:28,239 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 108 transitions. [2019-12-07 21:02:28,239 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 21:02:28,239 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 108 transitions. [2019-12-07 21:02:28,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 21:02:28,240 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:02:28,240 INFO L410 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] [2019-12-07 21:02:28,241 INFO L410 AbstractCegarLoop]: === Iteration 11 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 21:02:28,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:02:28,241 INFO L82 PathProgramCache]: Analyzing trace with hash 970950199, now seen corresponding path program 1 times [2019-12-07 21:02:28,241 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:02:28,241 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721173006] [2019-12-07 21:02:28,242 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:02:28,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:02:28,279 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-12-07 21:02:28,279 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721173006] [2019-12-07 21:02:28,279 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:02:28,279 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 21:02:28,279 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576919330] [2019-12-07 21:02:28,280 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 21:02:28,280 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:02:28,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 21:02:28,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 21:02:28,280 INFO L87 Difference]: Start difference. First operand 89 states and 108 transitions. Second operand 6 states. [2019-12-07 21:02:28,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:02:28,321 INFO L93 Difference]: Finished difference Result 176 states and 226 transitions. [2019-12-07 21:02:28,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 21:02:28,322 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-12-07 21:02:28,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:02:28,323 INFO L225 Difference]: With dead ends: 176 [2019-12-07 21:02:28,323 INFO L226 Difference]: Without dead ends: 105 [2019-12-07 21:02:28,324 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-07 21:02:28,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-12-07 21:02:28,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 97. [2019-12-07 21:02:28,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-12-07 21:02:28,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 117 transitions. [2019-12-07 21:02:28,330 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 117 transitions. Word has length 34 [2019-12-07 21:02:28,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:02:28,330 INFO L462 AbstractCegarLoop]: Abstraction has 97 states and 117 transitions. [2019-12-07 21:02:28,330 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 21:02:28,330 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 117 transitions. [2019-12-07 21:02:28,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-07 21:02:28,331 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:02:28,331 INFO L410 BasicCegarLoop]: trace histogram [5, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:02:28,331 INFO L410 AbstractCegarLoop]: === Iteration 12 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 21:02:28,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:02:28,331 INFO L82 PathProgramCache]: Analyzing trace with hash -1027694963, now seen corresponding path program 1 times [2019-12-07 21:02:28,331 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:02:28,331 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777106227] [2019-12-07 21:02:28,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:02:28,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:02:28,349 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-12-07 21:02:28,350 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777106227] [2019-12-07 21:02:28,350 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:02:28,350 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 21:02:28,350 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229092833] [2019-12-07 21:02:28,350 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 21:02:28,350 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:02:28,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 21:02:28,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:02:28,351 INFO L87 Difference]: Start difference. First operand 97 states and 117 transitions. Second operand 4 states. [2019-12-07 21:02:28,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:02:28,363 INFO L93 Difference]: Finished difference Result 104 states and 127 transitions. [2019-12-07 21:02:28,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 21:02:28,363 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2019-12-07 21:02:28,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:02:28,365 INFO L225 Difference]: With dead ends: 104 [2019-12-07 21:02:28,365 INFO L226 Difference]: Without dead ends: 103 [2019-12-07 21:02:28,365 INFO L630 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 [2019-12-07 21:02:28,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-12-07 21:02:28,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 101. [2019-12-07 21:02:28,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-12-07 21:02:28,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 121 transitions. [2019-12-07 21:02:28,372 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 121 transitions. Word has length 37 [2019-12-07 21:02:28,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:02:28,372 INFO L462 AbstractCegarLoop]: Abstraction has 101 states and 121 transitions. [2019-12-07 21:02:28,372 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 21:02:28,372 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 121 transitions. [2019-12-07 21:02:28,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 21:02:28,373 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:02:28,373 INFO L410 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] [2019-12-07 21:02:28,373 INFO L410 AbstractCegarLoop]: === Iteration 13 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 21:02:28,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:02:28,373 INFO L82 PathProgramCache]: Analyzing trace with hash 860890908, now seen corresponding path program 1 times [2019-12-07 21:02:28,374 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:02:28,374 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871699653] [2019-12-07 21:02:28,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:02:28,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:02:28,389 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-07 21:02:28,389 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871699653] [2019-12-07 21:02:28,389 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:02:28,389 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 21:02:28,389 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038796982] [2019-12-07 21:02:28,390 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:02:28,390 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:02:28,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:02:28,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:02:28,390 INFO L87 Difference]: Start difference. First operand 101 states and 121 transitions. Second operand 3 states. [2019-12-07 21:02:28,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:02:28,397 INFO L93 Difference]: Finished difference Result 101 states and 121 transitions. [2019-12-07 21:02:28,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:02:28,398 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-12-07 21:02:28,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:02:28,399 INFO L225 Difference]: With dead ends: 101 [2019-12-07 21:02:28,399 INFO L226 Difference]: Without dead ends: 100 [2019-12-07 21:02:28,399 INFO L630 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 [2019-12-07 21:02:28,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-12-07 21:02:28,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-12-07 21:02:28,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-12-07 21:02:28,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 119 transitions. [2019-12-07 21:02:28,405 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 119 transitions. Word has length 33 [2019-12-07 21:02:28,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:02:28,405 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 119 transitions. [2019-12-07 21:02:28,405 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:02:28,405 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 119 transitions. [2019-12-07 21:02:28,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-07 21:02:28,406 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:02:28,407 INFO L410 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] [2019-12-07 21:02:28,407 INFO L410 AbstractCegarLoop]: === Iteration 14 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 21:02:28,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:02:28,407 INFO L82 PathProgramCache]: Analyzing trace with hash 1035643475, now seen corresponding path program 1 times [2019-12-07 21:02:28,407 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:02:28,407 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097028577] [2019-12-07 21:02:28,407 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:02:28,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:02:28,442 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-12-07 21:02:28,443 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097028577] [2019-12-07 21:02:28,443 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:02:28,443 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 21:02:28,443 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132799996] [2019-12-07 21:02:28,444 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 21:02:28,444 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:02:28,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 21:02:28,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 21:02:28,444 INFO L87 Difference]: Start difference. First operand 100 states and 119 transitions. Second operand 6 states. [2019-12-07 21:02:28,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:02:28,482 INFO L93 Difference]: Finished difference Result 110 states and 131 transitions. [2019-12-07 21:02:28,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 21:02:28,482 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 48 [2019-12-07 21:02:28,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:02:28,484 INFO L225 Difference]: With dead ends: 110 [2019-12-07 21:02:28,484 INFO L226 Difference]: Without dead ends: 109 [2019-12-07 21:02:28,484 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-07 21:02:28,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-12-07 21:02:28,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 99. [2019-12-07 21:02:28,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-12-07 21:02:28,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 117 transitions. [2019-12-07 21:02:28,493 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 117 transitions. Word has length 48 [2019-12-07 21:02:28,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:02:28,493 INFO L462 AbstractCegarLoop]: Abstraction has 99 states and 117 transitions. [2019-12-07 21:02:28,493 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 21:02:28,493 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 117 transitions. [2019-12-07 21:02:28,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-07 21:02:28,495 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:02:28,495 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:02:28,495 INFO L410 AbstractCegarLoop]: === Iteration 15 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 21:02:28,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:02:28,495 INFO L82 PathProgramCache]: Analyzing trace with hash -1488967228, now seen corresponding path program 1 times [2019-12-07 21:02:28,495 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:02:28,496 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526801715] [2019-12-07 21:02:28,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:02:28,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:02:28,537 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-12-07 21:02:28,538 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526801715] [2019-12-07 21:02:28,538 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1620682690] [2019-12-07 21:02:28,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c5cc408f-43c8-485b-8216-8871e76fd419/bin/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:02:28,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:02:28,568 INFO L264 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 21:02:28,574 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:02:28,632 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-07 21:02:28,632 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:02:28,721 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-07 21:02:28,721 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-12-07 21:02:28,722 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [7] total 17 [2019-12-07 21:02:28,722 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655572373] [2019-12-07 21:02:28,722 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 21:02:28,722 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:02:28,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 21:02:28,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2019-12-07 21:02:28,723 INFO L87 Difference]: Start difference. First operand 99 states and 117 transitions. Second operand 12 states. [2019-12-07 21:02:28,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:02:28,808 INFO L93 Difference]: Finished difference Result 100 states and 117 transitions. [2019-12-07 21:02:28,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 21:02:28,809 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 40 [2019-12-07 21:02:28,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:02:28,810 INFO L225 Difference]: With dead ends: 100 [2019-12-07 21:02:28,810 INFO L226 Difference]: Without dead ends: 99 [2019-12-07 21:02:28,811 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2019-12-07 21:02:28,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-12-07 21:02:28,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2019-12-07 21:02:28,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-12-07 21:02:28,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 116 transitions. [2019-12-07 21:02:28,818 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 116 transitions. Word has length 40 [2019-12-07 21:02:28,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:02:28,818 INFO L462 AbstractCegarLoop]: Abstraction has 98 states and 116 transitions. [2019-12-07 21:02:28,818 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 21:02:28,818 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 116 transitions. [2019-12-07 21:02:28,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-07 21:02:28,819 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:02:28,820 INFO L410 BasicCegarLoop]: trace histogram [6, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:02:29,020 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:02:29,021 INFO L410 AbstractCegarLoop]: === Iteration 16 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 21:02:29,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:02:29,021 INFO L82 PathProgramCache]: Analyzing trace with hash 1798417111, now seen corresponding path program 1 times [2019-12-07 21:02:29,022 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:02:29,022 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932081132] [2019-12-07 21:02:29,022 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:02:29,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:02:29,115 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 24 proven. 2 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-12-07 21:02:29,116 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932081132] [2019-12-07 21:02:29,116 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [868398425] [2019-12-07 21:02:29,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c5cc408f-43c8-485b-8216-8871e76fd419/bin/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:02:29,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:02:29,163 INFO L264 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 21:02:29,167 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:02:29,243 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-12-07 21:02:29,243 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:02:29,384 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-12-07 21:02:29,384 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-12-07 21:02:29,384 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [7] total 17 [2019-12-07 21:02:29,384 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416242270] [2019-12-07 21:02:29,385 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 21:02:29,385 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:02:29,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 21:02:29,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2019-12-07 21:02:29,385 INFO L87 Difference]: Start difference. First operand 98 states and 116 transitions. Second operand 12 states. [2019-12-07 21:02:29,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:02:29,674 INFO L93 Difference]: Finished difference Result 179 states and 220 transitions. [2019-12-07 21:02:29,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-07 21:02:29,674 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 47 [2019-12-07 21:02:29,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:02:29,676 INFO L225 Difference]: With dead ends: 179 [2019-12-07 21:02:29,676 INFO L226 Difference]: Without dead ends: 176 [2019-12-07 21:02:29,677 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=209, Invalid=913, Unknown=0, NotChecked=0, Total=1122 [2019-12-07 21:02:29,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2019-12-07 21:02:29,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 174. [2019-12-07 21:02:29,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2019-12-07 21:02:29,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 216 transitions. [2019-12-07 21:02:29,685 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 216 transitions. Word has length 47 [2019-12-07 21:02:29,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:02:29,685 INFO L462 AbstractCegarLoop]: Abstraction has 174 states and 216 transitions. [2019-12-07 21:02:29,685 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 21:02:29,685 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 216 transitions. [2019-12-07 21:02:29,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-07 21:02:29,686 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:02:29,686 INFO L410 BasicCegarLoop]: trace histogram [5, 4, 3, 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] [2019-12-07 21:02:29,886 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:02:29,887 INFO L410 AbstractCegarLoop]: === Iteration 17 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 21:02:29,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:02:29,888 INFO L82 PathProgramCache]: Analyzing trace with hash 695736933, now seen corresponding path program 1 times [2019-12-07 21:02:29,888 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:02:29,889 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695433642] [2019-12-07 21:02:29,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:02:29,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:02:29,960 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 22 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-12-07 21:02:29,960 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695433642] [2019-12-07 21:02:29,960 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [578430966] [2019-12-07 21:02:29,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c5cc408f-43c8-485b-8216-8871e76fd419/bin/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:02:29,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:02:29,980 INFO L264 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 21:02:29,982 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:02:30,007 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-12-07 21:02:30,007 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:02:30,042 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-12-07 21:02:30,043 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-12-07 21:02:30,043 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [9] total 15 [2019-12-07 21:02:30,043 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533310856] [2019-12-07 21:02:30,043 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 21:02:30,043 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:02:30,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 21:02:30,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-12-07 21:02:30,044 INFO L87 Difference]: Start difference. First operand 174 states and 216 transitions. Second operand 8 states. [2019-12-07 21:02:30,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:02:30,098 INFO L93 Difference]: Finished difference Result 228 states and 285 transitions. [2019-12-07 21:02:30,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 21:02:30,098 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 45 [2019-12-07 21:02:30,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:02:30,100 INFO L225 Difference]: With dead ends: 228 [2019-12-07 21:02:30,100 INFO L226 Difference]: Without dead ends: 227 [2019-12-07 21:02:30,101 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2019-12-07 21:02:30,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2019-12-07 21:02:30,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 226. [2019-12-07 21:02:30,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-12-07 21:02:30,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 284 transitions. [2019-12-07 21:02:30,113 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 284 transitions. Word has length 45 [2019-12-07 21:02:30,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:02:30,114 INFO L462 AbstractCegarLoop]: Abstraction has 226 states and 284 transitions. [2019-12-07 21:02:30,114 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 21:02:30,114 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 284 transitions. [2019-12-07 21:02:30,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-07 21:02:30,115 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:02:30,115 INFO L410 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] [2019-12-07 21:02:30,315 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:02:30,316 INFO L410 AbstractCegarLoop]: === Iteration 18 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 21:02:30,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:02:30,317 INFO L82 PathProgramCache]: Analyzing trace with hash -1252678887, now seen corresponding path program 1 times [2019-12-07 21:02:30,317 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:02:30,318 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798450580] [2019-12-07 21:02:30,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:02:30,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:02:30,380 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-12-07 21:02:30,380 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798450580] [2019-12-07 21:02:30,380 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1423124375] [2019-12-07 21:02:30,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c5cc408f-43c8-485b-8216-8871e76fd419/bin/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:02:30,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:02:30,404 INFO L264 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 21:02:30,406 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:02:30,412 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-12-07 21:02:30,412 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:02:30,506 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-12-07 21:02:30,506 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [38563658] [2019-12-07 21:02:30,528 INFO L159 IcfgInterpreter]: Started Sifa with 31 locations of interest [2019-12-07 21:02:30,528 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 21:02:30,534 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 21:02:30,535 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 21:02:30,535 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2019-12-07 21:02:30,535 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106971106] [2019-12-07 21:02:30,536 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 21:02:30,536 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:02:30,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 21:02:30,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-12-07 21:02:30,536 INFO L87 Difference]: Start difference. First operand 226 states and 284 transitions. Second operand 10 states. [2019-12-07 21:02:30,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:02:30,570 INFO L93 Difference]: Finished difference Result 251 states and 314 transitions. [2019-12-07 21:02:30,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 21:02:30,570 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 60 [2019-12-07 21:02:30,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:02:30,572 INFO L225 Difference]: With dead ends: 251 [2019-12-07 21:02:30,572 INFO L226 Difference]: Without dead ends: 241 [2019-12-07 21:02:30,573 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-12-07 21:02:30,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2019-12-07 21:02:30,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2019-12-07 21:02:30,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2019-12-07 21:02:30,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 299 transitions. [2019-12-07 21:02:30,585 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 299 transitions. Word has length 60 [2019-12-07 21:02:30,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:02:30,585 INFO L462 AbstractCegarLoop]: Abstraction has 241 states and 299 transitions. [2019-12-07 21:02:30,585 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 21:02:30,586 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 299 transitions. [2019-12-07 21:02:30,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-12-07 21:02:30,587 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:02:30,587 INFO L410 BasicCegarLoop]: trace histogram [10, 8, 6, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:02:30,787 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:02:30,788 INFO L410 AbstractCegarLoop]: === Iteration 19 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 21:02:30,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:02:30,789 INFO L82 PathProgramCache]: Analyzing trace with hash 1438531096, now seen corresponding path program 2 times [2019-12-07 21:02:30,789 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:02:30,789 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429598937] [2019-12-07 21:02:30,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:02:30,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:02:30,957 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 68 proven. 30 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-12-07 21:02:30,957 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429598937] [2019-12-07 21:02:30,958 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1084594590] [2019-12-07 21:02:30,958 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c5cc408f-43c8-485b-8216-8871e76fd419/bin/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:02:30,981 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-12-07 21:02:30,982 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 21:02:30,982 INFO L264 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 21:02:30,985 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:02:31,021 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2019-12-07 21:02:31,021 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:02:31,080 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2019-12-07 21:02:31,080 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-12-07 21:02:31,081 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [12] total 18 [2019-12-07 21:02:31,081 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801597385] [2019-12-07 21:02:31,081 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 21:02:31,081 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:02:31,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 21:02:31,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2019-12-07 21:02:31,082 INFO L87 Difference]: Start difference. First operand 241 states and 299 transitions. Second operand 8 states. [2019-12-07 21:02:31,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:02:31,147 INFO L93 Difference]: Finished difference Result 242 states and 299 transitions. [2019-12-07 21:02:31,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 21:02:31,148 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 77 [2019-12-07 21:02:31,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:02:31,150 INFO L225 Difference]: With dead ends: 242 [2019-12-07 21:02:31,150 INFO L226 Difference]: Without dead ends: 241 [2019-12-07 21:02:31,151 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=396, Unknown=0, NotChecked=0, Total=462 [2019-12-07 21:02:31,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2019-12-07 21:02:31,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 240. [2019-12-07 21:02:31,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2019-12-07 21:02:31,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 298 transitions. [2019-12-07 21:02:31,163 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 298 transitions. Word has length 77 [2019-12-07 21:02:31,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:02:31,163 INFO L462 AbstractCegarLoop]: Abstraction has 240 states and 298 transitions. [2019-12-07 21:02:31,164 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 21:02:31,164 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 298 transitions. [2019-12-07 21:02:31,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-12-07 21:02:31,166 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:02:31,166 INFO L410 BasicCegarLoop]: trace histogram [13, 12, 9, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:02:31,367 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:02:31,367 INFO L410 AbstractCegarLoop]: === Iteration 20 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 21:02:31,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:02:31,367 INFO L82 PathProgramCache]: Analyzing trace with hash -1837690, now seen corresponding path program 1 times [2019-12-07 21:02:31,367 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:02:31,367 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931022744] [2019-12-07 21:02:31,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:02:31,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:02:31,426 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 73 proven. 72 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked. [2019-12-07 21:02:31,427 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931022744] [2019-12-07 21:02:31,427 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [254137084] [2019-12-07 21:02:31,427 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c5cc408f-43c8-485b-8216-8871e76fd419/bin/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:02:31,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:02:31,455 INFO L264 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 21:02:31,457 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:02:31,473 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 214 proven. 28 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2019-12-07 21:02:31,473 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:02:31,573 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 49 proven. 77 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2019-12-07 21:02:31,574 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1588174517] [2019-12-07 21:02:31,575 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2019-12-07 21:02:31,575 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 21:02:31,575 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 21:02:31,576 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 21:02:31,576 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 9 [2019-12-07 21:02:31,576 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070284285] [2019-12-07 21:02:31,577 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 21:02:31,577 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:02:31,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 21:02:31,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-07 21:02:31,577 INFO L87 Difference]: Start difference. First operand 240 states and 298 transitions. Second operand 9 states. [2019-12-07 21:02:31,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:02:31,659 INFO L93 Difference]: Finished difference Result 402 states and 505 transitions. [2019-12-07 21:02:31,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 21:02:31,659 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 104 [2019-12-07 21:02:31,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:02:31,661 INFO L225 Difference]: With dead ends: 402 [2019-12-07 21:02:31,661 INFO L226 Difference]: Without dead ends: 149 [2019-12-07 21:02:31,663 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 205 SyntacticMatches, 6 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2019-12-07 21:02:31,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-12-07 21:02:31,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 125. [2019-12-07 21:02:31,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-12-07 21:02:31,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 138 transitions. [2019-12-07 21:02:31,671 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 138 transitions. Word has length 104 [2019-12-07 21:02:31,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:02:31,671 INFO L462 AbstractCegarLoop]: Abstraction has 125 states and 138 transitions. [2019-12-07 21:02:31,671 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 21:02:31,671 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 138 transitions. [2019-12-07 21:02:31,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-12-07 21:02:31,674 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:02:31,674 INFO L410 BasicCegarLoop]: trace histogram [20, 20, 15, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1] [2019-12-07 21:02:31,874 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:02:31,875 INFO L410 AbstractCegarLoop]: === Iteration 21 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 21:02:31,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:02:31,876 INFO L82 PathProgramCache]: Analyzing trace with hash -1260681380, now seen corresponding path program 2 times [2019-12-07 21:02:31,876 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:02:31,877 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65746123] [2019-12-07 21:02:31,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:02:31,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:02:32,206 INFO L134 CoverageAnalysis]: Checked inductivity of 1010 backedges. 213 proven. 235 refuted. 0 times theorem prover too weak. 562 trivial. 0 not checked. [2019-12-07 21:02:32,207 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65746123] [2019-12-07 21:02:32,207 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1578635985] [2019-12-07 21:02:32,207 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c5cc408f-43c8-485b-8216-8871e76fd419/bin/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:02:32,232 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-12-07 21:02:32,232 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 21:02:32,233 INFO L264 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 21:02:32,236 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:02:32,322 INFO L134 CoverageAnalysis]: Checked inductivity of 1010 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2019-12-07 21:02:32,322 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:02:32,704 INFO L134 CoverageAnalysis]: Checked inductivity of 1010 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2019-12-07 21:02:32,704 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-12-07 21:02:32,704 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [20] total 26 [2019-12-07 21:02:32,704 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457459383] [2019-12-07 21:02:32,705 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 21:02:32,705 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:02:32,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 21:02:32,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=597, Unknown=0, NotChecked=0, Total=650 [2019-12-07 21:02:32,705 INFO L87 Difference]: Start difference. First operand 125 states and 138 transitions. Second operand 9 states. [2019-12-07 21:02:32,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:02:32,761 INFO L93 Difference]: Finished difference Result 156 states and 172 transitions. [2019-12-07 21:02:32,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 21:02:32,762 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 204 [2019-12-07 21:02:32,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:02:32,763 INFO L225 Difference]: With dead ends: 156 [2019-12-07 21:02:32,763 INFO L226 Difference]: Without dead ends: 127 [2019-12-07 21:02:32,764 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 453 GetRequests, 421 SyntacticMatches, 6 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=693, Unknown=0, NotChecked=0, Total=756 [2019-12-07 21:02:32,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-12-07 21:02:32,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 123. [2019-12-07 21:02:32,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-12-07 21:02:32,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 135 transitions. [2019-12-07 21:02:32,771 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 135 transitions. Word has length 204 [2019-12-07 21:02:32,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:02:32,772 INFO L462 AbstractCegarLoop]: Abstraction has 123 states and 135 transitions. [2019-12-07 21:02:32,772 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 21:02:32,772 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 135 transitions. [2019-12-07 21:02:32,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-12-07 21:02:32,774 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:02:32,774 INFO L410 BasicCegarLoop]: trace histogram [17, 17, 13, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2019-12-07 21:02:32,974 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:02:32,975 INFO L410 AbstractCegarLoop]: === Iteration 22 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 21:02:32,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:02:32,975 INFO L82 PathProgramCache]: Analyzing trace with hash -441371370, now seen corresponding path program 3 times [2019-12-07 21:02:32,975 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:02:32,975 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663646136] [2019-12-07 21:02:32,975 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:02:32,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:02:33,160 INFO L134 CoverageAnalysis]: Checked inductivity of 746 backedges. 130 proven. 208 refuted. 0 times theorem prover too weak. 408 trivial. 0 not checked. [2019-12-07 21:02:33,160 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663646136] [2019-12-07 21:02:33,160 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2053724970] [2019-12-07 21:02:33,160 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c5cc408f-43c8-485b-8216-8871e76fd419/bin/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:02:33,198 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 21:02:33,198 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 21:02:33,199 INFO L264 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-07 21:02:33,201 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:02:33,231 INFO L134 CoverageAnalysis]: Checked inductivity of 746 backedges. 64 proven. 144 refuted. 0 times theorem prover too weak. 538 trivial. 0 not checked. [2019-12-07 21:02:33,231 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:02:33,440 INFO L134 CoverageAnalysis]: Checked inductivity of 746 backedges. 64 proven. 144 refuted. 0 times theorem prover too weak. 538 trivial. 0 not checked. [2019-12-07 21:02:33,440 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1522933443] [2019-12-07 21:02:33,441 INFO L159 IcfgInterpreter]: Started Sifa with 31 locations of interest [2019-12-07 21:02:33,441 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 21:02:33,442 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 21:02:33,442 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 21:02:33,442 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 10, 10] total 21 [2019-12-07 21:02:33,442 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904292181] [2019-12-07 21:02:33,443 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-12-07 21:02:33,443 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:02:33,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-07 21:02:33,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=374, Unknown=0, NotChecked=0, Total=420 [2019-12-07 21:02:33,443 INFO L87 Difference]: Start difference. First operand 123 states and 135 transitions. Second operand 21 states. [2019-12-07 21:02:33,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:02:33,719 INFO L93 Difference]: Finished difference Result 127 states and 141 transitions. [2019-12-07 21:02:33,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-07 21:02:33,720 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 180 [2019-12-07 21:02:33,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:02:33,720 INFO L225 Difference]: With dead ends: 127 [2019-12-07 21:02:33,720 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 21:02:33,721 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 402 GetRequests, 364 SyntacticMatches, 8 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=869, Unknown=0, NotChecked=0, Total=992 [2019-12-07 21:02:33,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 21:02:33,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 21:02:33,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 21:02:33,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 21:02:33,721 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 180 [2019-12-07 21:02:33,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:02:33,722 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 21:02:33,722 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-12-07 21:02:33,722 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 21:02:33,722 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 21:02:33,922 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:02:33,926 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 21:02:34,364 INFO L246 CegarLoopResult]: For program point rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2019-12-07 21:02:34,364 INFO L246 CegarLoopResult]: For program point rec1FINAL(lines 11 15) no Hoare annotation was computed. [2019-12-07 21:02:34,364 INFO L246 CegarLoopResult]: For program point rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2019-12-07 21:02:34,364 INFO L246 CegarLoopResult]: For program point rec1EXIT(lines 11 15) no Hoare annotation was computed. [2019-12-07 21:02:34,364 INFO L246 CegarLoopResult]: For program point L14(line 14) no Hoare annotation was computed. [2019-12-07 21:02:34,364 INFO L249 CegarLoopResult]: At program point rec1ENTRY(lines 11 15) the Hoare annotation is: true [2019-12-07 21:02:34,364 INFO L246 CegarLoopResult]: For program point L14-1(line 14) no Hoare annotation was computed. [2019-12-07 21:02:34,364 INFO L246 CegarLoopResult]: For program point L12(lines 12 13) no Hoare annotation was computed. [2019-12-07 21:02:34,364 INFO L242 CegarLoopResult]: At program point L14-2(line 14) the Hoare annotation is: (and (or (and (<= rec1_~i 2147483647) (<= 1 rec1_~i)) (not (<= |rec1_#in~i| 2147483647))) (not (<= |rec1_#in~i| 2147483646))) [2019-12-07 21:02:34,364 INFO L246 CegarLoopResult]: For program point L14-3(line 14) no Hoare annotation was computed. [2019-12-07 21:02:34,365 INFO L246 CegarLoopResult]: For program point L14-4(line 14) no Hoare annotation was computed. [2019-12-07 21:02:34,365 INFO L246 CegarLoopResult]: For program point rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2019-12-07 21:02:34,365 INFO L246 CegarLoopResult]: For program point L14-5(line 14) no Hoare annotation was computed. [2019-12-07 21:02:34,365 INFO L242 CegarLoopResult]: At program point L14-6(line 14) the Hoare annotation is: (and (not (<= |rec1_#in~i| 2147483646)) (or (and (<= |rec1_#t~ret0| 1) (<= rec1_~i 2147483647) (<= 1 rec1_~i)) (not (<= |rec1_#in~i| 2147483647)))) [2019-12-07 21:02:34,365 INFO L246 CegarLoopResult]: For program point rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2019-12-07 21:02:34,365 INFO L246 CegarLoopResult]: For program point rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2019-12-07 21:02:34,365 INFO L246 CegarLoopResult]: For program point L14-7(line 14) no Hoare annotation was computed. [2019-12-07 21:02:34,365 INFO L246 CegarLoopResult]: For program point rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2019-12-07 21:02:34,365 INFO L242 CegarLoopResult]: At program point L14-8(line 14) the Hoare annotation is: (and (or (and (<= |rec1_#t~ret1| 0) (<= |rec1_#t~ret0| 1) (<= rec1_~i 2147483647) (<= 1 rec1_~i)) (not (<= |rec1_#in~i| 2147483647))) (not (<= |rec1_#in~i| 2147483646))) [2019-12-07 21:02:34,365 INFO L246 CegarLoopResult]: For program point L14-9(line 14) no Hoare annotation was computed. [2019-12-07 21:02:34,365 INFO L246 CegarLoopResult]: For program point L14-10(line 14) no Hoare annotation was computed. [2019-12-07 21:02:34,366 INFO L246 CegarLoopResult]: For program point L14-11(line 14) no Hoare annotation was computed. [2019-12-07 21:02:34,366 INFO L246 CegarLoopResult]: For program point rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-12-07 21:02:34,366 INFO L246 CegarLoopResult]: For program point rec2FINAL(lines 17 21) no Hoare annotation was computed. [2019-12-07 21:02:34,366 INFO L246 CegarLoopResult]: For program point rec2EXIT(lines 17 21) no Hoare annotation was computed. [2019-12-07 21:02:34,366 INFO L246 CegarLoopResult]: For program point L20(line 20) no Hoare annotation was computed. [2019-12-07 21:02:34,366 INFO L246 CegarLoopResult]: For program point L20-1(line 20) no Hoare annotation was computed. [2019-12-07 21:02:34,366 INFO L246 CegarLoopResult]: For program point L18(lines 18 19) no Hoare annotation was computed. [2019-12-07 21:02:34,366 INFO L242 CegarLoopResult]: At program point L20-2(line 20) the Hoare annotation is: (and (or (and (<= |rec2_#in~j| rec2_~j) (<= rec2_~j |rec2_#in~j|)) (not (<= |rec2_#in~j| 2147483647))) (not (<= |rec2_#in~j| 0))) [2019-12-07 21:02:34,366 INFO L246 CegarLoopResult]: For program point L20-3(line 20) no Hoare annotation was computed. [2019-12-07 21:02:34,366 INFO L242 CegarLoopResult]: At program point L20-4(line 20) the Hoare annotation is: (let ((.cse0 (not (<= |rec2_#in~j| 2147483647)))) (and (or (<= |rec2_#t~ret3| 0) .cse0 (and (<= 2 |rec2_#in~j|) (<= |rec2_#t~ret3| 1))) (or (and (<= |rec2_#in~j| rec2_~j) (<= rec2_~j |rec2_#in~j|)) .cse0) (not (<= |rec2_#in~j| 0)))) [2019-12-07 21:02:34,366 INFO L246 CegarLoopResult]: For program point L20-5(line 20) no Hoare annotation was computed. [2019-12-07 21:02:34,367 INFO L246 CegarLoopResult]: For program point L20-6(line 20) no Hoare annotation was computed. [2019-12-07 21:02:34,367 INFO L246 CegarLoopResult]: For program point L20-7(line 20) no Hoare annotation was computed. [2019-12-07 21:02:34,367 INFO L249 CegarLoopResult]: At program point rec2ENTRY(lines 17 21) the Hoare annotation is: true [2019-12-07 21:02:34,367 INFO L246 CegarLoopResult]: For program point rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-12-07 21:02:34,367 INFO L246 CegarLoopResult]: For program point rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-12-07 21:02:34,367 INFO L246 CegarLoopResult]: For program point rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-12-07 21:02:34,367 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 21:02:34,367 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-12-07 21:02:34,367 INFO L242 CegarLoopResult]: At program point L25(line 25) the Hoare annotation is: (<= ULTIMATE.start_main_~x~0 2147483647) [2019-12-07 21:02:34,367 INFO L246 CegarLoopResult]: For program point L25-1(line 25) no Hoare annotation was computed. [2019-12-07 21:02:34,371 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 09:02:34 BoogieIcfgContainer [2019-12-07 21:02:34,371 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 21:02:34,372 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 21:02:34,372 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 21:02:34,372 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 21:02:34,372 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 09:02:27" (3/4) ... [2019-12-07 21:02:34,374 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 21:02:34,378 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure rec1 [2019-12-07 21:02:34,379 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure rec2 [2019-12-07 21:02:34,383 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2019-12-07 21:02:34,383 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-12-07 21:02:34,383 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-12-07 21:02:34,415 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_c5cc408f-43c8-485b-8216-8871e76fd419/bin/utaipan/witness.graphml [2019-12-07 21:02:34,415 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 21:02:34,417 INFO L168 Benchmark]: Toolchain (without parser) took 7351.77 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 174.1 MB). Free memory was 940.9 MB in the beginning and 1.1 GB in the end (delta: -169.5 MB). Peak memory consumption was 4.5 MB. Max. memory is 11.5 GB. [2019-12-07 21:02:34,417 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 955.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 21:02:34,418 INFO L168 Benchmark]: CACSL2BoogieTranslator took 171.43 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 98.0 MB). Free memory was 940.9 MB in the beginning and 1.1 GB in the end (delta: -150.8 MB). Peak memory consumption was 23.4 MB. Max. memory is 11.5 GB. [2019-12-07 21:02:34,418 INFO L168 Benchmark]: Boogie Procedure Inliner took 20.17 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 21:02:34,418 INFO L168 Benchmark]: Boogie Preprocessor took 11.79 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 21:02:34,418 INFO L168 Benchmark]: RCFGBuilder took 170.23 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.9 MB). Peak memory consumption was 21.9 MB. Max. memory is 11.5 GB. [2019-12-07 21:02:34,419 INFO L168 Benchmark]: TraceAbstraction took 6931.16 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 76.0 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -50.0 MB). Peak memory consumption was 333.7 MB. Max. memory is 11.5 GB. [2019-12-07 21:02:34,419 INFO L168 Benchmark]: Witness Printer took 43.78 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 11.5 GB. [2019-12-07 21:02:34,420 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 955.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 171.43 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 98.0 MB). Free memory was 940.9 MB in the beginning and 1.1 GB in the end (delta: -150.8 MB). Peak memory consumption was 23.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 20.17 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 11.79 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 170.23 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.9 MB). Peak memory consumption was 21.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 6931.16 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 76.0 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -50.0 MB). Peak memory consumption was 333.7 MB. Max. memory is 11.5 GB. * Witness Printer took 43.78 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - AllSpecificationsHoldResult: All specifications hold 10 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 42 locations, 10 error locations. Result: SAFE, OverallTime: 6.4s, OverallIterations: 22, TraceHistogramMax: 20, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.4s, HoareTripleCheckerStatistics: 826 SDtfs, 419 SDslu, 2520 SDs, 0 SdLazy, 1424 SolverSat, 174 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1738 GetRequests, 1511 SyntacticMatches, 20 SemanticMatches, 207 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=241occurred in iteration=18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 22 MinimizatonAttempts, 111 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 330 PreInvPairs, 363 NumberOfFragments, 114 HoareAnnotationTreeSize, 330 FomulaSimplifications, 1458 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 8 FomulaSimplificationsInter, 1074 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 1813 NumberOfCodeBlocks, 1600 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 2532 ConstructedInterpolants, 0 QuantifiedInterpolants, 500610 SizeOfPredicates, 15 NumberOfNonLiveVariables, 1124 ConjunctsInSsa, 48 ConjunctsInUnsatCore, 38 InterpolantComputations, 24 PerfectInterpolantSequences, 6579/7538 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...