./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/bitvector/soft_float_1-2a.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- 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_7541f36f-96ea-4c50-bc16-2125232f8970/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_7541f36f-96ea-4c50-bc16-2125232f8970/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_7541f36f-96ea-4c50-bc16-2125232f8970/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_7541f36f-96ea-4c50-bc16-2125232f8970/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/bitvector/soft_float_1-2a.c.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_7541f36f-96ea-4c50-bc16-2125232f8970/bin/utaipan/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_7541f36f-96ea-4c50-bc16-2125232f8970/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 32bit --witnessprinter.graph.data.programhash 8bbbd483a09fdeea97ffdf681e0639d6c4265da0 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Using bit-precise analysis No suitable file found in config dir /tmp/vcloud-vcloud-master/worker/run_dir_7541f36f-96ea-4c50-bc16-2125232f8970/bin/utaipan/config using search string *Overflow*32bit*_Bitvector*.epf No suitable settings file found using Overflow*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 19:53:33,796 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 19:53:33,797 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 19:53:33,805 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 19:53:33,805 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 19:53:33,805 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 19:53:33,806 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 19:53:33,808 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 19:53:33,809 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 19:53:33,809 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 19:53:33,810 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 19:53:33,811 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 19:53:33,811 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 19:53:33,812 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 19:53:33,812 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 19:53:33,813 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 19:53:33,814 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 19:53:33,814 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 19:53:33,815 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 19:53:33,817 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 19:53:33,818 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 19:53:33,819 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 19:53:33,819 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 19:53:33,820 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 19:53:33,821 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 19:53:33,821 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 19:53:33,822 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 19:53:33,822 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 19:53:33,822 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 19:53:33,823 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 19:53:33,823 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 19:53:33,823 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 19:53:33,824 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 19:53:33,824 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 19:53:33,825 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 19:53:33,825 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 19:53:33,825 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 19:53:33,826 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 19:53:33,826 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 19:53:33,826 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 19:53:33,827 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 19:53:33,827 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_7541f36f-96ea-4c50-bc16-2125232f8970/bin/utaipan/config/svcomp-Overflow-32bit-Taipan_Default.epf [2019-12-07 19:53:33,837 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 19:53:33,837 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 19:53:33,838 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 19:53:33,838 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 19:53:33,838 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 19:53:33,838 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 19:53:33,838 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 19:53:33,839 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 19:53:33,839 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 19:53:33,839 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 19:53:33,839 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 19:53:33,839 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 19:53:33,839 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 19:53:33,839 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 19:53:33,839 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 19:53:33,840 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 19:53:33,840 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 19:53:33,840 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 19:53:33,840 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 19:53:33,840 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 19:53:33,840 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 19:53:33,841 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 19:53:33,841 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 19:53:33,841 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 19:53:33,841 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2019-12-07 19:53:33,841 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 19:53:33,841 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 19:53:33,841 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 19:53:33,841 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 19:53:33,841 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 19:53:33,842 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 19:53:33,842 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 19:53:33,842 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 19:53:33,842 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 19:53:33,842 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 19:53:33,842 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 19:53:33,842 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 19:53:33,842 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 19:53:33,842 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 19:53:33,842 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 19:53:33,843 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 19:53:33,843 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_7541f36f-96ea-4c50-bc16-2125232f8970/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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8bbbd483a09fdeea97ffdf681e0639d6c4265da0 [2019-12-07 19:53:33,940 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 19:53:33,949 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 19:53:33,951 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 19:53:33,952 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 19:53:33,953 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 19:53:33,953 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_7541f36f-96ea-4c50-bc16-2125232f8970/bin/utaipan/../../sv-benchmarks/c/bitvector/soft_float_1-2a.c.cil.c [2019-12-07 19:53:33,991 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7541f36f-96ea-4c50-bc16-2125232f8970/bin/utaipan/data/8e13fbef2/fe984ee1ac8c416db62c4bc3e98f1985/FLAG8569dce74 [2019-12-07 19:53:34,409 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 19:53:34,409 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_7541f36f-96ea-4c50-bc16-2125232f8970/sv-benchmarks/c/bitvector/soft_float_1-2a.c.cil.c [2019-12-07 19:53:34,414 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7541f36f-96ea-4c50-bc16-2125232f8970/bin/utaipan/data/8e13fbef2/fe984ee1ac8c416db62c4bc3e98f1985/FLAG8569dce74 [2019-12-07 19:53:34,423 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_7541f36f-96ea-4c50-bc16-2125232f8970/bin/utaipan/data/8e13fbef2/fe984ee1ac8c416db62c4bc3e98f1985 [2019-12-07 19:53:34,425 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 19:53:34,426 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 19:53:34,426 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 19:53:34,427 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 19:53:34,429 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 19:53:34,429 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 07:53:34" (1/1) ... [2019-12-07 19:53:34,431 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b0a94f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:53:34, skipping insertion in model container [2019-12-07 19:53:34,431 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 07:53:34" (1/1) ... [2019-12-07 19:53:34,436 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 19:53:34,455 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 19:53:34,623 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 19:53:34,625 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 19:53:34,653 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 19:53:34,662 INFO L208 MainTranslator]: Completed translation [2019-12-07 19:53:34,662 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:53:34 WrapperNode [2019-12-07 19:53:34,663 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 19:53:34,663 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 19:53:34,663 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 19:53:34,663 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 19:53:34,668 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:53:34" (1/1) ... [2019-12-07 19:53:34,674 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:53:34" (1/1) ... [2019-12-07 19:53:34,694 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 19:53:34,694 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 19:53:34,694 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 19:53:34,694 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 19:53:34,701 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:53:34" (1/1) ... [2019-12-07 19:53:34,701 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:53:34" (1/1) ... [2019-12-07 19:53:34,703 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:53:34" (1/1) ... [2019-12-07 19:53:34,703 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:53:34" (1/1) ... [2019-12-07 19:53:34,708 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:53:34" (1/1) ... [2019-12-07 19:53:34,713 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:53:34" (1/1) ... [2019-12-07 19:53:34,715 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:53:34" (1/1) ... [2019-12-07 19:53:34,717 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 19:53:34,717 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 19:53:34,718 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 19:53:34,718 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 19:53:34,718 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:53:34" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7541f36f-96ea-4c50-bc16-2125232f8970/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 19:53:34,758 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 19:53:34,758 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 19:53:35,290 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 19:53:35,290 INFO L287 CfgBuilder]: Removed 28 assume(true) statements. [2019-12-07 19:53:35,291 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 07:53:35 BoogieIcfgContainer [2019-12-07 19:53:35,291 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 19:53:35,291 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 19:53:35,291 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 19:53:35,293 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 19:53:35,293 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 07:53:34" (1/3) ... [2019-12-07 19:53:35,294 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a737f0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 07:53:35, skipping insertion in model container [2019-12-07 19:53:35,294 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:53:34" (2/3) ... [2019-12-07 19:53:35,294 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a737f0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 07:53:35, skipping insertion in model container [2019-12-07 19:53:35,294 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 07:53:35" (3/3) ... [2019-12-07 19:53:35,295 INFO L109 eAbstractionObserver]: Analyzing ICFG soft_float_1-2a.c.cil.c [2019-12-07 19:53:35,301 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 19:53:35,305 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 28 error locations. [2019-12-07 19:53:35,312 INFO L249 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2019-12-07 19:53:35,328 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 19:53:35,328 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 19:53:35,328 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 19:53:35,328 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 19:53:35,328 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 19:53:35,328 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 19:53:35,328 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 19:53:35,328 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 19:53:35,341 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states. [2019-12-07 19:53:35,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-12-07 19:53:35,345 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:53:35,345 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-12-07 19:53:35,346 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 19:53:35,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:53:35,349 INFO L82 PathProgramCache]: Analyzing trace with hash 923321367, now seen corresponding path program 1 times [2019-12-07 19:53:35,355 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:53:35,356 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533017546] [2019-12-07 19:53:35,356 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:53:35,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:53:35,430 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 19:53:35,430 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533017546] [2019-12-07 19:53:35,431 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:53:35,431 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 19:53:35,432 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652825596] [2019-12-07 19:53:35,435 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-12-07 19:53:35,435 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:53:35,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-12-07 19:53:35,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-07 19:53:35,445 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 2 states. [2019-12-07 19:53:35,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:53:35,462 INFO L93 Difference]: Finished difference Result 177 states and 229 transitions. [2019-12-07 19:53:35,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-12-07 19:53:35,463 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 6 [2019-12-07 19:53:35,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:53:35,470 INFO L225 Difference]: With dead ends: 177 [2019-12-07 19:53:35,471 INFO L226 Difference]: Without dead ends: 90 [2019-12-07 19:53:35,473 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-07 19:53:35,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-12-07 19:53:35,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2019-12-07 19:53:35,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-12-07 19:53:35,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 108 transitions. [2019-12-07 19:53:35,500 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 108 transitions. Word has length 6 [2019-12-07 19:53:35,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:53:35,500 INFO L462 AbstractCegarLoop]: Abstraction has 90 states and 108 transitions. [2019-12-07 19:53:35,500 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-12-07 19:53:35,500 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 108 transitions. [2019-12-07 19:53:35,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-12-07 19:53:35,500 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:53:35,501 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-12-07 19:53:35,501 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 19:53:35,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:53:35,501 INFO L82 PathProgramCache]: Analyzing trace with hash 921960144, now seen corresponding path program 1 times [2019-12-07 19:53:35,501 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:53:35,501 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808675629] [2019-12-07 19:53:35,501 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:53:35,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:53:35,539 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 19:53:35,539 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808675629] [2019-12-07 19:53:35,540 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:53:35,540 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 19:53:35,540 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365916621] [2019-12-07 19:53:35,541 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:53:35,541 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:53:35,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:53:35,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:53:35,542 INFO L87 Difference]: Start difference. First operand 90 states and 108 transitions. Second operand 4 states. [2019-12-07 19:53:35,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:53:35,643 INFO L93 Difference]: Finished difference Result 183 states and 213 transitions. [2019-12-07 19:53:35,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 19:53:35,643 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-12-07 19:53:35,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:53:35,644 INFO L225 Difference]: With dead ends: 183 [2019-12-07 19:53:35,644 INFO L226 Difference]: Without dead ends: 95 [2019-12-07 19:53:35,645 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:53:35,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-12-07 19:53:35,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 70. [2019-12-07 19:53:35,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-12-07 19:53:35,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 82 transitions. [2019-12-07 19:53:35,651 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 82 transitions. Word has length 6 [2019-12-07 19:53:35,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:53:35,651 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 82 transitions. [2019-12-07 19:53:35,651 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:53:35,651 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 82 transitions. [2019-12-07 19:53:35,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-07 19:53:35,652 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:53:35,652 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:53:35,652 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 19:53:35,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:53:35,652 INFO L82 PathProgramCache]: Analyzing trace with hash -705351300, now seen corresponding path program 1 times [2019-12-07 19:53:35,652 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:53:35,652 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295973678] [2019-12-07 19:53:35,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:53:35,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:53:35,677 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 19:53:35,677 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295973678] [2019-12-07 19:53:35,677 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:53:35,678 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 19:53:35,678 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156063429] [2019-12-07 19:53:35,678 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:53:35,678 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:53:35,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:53:35,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:53:35,678 INFO L87 Difference]: Start difference. First operand 70 states and 82 transitions. Second operand 4 states. [2019-12-07 19:53:35,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:53:35,722 INFO L93 Difference]: Finished difference Result 102 states and 117 transitions. [2019-12-07 19:53:35,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 19:53:35,723 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-12-07 19:53:35,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:53:35,724 INFO L225 Difference]: With dead ends: 102 [2019-12-07 19:53:35,724 INFO L226 Difference]: Without dead ends: 98 [2019-12-07 19:53:35,724 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:53:35,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-12-07 19:53:35,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 71. [2019-12-07 19:53:35,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-12-07 19:53:35,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 84 transitions. [2019-12-07 19:53:35,732 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 84 transitions. Word has length 8 [2019-12-07 19:53:35,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:53:35,733 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 84 transitions. [2019-12-07 19:53:35,733 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:53:35,733 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 84 transitions. [2019-12-07 19:53:35,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 19:53:35,733 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:53:35,734 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:53:35,734 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 19:53:35,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:53:35,734 INFO L82 PathProgramCache]: Analyzing trace with hash -391053687, now seen corresponding path program 1 times [2019-12-07 19:53:35,735 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:53:35,735 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579232153] [2019-12-07 19:53:35,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:53:35,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:53:35,756 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 19:53:35,757 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579232153] [2019-12-07 19:53:35,757 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:53:35,757 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 19:53:35,757 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856338006] [2019-12-07 19:53:35,757 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:53:35,757 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:53:35,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:53:35,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:53:35,758 INFO L87 Difference]: Start difference. First operand 71 states and 84 transitions. Second operand 3 states. [2019-12-07 19:53:35,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:53:35,794 INFO L93 Difference]: Finished difference Result 96 states and 109 transitions. [2019-12-07 19:53:35,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:53:35,794 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-07 19:53:35,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:53:35,795 INFO L225 Difference]: With dead ends: 96 [2019-12-07 19:53:35,795 INFO L226 Difference]: Without dead ends: 94 [2019-12-07 19:53:35,796 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:53:35,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-12-07 19:53:35,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 69. [2019-12-07 19:53:35,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-12-07 19:53:35,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 82 transitions. [2019-12-07 19:53:35,802 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 82 transitions. Word has length 9 [2019-12-07 19:53:35,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:53:35,803 INFO L462 AbstractCegarLoop]: Abstraction has 69 states and 82 transitions. [2019-12-07 19:53:35,803 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:53:35,803 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 82 transitions. [2019-12-07 19:53:35,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 19:53:35,804 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:53:35,804 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:53:35,804 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 19:53:35,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:53:35,804 INFO L82 PathProgramCache]: Analyzing trace with hash 1649753322, now seen corresponding path program 1 times [2019-12-07 19:53:35,805 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:53:35,805 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758066651] [2019-12-07 19:53:35,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:53:35,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:53:35,830 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 19:53:35,831 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758066651] [2019-12-07 19:53:35,831 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:53:35,831 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 19:53:35,831 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163508308] [2019-12-07 19:53:35,832 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:53:35,832 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:53:35,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:53:35,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:53:35,832 INFO L87 Difference]: Start difference. First operand 69 states and 82 transitions. Second operand 4 states. [2019-12-07 19:53:35,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:53:35,877 INFO L93 Difference]: Finished difference Result 100 states and 114 transitions. [2019-12-07 19:53:35,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 19:53:35,878 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-12-07 19:53:35,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:53:35,879 INFO L225 Difference]: With dead ends: 100 [2019-12-07 19:53:35,879 INFO L226 Difference]: Without dead ends: 98 [2019-12-07 19:53:35,879 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:53:35,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-12-07 19:53:35,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 71. [2019-12-07 19:53:35,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-12-07 19:53:35,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 84 transitions. [2019-12-07 19:53:35,884 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 84 transitions. Word has length 10 [2019-12-07 19:53:35,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:53:35,884 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 84 transitions. [2019-12-07 19:53:35,884 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:53:35,885 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 84 transitions. [2019-12-07 19:53:35,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 19:53:35,885 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:53:35,885 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:53:35,885 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 19:53:35,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:53:35,886 INFO L82 PathProgramCache]: Analyzing trace with hash 915766001, now seen corresponding path program 1 times [2019-12-07 19:53:35,886 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:53:35,886 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806091204] [2019-12-07 19:53:35,886 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:53:35,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:53:36,042 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 19:53:36,042 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806091204] [2019-12-07 19:53:36,043 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:53:36,043 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 19:53:36,043 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814132479] [2019-12-07 19:53:36,043 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 19:53:36,044 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:53:36,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 19:53:36,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-07 19:53:36,044 INFO L87 Difference]: Start difference. First operand 71 states and 84 transitions. Second operand 8 states. [2019-12-07 19:53:36,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:53:36,190 INFO L93 Difference]: Finished difference Result 163 states and 182 transitions. [2019-12-07 19:53:36,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 19:53:36,190 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2019-12-07 19:53:36,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:53:36,191 INFO L225 Difference]: With dead ends: 163 [2019-12-07 19:53:36,192 INFO L226 Difference]: Without dead ends: 162 [2019-12-07 19:53:36,192 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-07 19:53:36,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-12-07 19:53:36,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 83. [2019-12-07 19:53:36,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-12-07 19:53:36,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 101 transitions. [2019-12-07 19:53:36,199 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 101 transitions. Word has length 10 [2019-12-07 19:53:36,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:53:36,199 INFO L462 AbstractCegarLoop]: Abstraction has 83 states and 101 transitions. [2019-12-07 19:53:36,199 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 19:53:36,199 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 101 transitions. [2019-12-07 19:53:36,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 19:53:36,200 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:53:36,200 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:53:36,200 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 19:53:36,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:53:36,200 INFO L82 PathProgramCache]: Analyzing trace with hash 906971829, now seen corresponding path program 1 times [2019-12-07 19:53:36,200 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:53:36,201 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187260475] [2019-12-07 19:53:36,201 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:53:36,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:53:36,218 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 19:53:36,218 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187260475] [2019-12-07 19:53:36,218 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:53:36,219 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 19:53:36,219 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755900897] [2019-12-07 19:53:36,219 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:53:36,219 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:53:36,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:53:36,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:53:36,220 INFO L87 Difference]: Start difference. First operand 83 states and 101 transitions. Second operand 4 states. [2019-12-07 19:53:36,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:53:36,265 INFO L93 Difference]: Finished difference Result 115 states and 136 transitions. [2019-12-07 19:53:36,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 19:53:36,265 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-12-07 19:53:36,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:53:36,266 INFO L225 Difference]: With dead ends: 115 [2019-12-07 19:53:36,266 INFO L226 Difference]: Without dead ends: 113 [2019-12-07 19:53:36,267 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:53:36,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-12-07 19:53:36,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 86. [2019-12-07 19:53:36,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-12-07 19:53:36,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 104 transitions. [2019-12-07 19:53:36,272 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 104 transitions. Word has length 10 [2019-12-07 19:53:36,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:53:36,273 INFO L462 AbstractCegarLoop]: Abstraction has 86 states and 104 transitions. [2019-12-07 19:53:36,273 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:53:36,273 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 104 transitions. [2019-12-07 19:53:36,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-07 19:53:36,274 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:53:36,274 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:53:36,274 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 19:53:36,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:53:36,274 INFO L82 PathProgramCache]: Analyzing trace with hash -417159117, now seen corresponding path program 1 times [2019-12-07 19:53:36,275 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:53:36,275 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876005064] [2019-12-07 19:53:36,275 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:53:36,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:53:36,367 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 19:53:36,367 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876005064] [2019-12-07 19:53:36,368 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:53:36,368 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 19:53:36,368 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707649419] [2019-12-07 19:53:36,368 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 19:53:36,369 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:53:36,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 19:53:36,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-07 19:53:36,369 INFO L87 Difference]: Start difference. First operand 86 states and 104 transitions. Second operand 7 states. [2019-12-07 19:53:36,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:53:36,468 INFO L93 Difference]: Finished difference Result 149 states and 170 transitions. [2019-12-07 19:53:36,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 19:53:36,469 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2019-12-07 19:53:36,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:53:36,470 INFO L225 Difference]: With dead ends: 149 [2019-12-07 19:53:36,470 INFO L226 Difference]: Without dead ends: 121 [2019-12-07 19:53:36,470 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-12-07 19:53:36,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-12-07 19:53:36,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 74. [2019-12-07 19:53:36,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-12-07 19:53:36,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 86 transitions. [2019-12-07 19:53:36,478 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 86 transitions. Word has length 12 [2019-12-07 19:53:36,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:53:36,478 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 86 transitions. [2019-12-07 19:53:36,478 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 19:53:36,478 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 86 transitions. [2019-12-07 19:53:36,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-07 19:53:36,479 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:53:36,479 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:53:36,479 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 19:53:36,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:53:36,480 INFO L82 PathProgramCache]: Analyzing trace with hash 609021309, now seen corresponding path program 1 times [2019-12-07 19:53:36,480 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:53:36,480 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659419825] [2019-12-07 19:53:36,480 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:53:36,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:53:36,500 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 19:53:36,500 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659419825] [2019-12-07 19:53:36,500 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:53:36,500 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 19:53:36,500 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467043842] [2019-12-07 19:53:36,501 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:53:36,501 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:53:36,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:53:36,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:53:36,501 INFO L87 Difference]: Start difference. First operand 74 states and 86 transitions. Second operand 4 states. [2019-12-07 19:53:36,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:53:36,532 INFO L93 Difference]: Finished difference Result 105 states and 117 transitions. [2019-12-07 19:53:36,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 19:53:36,532 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-12-07 19:53:36,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:53:36,533 INFO L225 Difference]: With dead ends: 105 [2019-12-07 19:53:36,533 INFO L226 Difference]: Without dead ends: 103 [2019-12-07 19:53:36,533 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:53:36,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-12-07 19:53:36,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 76. [2019-12-07 19:53:36,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-12-07 19:53:36,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 88 transitions. [2019-12-07 19:53:36,537 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 88 transitions. Word has length 12 [2019-12-07 19:53:36,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:53:36,537 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 88 transitions. [2019-12-07 19:53:36,537 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:53:36,537 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 88 transitions. [2019-12-07 19:53:36,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 19:53:36,538 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:53:36,538 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:53:36,538 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 19:53:36,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:53:36,538 INFO L82 PathProgramCache]: Analyzing trace with hash 332262542, now seen corresponding path program 1 times [2019-12-07 19:53:36,539 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:53:36,539 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508648172] [2019-12-07 19:53:36,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:53:36,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:53:36,551 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 19:53:36,552 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508648172] [2019-12-07 19:53:36,552 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:53:36,552 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:53:36,552 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485227654] [2019-12-07 19:53:36,552 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:53:36,552 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:53:36,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:53:36,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:53:36,553 INFO L87 Difference]: Start difference. First operand 76 states and 88 transitions. Second operand 4 states. [2019-12-07 19:53:36,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:53:36,589 INFO L93 Difference]: Finished difference Result 130 states and 143 transitions. [2019-12-07 19:53:36,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 19:53:36,590 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 19:53:36,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:53:36,590 INFO L225 Difference]: With dead ends: 130 [2019-12-07 19:53:36,590 INFO L226 Difference]: Without dead ends: 128 [2019-12-07 19:53:36,591 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:53:36,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-12-07 19:53:36,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 68. [2019-12-07 19:53:36,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-12-07 19:53:36,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 80 transitions. [2019-12-07 19:53:36,594 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 80 transitions. Word has length 13 [2019-12-07 19:53:36,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:53:36,595 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 80 transitions. [2019-12-07 19:53:36,595 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:53:36,595 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 80 transitions. [2019-12-07 19:53:36,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 19:53:36,595 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:53:36,595 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:53:36,596 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 19:53:36,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:53:36,596 INFO L82 PathProgramCache]: Analyzing trace with hash 91552364, now seen corresponding path program 1 times [2019-12-07 19:53:36,596 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:53:36,596 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875664352] [2019-12-07 19:53:36,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:53:36,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:53:36,608 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:53:36,609 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875664352] [2019-12-07 19:53:36,609 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:53:36,609 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:53:36,609 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322099033] [2019-12-07 19:53:36,609 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:53:36,609 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:53:36,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:53:36,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:53:36,610 INFO L87 Difference]: Start difference. First operand 68 states and 80 transitions. Second operand 4 states. [2019-12-07 19:53:36,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:53:36,644 INFO L93 Difference]: Finished difference Result 98 states and 112 transitions. [2019-12-07 19:53:36,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 19:53:36,644 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-07 19:53:36,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:53:36,645 INFO L225 Difference]: With dead ends: 98 [2019-12-07 19:53:36,645 INFO L226 Difference]: Without dead ends: 96 [2019-12-07 19:53:36,645 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:53:36,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-12-07 19:53:36,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 58. [2019-12-07 19:53:36,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-12-07 19:53:36,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 68 transitions. [2019-12-07 19:53:36,648 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 68 transitions. Word has length 14 [2019-12-07 19:53:36,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:53:36,648 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 68 transitions. [2019-12-07 19:53:36,649 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:53:36,649 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 68 transitions. [2019-12-07 19:53:36,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 19:53:36,649 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:53:36,649 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:53:36,649 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 19:53:36,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:53:36,650 INFO L82 PathProgramCache]: Analyzing trace with hash 1161103266, now seen corresponding path program 1 times [2019-12-07 19:53:36,650 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:53:36,650 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351637176] [2019-12-07 19:53:36,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:53:36,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:53:36,761 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 19:53:36,761 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351637176] [2019-12-07 19:53:36,761 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:53:36,761 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 19:53:36,761 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188900670] [2019-12-07 19:53:36,762 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 19:53:36,762 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:53:36,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 19:53:36,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-07 19:53:36,762 INFO L87 Difference]: Start difference. First operand 58 states and 68 transitions. Second operand 8 states. [2019-12-07 19:53:36,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:53:36,853 INFO L93 Difference]: Finished difference Result 98 states and 112 transitions. [2019-12-07 19:53:36,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 19:53:36,853 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2019-12-07 19:53:36,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:53:36,854 INFO L225 Difference]: With dead ends: 98 [2019-12-07 19:53:36,854 INFO L226 Difference]: Without dead ends: 97 [2019-12-07 19:53:36,854 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-12-07 19:53:36,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-12-07 19:53:36,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 78. [2019-12-07 19:53:36,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-12-07 19:53:36,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 92 transitions. [2019-12-07 19:53:36,857 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 92 transitions. Word has length 14 [2019-12-07 19:53:36,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:53:36,858 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 92 transitions. [2019-12-07 19:53:36,858 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 19:53:36,858 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 92 transitions. [2019-12-07 19:53:36,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 19:53:36,858 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:53:36,858 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:53:36,858 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 19:53:36,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:53:36,859 INFO L82 PathProgramCache]: Analyzing trace with hash -871248732, now seen corresponding path program 1 times [2019-12-07 19:53:36,859 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:53:36,859 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606813522] [2019-12-07 19:53:36,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:53:36,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:53:37,020 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 19:53:37,021 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606813522] [2019-12-07 19:53:37,021 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:53:37,021 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 19:53:37,021 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723295844] [2019-12-07 19:53:37,022 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 19:53:37,022 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:53:37,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 19:53:37,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-07 19:53:37,022 INFO L87 Difference]: Start difference. First operand 78 states and 92 transitions. Second operand 9 states. [2019-12-07 19:53:37,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:53:37,109 INFO L93 Difference]: Finished difference Result 120 states and 134 transitions. [2019-12-07 19:53:37,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 19:53:37,110 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2019-12-07 19:53:37,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:53:37,111 INFO L225 Difference]: With dead ends: 120 [2019-12-07 19:53:37,111 INFO L226 Difference]: Without dead ends: 119 [2019-12-07 19:53:37,111 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-07 19:53:37,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-12-07 19:53:37,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 84. [2019-12-07 19:53:37,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-12-07 19:53:37,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 98 transitions. [2019-12-07 19:53:37,117 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 98 transitions. Word has length 16 [2019-12-07 19:53:37,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:53:37,117 INFO L462 AbstractCegarLoop]: Abstraction has 84 states and 98 transitions. [2019-12-07 19:53:37,117 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 19:53:37,117 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 98 transitions. [2019-12-07 19:53:37,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 19:53:37,118 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:53:37,118 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:53:37,119 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 19:53:37,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:53:37,119 INFO L82 PathProgramCache]: Analyzing trace with hash -1238900558, now seen corresponding path program 1 times [2019-12-07 19:53:37,119 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:53:37,119 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494558488] [2019-12-07 19:53:37,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:53:37,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:53:37,417 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 19:53:37,417 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494558488] [2019-12-07 19:53:37,417 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:53:37,417 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-07 19:53:37,417 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433142113] [2019-12-07 19:53:37,418 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 19:53:37,418 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:53:37,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 19:53:37,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-12-07 19:53:37,418 INFO L87 Difference]: Start difference. First operand 84 states and 98 transitions. Second operand 12 states. [2019-12-07 19:53:37,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:53:37,727 INFO L93 Difference]: Finished difference Result 134 states and 145 transitions. [2019-12-07 19:53:37,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-07 19:53:37,727 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 17 [2019-12-07 19:53:37,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:53:37,728 INFO L225 Difference]: With dead ends: 134 [2019-12-07 19:53:37,728 INFO L226 Difference]: Without dead ends: 131 [2019-12-07 19:53:37,729 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=294, Unknown=0, NotChecked=0, Total=380 [2019-12-07 19:53:37,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-12-07 19:53:37,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 92. [2019-12-07 19:53:37,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-12-07 19:53:37,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 108 transitions. [2019-12-07 19:53:37,733 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 108 transitions. Word has length 17 [2019-12-07 19:53:37,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:53:37,738 INFO L462 AbstractCegarLoop]: Abstraction has 92 states and 108 transitions. [2019-12-07 19:53:37,738 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 19:53:37,738 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 108 transitions. [2019-12-07 19:53:37,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 19:53:37,738 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:53:37,739 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:53:37,739 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 19:53:37,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:53:37,739 INFO L82 PathProgramCache]: Analyzing trace with hash -807778989, now seen corresponding path program 1 times [2019-12-07 19:53:37,740 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:53:37,740 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409855541] [2019-12-07 19:53:37,740 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:53:37,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:53:37,818 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 19:53:37,818 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409855541] [2019-12-07 19:53:37,818 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:53:37,818 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 19:53:37,818 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055065438] [2019-12-07 19:53:37,818 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 19:53:37,819 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:53:37,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 19:53:37,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-07 19:53:37,819 INFO L87 Difference]: Start difference. First operand 92 states and 108 transitions. Second operand 7 states. [2019-12-07 19:53:37,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:53:37,880 INFO L93 Difference]: Finished difference Result 179 states and 200 transitions. [2019-12-07 19:53:37,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 19:53:37,881 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2019-12-07 19:53:37,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:53:37,882 INFO L225 Difference]: With dead ends: 179 [2019-12-07 19:53:37,882 INFO L226 Difference]: Without dead ends: 178 [2019-12-07 19:53:37,882 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 19:53:37,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-12-07 19:53:37,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 100. [2019-12-07 19:53:37,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-12-07 19:53:37,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 119 transitions. [2019-12-07 19:53:37,890 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 119 transitions. Word has length 18 [2019-12-07 19:53:37,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:53:37,890 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 119 transitions. [2019-12-07 19:53:37,890 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 19:53:37,890 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 119 transitions. [2019-12-07 19:53:37,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 19:53:37,891 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:53:37,891 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:53:37,891 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 19:53:37,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:53:37,891 INFO L82 PathProgramCache]: Analyzing trace with hash 248788681, now seen corresponding path program 1 times [2019-12-07 19:53:37,891 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:53:37,891 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351035297] [2019-12-07 19:53:37,891 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:53:37,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:53:38,085 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 19:53:38,085 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351035297] [2019-12-07 19:53:38,086 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:53:38,086 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-07 19:53:38,086 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117987997] [2019-12-07 19:53:38,086 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 19:53:38,086 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:53:38,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 19:53:38,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-12-07 19:53:38,087 INFO L87 Difference]: Start difference. First operand 100 states and 119 transitions. Second operand 11 states. [2019-12-07 19:53:38,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:53:38,282 INFO L93 Difference]: Finished difference Result 130 states and 151 transitions. [2019-12-07 19:53:38,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 19:53:38,282 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2019-12-07 19:53:38,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:53:38,283 INFO L225 Difference]: With dead ends: 130 [2019-12-07 19:53:38,283 INFO L226 Difference]: Without dead ends: 124 [2019-12-07 19:53:38,284 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2019-12-07 19:53:38,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-12-07 19:53:38,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 120. [2019-12-07 19:53:38,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-12-07 19:53:38,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 142 transitions. [2019-12-07 19:53:38,289 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 142 transitions. Word has length 18 [2019-12-07 19:53:38,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:53:38,289 INFO L462 AbstractCegarLoop]: Abstraction has 120 states and 142 transitions. [2019-12-07 19:53:38,289 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 19:53:38,289 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 142 transitions. [2019-12-07 19:53:38,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 19:53:38,290 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:53:38,290 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:53:38,290 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 19:53:38,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:53:38,290 INFO L82 PathProgramCache]: Analyzing trace with hash -724221842, now seen corresponding path program 1 times [2019-12-07 19:53:38,290 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:53:38,290 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54233024] [2019-12-07 19:53:38,290 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:53:38,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:53:38,405 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 19:53:38,406 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54233024] [2019-12-07 19:53:38,406 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:53:38,406 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 19:53:38,406 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392310996] [2019-12-07 19:53:38,406 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 19:53:38,407 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:53:38,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 19:53:38,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-07 19:53:38,407 INFO L87 Difference]: Start difference. First operand 120 states and 142 transitions. Second operand 8 states. [2019-12-07 19:53:38,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:53:38,476 INFO L93 Difference]: Finished difference Result 124 states and 142 transitions. [2019-12-07 19:53:38,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 19:53:38,476 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2019-12-07 19:53:38,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:53:38,477 INFO L225 Difference]: With dead ends: 124 [2019-12-07 19:53:38,477 INFO L226 Difference]: Without dead ends: 77 [2019-12-07 19:53:38,477 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-12-07 19:53:38,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-12-07 19:53:38,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-12-07 19:53:38,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-12-07 19:53:38,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 89 transitions. [2019-12-07 19:53:38,483 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 89 transitions. Word has length 18 [2019-12-07 19:53:38,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:53:38,483 INFO L462 AbstractCegarLoop]: Abstraction has 77 states and 89 transitions. [2019-12-07 19:53:38,483 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 19:53:38,483 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 89 transitions. [2019-12-07 19:53:38,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 19:53:38,483 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:53:38,484 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:53:38,484 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 19:53:38,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:53:38,484 INFO L82 PathProgramCache]: Analyzing trace with hash 1389399293, now seen corresponding path program 1 times [2019-12-07 19:53:38,484 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:53:38,484 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114079692] [2019-12-07 19:53:38,485 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:53:38,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:53:38,549 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 19:53:38,550 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114079692] [2019-12-07 19:53:38,550 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:53:38,550 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:53:38,550 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994170074] [2019-12-07 19:53:38,550 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:53:38,550 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:53:38,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:53:38,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:53:38,551 INFO L87 Difference]: Start difference. First operand 77 states and 89 transitions. Second operand 4 states. [2019-12-07 19:53:38,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:53:38,691 INFO L93 Difference]: Finished difference Result 104 states and 116 transitions. [2019-12-07 19:53:38,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 19:53:38,691 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-12-07 19:53:38,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:53:38,692 INFO L225 Difference]: With dead ends: 104 [2019-12-07 19:53:38,692 INFO L226 Difference]: Without dead ends: 103 [2019-12-07 19:53:38,692 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:53:38,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-12-07 19:53:38,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 77. [2019-12-07 19:53:38,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-12-07 19:53:38,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 89 transitions. [2019-12-07 19:53:38,696 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 89 transitions. Word has length 20 [2019-12-07 19:53:38,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:53:38,696 INFO L462 AbstractCegarLoop]: Abstraction has 77 states and 89 transitions. [2019-12-07 19:53:38,696 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:53:38,696 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 89 transitions. [2019-12-07 19:53:38,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 19:53:38,696 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:53:38,697 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:53:38,697 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 19:53:38,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:53:38,697 INFO L82 PathProgramCache]: Analyzing trace with hash 1113481749, now seen corresponding path program 1 times [2019-12-07 19:53:38,697 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:53:38,697 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047408866] [2019-12-07 19:53:38,697 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:53:38,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:53:38,765 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 19:53:38,765 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047408866] [2019-12-07 19:53:38,765 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:53:38,765 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 19:53:38,765 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047722014] [2019-12-07 19:53:38,765 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 19:53:38,766 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:53:38,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 19:53:38,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-07 19:53:38,766 INFO L87 Difference]: Start difference. First operand 77 states and 89 transitions. Second operand 7 states. [2019-12-07 19:53:38,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:53:38,827 INFO L93 Difference]: Finished difference Result 139 states and 151 transitions. [2019-12-07 19:53:38,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 19:53:38,828 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2019-12-07 19:53:38,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:53:38,828 INFO L225 Difference]: With dead ends: 139 [2019-12-07 19:53:38,829 INFO L226 Difference]: Without dead ends: 138 [2019-12-07 19:53:38,829 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-12-07 19:53:38,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-12-07 19:53:38,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 83. [2019-12-07 19:53:38,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-12-07 19:53:38,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 95 transitions. [2019-12-07 19:53:38,834 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 95 transitions. Word has length 20 [2019-12-07 19:53:38,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:53:38,834 INFO L462 AbstractCegarLoop]: Abstraction has 83 states and 95 transitions. [2019-12-07 19:53:38,834 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 19:53:38,835 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 95 transitions. [2019-12-07 19:53:38,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 19:53:38,835 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:53:38,835 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:53:38,835 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 19:53:38,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:53:38,836 INFO L82 PathProgramCache]: Analyzing trace with hash 158202209, now seen corresponding path program 1 times [2019-12-07 19:53:38,836 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:53:38,836 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944943754] [2019-12-07 19:53:38,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:53:38,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:53:39,061 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 19:53:39,061 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944943754] [2019-12-07 19:53:39,061 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:53:39,061 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 19:53:39,061 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083478034] [2019-12-07 19:53:39,062 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 19:53:39,062 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:53:39,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 19:53:39,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-12-07 19:53:39,062 INFO L87 Difference]: Start difference. First operand 83 states and 95 transitions. Second operand 10 states. [2019-12-07 19:53:39,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:53:39,420 INFO L93 Difference]: Finished difference Result 158 states and 166 transitions. [2019-12-07 19:53:39,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-07 19:53:39,420 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2019-12-07 19:53:39,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:53:39,421 INFO L225 Difference]: With dead ends: 158 [2019-12-07 19:53:39,421 INFO L226 Difference]: Without dead ends: 155 [2019-12-07 19:53:39,421 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2019-12-07 19:53:39,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-12-07 19:53:39,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 91. [2019-12-07 19:53:39,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-12-07 19:53:39,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 104 transitions. [2019-12-07 19:53:39,425 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 104 transitions. Word has length 21 [2019-12-07 19:53:39,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:53:39,425 INFO L462 AbstractCegarLoop]: Abstraction has 91 states and 104 transitions. [2019-12-07 19:53:39,425 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 19:53:39,425 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 104 transitions. [2019-12-07 19:53:39,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 19:53:39,426 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:53:39,426 INFO L410 BasicCegarLoop]: trace histogram [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 19:53:39,426 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 19:53:39,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:53:39,426 INFO L82 PathProgramCache]: Analyzing trace with hash -522098881, now seen corresponding path program 1 times [2019-12-07 19:53:39,426 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:53:39,426 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946270898] [2019-12-07 19:53:39,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:53:39,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 19:53:39,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 19:53:39,465 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-12-07 19:53:39,465 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 19:53:39,484 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 07:53:39 BoogieIcfgContainer [2019-12-07 19:53:39,484 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 19:53:39,484 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 19:53:39,484 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 19:53:39,485 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 19:53:39,485 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 07:53:35" (3/4) ... [2019-12-07 19:53:39,487 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-12-07 19:53:39,487 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 19:53:39,489 INFO L168 Benchmark]: Toolchain (without parser) took 5062.36 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.7 MB). Free memory was 943.5 MB in the beginning and 1.1 GB in the end (delta: -170.4 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 19:53:39,489 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 19:53:39,489 INFO L168 Benchmark]: CACSL2BoogieTranslator took 236.26 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 104.9 MB). Free memory was 943.5 MB in the beginning and 1.1 GB in the end (delta: -150.9 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. [2019-12-07 19:53:39,489 INFO L168 Benchmark]: Boogie Procedure Inliner took 31.15 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 19:53:39,489 INFO L168 Benchmark]: Boogie Preprocessor took 22.99 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 19:53:39,490 INFO L168 Benchmark]: RCFGBuilder took 573.30 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 83.2 MB). Peak memory consumption was 83.2 MB. Max. memory is 11.5 GB. [2019-12-07 19:53:39,490 INFO L168 Benchmark]: TraceAbstraction took 4192.93 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 50.9 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -109.0 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 19:53:39,490 INFO L168 Benchmark]: Witness Printer took 2.89 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.2 MB). Peak memory consumption was 6.2 MB. Max. memory is 11.5 GB. [2019-12-07 19:53:39,492 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 236.26 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 104.9 MB). Free memory was 943.5 MB in the beginning and 1.1 GB in the end (delta: -150.9 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 31.15 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 22.99 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 573.30 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 83.2 MB). Peak memory consumption was 83.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4192.93 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 50.9 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -109.0 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 2.89 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.2 MB). Peak memory consumption was 6.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 103]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of bitwiseOr at line 101, overapproximation of bitwiseAnd at line 102. Possible FailurePath: [L217] unsigned int a ; [L218] unsigned int ma = __VERIFIER_nondet_uint(); [L219] signed char ea = __VERIFIER_nondet_char(); [L220] unsigned int b ; [L221] unsigned int mb = __VERIFIER_nondet_uint(); [L222] signed char eb = __VERIFIER_nondet_char(); [L223] unsigned int r_add ; [L224] unsigned int zero ; [L225] int sa ; [L226] int sb ; [L227] int tmp ; [L228] int tmp___0 ; [L229] int tmp___1 ; [L230] int tmp___2 ; [L231] int tmp___3 ; [L232] int tmp___4 ; [L233] int tmp___5 ; [L234] int tmp___6 ; [L235] int tmp___7 ; [L236] int tmp___8 ; [L237] int tmp___9 ; [L238] int __retres23 ; [L16] unsigned int res ; [L17] unsigned int __retres4 ; [L20] COND TRUE ! m [L21] __retres4 = 0U [L71] return (__retres4); [L242] zero = base2flt(0, 0) [L16] unsigned int res ; [L17] unsigned int __retres4 ; [L20] COND FALSE !(! m) [L26] COND FALSE !(m < 1U << 24U) [L48] COND TRUE 1 [L50] COND FALSE !(m >= 1U << 25U) [L67] m = m & ~ (1U << 24U) [L68] EXPR e + 128 [L68] res = m | ((unsigned int ) (e + 128) << 24U) [L69] __retres4 = res [L71] return (__retres4); [L243] a = base2flt(ma, ea) [L16] unsigned int res ; [L17] unsigned int __retres4 ; [L20] COND FALSE !(! m) [L26] COND FALSE !(m < 1U << 24U) [L48] COND TRUE 1 [L50] COND TRUE m >= 1U << 25U [L55] COND TRUE e >= 127 [L56] __retres4 = 4294967295U [L71] return (__retres4); [L244] b = base2flt(mb, eb) [L246] COND FALSE !(a < zero) [L249] COND TRUE a > zero [L250] tmp = 1 [L254] sa = tmp [L256] COND FALSE !(b < zero) [L259] COND TRUE b > zero [L260] tmp___0 = 1 [L264] sb = tmp___0 [L75] unsigned int res ; [L76] unsigned int ma ; [L77] unsigned int mb ; [L78] unsigned int delta ; [L79] int ea ; [L80] int eb ; [L81] unsigned int tmp ; [L82] unsigned int __retres10 ; [L85] COND TRUE a < b [L86] tmp = a [L87] a = b [L88] b = tmp [L92] COND FALSE !(! b) [L99] ma = a & ((1U << 24U) - 1U) [L100] EXPR (int )(a >> 24U) - 128 [L100] ea = (int )(a >> 24U) - 128 [L101] ma = ma | (1U << 24U) [L102] mb = b & ((1U << 24U) - 1U) [L103] (int )(b >> 24U) - 128 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 98 locations, 28 error locations. Result: UNSAFE, OverallTime: 4.1s, OverallIterations: 21, TraceHistogramMax: 2, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1488 SDtfs, 2114 SDslu, 3717 SDs, 0 SdLazy, 1255 SolverSat, 180 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 149 GetRequests, 15 SyntacticMatches, 3 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=120occurred in iteration=16, 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, 20 MinimizatonAttempts, 702 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 294 NumberOfCodeBlocks, 294 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 252 ConstructedInterpolants, 0 QuantifiedInterpolants, 26642 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 PerfectInterpolantSequences, 2/2 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 could not prove your program: unable to determine feasibility of some traces Received shutdown request...