./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/bitvector/soft_float_1-3a.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_2e137d1b-d05f-42b4-9e2c-aafc7e621e47/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_2e137d1b-d05f-42b4-9e2c-aafc7e621e47/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_2e137d1b-d05f-42b4-9e2c-aafc7e621e47/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_2e137d1b-d05f-42b4-9e2c-aafc7e621e47/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/bitvector/soft_float_1-3a.c.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_2e137d1b-d05f-42b4-9e2c-aafc7e621e47/bin/uautomizer/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_2e137d1b-d05f-42b4-9e2c-aafc7e621e47/bin/uautomizer --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0e04f2515dd5c7ce697460622800d33932bf1903 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis No suitable file found in config dir /tmp/vcloud-vcloud-master/worker/run_dir_2e137d1b-d05f-42b4-9e2c-aafc7e621e47/bin/uautomizer/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.24-678e011 [2019-11-20 01:50:53,127 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 01:50:53,129 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 01:50:53,146 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 01:50:53,146 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 01:50:53,148 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 01:50:53,150 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 01:50:53,159 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 01:50:53,164 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 01:50:53,169 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 01:50:53,170 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 01:50:53,171 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 01:50:53,172 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 01:50:53,174 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 01:50:53,175 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 01:50:53,176 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 01:50:53,177 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 01:50:53,178 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 01:50:53,181 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 01:50:53,184 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 01:50:53,189 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 01:50:53,191 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 01:50:53,194 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 01:50:53,195 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 01:50:53,198 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 01:50:53,198 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 01:50:53,199 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 01:50:53,200 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 01:50:53,201 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 01:50:53,202 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 01:50:53,202 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 01:50:53,203 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 01:50:53,204 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 01:50:53,205 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 01:50:53,206 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 01:50:53,206 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 01:50:53,207 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 01:50:53,207 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 01:50:53,207 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 01:50:53,208 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 01:50:53,209 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 01:50:53,210 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_2e137d1b-d05f-42b4-9e2c-aafc7e621e47/bin/uautomizer/config/svcomp-Overflow-32bit-Automizer_Default.epf [2019-11-20 01:50:53,238 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 01:50:53,250 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 01:50:53,251 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 01:50:53,252 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 01:50:53,252 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 01:50:53,252 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 01:50:53,253 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 01:50:53,253 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-20 01:50:53,253 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 01:50:53,253 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 01:50:53,254 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 01:50:53,254 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 01:50:53,254 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 01:50:53,254 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 01:50:53,255 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2019-11-20 01:50:53,255 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 01:50:53,255 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 01:50:53,255 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 01:50:53,256 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 01:50:53,256 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 01:50:53,256 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 01:50:53,256 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 01:50:53,257 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 01:50:53,257 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 01:50:53,257 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 01:50:53,257 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 01:50:53,258 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 01:50:53,259 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 01:50:53,259 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 01:50:53,260 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 01:50:53,260 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_2e137d1b-d05f-42b4-9e2c-aafc7e621e47/bin/uautomizer 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 -> Automizer 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 -> 0e04f2515dd5c7ce697460622800d33932bf1903 [2019-11-20 01:50:53,455 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 01:50:53,469 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 01:50:53,473 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 01:50:53,474 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 01:50:53,475 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 01:50:53,476 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_2e137d1b-d05f-42b4-9e2c-aafc7e621e47/bin/uautomizer/../../sv-benchmarks/c/bitvector/soft_float_1-3a.c.cil.c [2019-11-20 01:50:53,538 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_2e137d1b-d05f-42b4-9e2c-aafc7e621e47/bin/uautomizer/data/d2f72b00a/48bfb9f0edc54f56acf1d14c457386be/FLAG8648955b7 [2019-11-20 01:50:53,955 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 01:50:53,956 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_2e137d1b-d05f-42b4-9e2c-aafc7e621e47/sv-benchmarks/c/bitvector/soft_float_1-3a.c.cil.c [2019-11-20 01:50:53,968 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_2e137d1b-d05f-42b4-9e2c-aafc7e621e47/bin/uautomizer/data/d2f72b00a/48bfb9f0edc54f56acf1d14c457386be/FLAG8648955b7 [2019-11-20 01:50:53,981 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_2e137d1b-d05f-42b4-9e2c-aafc7e621e47/bin/uautomizer/data/d2f72b00a/48bfb9f0edc54f56acf1d14c457386be [2019-11-20 01:50:53,984 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 01:50:53,985 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 01:50:53,986 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 01:50:53,986 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 01:50:53,990 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 01:50:53,991 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 01:50:53" (1/1) ... [2019-11-20 01:50:53,994 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@200c2bff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:50:53, skipping insertion in model container [2019-11-20 01:50:53,994 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 01:50:53" (1/1) ... [2019-11-20 01:50:54,002 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 01:50:54,044 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 01:50:54,355 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 01:50:54,359 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 01:50:54,403 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 01:50:54,418 INFO L192 MainTranslator]: Completed translation [2019-11-20 01:50:54,418 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:50:54 WrapperNode [2019-11-20 01:50:54,418 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 01:50:54,419 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 01:50:54,419 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 01:50:54,420 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 01:50:54,429 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:50:54" (1/1) ... [2019-11-20 01:50:54,439 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:50:54" (1/1) ... [2019-11-20 01:50:54,481 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 01:50:54,481 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 01:50:54,482 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 01:50:54,482 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 01:50:54,491 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:50:54" (1/1) ... [2019-11-20 01:50:54,491 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:50:54" (1/1) ... [2019-11-20 01:50:54,494 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:50:54" (1/1) ... [2019-11-20 01:50:54,495 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:50:54" (1/1) ... [2019-11-20 01:50:54,503 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:50:54" (1/1) ... [2019-11-20 01:50:54,510 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:50:54" (1/1) ... [2019-11-20 01:50:54,514 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:50:54" (1/1) ... [2019-11-20 01:50:54,518 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 01:50:54,518 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 01:50:54,519 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 01:50:54,519 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 01:50:54,520 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:50:54" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2e137d1b-d05f-42b4-9e2c-aafc7e621e47/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 01:50:54,598 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 01:50:54,598 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 01:50:55,253 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 01:50:55,255 INFO L285 CfgBuilder]: Removed 30 assume(true) statements. [2019-11-20 01:50:55,257 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 01:50:55 BoogieIcfgContainer [2019-11-20 01:50:55,257 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 01:50:55,261 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 01:50:55,262 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 01:50:55,267 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 01:50:55,270 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 01:50:53" (1/3) ... [2019-11-20 01:50:55,271 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b8c37e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 01:50:55, skipping insertion in model container [2019-11-20 01:50:55,272 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:50:54" (2/3) ... [2019-11-20 01:50:55,273 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b8c37e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 01:50:55, skipping insertion in model container [2019-11-20 01:50:55,273 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 01:50:55" (3/3) ... [2019-11-20 01:50:55,275 INFO L109 eAbstractionObserver]: Analyzing ICFG soft_float_1-3a.c.cil.c [2019-11-20 01:50:55,285 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 01:50:55,296 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 28 error locations. [2019-11-20 01:50:55,309 INFO L249 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2019-11-20 01:50:55,350 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 01:50:55,350 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 01:50:55,350 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 01:50:55,350 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 01:50:55,351 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 01:50:55,351 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 01:50:55,351 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 01:50:55,351 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 01:50:55,380 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states. [2019-11-20 01:50:55,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-11-20 01:50:55,392 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:50:55,393 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-11-20 01:50:55,398 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-11-20 01:50:55,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:50:55,406 INFO L82 PathProgramCache]: Analyzing trace with hash 922901410, now seen corresponding path program 1 times [2019-11-20 01:50:55,416 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:50:55,416 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022383694] [2019-11-20 01:50:55,417 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:50:55,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:50:55,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:50:55,535 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022383694] [2019-11-20 01:50:55,536 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:50:55,536 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 01:50:55,538 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992180532] [2019-11-20 01:50:55,542 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-20 01:50:55,543 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:50:55,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-20 01:50:55,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-20 01:50:55,557 INFO L87 Difference]: Start difference. First operand 144 states. Second operand 2 states. [2019-11-20 01:50:55,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:50:55,594 INFO L93 Difference]: Finished difference Result 269 states and 377 transitions. [2019-11-20 01:50:55,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-20 01:50:55,596 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 6 [2019-11-20 01:50:55,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:50:55,608 INFO L225 Difference]: With dead ends: 269 [2019-11-20 01:50:55,608 INFO L226 Difference]: Without dead ends: 106 [2019-11-20 01:50:55,612 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-11-20 01:50:55,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-11-20 01:50:55,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2019-11-20 01:50:55,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-11-20 01:50:55,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 129 transitions. [2019-11-20 01:50:55,655 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 129 transitions. Word has length 6 [2019-11-20 01:50:55,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:50:55,656 INFO L462 AbstractCegarLoop]: Abstraction has 106 states and 129 transitions. [2019-11-20 01:50:55,656 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-20 01:50:55,656 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 129 transitions. [2019-11-20 01:50:55,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-11-20 01:50:55,657 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:50:55,657 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-11-20 01:50:55,657 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-11-20 01:50:55,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:50:55,658 INFO L82 PathProgramCache]: Analyzing trace with hash 921960144, now seen corresponding path program 1 times [2019-11-20 01:50:55,658 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:50:55,658 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820107132] [2019-11-20 01:50:55,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:50:55,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:50:55,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:50:55,712 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820107132] [2019-11-20 01:50:55,712 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:50:55,712 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 01:50:55,713 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172833362] [2019-11-20 01:50:55,714 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 01:50:55,714 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:50:55,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 01:50:55,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 01:50:55,715 INFO L87 Difference]: Start difference. First operand 106 states and 129 transitions. Second operand 4 states. [2019-11-20 01:50:55,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:50:55,924 INFO L93 Difference]: Finished difference Result 230 states and 275 transitions. [2019-11-20 01:50:55,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 01:50:55,929 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-11-20 01:50:55,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:50:55,931 INFO L225 Difference]: With dead ends: 230 [2019-11-20 01:50:55,931 INFO L226 Difference]: Without dead ends: 126 [2019-11-20 01:50:55,933 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-11-20 01:50:55,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-11-20 01:50:55,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 86. [2019-11-20 01:50:55,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-11-20 01:50:55,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 103 transitions. [2019-11-20 01:50:55,954 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 103 transitions. Word has length 6 [2019-11-20 01:50:55,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:50:55,954 INFO L462 AbstractCegarLoop]: Abstraction has 86 states and 103 transitions. [2019-11-20 01:50:55,954 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 01:50:55,954 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 103 transitions. [2019-11-20 01:50:55,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-20 01:50:55,955 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:50:55,955 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:50:55,956 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-11-20 01:50:55,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:50:55,956 INFO L82 PathProgramCache]: Analyzing trace with hash -118682603, now seen corresponding path program 1 times [2019-11-20 01:50:55,956 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:50:55,959 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112085332] [2019-11-20 01:50:55,959 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:50:55,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:50:56,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:50:56,012 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112085332] [2019-11-20 01:50:56,013 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:50:56,013 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 01:50:56,013 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594100871] [2019-11-20 01:50:56,014 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 01:50:56,014 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:50:56,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 01:50:56,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 01:50:56,015 INFO L87 Difference]: Start difference. First operand 86 states and 103 transitions. Second operand 4 states. [2019-11-20 01:50:56,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:50:56,108 INFO L93 Difference]: Finished difference Result 133 states and 158 transitions. [2019-11-20 01:50:56,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 01:50:56,108 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-11-20 01:50:56,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:50:56,110 INFO L225 Difference]: With dead ends: 133 [2019-11-20 01:50:56,110 INFO L226 Difference]: Without dead ends: 129 [2019-11-20 01:50:56,111 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-11-20 01:50:56,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-11-20 01:50:56,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 87. [2019-11-20 01:50:56,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-11-20 01:50:56,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 105 transitions. [2019-11-20 01:50:56,122 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 105 transitions. Word has length 9 [2019-11-20 01:50:56,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:50:56,122 INFO L462 AbstractCegarLoop]: Abstraction has 87 states and 105 transitions. [2019-11-20 01:50:56,122 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 01:50:56,122 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 105 transitions. [2019-11-20 01:50:56,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-20 01:50:56,123 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:50:56,123 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:50:56,123 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-11-20 01:50:56,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:50:56,124 INFO L82 PathProgramCache]: Analyzing trace with hash 615806736, now seen corresponding path program 1 times [2019-11-20 01:50:56,124 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:50:56,124 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569020994] [2019-11-20 01:50:56,124 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:50:56,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:50:56,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:50:56,158 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569020994] [2019-11-20 01:50:56,158 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:50:56,158 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 01:50:56,158 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293858078] [2019-11-20 01:50:56,159 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 01:50:56,159 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:50:56,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 01:50:56,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:50:56,160 INFO L87 Difference]: Start difference. First operand 87 states and 105 transitions. Second operand 3 states. [2019-11-20 01:50:56,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:50:56,211 INFO L93 Difference]: Finished difference Result 127 states and 150 transitions. [2019-11-20 01:50:56,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:50:56,211 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-11-20 01:50:56,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:50:56,213 INFO L225 Difference]: With dead ends: 127 [2019-11-20 01:50:56,213 INFO L226 Difference]: Without dead ends: 125 [2019-11-20 01:50:56,213 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:50:56,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-11-20 01:50:56,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 85. [2019-11-20 01:50:56,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-11-20 01:50:56,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 103 transitions. [2019-11-20 01:50:56,223 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 103 transitions. Word has length 10 [2019-11-20 01:50:56,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:50:56,224 INFO L462 AbstractCegarLoop]: Abstraction has 85 states and 103 transitions. [2019-11-20 01:50:56,224 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 01:50:56,224 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 103 transitions. [2019-11-20 01:50:56,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-20 01:50:56,229 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:50:56,229 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:50:56,230 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-11-20 01:50:56,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:50:56,231 INFO L82 PathProgramCache]: Analyzing trace with hash -1497311933, now seen corresponding path program 1 times [2019-11-20 01:50:56,231 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:50:56,231 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778780537] [2019-11-20 01:50:56,231 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:50:56,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:50:56,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:50:56,293 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778780537] [2019-11-20 01:50:56,293 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:50:56,293 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 01:50:56,293 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740418573] [2019-11-20 01:50:56,294 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 01:50:56,294 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:50:56,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 01:50:56,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 01:50:56,295 INFO L87 Difference]: Start difference. First operand 85 states and 103 transitions. Second operand 4 states. [2019-11-20 01:50:56,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:50:56,378 INFO L93 Difference]: Finished difference Result 131 states and 155 transitions. [2019-11-20 01:50:56,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 01:50:56,379 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-20 01:50:56,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:50:56,380 INFO L225 Difference]: With dead ends: 131 [2019-11-20 01:50:56,380 INFO L226 Difference]: Without dead ends: 129 [2019-11-20 01:50:56,381 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-11-20 01:50:56,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-11-20 01:50:56,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 87. [2019-11-20 01:50:56,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-11-20 01:50:56,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 105 transitions. [2019-11-20 01:50:56,392 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 105 transitions. Word has length 11 [2019-11-20 01:50:56,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:50:56,393 INFO L462 AbstractCegarLoop]: Abstraction has 87 states and 105 transitions. [2019-11-20 01:50:56,393 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 01:50:56,393 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 105 transitions. [2019-11-20 01:50:56,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-20 01:50:56,394 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:50:56,395 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:50:56,395 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-11-20 01:50:56,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:50:56,395 INFO L82 PathProgramCache]: Analyzing trace with hash -832741477, now seen corresponding path program 1 times [2019-11-20 01:50:56,396 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:50:56,396 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094363662] [2019-11-20 01:50:56,396 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:50:56,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:50:56,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:50:56,449 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094363662] [2019-11-20 01:50:56,449 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:50:56,449 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 01:50:56,449 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241970947] [2019-11-20 01:50:56,450 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 01:50:56,450 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:50:56,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 01:50:56,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 01:50:56,450 INFO L87 Difference]: Start difference. First operand 87 states and 105 transitions. Second operand 4 states. [2019-11-20 01:50:56,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:50:56,539 INFO L93 Difference]: Finished difference Result 134 states and 160 transitions. [2019-11-20 01:50:56,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 01:50:56,541 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-11-20 01:50:56,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:50:56,543 INFO L225 Difference]: With dead ends: 134 [2019-11-20 01:50:56,543 INFO L226 Difference]: Without dead ends: 132 [2019-11-20 01:50:56,543 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-11-20 01:50:56,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-11-20 01:50:56,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 90. [2019-11-20 01:50:56,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-11-20 01:50:56,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 109 transitions. [2019-11-20 01:50:56,569 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 109 transitions. Word has length 12 [2019-11-20 01:50:56,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:50:56,570 INFO L462 AbstractCegarLoop]: Abstraction has 90 states and 109 transitions. [2019-11-20 01:50:56,570 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 01:50:56,571 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 109 transitions. [2019-11-20 01:50:56,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-20 01:50:56,572 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:50:56,573 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:50:56,576 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-11-20 01:50:56,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:50:56,577 INFO L82 PathProgramCache]: Analyzing trace with hash 952355221, now seen corresponding path program 1 times [2019-11-20 01:50:56,577 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:50:56,578 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020437909] [2019-11-20 01:50:56,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:50:56,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:50:56,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:50:56,629 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020437909] [2019-11-20 01:50:56,629 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:50:56,629 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 01:50:56,629 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322820974] [2019-11-20 01:50:56,630 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 01:50:56,630 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:50:56,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 01:50:56,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 01:50:56,630 INFO L87 Difference]: Start difference. First operand 90 states and 109 transitions. Second operand 4 states. [2019-11-20 01:50:56,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:50:56,740 INFO L93 Difference]: Finished difference Result 178 states and 209 transitions. [2019-11-20 01:50:56,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 01:50:56,741 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-11-20 01:50:56,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:50:56,743 INFO L225 Difference]: With dead ends: 178 [2019-11-20 01:50:56,743 INFO L226 Difference]: Without dead ends: 176 [2019-11-20 01:50:56,744 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-11-20 01:50:56,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2019-11-20 01:50:56,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 89. [2019-11-20 01:50:56,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-11-20 01:50:56,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 108 transitions. [2019-11-20 01:50:56,757 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 108 transitions. Word has length 14 [2019-11-20 01:50:56,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:50:56,758 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 108 transitions. [2019-11-20 01:50:56,758 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 01:50:56,759 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 108 transitions. [2019-11-20 01:50:56,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-20 01:50:56,764 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:50:56,765 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:50:56,765 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-11-20 01:50:56,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:50:56,766 INFO L82 PathProgramCache]: Analyzing trace with hash -513187613, now seen corresponding path program 1 times [2019-11-20 01:50:56,766 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:50:56,767 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037732499] [2019-11-20 01:50:56,767 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:50:56,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:50:56,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:50:56,841 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037732499] [2019-11-20 01:50:56,841 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:50:56,842 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 01:50:56,842 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098029136] [2019-11-20 01:50:56,842 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 01:50:56,842 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:50:56,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 01:50:56,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 01:50:56,843 INFO L87 Difference]: Start difference. First operand 89 states and 108 transitions. Second operand 4 states. [2019-11-20 01:50:56,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:50:56,920 INFO L93 Difference]: Finished difference Result 131 states and 156 transitions. [2019-11-20 01:50:56,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 01:50:56,921 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-11-20 01:50:56,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:50:56,923 INFO L225 Difference]: With dead ends: 131 [2019-11-20 01:50:56,923 INFO L226 Difference]: Without dead ends: 129 [2019-11-20 01:50:56,924 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-11-20 01:50:56,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-11-20 01:50:56,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 84. [2019-11-20 01:50:56,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-11-20 01:50:56,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 103 transitions. [2019-11-20 01:50:56,939 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 103 transitions. Word has length 14 [2019-11-20 01:50:56,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:50:56,940 INFO L462 AbstractCegarLoop]: Abstraction has 84 states and 103 transitions. [2019-11-20 01:50:56,940 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 01:50:56,940 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 103 transitions. [2019-11-20 01:50:56,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-20 01:50:56,941 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:50:56,941 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:50:56,942 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-11-20 01:50:56,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:50:56,943 INFO L82 PathProgramCache]: Analyzing trace with hash 2134556229, now seen corresponding path program 1 times [2019-11-20 01:50:56,944 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:50:56,944 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461997122] [2019-11-20 01:50:56,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:50:56,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:50:56,994 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:50:56,995 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461997122] [2019-11-20 01:50:56,995 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:50:56,995 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 01:50:56,995 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143962094] [2019-11-20 01:50:56,996 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 01:50:56,996 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:50:56,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 01:50:56,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 01:50:56,997 INFO L87 Difference]: Start difference. First operand 84 states and 103 transitions. Second operand 4 states. [2019-11-20 01:50:57,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:50:57,076 INFO L93 Difference]: Finished difference Result 168 states and 199 transitions. [2019-11-20 01:50:57,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 01:50:57,077 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-11-20 01:50:57,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:50:57,078 INFO L225 Difference]: With dead ends: 168 [2019-11-20 01:50:57,078 INFO L226 Difference]: Without dead ends: 166 [2019-11-20 01:50:57,079 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-11-20 01:50:57,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-11-20 01:50:57,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 74. [2019-11-20 01:50:57,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-11-20 01:50:57,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 91 transitions. [2019-11-20 01:50:57,085 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 91 transitions. Word has length 15 [2019-11-20 01:50:57,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:50:57,085 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 91 transitions. [2019-11-20 01:50:57,085 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 01:50:57,085 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 91 transitions. [2019-11-20 01:50:57,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-20 01:50:57,086 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:50:57,086 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:50:57,086 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-11-20 01:50:57,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:50:57,087 INFO L82 PathProgramCache]: Analyzing trace with hash -324557016, now seen corresponding path program 1 times [2019-11-20 01:50:57,087 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:50:57,087 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851146220] [2019-11-20 01:50:57,087 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:50:57,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:50:57,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:50:57,285 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851146220] [2019-11-20 01:50:57,285 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:50:57,285 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-20 01:50:57,286 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258680552] [2019-11-20 01:50:57,286 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-20 01:50:57,286 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:50:57,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-20 01:50:57,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-11-20 01:50:57,287 INFO L87 Difference]: Start difference. First operand 74 states and 91 transitions. Second operand 9 states. [2019-11-20 01:50:57,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:50:57,577 INFO L93 Difference]: Finished difference Result 118 states and 141 transitions. [2019-11-20 01:50:57,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-20 01:50:57,578 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2019-11-20 01:50:57,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:50:57,579 INFO L225 Difference]: With dead ends: 118 [2019-11-20 01:50:57,579 INFO L226 Difference]: Without dead ends: 76 [2019-11-20 01:50:57,579 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2019-11-20 01:50:57,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-11-20 01:50:57,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2019-11-20 01:50:57,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-11-20 01:50:57,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 89 transitions. [2019-11-20 01:50:57,593 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 89 transitions. Word has length 17 [2019-11-20 01:50:57,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:50:57,593 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 89 transitions. [2019-11-20 01:50:57,594 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-20 01:50:57,594 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 89 transitions. [2019-11-20 01:50:57,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-20 01:50:57,595 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:50:57,595 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-11-20 01:50:57,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-11-20 01:50:57,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:50:57,597 INFO L82 PathProgramCache]: Analyzing trace with hash 1112826903, now seen corresponding path program 1 times [2019-11-20 01:50:57,597 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:50:57,597 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598007796] [2019-11-20 01:50:57,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:50:57,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:50:57,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:50:57,793 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598007796] [2019-11-20 01:50:57,793 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:50:57,793 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-20 01:50:57,794 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715656355] [2019-11-20 01:50:57,794 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-20 01:50:57,794 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:50:57,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 01:50:57,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-20 01:50:57,795 INFO L87 Difference]: Start difference. First operand 74 states and 89 transitions. Second operand 8 states. [2019-11-20 01:50:58,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:50:58,088 INFO L93 Difference]: Finished difference Result 170 states and 193 transitions. [2019-11-20 01:50:58,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-20 01:50:58,089 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2019-11-20 01:50:58,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:50:58,090 INFO L225 Difference]: With dead ends: 170 [2019-11-20 01:50:58,090 INFO L226 Difference]: Without dead ends: 140 [2019-11-20 01:50:58,091 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2019-11-20 01:50:58,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-11-20 01:50:58,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 92. [2019-11-20 01:50:58,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-11-20 01:50:58,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 112 transitions. [2019-11-20 01:50:58,102 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 112 transitions. Word has length 21 [2019-11-20 01:50:58,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:50:58,103 INFO L462 AbstractCegarLoop]: Abstraction has 92 states and 112 transitions. [2019-11-20 01:50:58,103 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-20 01:50:58,103 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 112 transitions. [2019-11-20 01:50:58,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-20 01:50:58,104 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:50:58,104 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, 1] [2019-11-20 01:50:58,105 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-11-20 01:50:58,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:50:58,105 INFO L82 PathProgramCache]: Analyzing trace with hash -2013141521, now seen corresponding path program 1 times [2019-11-20 01:50:58,106 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:50:58,106 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433406940] [2019-11-20 01:50:58,106 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:50:58,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:50:58,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:50:58,340 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433406940] [2019-11-20 01:50:58,340 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:50:58,340 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-20 01:50:58,340 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796288315] [2019-11-20 01:50:58,341 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-20 01:50:58,341 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:50:58,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 01:50:58,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-20 01:50:58,342 INFO L87 Difference]: Start difference. First operand 92 states and 112 transitions. Second operand 8 states. [2019-11-20 01:50:58,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:50:58,676 INFO L93 Difference]: Finished difference Result 240 states and 281 transitions. [2019-11-20 01:50:58,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-20 01:50:58,677 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2019-11-20 01:50:58,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:50:58,678 INFO L225 Difference]: With dead ends: 240 [2019-11-20 01:50:58,678 INFO L226 Difference]: Without dead ends: 192 [2019-11-20 01:50:58,681 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-11-20 01:50:58,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2019-11-20 01:50:58,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 132. [2019-11-20 01:50:58,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-11-20 01:50:58,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 163 transitions. [2019-11-20 01:50:58,692 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 163 transitions. Word has length 23 [2019-11-20 01:50:58,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:50:58,693 INFO L462 AbstractCegarLoop]: Abstraction has 132 states and 163 transitions. [2019-11-20 01:50:58,693 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-20 01:50:58,694 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 163 transitions. [2019-11-20 01:50:58,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-20 01:50:58,694 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:50:58,694 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, 1] [2019-11-20 01:50:58,695 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-11-20 01:50:58,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:50:58,695 INFO L82 PathProgramCache]: Analyzing trace with hash -1836591731, now seen corresponding path program 1 times [2019-11-20 01:50:58,695 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:50:58,696 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643306413] [2019-11-20 01:50:58,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:50:58,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:50:58,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:50:58,839 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643306413] [2019-11-20 01:50:58,839 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:50:58,839 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-20 01:50:58,839 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283884500] [2019-11-20 01:50:58,840 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-20 01:50:58,840 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:50:58,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 01:50:58,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-20 01:50:58,841 INFO L87 Difference]: Start difference. First operand 132 states and 163 transitions. Second operand 8 states. [2019-11-20 01:50:59,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:50:59,067 INFO L93 Difference]: Finished difference Result 166 states and 197 transitions. [2019-11-20 01:50:59,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-20 01:50:59,068 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2019-11-20 01:50:59,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:50:59,069 INFO L225 Difference]: With dead ends: 166 [2019-11-20 01:50:59,069 INFO L226 Difference]: Without dead ends: 92 [2019-11-20 01:50:59,070 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2019-11-20 01:50:59,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-11-20 01:50:59,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2019-11-20 01:50:59,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-11-20 01:50:59,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 110 transitions. [2019-11-20 01:50:59,077 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 110 transitions. Word has length 23 [2019-11-20 01:50:59,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:50:59,077 INFO L462 AbstractCegarLoop]: Abstraction has 92 states and 110 transitions. [2019-11-20 01:50:59,077 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-20 01:50:59,077 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 110 transitions. [2019-11-20 01:50:59,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-20 01:50:59,078 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:50:59,078 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, 1, 1, 1, 1, 1] [2019-11-20 01:50:59,078 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-11-20 01:50:59,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:50:59,079 INFO L82 PathProgramCache]: Analyzing trace with hash -1319121376, now seen corresponding path program 1 times [2019-11-20 01:50:59,079 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:50:59,081 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318878208] [2019-11-20 01:50:59,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:50:59,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:50:59,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:50:59,225 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318878208] [2019-11-20 01:50:59,225 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:50:59,225 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-20 01:50:59,225 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672719260] [2019-11-20 01:50:59,226 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-20 01:50:59,226 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:50:59,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-20 01:50:59,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-20 01:50:59,226 INFO L87 Difference]: Start difference. First operand 92 states and 110 transitions. Second operand 7 states. [2019-11-20 01:50:59,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:50:59,464 INFO L93 Difference]: Finished difference Result 308 states and 346 transitions. [2019-11-20 01:50:59,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-20 01:50:59,465 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2019-11-20 01:50:59,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:50:59,467 INFO L225 Difference]: With dead ends: 308 [2019-11-20 01:50:59,467 INFO L226 Difference]: Without dead ends: 262 [2019-11-20 01:50:59,468 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-11-20 01:50:59,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2019-11-20 01:50:59,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 132. [2019-11-20 01:50:59,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-11-20 01:50:59,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 161 transitions. [2019-11-20 01:50:59,481 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 161 transitions. Word has length 27 [2019-11-20 01:50:59,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:50:59,481 INFO L462 AbstractCegarLoop]: Abstraction has 132 states and 161 transitions. [2019-11-20 01:50:59,481 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-20 01:50:59,481 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 161 transitions. [2019-11-20 01:50:59,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-20 01:50:59,482 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:50:59,482 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, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:50:59,483 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-11-20 01:50:59,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:50:59,483 INFO L82 PathProgramCache]: Analyzing trace with hash 590911882, now seen corresponding path program 1 times [2019-11-20 01:50:59,483 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:50:59,483 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424953287] [2019-11-20 01:50:59,483 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:50:59,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:50:59,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:50:59,732 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424953287] [2019-11-20 01:50:59,732 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:50:59,732 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-20 01:50:59,733 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570455975] [2019-11-20 01:50:59,733 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-20 01:50:59,733 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:50:59,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-20 01:50:59,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-11-20 01:50:59,734 INFO L87 Difference]: Start difference. First operand 132 states and 161 transitions. Second operand 9 states. [2019-11-20 01:51:00,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:51:00,121 INFO L93 Difference]: Finished difference Result 181 states and 209 transitions. [2019-11-20 01:51:00,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-20 01:51:00,122 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2019-11-20 01:51:00,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:51:00,124 INFO L225 Difference]: With dead ends: 181 [2019-11-20 01:51:00,124 INFO L226 Difference]: Without dead ends: 180 [2019-11-20 01:51:00,124 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2019-11-20 01:51:00,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-11-20 01:51:00,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 122. [2019-11-20 01:51:00,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-11-20 01:51:00,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 147 transitions. [2019-11-20 01:51:00,136 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 147 transitions. Word has length 29 [2019-11-20 01:51:00,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:51:00,136 INFO L462 AbstractCegarLoop]: Abstraction has 122 states and 147 transitions. [2019-11-20 01:51:00,137 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-20 01:51:00,137 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 147 transitions. [2019-11-20 01:51:00,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-20 01:51:00,138 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:51:00,138 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, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:51:00,138 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-11-20 01:51:00,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:51:00,139 INFO L82 PathProgramCache]: Analyzing trace with hash 767461672, now seen corresponding path program 1 times [2019-11-20 01:51:00,139 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:51:00,139 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019079331] [2019-11-20 01:51:00,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:51:00,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:51:00,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:51:00,229 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019079331] [2019-11-20 01:51:00,229 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:51:00,230 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 01:51:00,230 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099998651] [2019-11-20 01:51:00,230 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 01:51:00,230 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:51:00,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 01:51:00,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-20 01:51:00,231 INFO L87 Difference]: Start difference. First operand 122 states and 147 transitions. Second operand 6 states. [2019-11-20 01:51:00,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:51:00,365 INFO L93 Difference]: Finished difference Result 170 states and 201 transitions. [2019-11-20 01:51:00,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 01:51:00,365 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2019-11-20 01:51:00,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:51:00,366 INFO L225 Difference]: With dead ends: 170 [2019-11-20 01:51:00,367 INFO L226 Difference]: Without dead ends: 122 [2019-11-20 01:51:00,367 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-20 01:51:00,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-11-20 01:51:00,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 119. [2019-11-20 01:51:00,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-11-20 01:51:00,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 140 transitions. [2019-11-20 01:51:00,376 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 140 transitions. Word has length 29 [2019-11-20 01:51:00,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:51:00,376 INFO L462 AbstractCegarLoop]: Abstraction has 119 states and 140 transitions. [2019-11-20 01:51:00,377 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 01:51:00,377 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 140 transitions. [2019-11-20 01:51:00,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-20 01:51:00,377 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:51:00,377 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:51:00,378 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-11-20 01:51:00,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:51:00,378 INFO L82 PathProgramCache]: Analyzing trace with hash 1093653162, now seen corresponding path program 1 times [2019-11-20 01:51:00,378 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:51:00,379 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953689222] [2019-11-20 01:51:00,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:51:00,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:51:00,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:51:00,497 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953689222] [2019-11-20 01:51:00,497 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:51:00,497 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-20 01:51:00,497 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789391793] [2019-11-20 01:51:00,498 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 01:51:00,498 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:51:00,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 01:51:00,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-20 01:51:00,499 INFO L87 Difference]: Start difference. First operand 119 states and 140 transitions. Second operand 6 states. [2019-11-20 01:51:00,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:51:00,668 INFO L93 Difference]: Finished difference Result 237 states and 261 transitions. [2019-11-20 01:51:00,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-20 01:51:00,669 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2019-11-20 01:51:00,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:51:00,672 INFO L225 Difference]: With dead ends: 237 [2019-11-20 01:51:00,672 INFO L226 Difference]: Without dead ends: 206 [2019-11-20 01:51:00,673 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-11-20 01:51:00,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2019-11-20 01:51:00,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 129. [2019-11-20 01:51:00,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-11-20 01:51:00,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 151 transitions. [2019-11-20 01:51:00,685 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 151 transitions. Word has length 31 [2019-11-20 01:51:00,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:51:00,686 INFO L462 AbstractCegarLoop]: Abstraction has 129 states and 151 transitions. [2019-11-20 01:51:00,686 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 01:51:00,686 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 151 transitions. [2019-11-20 01:51:00,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-20 01:51:00,687 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:51:00,687 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:51:00,687 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-11-20 01:51:00,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:51:00,688 INFO L82 PathProgramCache]: Analyzing trace with hash 964745492, now seen corresponding path program 1 times [2019-11-20 01:51:00,688 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:51:00,688 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563292375] [2019-11-20 01:51:00,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:51:00,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 01:51:00,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 01:51:00,772 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 01:51:00,772 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-20 01:51:00,829 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 01:51:00 BoogieIcfgContainer [2019-11-20 01:51:00,829 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 01:51:00,829 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 01:51:00,830 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 01:51:00,830 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 01:51:00,831 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 01:50:55" (3/4) ... [2019-11-20 01:51:00,835 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-20 01:51:00,835 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 01:51:00,841 INFO L168 Benchmark]: Toolchain (without parser) took 6851.44 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 209.7 MB). Free memory was 946.1 MB in the beginning and 897.2 MB in the end (delta: 48.9 MB). Peak memory consumption was 258.6 MB. Max. memory is 11.5 GB. [2019-11-20 01:51:00,842 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 01:51:00,842 INFO L168 Benchmark]: CACSL2BoogieTranslator took 432.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -184.2 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. [2019-11-20 01:51:00,844 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.00 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.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-11-20 01:51:00,844 INFO L168 Benchmark]: Boogie Preprocessor took 36.75 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 01:51:00,847 INFO L168 Benchmark]: RCFGBuilder took 739.30 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: 43.9 MB). Peak memory consumption was 43.9 MB. Max. memory is 11.5 GB. [2019-11-20 01:51:00,847 INFO L168 Benchmark]: TraceAbstraction took 5567.95 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 70.8 MB). Free memory was 1.1 GB in the beginning and 897.2 MB in the end (delta: 182.3 MB). Peak memory consumption was 253.1 MB. Max. memory is 11.5 GB. [2019-11-20 01:51:00,848 INFO L168 Benchmark]: Witness Printer took 5.50 ms. Allocated memory is still 1.2 GB. Free memory is still 897.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 01:51:00,852 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.25 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 432.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -184.2 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 62.00 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.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 36.75 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 739.30 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: 43.9 MB). Peak memory consumption was 43.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5567.95 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 70.8 MB). Free memory was 1.1 GB in the beginning and 897.2 MB in the end (delta: 182.3 MB). Peak memory consumption was 253.1 MB. Max. memory is 11.5 GB. * Witness Printer took 5.50 ms. Allocated memory is still 1.2 GB. Free memory is still 897.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 102]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of bitwiseOr at line 100, overapproximation of bitwiseAnd at line 101. Possible FailurePath: [L216] unsigned int a ; [L217] unsigned int ma = __VERIFIER_nondet_uint(); [L218] signed char ea = __VERIFIER_nondet_char(); [L219] unsigned int b ; [L220] unsigned int mb = __VERIFIER_nondet_uint(); [L221] signed char eb = __VERIFIER_nondet_char(); [L222] unsigned int r_add ; [L223] unsigned int zero ; [L224] int sa ; [L225] int sb ; [L226] int tmp ; [L227] int tmp___0 ; [L228] int tmp___1 ; [L229] int tmp___2 ; [L230] int tmp___3 ; [L231] int tmp___4 ; [L232] int tmp___5 ; [L233] int tmp___6 ; [L234] int tmp___7 ; [L235] int tmp___8 ; [L236] int tmp___9 ; [L237] int __retres23 ; [L15] unsigned int res ; [L16] unsigned int __retres4 ; [L19] COND TRUE ! m [L20] __retres4 = 0U [L70] return (__retres4); [L241] zero = base2flt(0, 0) [L15] unsigned int res ; [L16] unsigned int __retres4 ; [L19] COND FALSE !(! m) [L25] COND FALSE !(m < 1U << 24U) [L47] COND TRUE 1 [L49] COND FALSE !(m >= 1U << 25U) [L66] m = m & ~ (1U << 24U) [L67] EXPR e + 128 [L67] res = m | ((unsigned int )(e + 128) << 24U) [L68] __retres4 = res [L70] return (__retres4); [L242] a = base2flt(ma, ea) [L15] unsigned int res ; [L16] unsigned int __retres4 ; [L19] COND FALSE !(! m) [L25] COND FALSE !(m < 1U << 24U) [L47] COND TRUE 1 [L49] COND TRUE m >= 1U << 25U [L54] COND TRUE e >= 127 [L55] __retres4 = 4294967295U [L70] return (__retres4); [L243] b = base2flt(mb, eb) [L245] COND FALSE !(a < zero) [L248] COND TRUE a > zero [L249] tmp = 1 [L253] sa = tmp [L255] COND FALSE !(b < zero) [L258] COND TRUE b > zero [L259] tmp___0 = 1 [L263] sb = tmp___0 [L74] unsigned int res ; [L75] unsigned int ma ; [L76] unsigned int mb ; [L77] unsigned int delta ; [L78] int ea ; [L79] int eb ; [L80] unsigned int tmp ; [L81] unsigned int __retres10 ; [L84] COND TRUE a < b [L85] tmp = a [L86] a = b [L87] b = tmp [L91] COND FALSE !(! b) [L98] ma = a & ((1U << 24U) - 1U) [L99] EXPR (int )(a >> 24U) - 128 [L99] ea = (int )(a >> 24U) - 128 [L100] ma = ma | (1U << 24U) [L101] mb = b & ((1U << 24U) - 1U) [L102] (int )(b >> 24U) - 128 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 144 locations, 28 error locations. Result: UNSAFE, OverallTime: 5.4s, OverallIterations: 18, TraceHistogramMax: 2, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1907 SDtfs, 2273 SDslu, 4236 SDs, 0 SdLazy, 1090 SolverSat, 133 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 120 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=144occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 17 MinimizatonAttempts, 808 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 330 NumberOfCodeBlocks, 330 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 280 ConstructedInterpolants, 0 QuantifiedInterpolants, 33514 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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...