./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/termination-crafted/MutualRecursion_1b.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_63d6577f-4e3c-4f40-bf0e-4ac75f586f30/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_63d6577f-4e3c-4f40-bf0e-4ac75f586f30/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_63d6577f-4e3c-4f40-bf0e-4ac75f586f30/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_63d6577f-4e3c-4f40-bf0e-4ac75f586f30/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/termination-crafted/MutualRecursion_1b.c -s /tmp/vcloud-vcloud-master/worker/run_dir_63d6577f-4e3c-4f40-bf0e-4ac75f586f30/bin/utaipan/config/svcomp-Overflow-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_63d6577f-4e3c-4f40-bf0e-4ac75f586f30/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 9072a9376e1e28de1ef4dc11b7134f6f175023b7 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 20:18:03,977 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 20:18:03,978 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 20:18:03,986 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 20:18:03,986 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 20:18:03,987 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 20:18:03,988 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 20:18:03,990 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 20:18:03,992 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 20:18:03,992 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 20:18:03,993 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 20:18:03,994 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 20:18:03,994 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 20:18:03,995 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 20:18:03,995 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 20:18:03,996 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 20:18:03,996 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 20:18:03,997 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 20:18:03,999 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 20:18:04,000 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 20:18:04,001 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 20:18:04,002 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 20:18:04,003 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 20:18:04,003 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 20:18:04,005 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 20:18:04,005 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 20:18:04,005 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 20:18:04,005 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 20:18:04,006 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 20:18:04,006 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 20:18:04,006 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 20:18:04,007 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 20:18:04,008 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 20:18:04,008 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 20:18:04,009 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 20:18:04,009 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 20:18:04,010 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 20:18:04,010 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 20:18:04,010 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 20:18:04,011 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 20:18:04,011 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 20:18:04,012 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_63d6577f-4e3c-4f40-bf0e-4ac75f586f30/bin/utaipan/config/svcomp-Overflow-64bit-Taipan_Default.epf [2019-12-07 20:18:04,024 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 20:18:04,025 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 20:18:04,025 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 20:18:04,025 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 20:18:04,026 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 20:18:04,026 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 20:18:04,026 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 20:18:04,026 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 20:18:04,026 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 20:18:04,026 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 20:18:04,027 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 20:18:04,027 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 20:18:04,027 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 20:18:04,027 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 20:18:04,027 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 20:18:04,028 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 20:18:04,028 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 20:18:04,028 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 20:18:04,028 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 20:18:04,028 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 20:18:04,028 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 20:18:04,029 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 20:18:04,029 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2019-12-07 20:18:04,029 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 20:18:04,029 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 20:18:04,029 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 20:18:04,029 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 20:18:04,030 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 20:18:04,030 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 20:18:04,030 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 20:18:04,030 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 20:18:04,030 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 20:18:04,031 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 20:18:04,031 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 20:18:04,031 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 20:18:04,031 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 20:18:04,031 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 20:18:04,032 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 20:18:04,032 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_63d6577f-4e3c-4f40-bf0e-4ac75f586f30/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 -> 9072a9376e1e28de1ef4dc11b7134f6f175023b7 [2019-12-07 20:18:04,135 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 20:18:04,145 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 20:18:04,148 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 20:18:04,149 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 20:18:04,149 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 20:18:04,150 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_63d6577f-4e3c-4f40-bf0e-4ac75f586f30/bin/utaipan/../../sv-benchmarks/c/termination-crafted/MutualRecursion_1b.c [2019-12-07 20:18:04,197 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_63d6577f-4e3c-4f40-bf0e-4ac75f586f30/bin/utaipan/data/5b29b048e/e50062f8e28346d6ae3be5f3df92c9dd/FLAGa7ac5cd0c [2019-12-07 20:18:04,501 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 20:18:04,502 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_63d6577f-4e3c-4f40-bf0e-4ac75f586f30/sv-benchmarks/c/termination-crafted/MutualRecursion_1b.c [2019-12-07 20:18:04,506 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_63d6577f-4e3c-4f40-bf0e-4ac75f586f30/bin/utaipan/data/5b29b048e/e50062f8e28346d6ae3be5f3df92c9dd/FLAGa7ac5cd0c [2019-12-07 20:18:04,514 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_63d6577f-4e3c-4f40-bf0e-4ac75f586f30/bin/utaipan/data/5b29b048e/e50062f8e28346d6ae3be5f3df92c9dd [2019-12-07 20:18:04,516 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 20:18:04,517 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 20:18:04,517 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 20:18:04,517 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 20:18:04,520 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 20:18:04,520 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 08:18:04" (1/1) ... [2019-12-07 20:18:04,522 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39047d0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:18:04, skipping insertion in model container [2019-12-07 20:18:04,522 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 08:18:04" (1/1) ... [2019-12-07 20:18:04,527 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 20:18:04,537 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 20:18:04,632 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 20:18:04,634 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 20:18:04,684 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 20:18:04,696 INFO L208 MainTranslator]: Completed translation [2019-12-07 20:18:04,696 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:18:04 WrapperNode [2019-12-07 20:18:04,696 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 20:18:04,696 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 20:18:04,697 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 20:18:04,697 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 20:18:04,702 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:18:04" (1/1) ... [2019-12-07 20:18:04,705 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:18:04" (1/1) ... [2019-12-07 20:18:04,716 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 20:18:04,716 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 20:18:04,716 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 20:18:04,716 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 20:18:04,722 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:18:04" (1/1) ... [2019-12-07 20:18:04,722 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:18:04" (1/1) ... [2019-12-07 20:18:04,723 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:18:04" (1/1) ... [2019-12-07 20:18:04,723 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:18:04" (1/1) ... [2019-12-07 20:18:04,725 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:18:04" (1/1) ... [2019-12-07 20:18:04,726 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:18:04" (1/1) ... [2019-12-07 20:18:04,726 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:18:04" (1/1) ... [2019-12-07 20:18:04,727 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 20:18:04,727 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 20:18:04,727 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 20:18:04,727 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 20:18:04,728 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:18:04" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_63d6577f-4e3c-4f40-bf0e-4ac75f586f30/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 20:18:04,768 INFO L130 BoogieDeclarations]: Found specification of procedure f [2019-12-07 20:18:04,768 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2019-12-07 20:18:04,768 INFO L130 BoogieDeclarations]: Found specification of procedure g [2019-12-07 20:18:04,768 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2019-12-07 20:18:04,768 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 20:18:04,768 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 20:18:04,910 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 20:18:04,911 INFO L287 CfgBuilder]: Removed 4 assume(true) statements. [2019-12-07 20:18:04,911 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 08:18:04 BoogieIcfgContainer [2019-12-07 20:18:04,912 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 20:18:04,912 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 20:18:04,912 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 20:18:04,914 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 20:18:04,914 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 08:18:04" (1/3) ... [2019-12-07 20:18:04,915 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ef2fd8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 08:18:04, skipping insertion in model container [2019-12-07 20:18:04,915 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:18:04" (2/3) ... [2019-12-07 20:18:04,915 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ef2fd8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 08:18:04, skipping insertion in model container [2019-12-07 20:18:04,915 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 08:18:04" (3/3) ... [2019-12-07 20:18:04,916 INFO L109 eAbstractionObserver]: Analyzing ICFG MutualRecursion_1b.c [2019-12-07 20:18:04,924 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 20:18:04,928 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 10 error locations. [2019-12-07 20:18:04,935 INFO L249 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2019-12-07 20:18:04,950 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 20:18:04,950 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 20:18:04,950 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 20:18:04,950 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 20:18:04,950 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 20:18:04,950 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 20:18:04,950 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 20:18:04,950 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 20:18:04,963 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2019-12-07 20:18:04,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 20:18:04,966 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:18:04,967 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-07 20:18:04,967 INFO L410 AbstractCegarLoop]: === Iteration 1 === [fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 20:18:04,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:18:04,971 INFO L82 PathProgramCache]: Analyzing trace with hash 68150020, now seen corresponding path program 1 times [2019-12-07 20:18:04,976 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:18:04,977 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596026594] [2019-12-07 20:18:04,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:18:05,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:18:05,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:18:05,085 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596026594] [2019-12-07 20:18:05,085 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:18:05,086 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 20:18:05,087 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913150213] [2019-12-07 20:18:05,089 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 20:18:05,090 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:18:05,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 20:18:05,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 20:18:05,103 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 5 states. [2019-12-07 20:18:05,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:18:05,174 INFO L93 Difference]: Finished difference Result 62 states and 69 transitions. [2019-12-07 20:18:05,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 20:18:05,176 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-12-07 20:18:05,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:18:05,183 INFO L225 Difference]: With dead ends: 62 [2019-12-07 20:18:05,183 INFO L226 Difference]: Without dead ends: 56 [2019-12-07 20:18:05,185 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 20:18:05,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-12-07 20:18:05,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 50. [2019-12-07 20:18:05,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-12-07 20:18:05,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 59 transitions. [2019-12-07 20:18:05,217 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 59 transitions. Word has length 5 [2019-12-07 20:18:05,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:18:05,217 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 59 transitions. [2019-12-07 20:18:05,218 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 20:18:05,218 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 59 transitions. [2019-12-07 20:18:05,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-12-07 20:18:05,218 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:18:05,218 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-12-07 20:18:05,218 INFO L410 AbstractCegarLoop]: === Iteration 2 === [fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 20:18:05,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:18:05,219 INFO L82 PathProgramCache]: Analyzing trace with hash 2112650676, now seen corresponding path program 1 times [2019-12-07 20:18:05,219 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:18:05,219 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106828741] [2019-12-07 20:18:05,219 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:18:05,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:18:05,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:18:05,230 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106828741] [2019-12-07 20:18:05,231 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:18:05,231 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 20:18:05,231 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102971004] [2019-12-07 20:18:05,232 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:18:05,232 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:18:05,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:18:05,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:18:05,232 INFO L87 Difference]: Start difference. First operand 50 states and 59 transitions. Second operand 3 states. [2019-12-07 20:18:05,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:18:05,247 INFO L93 Difference]: Finished difference Result 52 states and 62 transitions. [2019-12-07 20:18:05,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:18:05,248 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2019-12-07 20:18:05,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:18:05,248 INFO L225 Difference]: With dead ends: 52 [2019-12-07 20:18:05,249 INFO L226 Difference]: Without dead ends: 50 [2019-12-07 20:18:05,249 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:18:05,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-12-07 20:18:05,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2019-12-07 20:18:05,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-12-07 20:18:05,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2019-12-07 20:18:05,256 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 6 [2019-12-07 20:18:05,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:18:05,256 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2019-12-07 20:18:05,256 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:18:05,257 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2019-12-07 20:18:05,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 20:18:05,257 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:18:05,257 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:18:05,257 INFO L410 AbstractCegarLoop]: === Iteration 3 === [fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 20:18:05,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:18:05,258 INFO L82 PathProgramCache]: Analyzing trace with hash 803040358, now seen corresponding path program 1 times [2019-12-07 20:18:05,258 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:18:05,258 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642649355] [2019-12-07 20:18:05,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:18:05,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:18:05,311 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:18:05,311 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642649355] [2019-12-07 20:18:05,312 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:18:05,312 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 20:18:05,312 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803633760] [2019-12-07 20:18:05,312 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 20:18:05,312 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:18:05,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 20:18:05,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-07 20:18:05,313 INFO L87 Difference]: Start difference. First operand 48 states and 55 transitions. Second operand 9 states. [2019-12-07 20:18:05,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:18:05,425 INFO L93 Difference]: Finished difference Result 66 states and 77 transitions. [2019-12-07 20:18:05,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 20:18:05,425 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2019-12-07 20:18:05,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:18:05,426 INFO L225 Difference]: With dead ends: 66 [2019-12-07 20:18:05,426 INFO L226 Difference]: Without dead ends: 63 [2019-12-07 20:18:05,426 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-12-07 20:18:05,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-12-07 20:18:05,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 59. [2019-12-07 20:18:05,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-12-07 20:18:05,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 70 transitions. [2019-12-07 20:18:05,434 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 70 transitions. Word has length 13 [2019-12-07 20:18:05,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:18:05,434 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 70 transitions. [2019-12-07 20:18:05,434 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 20:18:05,434 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 70 transitions. [2019-12-07 20:18:05,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 20:18:05,435 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:18:05,435 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:18:05,435 INFO L410 AbstractCegarLoop]: === Iteration 4 === [fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 20:18:05,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:18:05,435 INFO L82 PathProgramCache]: Analyzing trace with hash -265858514, now seen corresponding path program 1 times [2019-12-07 20:18:05,436 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:18:05,436 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048958688] [2019-12-07 20:18:05,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:18:05,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:18:05,452 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 20:18:05,452 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048958688] [2019-12-07 20:18:05,453 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:18:05,453 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 20:18:05,453 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638251203] [2019-12-07 20:18:05,453 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:18:05,453 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:18:05,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:18:05,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:18:05,454 INFO L87 Difference]: Start difference. First operand 59 states and 70 transitions. Second operand 3 states. [2019-12-07 20:18:05,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:18:05,461 INFO L93 Difference]: Finished difference Result 61 states and 77 transitions. [2019-12-07 20:18:05,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:18:05,461 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-12-07 20:18:05,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:18:05,462 INFO L225 Difference]: With dead ends: 61 [2019-12-07 20:18:05,462 INFO L226 Difference]: Without dead ends: 60 [2019-12-07 20:18:05,462 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:18:05,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-12-07 20:18:05,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2019-12-07 20:18:05,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-12-07 20:18:05,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 69 transitions. [2019-12-07 20:18:05,469 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 69 transitions. Word has length 17 [2019-12-07 20:18:05,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:18:05,469 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 69 transitions. [2019-12-07 20:18:05,469 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:18:05,469 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 69 transitions. [2019-12-07 20:18:05,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 20:18:05,470 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:18:05,470 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:18:05,470 INFO L410 AbstractCegarLoop]: === Iteration 5 === [fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 20:18:05,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:18:05,471 INFO L82 PathProgramCache]: Analyzing trace with hash -1650762684, now seen corresponding path program 1 times [2019-12-07 20:18:05,471 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:18:05,471 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381943757] [2019-12-07 20:18:05,471 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:18:05,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:18:05,498 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-07 20:18:05,498 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381943757] [2019-12-07 20:18:05,498 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:18:05,499 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 20:18:05,499 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971398789] [2019-12-07 20:18:05,499 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 20:18:05,499 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:18:05,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 20:18:05,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 20:18:05,500 INFO L87 Difference]: Start difference. First operand 58 states and 69 transitions. Second operand 5 states. [2019-12-07 20:18:05,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:18:05,532 INFO L93 Difference]: Finished difference Result 93 states and 122 transitions. [2019-12-07 20:18:05,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 20:18:05,532 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-12-07 20:18:05,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:18:05,533 INFO L225 Difference]: With dead ends: 93 [2019-12-07 20:18:05,534 INFO L226 Difference]: Without dead ends: 92 [2019-12-07 20:18:05,534 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 20:18:05,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-12-07 20:18:05,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 78. [2019-12-07 20:18:05,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-12-07 20:18:05,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 100 transitions. [2019-12-07 20:18:05,543 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 100 transitions. Word has length 21 [2019-12-07 20:18:05,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:18:05,543 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 100 transitions. [2019-12-07 20:18:05,544 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 20:18:05,544 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 100 transitions. [2019-12-07 20:18:05,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 20:18:05,544 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:18:05,544 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:18:05,545 INFO L410 AbstractCegarLoop]: === Iteration 6 === [fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 20:18:05,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:18:05,545 INFO L82 PathProgramCache]: Analyzing trace with hash 365964416, now seen corresponding path program 1 times [2019-12-07 20:18:05,545 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:18:05,545 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002750953] [2019-12-07 20:18:05,545 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:18:05,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:18:05,571 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-07 20:18:05,572 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002750953] [2019-12-07 20:18:05,572 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:18:05,572 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 20:18:05,572 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458029091] [2019-12-07 20:18:05,573 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 20:18:05,573 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:18:05,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 20:18:05,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 20:18:05,573 INFO L87 Difference]: Start difference. First operand 78 states and 100 transitions. Second operand 5 states. [2019-12-07 20:18:05,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:18:05,609 INFO L93 Difference]: Finished difference Result 93 states and 119 transitions. [2019-12-07 20:18:05,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 20:18:05,609 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-07 20:18:05,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:18:05,610 INFO L225 Difference]: With dead ends: 93 [2019-12-07 20:18:05,610 INFO L226 Difference]: Without dead ends: 89 [2019-12-07 20:18:05,611 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 20:18:05,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-12-07 20:18:05,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 78. [2019-12-07 20:18:05,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-12-07 20:18:05,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 99 transitions. [2019-12-07 20:18:05,619 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 99 transitions. Word has length 22 [2019-12-07 20:18:05,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:18:05,619 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 99 transitions. [2019-12-07 20:18:05,619 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 20:18:05,619 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 99 transitions. [2019-12-07 20:18:05,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 20:18:05,620 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:18:05,620 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:18:05,620 INFO L410 AbstractCegarLoop]: === Iteration 7 === [fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 20:18:05,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:18:05,621 INFO L82 PathProgramCache]: Analyzing trace with hash 1488102097, now seen corresponding path program 1 times [2019-12-07 20:18:05,621 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:18:05,621 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235874975] [2019-12-07 20:18:05,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:18:05,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:18:05,657 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-07 20:18:05,657 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235874975] [2019-12-07 20:18:05,658 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:18:05,658 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 20:18:05,658 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825746653] [2019-12-07 20:18:05,658 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 20:18:05,658 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:18:05,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 20:18:05,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 20:18:05,659 INFO L87 Difference]: Start difference. First operand 78 states and 99 transitions. Second operand 7 states. [2019-12-07 20:18:05,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:18:05,751 INFO L93 Difference]: Finished difference Result 95 states and 119 transitions. [2019-12-07 20:18:05,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 20:18:05,751 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2019-12-07 20:18:05,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:18:05,752 INFO L225 Difference]: With dead ends: 95 [2019-12-07 20:18:05,753 INFO L226 Difference]: Without dead ends: 94 [2019-12-07 20:18:05,753 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-12-07 20:18:05,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-12-07 20:18:05,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 88. [2019-12-07 20:18:05,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-12-07 20:18:05,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 111 transitions. [2019-12-07 20:18:05,761 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 111 transitions. Word has length 24 [2019-12-07 20:18:05,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:18:05,761 INFO L462 AbstractCegarLoop]: Abstraction has 88 states and 111 transitions. [2019-12-07 20:18:05,761 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 20:18:05,761 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 111 transitions. [2019-12-07 20:18:05,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 20:18:05,762 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:18:05,762 INFO L410 BasicCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:18:05,762 INFO L410 AbstractCegarLoop]: === Iteration 8 === [fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 20:18:05,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:18:05,763 INFO L82 PathProgramCache]: Analyzing trace with hash -1361134625, now seen corresponding path program 1 times [2019-12-07 20:18:05,763 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:18:05,763 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785068301] [2019-12-07 20:18:05,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:18:05,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:18:05,802 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-12-07 20:18:05,802 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785068301] [2019-12-07 20:18:05,802 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:18:05,802 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 20:18:05,802 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212505417] [2019-12-07 20:18:05,803 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 20:18:05,803 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:18:05,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 20:18:05,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 20:18:05,803 INFO L87 Difference]: Start difference. First operand 88 states and 111 transitions. Second operand 7 states. [2019-12-07 20:18:05,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:18:05,889 INFO L93 Difference]: Finished difference Result 95 states and 118 transitions. [2019-12-07 20:18:05,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 20:18:05,889 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-07 20:18:05,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:18:05,890 INFO L225 Difference]: With dead ends: 95 [2019-12-07 20:18:05,890 INFO L226 Difference]: Without dead ends: 94 [2019-12-07 20:18:05,891 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-12-07 20:18:05,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-12-07 20:18:05,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 89. [2019-12-07 20:18:05,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-12-07 20:18:05,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 112 transitions. [2019-12-07 20:18:05,898 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 112 transitions. Word has length 33 [2019-12-07 20:18:05,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:18:05,899 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 112 transitions. [2019-12-07 20:18:05,899 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 20:18:05,899 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 112 transitions. [2019-12-07 20:18:05,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-07 20:18:05,900 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:18:05,900 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:18:05,900 INFO L410 AbstractCegarLoop]: === Iteration 9 === [fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 20:18:05,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:18:05,901 INFO L82 PathProgramCache]: Analyzing trace with hash 1124211105, now seen corresponding path program 1 times [2019-12-07 20:18:05,901 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:18:05,901 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88688906] [2019-12-07 20:18:05,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:18:05,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:18:05,992 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-07 20:18:05,993 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88688906] [2019-12-07 20:18:05,993 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [357292190] [2019-12-07 20:18:05,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_63d6577f-4e3c-4f40-bf0e-4ac75f586f30/bin/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:18:06,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:18:06,023 INFO L264 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 20:18:06,028 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:18:06,082 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-12-07 20:18:06,083 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:18:06,198 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-12-07 20:18:06,198 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1751041251] [2019-12-07 20:18:06,214 INFO L159 IcfgInterpreter]: Started Sifa with 28 locations of interest [2019-12-07 20:18:06,214 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 20:18:06,219 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 20:18:06,220 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 20:18:06,220 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7, 7] total 20 [2019-12-07 20:18:06,220 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103306726] [2019-12-07 20:18:06,220 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-07 20:18:06,221 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:18:06,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-07 20:18:06,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=336, Unknown=0, NotChecked=0, Total=380 [2019-12-07 20:18:06,221 INFO L87 Difference]: Start difference. First operand 89 states and 112 transitions. Second operand 20 states. [2019-12-07 20:18:06,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:18:06,773 INFO L93 Difference]: Finished difference Result 242 states and 325 transitions. [2019-12-07 20:18:06,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-07 20:18:06,773 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 37 [2019-12-07 20:18:06,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:18:06,775 INFO L225 Difference]: With dead ends: 242 [2019-12-07 20:18:06,775 INFO L226 Difference]: Without dead ends: 160 [2019-12-07 20:18:06,778 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 67 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=241, Invalid=1319, Unknown=0, NotChecked=0, Total=1560 [2019-12-07 20:18:06,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-12-07 20:18:06,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 106. [2019-12-07 20:18:06,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-12-07 20:18:06,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 136 transitions. [2019-12-07 20:18:06,793 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 136 transitions. Word has length 37 [2019-12-07 20:18:06,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:18:06,793 INFO L462 AbstractCegarLoop]: Abstraction has 106 states and 136 transitions. [2019-12-07 20:18:06,793 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-07 20:18:06,793 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 136 transitions. [2019-12-07 20:18:06,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-07 20:18:06,795 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:18:06,795 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 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] [2019-12-07 20:18:06,996 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:18:06,997 INFO L410 AbstractCegarLoop]: === Iteration 10 === [fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 20:18:06,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:18:06,997 INFO L82 PathProgramCache]: Analyzing trace with hash -2087434237, now seen corresponding path program 2 times [2019-12-07 20:18:06,998 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:18:06,998 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076277296] [2019-12-07 20:18:06,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:18:07,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:18:07,093 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-12-07 20:18:07,093 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076277296] [2019-12-07 20:18:07,093 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1429660874] [2019-12-07 20:18:07,093 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_63d6577f-4e3c-4f40-bf0e-4ac75f586f30/bin/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:18:07,116 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-12-07 20:18:07,116 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 20:18:07,117 INFO L264 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 20:18:07,118 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:18:07,141 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-12-07 20:18:07,141 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:18:07,182 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-12-07 20:18:07,182 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-12-07 20:18:07,182 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [10] total 13 [2019-12-07 20:18:07,183 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749995923] [2019-12-07 20:18:07,183 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 20:18:07,183 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:18:07,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 20:18:07,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2019-12-07 20:18:07,184 INFO L87 Difference]: Start difference. First operand 106 states and 136 transitions. Second operand 6 states. [2019-12-07 20:18:07,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:18:07,210 INFO L93 Difference]: Finished difference Result 117 states and 150 transitions. [2019-12-07 20:18:07,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 20:18:07,210 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 45 [2019-12-07 20:18:07,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:18:07,212 INFO L225 Difference]: With dead ends: 117 [2019-12-07 20:18:07,212 INFO L226 Difference]: Without dead ends: 116 [2019-12-07 20:18:07,212 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 86 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-12-07 20:18:07,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-12-07 20:18:07,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 112. [2019-12-07 20:18:07,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-12-07 20:18:07,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 142 transitions. [2019-12-07 20:18:07,219 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 142 transitions. Word has length 45 [2019-12-07 20:18:07,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:18:07,219 INFO L462 AbstractCegarLoop]: Abstraction has 112 states and 142 transitions. [2019-12-07 20:18:07,219 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 20:18:07,219 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 142 transitions. [2019-12-07 20:18:07,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-07 20:18:07,221 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:18:07,221 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:18:07,421 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:18:07,422 INFO L410 AbstractCegarLoop]: === Iteration 11 === [fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 20:18:07,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:18:07,422 INFO L82 PathProgramCache]: Analyzing trace with hash 1191448003, now seen corresponding path program 1 times [2019-12-07 20:18:07,422 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:18:07,423 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111332766] [2019-12-07 20:18:07,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:18:07,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:18:07,548 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-07 20:18:07,548 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111332766] [2019-12-07 20:18:07,549 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1880832278] [2019-12-07 20:18:07,549 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_63d6577f-4e3c-4f40-bf0e-4ac75f586f30/bin/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:18:07,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:18:07,587 INFO L264 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 20:18:07,590 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:18:07,613 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 20:18:07,614 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:18:07,672 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-07 20:18:07,672 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-12-07 20:18:07,672 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10, 5] total 13 [2019-12-07 20:18:07,673 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927641880] [2019-12-07 20:18:07,673 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 20:18:07,673 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:18:07,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 20:18:07,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2019-12-07 20:18:07,674 INFO L87 Difference]: Start difference. First operand 112 states and 142 transitions. Second operand 5 states. [2019-12-07 20:18:07,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:18:07,708 INFO L93 Difference]: Finished difference Result 210 states and 279 transitions. [2019-12-07 20:18:07,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 20:18:07,709 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2019-12-07 20:18:07,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:18:07,710 INFO L225 Difference]: With dead ends: 210 [2019-12-07 20:18:07,710 INFO L226 Difference]: Without dead ends: 101 [2019-12-07 20:18:07,711 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 71 SyntacticMatches, 4 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-12-07 20:18:07,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-12-07 20:18:07,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2019-12-07 20:18:07,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-12-07 20:18:07,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 126 transitions. [2019-12-07 20:18:07,716 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 126 transitions. Word has length 38 [2019-12-07 20:18:07,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:18:07,716 INFO L462 AbstractCegarLoop]: Abstraction has 101 states and 126 transitions. [2019-12-07 20:18:07,716 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 20:18:07,716 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 126 transitions. [2019-12-07 20:18:07,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-07 20:18:07,718 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:18:07,718 INFO L410 BasicCegarLoop]: trace histogram [6, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:18:07,918 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:18:07,918 INFO L410 AbstractCegarLoop]: === Iteration 12 === [fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 20:18:07,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:18:07,919 INFO L82 PathProgramCache]: Analyzing trace with hash 1929359181, now seen corresponding path program 1 times [2019-12-07 20:18:07,919 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:18:07,919 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513188283] [2019-12-07 20:18:07,919 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:18:07,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:18:07,963 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2019-12-07 20:18:07,964 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513188283] [2019-12-07 20:18:07,964 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:18:07,964 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 20:18:07,964 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847852671] [2019-12-07 20:18:07,964 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 20:18:07,964 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:18:07,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 20:18:07,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-07 20:18:07,965 INFO L87 Difference]: Start difference. First operand 101 states and 126 transitions. Second operand 8 states. [2019-12-07 20:18:08,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:18:08,004 INFO L93 Difference]: Finished difference Result 101 states and 126 transitions. [2019-12-07 20:18:08,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 20:18:08,004 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 68 [2019-12-07 20:18:08,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:18:08,005 INFO L225 Difference]: With dead ends: 101 [2019-12-07 20:18:08,005 INFO L226 Difference]: Without dead ends: 99 [2019-12-07 20:18:08,005 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-12-07 20:18:08,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-12-07 20:18:08,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 93. [2019-12-07 20:18:08,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-12-07 20:18:08,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 115 transitions. [2019-12-07 20:18:08,010 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 115 transitions. Word has length 68 [2019-12-07 20:18:08,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:18:08,010 INFO L462 AbstractCegarLoop]: Abstraction has 93 states and 115 transitions. [2019-12-07 20:18:08,010 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 20:18:08,010 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 115 transitions. [2019-12-07 20:18:08,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-07 20:18:08,011 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:18:08,012 INFO L410 BasicCegarLoop]: trace histogram [6, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:18:08,012 INFO L410 AbstractCegarLoop]: === Iteration 13 === [fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 20:18:08,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:18:08,012 INFO L82 PathProgramCache]: Analyzing trace with hash -319407487, now seen corresponding path program 1 times [2019-12-07 20:18:08,012 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:18:08,012 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411411047] [2019-12-07 20:18:08,013 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:18:08,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:18:08,065 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2019-12-07 20:18:08,065 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411411047] [2019-12-07 20:18:08,065 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:18:08,065 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 20:18:08,065 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897936377] [2019-12-07 20:18:08,065 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 20:18:08,066 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:18:08,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 20:18:08,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-07 20:18:08,066 INFO L87 Difference]: Start difference. First operand 93 states and 115 transitions. Second operand 8 states. [2019-12-07 20:18:08,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:18:08,098 INFO L93 Difference]: Finished difference Result 93 states and 115 transitions. [2019-12-07 20:18:08,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 20:18:08,098 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 69 [2019-12-07 20:18:08,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:18:08,099 INFO L225 Difference]: With dead ends: 93 [2019-12-07 20:18:08,099 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 20:18:08,099 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-12-07 20:18:08,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 20:18:08,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 20:18:08,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 20:18:08,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 20:18:08,100 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 69 [2019-12-07 20:18:08,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:18:08,100 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 20:18:08,100 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 20:18:08,100 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 20:18:08,100 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 20:18:08,101 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 20:18:08,253 INFO L246 CegarLoopResult]: For program point fFINAL(lines 11 15) no Hoare annotation was computed. [2019-12-07 20:18:08,253 INFO L242 CegarLoopResult]: At program point L14(line 14) the Hoare annotation is: (or (not (<= |f_#in~x| 2147483645)) (and (<= f_~x |f_#in~x|) (<= |f_#in~x| f_~x) (<= 1 f_~x))) [2019-12-07 20:18:08,253 INFO L246 CegarLoopResult]: For program point L13(lines 13 14) no Hoare annotation was computed. [2019-12-07 20:18:08,253 INFO L246 CegarLoopResult]: For program point L14-1(line 14) no Hoare annotation was computed. [2019-12-07 20:18:08,253 INFO L246 CegarLoopResult]: For program point L14-2(line 14) no Hoare annotation was computed. [2019-12-07 20:18:08,253 INFO L246 CegarLoopResult]: For program point L14-3(line 14) no Hoare annotation was computed. [2019-12-07 20:18:08,253 INFO L242 CegarLoopResult]: At program point L14-4(line 14) the Hoare annotation is: (or (and (<= f_~x |f_#in~x|) (<= 0 |f_#t~ret0|) (<= |f_#in~x| f_~x) (<= |f_#t~ret0| 0) (<= 1 f_~x)) (not (<= |f_#in~x| 2147483645))) [2019-12-07 20:18:08,253 INFO L246 CegarLoopResult]: For program point L14-5(line 14) no Hoare annotation was computed. [2019-12-07 20:18:08,253 INFO L246 CegarLoopResult]: For program point fErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2019-12-07 20:18:08,254 INFO L246 CegarLoopResult]: For program point fErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2019-12-07 20:18:08,254 INFO L246 CegarLoopResult]: For program point L14-6(line 14) no Hoare annotation was computed. [2019-12-07 20:18:08,254 INFO L246 CegarLoopResult]: For program point fEXIT(lines 11 15) no Hoare annotation was computed. [2019-12-07 20:18:08,254 INFO L246 CegarLoopResult]: For program point L14-7(line 14) no Hoare annotation was computed. [2019-12-07 20:18:08,254 INFO L249 CegarLoopResult]: At program point fENTRY(lines 11 15) the Hoare annotation is: true [2019-12-07 20:18:08,254 INFO L246 CegarLoopResult]: For program point fErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2019-12-07 20:18:08,254 INFO L246 CegarLoopResult]: For program point fErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2019-12-07 20:18:08,254 INFO L246 CegarLoopResult]: For program point gFINAL(lines 17 21) no Hoare annotation was computed. [2019-12-07 20:18:08,254 INFO L246 CegarLoopResult]: For program point L20(line 20) no Hoare annotation was computed. [2019-12-07 20:18:08,254 INFO L246 CegarLoopResult]: For program point L19(lines 19 20) no Hoare annotation was computed. [2019-12-07 20:18:08,254 INFO L246 CegarLoopResult]: For program point L20-1(line 20) no Hoare annotation was computed. [2019-12-07 20:18:08,254 INFO L242 CegarLoopResult]: At program point L20-2(line 20) the Hoare annotation is: (and (or (not (<= |g_#in~x| 2147483645)) (<= g_~x 2147483645)) (or (and (<= 1 g_~x) (<= g_~x 2147483647) (<= |g_#in~x| g_~x)) (not (<= |g_#in~x| 2147483647)))) [2019-12-07 20:18:08,254 INFO L246 CegarLoopResult]: For program point L20-3(line 20) no Hoare annotation was computed. [2019-12-07 20:18:08,254 INFO L246 CegarLoopResult]: For program point L20-4(line 20) no Hoare annotation was computed. [2019-12-07 20:18:08,254 INFO L246 CegarLoopResult]: For program point L20-5(line 20) no Hoare annotation was computed. [2019-12-07 20:18:08,255 INFO L242 CegarLoopResult]: At program point L20-6(line 20) the Hoare annotation is: (and (or (not (<= |g_#in~x| 2147483645)) (<= g_~x 2147483645)) (or (and (<= 0 |g_#t~ret2|) (<= 1 g_~x) (<= g_~x 2147483647) (<= |g_#in~x| g_~x) (<= |g_#t~ret2| 0)) (not (<= |g_#in~x| 2147483647)))) [2019-12-07 20:18:08,255 INFO L246 CegarLoopResult]: For program point L20-7(line 20) no Hoare annotation was computed. [2019-12-07 20:18:08,255 INFO L246 CegarLoopResult]: For program point L20-8(line 20) no Hoare annotation was computed. [2019-12-07 20:18:08,255 INFO L246 CegarLoopResult]: For program point L20-9(line 20) no Hoare annotation was computed. [2019-12-07 20:18:08,255 INFO L246 CegarLoopResult]: For program point gErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-12-07 20:18:08,255 INFO L246 CegarLoopResult]: For program point gEXIT(lines 17 21) no Hoare annotation was computed. [2019-12-07 20:18:08,255 INFO L246 CegarLoopResult]: For program point gErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-12-07 20:18:08,255 INFO L249 CegarLoopResult]: At program point gENTRY(lines 17 21) the Hoare annotation is: true [2019-12-07 20:18:08,255 INFO L246 CegarLoopResult]: For program point gErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-12-07 20:18:08,255 INFO L246 CegarLoopResult]: For program point gErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-12-07 20:18:08,255 INFO L246 CegarLoopResult]: For program point gErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-12-07 20:18:08,255 INFO L246 CegarLoopResult]: For program point gErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2019-12-07 20:18:08,255 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 20:18:08,255 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-12-07 20:18:08,255 INFO L242 CegarLoopResult]: At program point L26(line 26) the Hoare annotation is: (<= ULTIMATE.start_main_~x~0 2147483647) [2019-12-07 20:18:08,255 INFO L246 CegarLoopResult]: For program point L26-1(line 26) no Hoare annotation was computed. [2019-12-07 20:18:08,259 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 08:18:08 BoogieIcfgContainer [2019-12-07 20:18:08,259 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 20:18:08,259 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 20:18:08,259 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 20:18:08,259 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 20:18:08,260 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 08:18:04" (3/4) ... [2019-12-07 20:18:08,262 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 20:18:08,266 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure f [2019-12-07 20:18:08,266 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure g [2019-12-07 20:18:08,269 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2019-12-07 20:18:08,270 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-12-07 20:18:08,270 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-12-07 20:18:08,301 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_63d6577f-4e3c-4f40-bf0e-4ac75f586f30/bin/utaipan/witness.graphml [2019-12-07 20:18:08,301 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 20:18:08,302 INFO L168 Benchmark]: Toolchain (without parser) took 3785.05 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.8 MB). Free memory was 940.8 MB in the beginning and 1.0 GB in the end (delta: -107.1 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. [2019-12-07 20:18:08,302 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 955.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 20:18:08,303 INFO L168 Benchmark]: CACSL2BoogieTranslator took 178.91 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 86.0 MB). Free memory was 940.8 MB in the beginning and 1.1 GB in the end (delta: -141.6 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. [2019-12-07 20:18:08,303 INFO L168 Benchmark]: Boogie Procedure Inliner took 19.51 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 20:18:08,303 INFO L168 Benchmark]: Boogie Preprocessor took 10.96 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2019-12-07 20:18:08,304 INFO L168 Benchmark]: RCFGBuilder took 184.29 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.9 MB). Peak memory consumption was 21.9 MB. Max. memory is 11.5 GB. [2019-12-07 20:18:08,304 INFO L168 Benchmark]: TraceAbstraction took 3346.95 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 39.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.7 MB). Peak memory consumption was 41.5 MB. Max. memory is 11.5 GB. [2019-12-07 20:18:08,304 INFO L168 Benchmark]: Witness Printer took 41.45 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 8.2 MB). Peak memory consumption was 8.2 MB. Max. memory is 11.5 GB. [2019-12-07 20:18:08,306 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 955.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 178.91 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 86.0 MB). Free memory was 940.8 MB in the beginning and 1.1 GB in the end (delta: -141.6 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 19.51 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 10.96 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 184.29 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.9 MB). Peak memory consumption was 21.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3346.95 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 39.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.7 MB). Peak memory consumption was 41.5 MB. Max. memory is 11.5 GB. * Witness Printer took 41.45 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 8.2 MB). Peak memory consumption was 8.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - AllSpecificationsHoldResult: All specifications hold 10 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 40 locations, 10 error locations. Result: SAFE, OverallTime: 3.1s, OverallIterations: 13, TraceHistogramMax: 6, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, HoareTripleCheckerStatistics: 371 SDtfs, 485 SDslu, 1145 SDs, 0 SdLazy, 1105 SolverSat, 153 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 381 GetRequests, 250 SyntacticMatches, 9 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=112occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 114 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 115 PreInvPairs, 130 NumberOfFragments, 95 HoareAnnotationTreeSize, 115 FomulaSimplifications, 215 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 130 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 518 NumberOfCodeBlocks, 502 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 619 ConstructedInterpolants, 0 QuantifiedInterpolants, 56777 SizeOfPredicates, 7 NumberOfNonLiveVariables, 219 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 19 InterpolantComputations, 13 PerfectInterpolantSequences, 337/355 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...