./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 6b5699aa Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_4c0ae99b-34ef-46d4-9904-26c8d1fa6dd0/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_4c0ae99b-34ef-46d4-9904-26c8d1fa6dd0/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_4c0ae99b-34ef-46d4-9904-26c8d1fa6dd0/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_4c0ae99b-34ef-46d4-9904-26c8d1fa6dd0/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/termination-crafted/NestedRecursion_1b.c -s /tmp/vcloud-vcloud-master/worker/run_dir_4c0ae99b-34ef-46d4-9904-26c8d1fa6dd0/bin/utaipan/config/svcomp-Overflow-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_4c0ae99b-34ef-46d4-9904-26c8d1fa6dd0/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 Using bit-precise analysis No suitable file found in config dir /tmp/vcloud-vcloud-master/worker/run_dir_4c0ae99b-34ef-46d4-9904-26c8d1fa6dd0/bin/utaipan/config using search string *Overflow*64bit*_Bitvector*.epf No suitable settings file found using Overflow*64bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: IllegalArgumentException: Recursive programs are not supported. --- Real Ultimate output --- This is Ultimate 0.1.24-6b5699a [2019-11-26 02:28:21,835 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-26 02:28:21,836 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-26 02:28:21,846 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-26 02:28:21,847 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-26 02:28:21,848 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-26 02:28:21,849 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-26 02:28:21,851 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-26 02:28:21,852 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-26 02:28:21,853 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-26 02:28:21,854 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-26 02:28:21,855 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-26 02:28:21,855 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-26 02:28:21,856 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-26 02:28:21,857 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-26 02:28:21,858 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-26 02:28:21,859 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-26 02:28:21,860 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-26 02:28:21,862 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-26 02:28:21,864 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-26 02:28:21,865 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-26 02:28:21,866 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-26 02:28:21,867 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-26 02:28:21,868 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-26 02:28:21,870 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-26 02:28:21,870 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-26 02:28:21,874 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-26 02:28:21,875 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-26 02:28:21,875 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-26 02:28:21,876 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-26 02:28:21,876 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-26 02:28:21,877 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-26 02:28:21,877 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-26 02:28:21,878 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-26 02:28:21,879 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-26 02:28:21,879 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-26 02:28:21,879 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-26 02:28:21,879 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-26 02:28:21,880 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-26 02:28:21,880 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-26 02:28:21,881 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-26 02:28:21,881 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_4c0ae99b-34ef-46d4-9904-26c8d1fa6dd0/bin/utaipan/config/svcomp-Overflow-64bit-Taipan_Default.epf [2019-11-26 02:28:21,901 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-26 02:28:21,901 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-26 02:28:21,902 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-26 02:28:21,902 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-26 02:28:21,902 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-26 02:28:21,902 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-26 02:28:21,903 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-26 02:28:21,903 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-26 02:28:21,903 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-26 02:28:21,903 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-26 02:28:21,904 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-26 02:28:21,904 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-26 02:28:21,904 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-26 02:28:21,905 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-26 02:28:21,905 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-26 02:28:21,905 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-26 02:28:21,905 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-26 02:28:21,906 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-26 02:28:21,906 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-26 02:28:21,906 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-26 02:28:21,906 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-26 02:28:21,906 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-26 02:28:21,907 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2019-11-26 02:28:21,907 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-26 02:28:21,907 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-26 02:28:21,907 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-26 02:28:21,908 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-26 02:28:21,908 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-26 02:28:21,908 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-26 02:28:21,908 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-26 02:28:21,908 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-26 02:28:21,908 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-26 02:28:21,909 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-26 02:28:21,909 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-26 02:28:21,909 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-26 02:28:21,909 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-26 02:28:21,909 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_4c0ae99b-34ef-46d4-9904-26c8d1fa6dd0/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-11-26 02:28:22,094 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-26 02:28:22,104 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-26 02:28:22,106 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-26 02:28:22,108 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-26 02:28:22,108 INFO L275 PluginConnector]: CDTParser initialized [2019-11-26 02:28:22,109 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_4c0ae99b-34ef-46d4-9904-26c8d1fa6dd0/bin/utaipan/../../sv-benchmarks/c/termination-crafted/NestedRecursion_1b.c [2019-11-26 02:28:22,156 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_4c0ae99b-34ef-46d4-9904-26c8d1fa6dd0/bin/utaipan/data/5087e72f8/6e4ca0c1988e4ad4b308e8a17b973a53/FLAG1808782c4 [2019-11-26 02:28:22,549 INFO L306 CDTParser]: Found 1 translation units. [2019-11-26 02:28:22,549 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_4c0ae99b-34ef-46d4-9904-26c8d1fa6dd0/sv-benchmarks/c/termination-crafted/NestedRecursion_1b.c [2019-11-26 02:28:22,554 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_4c0ae99b-34ef-46d4-9904-26c8d1fa6dd0/bin/utaipan/data/5087e72f8/6e4ca0c1988e4ad4b308e8a17b973a53/FLAG1808782c4 [2019-11-26 02:28:22,566 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_4c0ae99b-34ef-46d4-9904-26c8d1fa6dd0/bin/utaipan/data/5087e72f8/6e4ca0c1988e4ad4b308e8a17b973a53 [2019-11-26 02:28:22,568 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-26 02:28:22,569 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-26 02:28:22,570 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-26 02:28:22,570 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-26 02:28:22,575 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-26 02:28:22,576 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:28:22" (1/1) ... [2019-11-26 02:28:22,578 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f15bcaa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:28:22, skipping insertion in model container [2019-11-26 02:28:22,579 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:28:22" (1/1) ... [2019-11-26 02:28:22,585 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-26 02:28:22,599 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-26 02:28:22,774 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:28:22,777 INFO L201 MainTranslator]: Completed pre-run [2019-11-26 02:28:22,851 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:28:22,863 INFO L205 MainTranslator]: Completed translation [2019-11-26 02:28:22,863 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:28:22 WrapperNode [2019-11-26 02:28:22,863 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-26 02:28:22,864 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-26 02:28:22,864 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-26 02:28:22,864 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-26 02:28:22,872 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:28:22" (1/1) ... [2019-11-26 02:28:22,876 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:28:22" (1/1) ... [2019-11-26 02:28:22,890 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-26 02:28:22,891 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-26 02:28:22,891 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-26 02:28:22,891 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-26 02:28:22,899 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:28:22" (1/1) ... [2019-11-26 02:28:22,899 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:28:22" (1/1) ... [2019-11-26 02:28:22,899 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:28:22" (1/1) ... [2019-11-26 02:28:22,900 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:28:22" (1/1) ... [2019-11-26 02:28:22,901 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:28:22" (1/1) ... [2019-11-26 02:28:22,902 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:28:22" (1/1) ... [2019-11-26 02:28:22,903 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:28:22" (1/1) ... [2019-11-26 02:28:22,904 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-26 02:28:22,905 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-26 02:28:22,905 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-26 02:28:22,905 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-26 02:28:22,906 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:28:22" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4c0ae99b-34ef-46d4-9904-26c8d1fa6dd0/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-11-26 02:28:22,953 INFO L130 BoogieDeclarations]: Found specification of procedure rec1 [2019-11-26 02:28:22,953 INFO L138 BoogieDeclarations]: Found implementation of procedure rec1 [2019-11-26 02:28:22,955 INFO L130 BoogieDeclarations]: Found specification of procedure rec2 [2019-11-26 02:28:22,955 INFO L138 BoogieDeclarations]: Found implementation of procedure rec2 [2019-11-26 02:28:22,955 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-26 02:28:22,956 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-26 02:28:23,148 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-26 02:28:23,148 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-26 02:28:23,149 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:28:23 BoogieIcfgContainer [2019-11-26 02:28:23,149 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-26 02:28:23,150 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-26 02:28:23,150 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-26 02:28:23,153 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-26 02:28:23,153 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 02:28:22" (1/3) ... [2019-11-26 02:28:23,154 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e75fc47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:28:23, skipping insertion in model container [2019-11-26 02:28:23,154 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:28:22" (2/3) ... [2019-11-26 02:28:23,154 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e75fc47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:28:23, skipping insertion in model container [2019-11-26 02:28:23,154 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:28:23" (3/3) ... [2019-11-26 02:28:23,155 INFO L109 eAbstractionObserver]: Analyzing ICFG NestedRecursion_1b.c [2019-11-26 02:28:23,164 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-26 02:28:23,170 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 10 error locations. [2019-11-26 02:28:23,180 INFO L249 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2019-11-26 02:28:23,200 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-26 02:28:23,200 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-26 02:28:23,200 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-26 02:28:23,200 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-26 02:28:23,200 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-26 02:28:23,201 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-26 02:28:23,201 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-26 02:28:23,201 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-26 02:28:23,218 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states. [2019-11-26 02:28:23,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-11-26 02:28:23,223 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:28:23,223 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-11-26 02:28:23,224 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-11-26 02:28:23,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:28:23,229 INFO L82 PathProgramCache]: Analyzing trace with hash 70122184, now seen corresponding path program 1 times [2019-11-26 02:28:23,237 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:28:23,237 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040373503] [2019-11-26 02:28:23,237 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:28:23,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:28:23,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:28:23,394 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040373503] [2019-11-26 02:28:23,394 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:28:23,394 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:28:23,396 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997581856] [2019-11-26 02:28:23,399 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-26 02:28:23,400 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:28:23,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-26 02:28:23,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:28:23,411 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 5 states. [2019-11-26 02:28:23,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:28:23,520 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2019-11-26 02:28:23,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-26 02:28:23,523 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-11-26 02:28:23,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:28:23,532 INFO L225 Difference]: With dead ends: 60 [2019-11-26 02:28:23,532 INFO L226 Difference]: Without dead ends: 55 [2019-11-26 02:28:23,535 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-11-26 02:28:23,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-11-26 02:28:23,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 50. [2019-11-26 02:28:23,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-11-26 02:28:23,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 59 transitions. [2019-11-26 02:28:23,576 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 59 transitions. Word has length 5 [2019-11-26 02:28:23,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:28:23,576 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 59 transitions. [2019-11-26 02:28:23,576 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-26 02:28:23,577 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 59 transitions. [2019-11-26 02:28:23,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-11-26 02:28:23,577 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:28:23,577 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-11-26 02:28:23,577 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-11-26 02:28:23,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:28:23,578 INFO L82 PathProgramCache]: Analyzing trace with hash -2121179530, now seen corresponding path program 1 times [2019-11-26 02:28:23,578 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:28:23,578 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805203064] [2019-11-26 02:28:23,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:28:23,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:28:23,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:28:23,594 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805203064] [2019-11-26 02:28:23,594 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:28:23,594 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 02:28:23,594 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123332960] [2019-11-26 02:28:23,595 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:28:23,596 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:28:23,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:28:23,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:28:23,596 INFO L87 Difference]: Start difference. First operand 50 states and 59 transitions. Second operand 3 states. [2019-11-26 02:28:23,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:28:23,621 INFO L93 Difference]: Finished difference Result 52 states and 62 transitions. [2019-11-26 02:28:23,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:28:23,623 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2019-11-26 02:28:23,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:28:23,624 INFO L225 Difference]: With dead ends: 52 [2019-11-26 02:28:23,625 INFO L226 Difference]: Without dead ends: 51 [2019-11-26 02:28:23,626 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-11-26 02:28:23,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-11-26 02:28:23,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2019-11-26 02:28:23,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-11-26 02:28:23,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 57 transitions. [2019-11-26 02:28:23,637 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 57 transitions. Word has length 6 [2019-11-26 02:28:23,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:28:23,637 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 57 transitions. [2019-11-26 02:28:23,637 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:28:23,637 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2019-11-26 02:28:23,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-26 02:28:23,637 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:28:23,637 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:28:23,638 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-11-26 02:28:23,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:28:23,638 INFO L82 PathProgramCache]: Analyzing trace with hash -2074588191, now seen corresponding path program 1 times [2019-11-26 02:28:23,638 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:28:23,638 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939453489] [2019-11-26 02:28:23,639 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:28:23,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:28:23,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:28:23,698 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939453489] [2019-11-26 02:28:23,698 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:28:23,698 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-26 02:28:23,698 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591217588] [2019-11-26 02:28:23,699 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-26 02:28:23,699 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:28:23,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-26 02:28:23,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-26 02:28:23,699 INFO L87 Difference]: Start difference. First operand 49 states and 57 transitions. Second operand 7 states. [2019-11-26 02:28:23,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:28:23,887 INFO L93 Difference]: Finished difference Result 77 states and 92 transitions. [2019-11-26 02:28:23,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-26 02:28:23,888 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2019-11-26 02:28:23,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:28:23,889 INFO L225 Difference]: With dead ends: 77 [2019-11-26 02:28:23,889 INFO L226 Difference]: Without dead ends: 76 [2019-11-26 02:28:23,890 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-11-26 02:28:23,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-11-26 02:28:23,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 65. [2019-11-26 02:28:23,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-11-26 02:28:23,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 81 transitions. [2019-11-26 02:28:23,919 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 81 transitions. Word has length 10 [2019-11-26 02:28:23,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:28:23,920 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 81 transitions. [2019-11-26 02:28:23,921 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-26 02:28:23,921 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 81 transitions. [2019-11-26 02:28:23,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-26 02:28:23,922 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:28:23,922 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:28:23,923 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-11-26 02:28:23,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:28:23,923 INFO L82 PathProgramCache]: Analyzing trace with hash 112275557, now seen corresponding path program 1 times [2019-11-26 02:28:23,923 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:28:23,924 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641769107] [2019-11-26 02:28:23,924 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:28:23,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:28:23,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:28:23,946 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641769107] [2019-11-26 02:28:23,947 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:28:23,947 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 02:28:23,947 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821657160] [2019-11-26 02:28:23,947 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:28:23,948 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:28:23,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:28:23,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:28:23,948 INFO L87 Difference]: Start difference. First operand 65 states and 81 transitions. Second operand 3 states. [2019-11-26 02:28:23,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:28:23,961 INFO L93 Difference]: Finished difference Result 69 states and 91 transitions. [2019-11-26 02:28:23,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:28:23,962 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-11-26 02:28:23,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:28:23,963 INFO L225 Difference]: With dead ends: 69 [2019-11-26 02:28:23,963 INFO L226 Difference]: Without dead ends: 68 [2019-11-26 02:28:23,964 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-11-26 02:28:23,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-26 02:28:23,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 64. [2019-11-26 02:28:23,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-11-26 02:28:23,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 79 transitions. [2019-11-26 02:28:23,976 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 79 transitions. Word has length 11 [2019-11-26 02:28:23,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:28:23,976 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 79 transitions. [2019-11-26 02:28:23,976 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:28:23,977 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 79 transitions. [2019-11-26 02:28:23,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-26 02:28:23,977 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:28:23,978 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:28:23,978 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-11-26 02:28:23,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:28:23,978 INFO L82 PathProgramCache]: Analyzing trace with hash -2048531074, now seen corresponding path program 1 times [2019-11-26 02:28:23,979 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:28:23,979 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828873735] [2019-11-26 02:28:23,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:28:23,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:28:24,023 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:28:24,023 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828873735] [2019-11-26 02:28:24,023 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:28:24,024 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-26 02:28:24,024 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166211606] [2019-11-26 02:28:24,024 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-26 02:28:24,024 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:28:24,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-26 02:28:24,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-26 02:28:24,025 INFO L87 Difference]: Start difference. First operand 64 states and 79 transitions. Second operand 6 states. [2019-11-26 02:28:24,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:28:24,072 INFO L93 Difference]: Finished difference Result 125 states and 160 transitions. [2019-11-26 02:28:24,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-26 02:28:24,073 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-11-26 02:28:24,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:28:24,074 INFO L225 Difference]: With dead ends: 125 [2019-11-26 02:28:24,074 INFO L226 Difference]: Without dead ends: 86 [2019-11-26 02:28:24,075 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-11-26 02:28:24,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-11-26 02:28:24,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 76. [2019-11-26 02:28:24,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-11-26 02:28:24,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 98 transitions. [2019-11-26 02:28:24,087 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 98 transitions. Word has length 16 [2019-11-26 02:28:24,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:28:24,088 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 98 transitions. [2019-11-26 02:28:24,088 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-26 02:28:24,088 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 98 transitions. [2019-11-26 02:28:24,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-26 02:28:24,089 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:28:24,089 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:28:24,090 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-11-26 02:28:24,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:28:24,090 INFO L82 PathProgramCache]: Analyzing trace with hash -57180086, now seen corresponding path program 1 times [2019-11-26 02:28:24,090 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:28:24,090 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943479638] [2019-11-26 02:28:24,091 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:28:24,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:28:24,111 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-26 02:28:24,111 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943479638] [2019-11-26 02:28:24,111 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:28:24,112 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 02:28:24,112 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102204169] [2019-11-26 02:28:24,112 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:28:24,112 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:28:24,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:28:24,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:28:24,113 INFO L87 Difference]: Start difference. First operand 76 states and 98 transitions. Second operand 3 states. [2019-11-26 02:28:24,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:28:24,130 INFO L93 Difference]: Finished difference Result 76 states and 98 transitions. [2019-11-26 02:28:24,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:28:24,131 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-26 02:28:24,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:28:24,132 INFO L225 Difference]: With dead ends: 76 [2019-11-26 02:28:24,132 INFO L226 Difference]: Without dead ends: 75 [2019-11-26 02:28:24,133 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-11-26 02:28:24,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-11-26 02:28:24,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-11-26 02:28:24,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-11-26 02:28:24,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 96 transitions. [2019-11-26 02:28:24,145 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 96 transitions. Word has length 18 [2019-11-26 02:28:24,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:28:24,146 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 96 transitions. [2019-11-26 02:28:24,146 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:28:24,146 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 96 transitions. [2019-11-26 02:28:24,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-26 02:28:24,147 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:28:24,147 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:28:24,147 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-11-26 02:28:24,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:28:24,147 INFO L82 PathProgramCache]: Analyzing trace with hash -599425808, now seen corresponding path program 1 times [2019-11-26 02:28:24,148 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:28:24,148 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537604832] [2019-11-26 02:28:24,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:28:24,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:28:24,167 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-26 02:28:24,167 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537604832] [2019-11-26 02:28:24,168 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:28:24,168 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 02:28:24,168 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716623541] [2019-11-26 02:28:24,168 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:28:24,169 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:28:24,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:28:24,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:28:24,169 INFO L87 Difference]: Start difference. First operand 75 states and 96 transitions. Second operand 3 states. [2019-11-26 02:28:24,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:28:24,179 INFO L93 Difference]: Finished difference Result 75 states and 96 transitions. [2019-11-26 02:28:24,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:28:24,179 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-26 02:28:24,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:28:24,181 INFO L225 Difference]: With dead ends: 75 [2019-11-26 02:28:24,181 INFO L226 Difference]: Without dead ends: 74 [2019-11-26 02:28:24,181 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-11-26 02:28:24,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-11-26 02:28:24,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-11-26 02:28:24,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-11-26 02:28:24,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 94 transitions. [2019-11-26 02:28:24,191 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 94 transitions. Word has length 19 [2019-11-26 02:28:24,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:28:24,192 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 94 transitions. [2019-11-26 02:28:24,192 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:28:24,192 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 94 transitions. [2019-11-26 02:28:24,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-26 02:28:24,193 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:28:24,193 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:28:24,193 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-11-26 02:28:24,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:28:24,194 INFO L82 PathProgramCache]: Analyzing trace with hash -1772582622, now seen corresponding path program 1 times [2019-11-26 02:28:24,194 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:28:24,194 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778029976] [2019-11-26 02:28:24,194 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:28:24,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:28:24,223 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-26 02:28:24,224 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778029976] [2019-11-26 02:28:24,224 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:28:24,224 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:28:24,224 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606253832] [2019-11-26 02:28:24,225 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:28:24,225 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:28:24,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:28:24,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:28:24,226 INFO L87 Difference]: Start difference. First operand 74 states and 94 transitions. Second operand 4 states. [2019-11-26 02:28:24,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:28:24,246 INFO L93 Difference]: Finished difference Result 95 states and 126 transitions. [2019-11-26 02:28:24,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:28:24,246 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-11-26 02:28:24,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:28:24,248 INFO L225 Difference]: With dead ends: 95 [2019-11-26 02:28:24,248 INFO L226 Difference]: Without dead ends: 94 [2019-11-26 02:28:24,249 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-11-26 02:28:24,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-11-26 02:28:24,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 80. [2019-11-26 02:28:24,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-11-26 02:28:24,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 100 transitions. [2019-11-26 02:28:24,260 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 100 transitions. Word has length 19 [2019-11-26 02:28:24,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:28:24,261 INFO L462 AbstractCegarLoop]: Abstraction has 80 states and 100 transitions. [2019-11-26 02:28:24,261 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:28:24,261 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 100 transitions. [2019-11-26 02:28:24,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-26 02:28:24,262 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:28:24,262 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-11-26 02:28:24,262 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-11-26 02:28:24,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:28:24,263 INFO L82 PathProgramCache]: Analyzing trace with hash -1402330794, now seen corresponding path program 1 times [2019-11-26 02:28:24,263 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:28:24,263 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091146543] [2019-11-26 02:28:24,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:28:24,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:28:24,292 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-26 02:28:24,292 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091146543] [2019-11-26 02:28:24,293 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:28:24,293 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:28:24,293 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523394153] [2019-11-26 02:28:24,293 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:28:24,293 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:28:24,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:28:24,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:28:24,294 INFO L87 Difference]: Start difference. First operand 80 states and 100 transitions. Second operand 4 states. [2019-11-26 02:28:24,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:28:24,318 INFO L93 Difference]: Finished difference Result 89 states and 110 transitions. [2019-11-26 02:28:24,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:28:24,320 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-11-26 02:28:24,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:28:24,321 INFO L225 Difference]: With dead ends: 89 [2019-11-26 02:28:24,321 INFO L226 Difference]: Without dead ends: 83 [2019-11-26 02:28:24,321 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-11-26 02:28:24,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-11-26 02:28:24,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-11-26 02:28:24,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-11-26 02:28:24,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 101 transitions. [2019-11-26 02:28:24,335 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 101 transitions. Word has length 20 [2019-11-26 02:28:24,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:28:24,336 INFO L462 AbstractCegarLoop]: Abstraction has 83 states and 101 transitions. [2019-11-26 02:28:24,336 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:28:24,336 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 101 transitions. [2019-11-26 02:28:24,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-26 02:28:24,341 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:28:24,341 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-11-26 02:28:24,341 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-11-26 02:28:24,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:28:24,342 INFO L82 PathProgramCache]: Analyzing trace with hash 921726737, now seen corresponding path program 1 times [2019-11-26 02:28:24,342 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:28:24,342 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922610083] [2019-11-26 02:28:24,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:28:24,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:28:24,382 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-26 02:28:24,383 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922610083] [2019-11-26 02:28:24,383 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:28:24,383 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-26 02:28:24,383 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920304350] [2019-11-26 02:28:24,384 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-26 02:28:24,384 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:28:24,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-26 02:28:24,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-26 02:28:24,384 INFO L87 Difference]: Start difference. First operand 83 states and 101 transitions. Second operand 6 states. [2019-11-26 02:28:24,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:28:24,466 INFO L93 Difference]: Finished difference Result 167 states and 222 transitions. [2019-11-26 02:28:24,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-26 02:28:24,475 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2019-11-26 02:28:24,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:28:24,477 INFO L225 Difference]: With dead ends: 167 [2019-11-26 02:28:24,477 INFO L226 Difference]: Without dead ends: 101 [2019-11-26 02:28:24,479 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-11-26 02:28:24,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-11-26 02:28:24,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 89. [2019-11-26 02:28:24,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-11-26 02:28:24,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 108 transitions. [2019-11-26 02:28:24,498 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 108 transitions. Word has length 23 [2019-11-26 02:28:24,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:28:24,499 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 108 transitions. [2019-11-26 02:28:24,499 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-26 02:28:24,500 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 108 transitions. [2019-11-26 02:28:24,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-26 02:28:24,502 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:28:24,502 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-11-26 02:28:24,502 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-11-26 02:28:24,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:28:24,502 INFO L82 PathProgramCache]: Analyzing trace with hash 970950199, now seen corresponding path program 1 times [2019-11-26 02:28:24,503 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:28:24,503 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145580813] [2019-11-26 02:28:24,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:28:24,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:28:24,563 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-26 02:28:24,564 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145580813] [2019-11-26 02:28:24,564 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:28:24,564 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-26 02:28:24,564 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949578251] [2019-11-26 02:28:24,565 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-26 02:28:24,565 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:28:24,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-26 02:28:24,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-26 02:28:24,565 INFO L87 Difference]: Start difference. First operand 89 states and 108 transitions. Second operand 6 states. [2019-11-26 02:28:24,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:28:24,634 INFO L93 Difference]: Finished difference Result 176 states and 226 transitions. [2019-11-26 02:28:24,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-26 02:28:24,636 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-11-26 02:28:24,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:28:24,637 INFO L225 Difference]: With dead ends: 176 [2019-11-26 02:28:24,637 INFO L226 Difference]: Without dead ends: 105 [2019-11-26 02:28:24,638 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-11-26 02:28:24,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-11-26 02:28:24,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 97. [2019-11-26 02:28:24,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-11-26 02:28:24,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 117 transitions. [2019-11-26 02:28:24,653 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 117 transitions. Word has length 34 [2019-11-26 02:28:24,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:28:24,654 INFO L462 AbstractCegarLoop]: Abstraction has 97 states and 117 transitions. [2019-11-26 02:28:24,654 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-26 02:28:24,654 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 117 transitions. [2019-11-26 02:28:24,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-26 02:28:24,657 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:28:24,657 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-11-26 02:28:24,657 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-11-26 02:28:24,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:28:24,657 INFO L82 PathProgramCache]: Analyzing trace with hash -1027694963, now seen corresponding path program 1 times [2019-11-26 02:28:24,658 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:28:24,658 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657281390] [2019-11-26 02:28:24,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:28:24,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:28:24,699 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-11-26 02:28:24,700 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657281390] [2019-11-26 02:28:24,700 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:28:24,700 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:28:24,700 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433772739] [2019-11-26 02:28:24,701 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:28:24,701 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:28:24,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:28:24,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:28:24,701 INFO L87 Difference]: Start difference. First operand 97 states and 117 transitions. Second operand 4 states. [2019-11-26 02:28:24,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:28:24,719 INFO L93 Difference]: Finished difference Result 104 states and 127 transitions. [2019-11-26 02:28:24,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:28:24,720 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2019-11-26 02:28:24,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:28:24,722 INFO L225 Difference]: With dead ends: 104 [2019-11-26 02:28:24,722 INFO L226 Difference]: Without dead ends: 103 [2019-11-26 02:28:24,722 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-11-26 02:28:24,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-11-26 02:28:24,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 101. [2019-11-26 02:28:24,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-11-26 02:28:24,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 121 transitions. [2019-11-26 02:28:24,732 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 121 transitions. Word has length 37 [2019-11-26 02:28:24,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:28:24,733 INFO L462 AbstractCegarLoop]: Abstraction has 101 states and 121 transitions. [2019-11-26 02:28:24,733 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:28:24,733 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 121 transitions. [2019-11-26 02:28:24,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-26 02:28:24,734 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:28:24,734 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-11-26 02:28:24,735 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-11-26 02:28:24,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:28:24,735 INFO L82 PathProgramCache]: Analyzing trace with hash 860890908, now seen corresponding path program 1 times [2019-11-26 02:28:24,735 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:28:24,736 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464235290] [2019-11-26 02:28:24,736 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:28:24,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:28:24,777 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-26 02:28:24,777 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464235290] [2019-11-26 02:28:24,778 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:28:24,778 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 02:28:24,778 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597791448] [2019-11-26 02:28:24,778 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:28:24,778 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:28:24,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:28:24,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:28:24,779 INFO L87 Difference]: Start difference. First operand 101 states and 121 transitions. Second operand 3 states. [2019-11-26 02:28:24,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:28:24,794 INFO L93 Difference]: Finished difference Result 101 states and 121 transitions. [2019-11-26 02:28:24,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:28:24,794 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-11-26 02:28:24,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:28:24,796 INFO L225 Difference]: With dead ends: 101 [2019-11-26 02:28:24,796 INFO L226 Difference]: Without dead ends: 100 [2019-11-26 02:28:24,796 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-11-26 02:28:24,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-11-26 02:28:24,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-11-26 02:28:24,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-11-26 02:28:24,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 119 transitions. [2019-11-26 02:28:24,816 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 119 transitions. Word has length 33 [2019-11-26 02:28:24,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:28:24,816 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 119 transitions. [2019-11-26 02:28:24,816 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:28:24,817 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 119 transitions. [2019-11-26 02:28:24,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-26 02:28:24,820 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:28:24,823 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-11-26 02:28:24,823 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-11-26 02:28:24,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:28:24,823 INFO L82 PathProgramCache]: Analyzing trace with hash 1035643475, now seen corresponding path program 1 times [2019-11-26 02:28:24,824 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:28:24,824 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614006725] [2019-11-26 02:28:24,827 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:28:24,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:28:24,894 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-11-26 02:28:24,894 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614006725] [2019-11-26 02:28:24,894 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:28:24,895 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-26 02:28:24,895 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253077123] [2019-11-26 02:28:24,895 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-26 02:28:24,895 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:28:24,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-26 02:28:24,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-26 02:28:24,896 INFO L87 Difference]: Start difference. First operand 100 states and 119 transitions. Second operand 6 states. [2019-11-26 02:28:24,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:28:24,948 INFO L93 Difference]: Finished difference Result 110 states and 131 transitions. [2019-11-26 02:28:24,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-26 02:28:24,949 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 48 [2019-11-26 02:28:24,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:28:24,951 INFO L225 Difference]: With dead ends: 110 [2019-11-26 02:28:24,951 INFO L226 Difference]: Without dead ends: 109 [2019-11-26 02:28:24,951 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-11-26 02:28:24,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-11-26 02:28:24,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 99. [2019-11-26 02:28:24,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-11-26 02:28:24,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 117 transitions. [2019-11-26 02:28:24,960 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 117 transitions. Word has length 48 [2019-11-26 02:28:24,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:28:24,960 INFO L462 AbstractCegarLoop]: Abstraction has 99 states and 117 transitions. [2019-11-26 02:28:24,960 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-26 02:28:24,961 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 117 transitions. [2019-11-26 02:28:24,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-26 02:28:24,962 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:28:24,962 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-11-26 02:28:24,962 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-11-26 02:28:24,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:28:24,963 INFO L82 PathProgramCache]: Analyzing trace with hash -1488967228, now seen corresponding path program 1 times [2019-11-26 02:28:24,963 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:28:24,963 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193475948] [2019-11-26 02:28:24,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:28:24,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:28:25,028 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-11-26 02:28:25,028 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193475948] [2019-11-26 02:28:25,028 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [6696586] [2019-11-26 02:28:25,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4c0ae99b-34ef-46d4-9904-26c8d1fa6dd0/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-11-26 02:28:25,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:28:25,073 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-26 02:28:25,078 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:28:25,168 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-26 02:28:25,168 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:28:25,330 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-26 02:28:25,330 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-26 02:28:25,330 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [7] total 17 [2019-11-26 02:28:25,331 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614462625] [2019-11-26 02:28:25,331 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-26 02:28:25,331 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:28:25,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-26 02:28:25,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2019-11-26 02:28:25,332 INFO L87 Difference]: Start difference. First operand 99 states and 117 transitions. Second operand 12 states. [2019-11-26 02:28:25,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:28:25,480 INFO L93 Difference]: Finished difference Result 100 states and 117 transitions. [2019-11-26 02:28:25,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-26 02:28:25,480 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 40 [2019-11-26 02:28:25,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:28:25,482 INFO L225 Difference]: With dead ends: 100 [2019-11-26 02:28:25,482 INFO L226 Difference]: Without dead ends: 99 [2019-11-26 02:28:25,482 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2019-11-26 02:28:25,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-11-26 02:28:25,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2019-11-26 02:28:25,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-11-26 02:28:25,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 116 transitions. [2019-11-26 02:28:25,489 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 116 transitions. Word has length 40 [2019-11-26 02:28:25,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:28:25,494 INFO L462 AbstractCegarLoop]: Abstraction has 98 states and 116 transitions. [2019-11-26 02:28:25,494 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-26 02:28:25,494 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 116 transitions. [2019-11-26 02:28:25,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-26 02:28:25,497 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:28:25,497 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-11-26 02:28:25,701 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:28:25,701 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-11-26 02:28:25,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:28:25,701 INFO L82 PathProgramCache]: Analyzing trace with hash 1798417111, now seen corresponding path program 1 times [2019-11-26 02:28:25,701 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:28:25,701 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094953814] [2019-11-26 02:28:25,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:28:25,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:28:25,766 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 24 proven. 2 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-11-26 02:28:25,766 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094953814] [2019-11-26 02:28:25,766 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [874368428] [2019-11-26 02:28:25,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4c0ae99b-34ef-46d4-9904-26c8d1fa6dd0/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-11-26 02:28:25,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:28:25,809 INFO L255 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-26 02:28:25,813 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:28:25,876 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-11-26 02:28:25,876 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:28:26,007 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-11-26 02:28:26,007 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-26 02:28:26,008 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [7] total 17 [2019-11-26 02:28:26,008 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990021671] [2019-11-26 02:28:26,008 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-26 02:28:26,008 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:28:26,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-26 02:28:26,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2019-11-26 02:28:26,009 INFO L87 Difference]: Start difference. First operand 98 states and 116 transitions. Second operand 12 states. [2019-11-26 02:28:26,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:28:26,548 INFO L93 Difference]: Finished difference Result 179 states and 220 transitions. [2019-11-26 02:28:26,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-26 02:28:26,548 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 47 [2019-11-26 02:28:26,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:28:26,550 INFO L225 Difference]: With dead ends: 179 [2019-11-26 02:28:26,550 INFO L226 Difference]: Without dead ends: 176 [2019-11-26 02:28:26,551 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=209, Invalid=913, Unknown=0, NotChecked=0, Total=1122 [2019-11-26 02:28:26,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2019-11-26 02:28:26,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 174. [2019-11-26 02:28:26,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2019-11-26 02:28:26,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 216 transitions. [2019-11-26 02:28:26,568 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 216 transitions. Word has length 47 [2019-11-26 02:28:26,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:28:26,569 INFO L462 AbstractCegarLoop]: Abstraction has 174 states and 216 transitions. [2019-11-26 02:28:26,569 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-26 02:28:26,569 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 216 transitions. [2019-11-26 02:28:26,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-26 02:28:26,570 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:28:26,570 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-11-26 02:28:26,773 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:28:26,777 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-11-26 02:28:26,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:28:26,777 INFO L82 PathProgramCache]: Analyzing trace with hash 695736933, now seen corresponding path program 1 times [2019-11-26 02:28:26,778 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:28:26,778 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694061635] [2019-11-26 02:28:26,778 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:28:26,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:28:26,856 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 22 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-11-26 02:28:26,856 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694061635] [2019-11-26 02:28:26,856 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2122994626] [2019-11-26 02:28:26,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4c0ae99b-34ef-46d4-9904-26c8d1fa6dd0/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-11-26 02:28:26,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:28:26,886 INFO L255 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-26 02:28:26,890 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:28:26,925 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-26 02:28:26,925 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:28:26,995 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-26 02:28:26,995 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-26 02:28:26,995 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [9] total 15 [2019-11-26 02:28:26,995 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776631183] [2019-11-26 02:28:26,996 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-26 02:28:26,996 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:28:26,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-26 02:28:26,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-11-26 02:28:26,997 INFO L87 Difference]: Start difference. First operand 174 states and 216 transitions. Second operand 8 states. [2019-11-26 02:28:27,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:28:27,106 INFO L93 Difference]: Finished difference Result 228 states and 285 transitions. [2019-11-26 02:28:27,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-26 02:28:27,109 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 45 [2019-11-26 02:28:27,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:28:27,111 INFO L225 Difference]: With dead ends: 228 [2019-11-26 02:28:27,111 INFO L226 Difference]: Without dead ends: 227 [2019-11-26 02:28:27,111 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2019-11-26 02:28:27,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2019-11-26 02:28:27,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 226. [2019-11-26 02:28:27,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-11-26 02:28:27,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 284 transitions. [2019-11-26 02:28:27,126 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 284 transitions. Word has length 45 [2019-11-26 02:28:27,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:28:27,126 INFO L462 AbstractCegarLoop]: Abstraction has 226 states and 284 transitions. [2019-11-26 02:28:27,126 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-26 02:28:27,126 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 284 transitions. [2019-11-26 02:28:27,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-26 02:28:27,127 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:28:27,128 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-11-26 02:28:27,333 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:28:27,333 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-11-26 02:28:27,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:28:27,334 INFO L82 PathProgramCache]: Analyzing trace with hash -1252678887, now seen corresponding path program 1 times [2019-11-26 02:28:27,334 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:28:27,334 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113489147] [2019-11-26 02:28:27,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:28:27,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:28:27,377 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-11-26 02:28:27,377 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113489147] [2019-11-26 02:28:27,377 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [837635525] [2019-11-26 02:28:27,378 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4c0ae99b-34ef-46d4-9904-26c8d1fa6dd0/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-11-26 02:28:27,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:28:27,405 INFO L255 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-26 02:28:27,407 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:28:27,414 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-11-26 02:28:27,414 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:28:27,563 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-11-26 02:28:27,564 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1594682422] [2019-11-26 02:28:27,592 INFO L159 IcfgInterpreter]: Started Sifa with 31 locations of interest [2019-11-26 02:28:27,592 INFO L166 IcfgInterpreter]: Building call graph [2019-11-26 02:28:27,598 FATAL L310 FreeRefinementEngine]: Exception during interpolant generation: IllegalArgumentException [2019-11-26 02:28:27,801 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:28:27,802 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an 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.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:333) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:171) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) 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-11-26 02:28:27,805 INFO L168 Benchmark]: Toolchain (without parser) took 5235.69 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 181.4 MB). Free memory was 946.1 MB in the beginning and 1.2 GB in the end (delta: -232.6 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:28:27,805 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:28:27,806 INFO L168 Benchmark]: CACSL2BoogieTranslator took 293.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -196.0 MB). Peak memory consumption was 23.4 MB. Max. memory is 11.5 GB. [2019-11-26 02:28:27,806 INFO L168 Benchmark]: Boogie Procedure Inliner took 26.37 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:28:27,807 INFO L168 Benchmark]: Boogie Preprocessor took 13.87 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2019-11-26 02:28:27,807 INFO L168 Benchmark]: RCFGBuilder took 244.91 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: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. [2019-11-26 02:28:27,808 INFO L168 Benchmark]: TraceAbstraction took 4653.65 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 36.7 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -61.7 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:28:27,810 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.21 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 293.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -196.0 MB). Peak memory consumption was 23.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 26.37 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 13.87 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 244.91 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: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4653.65 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 36.7 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -61.7 MB). There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: IllegalArgumentException: Recursive programs are not supported. de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalArgumentException: Recursive programs are not supported.: de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...