./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/termination-crafted/MutualRecursion_1a_true-no-overflow_false-termination_true-valid-memsafety.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_0c0b88ac-0b4c-4983-a37f-a80b47f0992e/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_0c0b88ac-0b4c-4983-a37f-a80b47f0992e/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_0c0b88ac-0b4c-4983-a37f-a80b47f0992e/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_0c0b88ac-0b4c-4983-a37f-a80b47f0992e/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/termination-crafted/MutualRecursion_1a_true-no-overflow_false-termination_true-valid-memsafety.c -s /tmp/vcloud-vcloud-master/worker/working_dir_0c0b88ac-0b4c-4983-a37f-a80b47f0992e/bin-2019/utaipan/config/svcomp-Overflow-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_0c0b88ac-0b4c-4983-a37f-a80b47f0992e/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash c27ad91a5bec233234e07a14bfd5505e082df4cd .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 01:12:26,889 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 01:12:26,890 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 01:12:26,896 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 01:12:26,896 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 01:12:26,897 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 01:12:26,897 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 01:12:26,898 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 01:12:26,899 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 01:12:26,900 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 01:12:26,900 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 01:12:26,900 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 01:12:26,901 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 01:12:26,901 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 01:12:26,902 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 01:12:26,902 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 01:12:26,903 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 01:12:26,903 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 01:12:26,904 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 01:12:26,905 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 01:12:26,906 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 01:12:26,907 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 01:12:26,908 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 01:12:26,908 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 01:12:26,908 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 01:12:26,909 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 01:12:26,909 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 01:12:26,909 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 01:12:26,910 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 01:12:26,910 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 01:12:26,911 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 01:12:26,911 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 01:12:26,911 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 01:12:26,911 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 01:12:26,912 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 01:12:26,912 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 01:12:26,912 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_0c0b88ac-0b4c-4983-a37f-a80b47f0992e/bin-2019/utaipan/config/svcomp-Overflow-64bit-Taipan_Default.epf [2018-12-09 01:12:26,919 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 01:12:26,920 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 01:12:26,920 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 01:12:26,920 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 01:12:26,920 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 01:12:26,921 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 01:12:26,921 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 01:12:26,921 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 01:12:26,921 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 01:12:26,921 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 01:12:26,921 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 01:12:26,921 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 01:12:26,921 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 01:12:26,922 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 01:12:26,922 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-09 01:12:26,922 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 01:12:26,922 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 01:12:26,922 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 01:12:26,922 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 01:12:26,922 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 01:12:26,923 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2018-12-09 01:12:26,923 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 01:12:26,923 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 01:12:26,923 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 01:12:26,923 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 01:12:26,923 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 01:12:26,923 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 01:12:26,923 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 01:12:26,924 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 01:12:26,924 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 01:12:26,924 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 01:12:26,924 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 01:12:26,924 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 01:12:26,924 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 01:12:26,924 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-09 01:12:26,924 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_0c0b88ac-0b4c-4983-a37f-a80b47f0992e/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c27ad91a5bec233234e07a14bfd5505e082df4cd [2018-12-09 01:12:26,942 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 01:12:26,949 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 01:12:26,951 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 01:12:26,952 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 01:12:26,952 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 01:12:26,953 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_0c0b88ac-0b4c-4983-a37f-a80b47f0992e/bin-2019/utaipan/../../sv-benchmarks/c/termination-crafted/MutualRecursion_1a_true-no-overflow_false-termination_true-valid-memsafety.c [2018-12-09 01:12:26,986 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0c0b88ac-0b4c-4983-a37f-a80b47f0992e/bin-2019/utaipan/data/c57f89f40/44f1ab0943034b25ab4349780e788b64/FLAG88fc4761e [2018-12-09 01:12:27,419 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 01:12:27,419 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_0c0b88ac-0b4c-4983-a37f-a80b47f0992e/sv-benchmarks/c/termination-crafted/MutualRecursion_1a_true-no-overflow_false-termination_true-valid-memsafety.c [2018-12-09 01:12:27,423 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0c0b88ac-0b4c-4983-a37f-a80b47f0992e/bin-2019/utaipan/data/c57f89f40/44f1ab0943034b25ab4349780e788b64/FLAG88fc4761e [2018-12-09 01:12:27,431 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_0c0b88ac-0b4c-4983-a37f-a80b47f0992e/bin-2019/utaipan/data/c57f89f40/44f1ab0943034b25ab4349780e788b64 [2018-12-09 01:12:27,433 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 01:12:27,433 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 01:12:27,434 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 01:12:27,434 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 01:12:27,436 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 01:12:27,437 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 01:12:27" (1/1) ... [2018-12-09 01:12:27,439 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e789c3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:12:27, skipping insertion in model container [2018-12-09 01:12:27,439 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 01:12:27" (1/1) ... [2018-12-09 01:12:27,443 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 01:12:27,452 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 01:12:27,534 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 01:12:27,536 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 01:12:27,545 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 01:12:27,553 INFO L195 MainTranslator]: Completed translation [2018-12-09 01:12:27,554 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:12:27 WrapperNode [2018-12-09 01:12:27,554 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 01:12:27,554 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 01:12:27,554 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 01:12:27,554 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 01:12:27,559 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:12:27" (1/1) ... [2018-12-09 01:12:27,562 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:12:27" (1/1) ... [2018-12-09 01:12:27,566 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 01:12:27,566 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 01:12:27,566 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 01:12:27,566 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 01:12:27,572 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:12:27" (1/1) ... [2018-12-09 01:12:27,572 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:12:27" (1/1) ... [2018-12-09 01:12:27,572 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:12:27" (1/1) ... [2018-12-09 01:12:27,573 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:12:27" (1/1) ... [2018-12-09 01:12:27,575 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:12:27" (1/1) ... [2018-12-09 01:12:27,576 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:12:27" (1/1) ... [2018-12-09 01:12:27,576 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:12:27" (1/1) ... [2018-12-09 01:12:27,577 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 01:12:27,577 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 01:12:27,577 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 01:12:27,577 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 01:12:27,578 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:12:27" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0c0b88ac-0b4c-4983-a37f-a80b47f0992e/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 01:12:27,641 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 01:12:27,641 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 01:12:27,641 INFO L130 BoogieDeclarations]: Found specification of procedure f [2018-12-09 01:12:27,641 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2018-12-09 01:12:27,641 INFO L130 BoogieDeclarations]: Found specification of procedure g [2018-12-09 01:12:27,641 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2018-12-09 01:12:27,641 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 01:12:27,641 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 01:12:27,641 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 01:12:27,641 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 01:12:27,738 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 01:12:27,738 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-09 01:12:27,738 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 01:12:27 BoogieIcfgContainer [2018-12-09 01:12:27,738 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 01:12:27,739 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 01:12:27,739 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 01:12:27,740 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 01:12:27,741 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 01:12:27" (1/3) ... [2018-12-09 01:12:27,741 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d0b9eab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 01:12:27, skipping insertion in model container [2018-12-09 01:12:27,741 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:12:27" (2/3) ... [2018-12-09 01:12:27,741 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d0b9eab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 01:12:27, skipping insertion in model container [2018-12-09 01:12:27,741 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 01:12:27" (3/3) ... [2018-12-09 01:12:27,742 INFO L112 eAbstractionObserver]: Analyzing ICFG MutualRecursion_1a_true-no-overflow_false-termination_true-valid-memsafety.c [2018-12-09 01:12:27,748 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 01:12:27,753 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 10 error locations. [2018-12-09 01:12:27,761 INFO L257 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2018-12-09 01:12:27,779 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 01:12:27,779 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 01:12:27,779 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 01:12:27,779 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 01:12:27,779 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 01:12:27,779 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 01:12:27,779 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 01:12:27,779 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 01:12:27,789 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states. [2018-12-09 01:12:27,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-09 01:12:27,792 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:12:27,793 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:12:27,794 INFO L423 AbstractCegarLoop]: === Iteration 1 === [fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-09 01:12:27,797 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:12:27,797 INFO L82 PathProgramCache]: Analyzing trace with hash -1878681222, now seen corresponding path program 1 times [2018-12-09 01:12:27,799 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:12:27,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:12:27,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:12:27,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:12:27,828 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:12:27,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:12:27,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:12:27,889 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:12:27,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 01:12:27,890 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 01:12:27,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 01:12:27,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 01:12:27,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 01:12:27,901 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 5 states. [2018-12-09 01:12:27,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:12:27,967 INFO L93 Difference]: Finished difference Result 69 states and 76 transitions. [2018-12-09 01:12:27,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 01:12:27,968 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2018-12-09 01:12:27,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:12:27,975 INFO L225 Difference]: With dead ends: 69 [2018-12-09 01:12:27,975 INFO L226 Difference]: Without dead ends: 60 [2018-12-09 01:12:27,977 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 01:12:27,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-12-09 01:12:28,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 54. [2018-12-09 01:12:28,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-12-09 01:12:28,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2018-12-09 01:12:28,004 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 63 transitions. Word has length 9 [2018-12-09 01:12:28,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:12:28,004 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 63 transitions. [2018-12-09 01:12:28,004 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 01:12:28,004 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2018-12-09 01:12:28,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-09 01:12:28,004 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:12:28,004 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:12:28,005 INFO L423 AbstractCegarLoop]: === Iteration 2 === [fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-09 01:12:28,005 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:12:28,005 INFO L82 PathProgramCache]: Analyzing trace with hash 1890424319, now seen corresponding path program 1 times [2018-12-09 01:12:28,005 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:12:28,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:12:28,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:12:28,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:12:28,006 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:12:28,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:12:28,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:12:28,025 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:12:28,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 01:12:28,026 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 01:12:28,027 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 01:12:28,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 01:12:28,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 01:12:28,027 INFO L87 Difference]: Start difference. First operand 54 states and 63 transitions. Second operand 3 states. [2018-12-09 01:12:28,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:12:28,040 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2018-12-09 01:12:28,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 01:12:28,040 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-12-09 01:12:28,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:12:28,041 INFO L225 Difference]: With dead ends: 56 [2018-12-09 01:12:28,041 INFO L226 Difference]: Without dead ends: 54 [2018-12-09 01:12:28,042 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 01:12:28,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-12-09 01:12:28,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2018-12-09 01:12:28,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-12-09 01:12:28,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2018-12-09 01:12:28,047 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 10 [2018-12-09 01:12:28,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:12:28,047 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2018-12-09 01:12:28,047 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 01:12:28,047 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2018-12-09 01:12:28,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-09 01:12:28,048 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:12:28,048 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:12:28,048 INFO L423 AbstractCegarLoop]: === Iteration 3 === [fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-09 01:12:28,048 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:12:28,048 INFO L82 PathProgramCache]: Analyzing trace with hash -1814880932, now seen corresponding path program 1 times [2018-12-09 01:12:28,048 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:12:28,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:12:28,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:12:28,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:12:28,049 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:12:28,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:12:28,090 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:12:28,091 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:12:28,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 01:12:28,091 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 01:12:28,091 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 01:12:28,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 01:12:28,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-09 01:12:28,092 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. Second operand 7 states. [2018-12-09 01:12:28,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:12:28,165 INFO L93 Difference]: Finished difference Result 71 states and 81 transitions. [2018-12-09 01:12:28,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 01:12:28,165 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2018-12-09 01:12:28,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:12:28,166 INFO L225 Difference]: With dead ends: 71 [2018-12-09 01:12:28,166 INFO L226 Difference]: Without dead ends: 69 [2018-12-09 01:12:28,166 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-12-09 01:12:28,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-12-09 01:12:28,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 65. [2018-12-09 01:12:28,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-12-09 01:12:28,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 76 transitions. [2018-12-09 01:12:28,172 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 76 transitions. Word has length 17 [2018-12-09 01:12:28,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:12:28,172 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 76 transitions. [2018-12-09 01:12:28,172 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 01:12:28,172 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 76 transitions. [2018-12-09 01:12:28,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-09 01:12:28,173 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:12:28,173 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:12:28,173 INFO L423 AbstractCegarLoop]: === Iteration 4 === [fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-09 01:12:28,173 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:12:28,173 INFO L82 PathProgramCache]: Analyzing trace with hash -2069922715, now seen corresponding path program 1 times [2018-12-09 01:12:28,173 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:12:28,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:12:28,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:12:28,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:12:28,174 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:12:28,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:12:28,200 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 01:12:28,200 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:12:28,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 01:12:28,200 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 01:12:28,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 01:12:28,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 01:12:28,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 01:12:28,201 INFO L87 Difference]: Start difference. First operand 65 states and 76 transitions. Second operand 5 states. [2018-12-09 01:12:28,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:12:28,246 INFO L93 Difference]: Finished difference Result 81 states and 100 transitions. [2018-12-09 01:12:28,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 01:12:28,246 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-12-09 01:12:28,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:12:28,247 INFO L225 Difference]: With dead ends: 81 [2018-12-09 01:12:28,247 INFO L226 Difference]: Without dead ends: 80 [2018-12-09 01:12:28,248 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 01:12:28,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-12-09 01:12:28,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 69. [2018-12-09 01:12:28,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-12-09 01:12:28,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 80 transitions. [2018-12-09 01:12:28,258 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 80 transitions. Word has length 20 [2018-12-09 01:12:28,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:12:28,258 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 80 transitions. [2018-12-09 01:12:28,258 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 01:12:28,258 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 80 transitions. [2018-12-09 01:12:28,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-09 01:12:28,258 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:12:28,258 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:12:28,259 INFO L423 AbstractCegarLoop]: === Iteration 5 === [fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-09 01:12:28,259 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:12:28,259 INFO L82 PathProgramCache]: Analyzing trace with hash 256905316, now seen corresponding path program 1 times [2018-12-09 01:12:28,259 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:12:28,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:12:28,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:12:28,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:12:28,260 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:12:28,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:12:28,272 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-09 01:12:28,272 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:12:28,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 01:12:28,273 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 01:12:28,273 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 01:12:28,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 01:12:28,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 01:12:28,273 INFO L87 Difference]: Start difference. First operand 69 states and 80 transitions. Second operand 3 states. [2018-12-09 01:12:28,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:12:28,280 INFO L93 Difference]: Finished difference Result 71 states and 87 transitions. [2018-12-09 01:12:28,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 01:12:28,281 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-12-09 01:12:28,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:12:28,281 INFO L225 Difference]: With dead ends: 71 [2018-12-09 01:12:28,282 INFO L226 Difference]: Without dead ends: 70 [2018-12-09 01:12:28,282 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 01:12:28,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-12-09 01:12:28,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2018-12-09 01:12:28,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-12-09 01:12:28,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 79 transitions. [2018-12-09 01:12:28,287 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 79 transitions. Word has length 21 [2018-12-09 01:12:28,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:12:28,287 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 79 transitions. [2018-12-09 01:12:28,287 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 01:12:28,287 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 79 transitions. [2018-12-09 01:12:28,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-09 01:12:28,288 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:12:28,288 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:12:28,288 INFO L423 AbstractCegarLoop]: === Iteration 6 === [fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-09 01:12:28,288 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:12:28,289 INFO L82 PathProgramCache]: Analyzing trace with hash -831628633, now seen corresponding path program 1 times [2018-12-09 01:12:28,289 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:12:28,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:12:28,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:12:28,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:12:28,290 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:12:28,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:12:28,309 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 01:12:28,309 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:12:28,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 01:12:28,309 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 01:12:28,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 01:12:28,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 01:12:28,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 01:12:28,310 INFO L87 Difference]: Start difference. First operand 68 states and 79 transitions. Second operand 5 states. [2018-12-09 01:12:28,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:12:28,347 INFO L93 Difference]: Finished difference Result 127 states and 161 transitions. [2018-12-09 01:12:28,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 01:12:28,347 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-12-09 01:12:28,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:12:28,348 INFO L225 Difference]: With dead ends: 127 [2018-12-09 01:12:28,348 INFO L226 Difference]: Without dead ends: 66 [2018-12-09 01:12:28,349 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 01:12:28,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-12-09 01:12:28,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2018-12-09 01:12:28,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-12-09 01:12:28,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 73 transitions. [2018-12-09 01:12:28,356 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 73 transitions. Word has length 25 [2018-12-09 01:12:28,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:12:28,356 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 73 transitions. [2018-12-09 01:12:28,356 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 01:12:28,356 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 73 transitions. [2018-12-09 01:12:28,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-09 01:12:28,357 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:12:28,357 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:12:28,357 INFO L423 AbstractCegarLoop]: === Iteration 7 === [fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-09 01:12:28,358 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:12:28,358 INFO L82 PathProgramCache]: Analyzing trace with hash 1630439354, now seen corresponding path program 1 times [2018-12-09 01:12:28,358 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:12:28,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:12:28,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:12:28,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:12:28,359 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:12:28,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:12:28,382 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-09 01:12:28,382 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:12:28,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 01:12:28,382 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 01:12:28,383 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 01:12:28,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 01:12:28,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 01:12:28,383 INFO L87 Difference]: Start difference. First operand 64 states and 73 transitions. Second operand 5 states. [2018-12-09 01:12:28,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:12:28,410 INFO L93 Difference]: Finished difference Result 76 states and 92 transitions. [2018-12-09 01:12:28,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 01:12:28,410 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-12-09 01:12:28,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:12:28,411 INFO L225 Difference]: With dead ends: 76 [2018-12-09 01:12:28,411 INFO L226 Difference]: Without dead ends: 75 [2018-12-09 01:12:28,411 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 01:12:28,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-12-09 01:12:28,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 72. [2018-12-09 01:12:28,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-12-09 01:12:28,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 86 transitions. [2018-12-09 01:12:28,418 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 86 transitions. Word has length 25 [2018-12-09 01:12:28,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:12:28,419 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 86 transitions. [2018-12-09 01:12:28,419 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 01:12:28,419 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 86 transitions. [2018-12-09 01:12:28,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-09 01:12:28,420 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:12:28,420 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:12:28,420 INFO L423 AbstractCegarLoop]: === Iteration 8 === [fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-09 01:12:28,420 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:12:28,421 INFO L82 PathProgramCache]: Analyzing trace with hash -995987509, now seen corresponding path program 1 times [2018-12-09 01:12:28,421 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:12:28,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:12:28,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:12:28,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:12:28,422 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:12:28,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:12:28,444 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-09 01:12:28,444 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:12:28,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 01:12:28,445 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 01:12:28,445 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 01:12:28,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 01:12:28,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 01:12:28,445 INFO L87 Difference]: Start difference. First operand 72 states and 86 transitions. Second operand 5 states. [2018-12-09 01:12:28,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:12:28,466 INFO L93 Difference]: Finished difference Result 79 states and 94 transitions. [2018-12-09 01:12:28,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 01:12:28,466 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-12-09 01:12:28,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:12:28,467 INFO L225 Difference]: With dead ends: 79 [2018-12-09 01:12:28,467 INFO L226 Difference]: Without dead ends: 75 [2018-12-09 01:12:28,467 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 01:12:28,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-12-09 01:12:28,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 72. [2018-12-09 01:12:28,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-12-09 01:12:28,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 85 transitions. [2018-12-09 01:12:28,473 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 85 transitions. Word has length 26 [2018-12-09 01:12:28,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:12:28,474 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 85 transitions. [2018-12-09 01:12:28,474 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 01:12:28,474 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 85 transitions. [2018-12-09 01:12:28,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-09 01:12:28,474 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:12:28,474 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 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] [2018-12-09 01:12:28,475 INFO L423 AbstractCegarLoop]: === Iteration 9 === [fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-09 01:12:28,475 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:12:28,475 INFO L82 PathProgramCache]: Analyzing trace with hash -23503209, now seen corresponding path program 1 times [2018-12-09 01:12:28,475 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:12:28,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:12:28,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:12:28,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:12:28,476 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:12:28,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:12:28,501 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-09 01:12:28,502 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:12:28,502 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 01:12:28,503 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 47 with the following transitions: [2018-12-09 01:12:28,504 INFO L205 CegarAbsIntRunner]: [0], [1], [4], [5], [7], [8], [18], [19], [23], [25], [27], [29], [31], [33], [35], [37], [39], [40], [44], [48], [49], [52], [53], [54], [55], [56], [57], [58], [60] [2018-12-09 01:12:28,527 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 01:12:28,527 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 01:12:28,655 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 01:12:28,656 INFO L272 AbstractInterpreter]: Visited 29 different actions 163 times. Never merged. Never widened. Performed 326 root evaluator evaluations with a maximum evaluation depth of 3. Performed 326 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 7 fixpoints after 3 different actions. Largest state had 5 variables. [2018-12-09 01:12:28,661 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:12:28,662 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 01:12:28,662 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:12:28,662 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0c0b88ac-0b4c-4983-a37f-a80b47f0992e/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 01:12:28,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:12:28,668 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 01:12:28,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:12:28,683 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:12:28,740 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-09 01:12:28,740 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 01:12:28,782 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-09 01:12:28,796 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 01:12:28,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 6] total 11 [2018-12-09 01:12:28,796 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 01:12:28,796 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 01:12:28,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 01:12:28,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-12-09 01:12:28,797 INFO L87 Difference]: Start difference. First operand 72 states and 85 transitions. Second operand 10 states. [2018-12-09 01:12:28,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:12:28,887 INFO L93 Difference]: Finished difference Result 88 states and 103 transitions. [2018-12-09 01:12:28,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 01:12:28,887 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 46 [2018-12-09 01:12:28,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:12:28,888 INFO L225 Difference]: With dead ends: 88 [2018-12-09 01:12:28,888 INFO L226 Difference]: Without dead ends: 86 [2018-12-09 01:12:28,889 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 86 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2018-12-09 01:12:28,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-12-09 01:12:28,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 82. [2018-12-09 01:12:28,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-12-09 01:12:28,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 96 transitions. [2018-12-09 01:12:28,896 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 96 transitions. Word has length 46 [2018-12-09 01:12:28,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:12:28,896 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 96 transitions. [2018-12-09 01:12:28,896 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 01:12:28,897 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 96 transitions. [2018-12-09 01:12:28,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-12-09 01:12:28,899 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:12:28,899 INFO L402 BasicCegarLoop]: trace histogram [9, 7, 7, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:12:28,900 INFO L423 AbstractCegarLoop]: === Iteration 10 === [fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-09 01:12:28,900 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:12:28,900 INFO L82 PathProgramCache]: Analyzing trace with hash 1677535167, now seen corresponding path program 1 times [2018-12-09 01:12:28,900 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:12:28,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:12:28,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:12:28,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:12:28,901 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:12:28,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:12:28,969 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 19 proven. 61 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2018-12-09 01:12:28,969 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:12:28,969 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 01:12:28,970 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 107 with the following transitions: [2018-12-09 01:12:28,970 INFO L205 CegarAbsIntRunner]: [0], [1], [4], [5], [7], [9], [11], [13], [14], [18], [19], [23], [25], [27], [29], [31], [33], [35], [37], [39], [40], [44], [48], [49], [50], [51], [52], [53], [54], [55], [56], [57], [58], [60] [2018-12-09 01:12:28,971 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 01:12:28,971 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 01:12:29,118 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-09 01:12:29,118 INFO L272 AbstractInterpreter]: Visited 34 different actions 669 times. Never merged. Never widened. Performed 1336 root evaluator evaluations with a maximum evaluation depth of 3. Performed 1336 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 35 fixpoints after 3 different actions. Largest state had 5 variables. [2018-12-09 01:12:29,124 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:12:29,125 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-09 01:12:29,201 INFO L227 lantSequenceWeakener]: Weakened 39 states. On average, predicates are now at 46.15% of their original sizes. [2018-12-09 01:12:29,201 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-09 01:12:29,254 INFO L418 sIntCurrentIteration]: We unified 105 AI predicates to 105 [2018-12-09 01:12:29,255 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-09 01:12:29,255 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-09 01:12:29,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [7] total 16 [2018-12-09 01:12:29,255 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 01:12:29,256 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-09 01:12:29,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-09 01:12:29,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-12-09 01:12:29,256 INFO L87 Difference]: Start difference. First operand 82 states and 96 transitions. Second operand 11 states. [2018-12-09 01:12:29,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:12:29,497 INFO L93 Difference]: Finished difference Result 84 states and 100 transitions. [2018-12-09 01:12:29,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-09 01:12:29,497 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 106 [2018-12-09 01:12:29,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:12:29,498 INFO L225 Difference]: With dead ends: 84 [2018-12-09 01:12:29,498 INFO L226 Difference]: Without dead ends: 0 [2018-12-09 01:12:29,498 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 114 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2018-12-09 01:12:29,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-09 01:12:29,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-09 01:12:29,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-09 01:12:29,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-09 01:12:29,499 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 106 [2018-12-09 01:12:29,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:12:29,499 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 01:12:29,499 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-09 01:12:29,499 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-09 01:12:29,499 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-09 01:12:29,502 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-09 01:12:29,632 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-12-09 01:12:29,632 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-09 01:12:29,632 INFO L448 ceAbstractionStarter]: For program point fFINAL(lines 11 15) no Hoare annotation was computed. [2018-12-09 01:12:29,632 INFO L444 ceAbstractionStarter]: At program point L14(line 14) the Hoare annotation is: (and (or (< 2147483646 |f_#in~x|) (and (<= f_~x 2147483646) (<= 1 f_~x))) (or (<= f_~x 2147483645) (< 2147483645 |f_#in~x|))) [2018-12-09 01:12:29,632 INFO L448 ceAbstractionStarter]: For program point L13(lines 13 14) no Hoare annotation was computed. [2018-12-09 01:12:29,632 INFO L448 ceAbstractionStarter]: For program point L14-1(line 14) no Hoare annotation was computed. [2018-12-09 01:12:29,632 INFO L448 ceAbstractionStarter]: For program point L14-2(line 14) no Hoare annotation was computed. [2018-12-09 01:12:29,632 INFO L448 ceAbstractionStarter]: For program point L14-3(line 14) no Hoare annotation was computed. [2018-12-09 01:12:29,632 INFO L448 ceAbstractionStarter]: For program point fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2018-12-09 01:12:29,632 INFO L448 ceAbstractionStarter]: For program point fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2018-12-09 01:12:29,632 INFO L444 ceAbstractionStarter]: At program point L14-4(line 14) the Hoare annotation is: (and (or (and (= |f_#t~ret0| 0) (<= f_~x 2147483646) (<= 1 f_~x)) (< 2147483646 |f_#in~x|)) (or (< 2147483645 |f_#in~x|) (<= f_~x 2147483645))) [2018-12-09 01:12:29,632 INFO L448 ceAbstractionStarter]: For program point L14-5(line 14) no Hoare annotation was computed. [2018-12-09 01:12:29,633 INFO L448 ceAbstractionStarter]: For program point fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2018-12-09 01:12:29,633 INFO L448 ceAbstractionStarter]: For program point L14-6(line 14) no Hoare annotation was computed. [2018-12-09 01:12:29,633 INFO L448 ceAbstractionStarter]: For program point fEXIT(lines 11 15) no Hoare annotation was computed. [2018-12-09 01:12:29,633 INFO L448 ceAbstractionStarter]: For program point fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2018-12-09 01:12:29,633 INFO L448 ceAbstractionStarter]: For program point L14-7(line 14) no Hoare annotation was computed. [2018-12-09 01:12:29,633 INFO L451 ceAbstractionStarter]: At program point fENTRY(lines 11 15) the Hoare annotation is: true [2018-12-09 01:12:29,633 INFO L448 ceAbstractionStarter]: For program point gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2018-12-09 01:12:29,633 INFO L448 ceAbstractionStarter]: For program point gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2018-12-09 01:12:29,633 INFO L448 ceAbstractionStarter]: For program point gFINAL(lines 17 21) no Hoare annotation was computed. [2018-12-09 01:12:29,633 INFO L448 ceAbstractionStarter]: For program point L20(line 20) no Hoare annotation was computed. [2018-12-09 01:12:29,633 INFO L448 ceAbstractionStarter]: For program point L19(lines 19 20) no Hoare annotation was computed. [2018-12-09 01:12:29,633 INFO L448 ceAbstractionStarter]: For program point L20-1(line 20) no Hoare annotation was computed. [2018-12-09 01:12:29,633 INFO L444 ceAbstractionStarter]: At program point L20-2(line 20) the Hoare annotation is: (or (< 2147483647 |g_#in~x|) (and (<= 1 g_~x) (<= g_~x 2147483647) (<= |g_#in~x| g_~x))) [2018-12-09 01:12:29,633 INFO L448 ceAbstractionStarter]: For program point L20-3(line 20) no Hoare annotation was computed. [2018-12-09 01:12:29,633 INFO L448 ceAbstractionStarter]: For program point L20-4(line 20) no Hoare annotation was computed. [2018-12-09 01:12:29,633 INFO L448 ceAbstractionStarter]: For program point L20-5(line 20) no Hoare annotation was computed. [2018-12-09 01:12:29,633 INFO L444 ceAbstractionStarter]: At program point L20-6(line 20) the Hoare annotation is: (or (and (<= 1 g_~x) (<= g_~x 2147483647) (<= |g_#in~x| g_~x) (= |g_#t~ret2| 0)) (< 2147483647 |g_#in~x|)) [2018-12-09 01:12:29,633 INFO L448 ceAbstractionStarter]: For program point L20-7(line 20) no Hoare annotation was computed. [2018-12-09 01:12:29,634 INFO L448 ceAbstractionStarter]: For program point L20-8(line 20) no Hoare annotation was computed. [2018-12-09 01:12:29,634 INFO L448 ceAbstractionStarter]: For program point L20-9(line 20) no Hoare annotation was computed. [2018-12-09 01:12:29,634 INFO L448 ceAbstractionStarter]: For program point gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2018-12-09 01:12:29,634 INFO L448 ceAbstractionStarter]: For program point gEXIT(lines 17 21) no Hoare annotation was computed. [2018-12-09 01:12:29,634 INFO L448 ceAbstractionStarter]: For program point gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2018-12-09 01:12:29,634 INFO L451 ceAbstractionStarter]: At program point gENTRY(lines 17 21) the Hoare annotation is: true [2018-12-09 01:12:29,634 INFO L448 ceAbstractionStarter]: For program point gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2018-12-09 01:12:29,634 INFO L448 ceAbstractionStarter]: For program point gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2018-12-09 01:12:29,634 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-09 01:12:29,634 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-12-09 01:12:29,634 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-09 01:12:29,634 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-09 01:12:29,634 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 24 27) the Hoare annotation is: true [2018-12-09 01:12:29,634 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 24 27) no Hoare annotation was computed. [2018-12-09 01:12:29,634 INFO L444 ceAbstractionStarter]: At program point L26(line 26) the Hoare annotation is: (<= main_~x~0 2147483647) [2018-12-09 01:12:29,634 INFO L448 ceAbstractionStarter]: For program point L26-1(line 26) no Hoare annotation was computed. [2018-12-09 01:12:29,634 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 24 27) no Hoare annotation was computed. [2018-12-09 01:12:29,636 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 01:12:29 BoogieIcfgContainer [2018-12-09 01:12:29,636 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 01:12:29,636 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 01:12:29,636 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 01:12:29,636 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 01:12:29,637 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 01:12:27" (3/4) ... [2018-12-09 01:12:29,640 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-09 01:12:29,643 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-09 01:12:29,643 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure f [2018-12-09 01:12:29,643 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure g [2018-12-09 01:12:29,644 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-09 01:12:29,646 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2018-12-09 01:12:29,646 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-12-09 01:12:29,646 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-09 01:12:29,672 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_0c0b88ac-0b4c-4983-a37f-a80b47f0992e/bin-2019/utaipan/witness.graphml [2018-12-09 01:12:29,672 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 01:12:29,673 INFO L168 Benchmark]: Toolchain (without parser) took 2239.64 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 216.0 MB). Free memory was 959.7 MB in the beginning and 1.1 GB in the end (delta: -177.7 MB). Peak memory consumption was 38.3 MB. Max. memory is 11.5 GB. [2018-12-09 01:12:29,673 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 01:12:29,673 INFO L168 Benchmark]: CACSL2BoogieTranslator took 119.68 ms. Allocated memory is still 1.0 GB. Free memory was 959.7 MB in the beginning and 947.9 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 11.5 GB. [2018-12-09 01:12:29,674 INFO L168 Benchmark]: Boogie Procedure Inliner took 11.75 ms. Allocated memory is still 1.0 GB. Free memory is still 947.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 01:12:29,674 INFO L168 Benchmark]: Boogie Preprocessor took 11.00 ms. Allocated memory is still 1.0 GB. Free memory is still 947.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 01:12:29,674 INFO L168 Benchmark]: RCFGBuilder took 161.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 947.9 MB in the beginning and 1.1 GB in the end (delta: -165.0 MB). Peak memory consumption was 15.9 MB. Max. memory is 11.5 GB. [2018-12-09 01:12:29,674 INFO L168 Benchmark]: TraceAbstraction took 1897.38 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 83.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -30.0 MB). Peak memory consumption was 53.4 MB. Max. memory is 11.5 GB. [2018-12-09 01:12:29,674 INFO L168 Benchmark]: Witness Printer took 35.81 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-09 01:12:29,676 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 119.68 ms. Allocated memory is still 1.0 GB. Free memory was 959.7 MB in the beginning and 947.9 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 11.75 ms. Allocated memory is still 1.0 GB. Free memory is still 947.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 11.00 ms. Allocated memory is still 1.0 GB. Free memory is still 947.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 161.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 947.9 MB in the beginning and 1.1 GB in the end (delta: -165.0 MB). Peak memory consumption was 15.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1897.38 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 83.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -30.0 MB). Peak memory consumption was 53.4 MB. Max. memory is 11.5 GB. * Witness Printer took 35.81 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: 5.4 MB). Peak memory consumption was 5.4 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: 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 - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - AllSpecificationsHoldResult: All specifications hold 10 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 47 locations, 10 error locations. SAFE Result, 1.8s OverallTime, 10 OverallIterations, 9 TraceHistogramMax, 0.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 359 SDtfs, 268 SDslu, 1001 SDs, 0 SdLazy, 392 SolverSat, 61 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 255 GetRequests, 193 SyntacticMatches, 2 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=82occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.3s AbstIntTime, 2 AbstIntIterations, 1 AbstIntStrong, 0.8126984126984127 AbsIntWeakeningRatio, 0.4666666666666667 AbsIntAvgWeakeningVarsNumRemoved, 0.4666666666666667 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 37 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 11 LocationsWithAnnotation, 59 PreInvPairs, 70 NumberOfFragments, 87 HoareAnnotationTreeSize, 59 FomulaSimplifications, 66 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 11 FomulaSimplificationsInter, 178 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 351 NumberOfCodeBlocks, 351 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 385 ConstructedInterpolants, 0 QuantifiedInterpolants, 28144 SizeOfPredicates, 3 NumberOfNonLiveVariables, 95 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 12 InterpolantComputations, 8 PerfectInterpolantSequences, 214/311 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...