./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/busybox-1.22.0/hostid.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_c10be5a7-1ff0-46fa-a173-ee2f0013a2c9/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_c10be5a7-1ff0-46fa-a173-ee2f0013a2c9/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_c10be5a7-1ff0-46fa-a173-ee2f0013a2c9/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_c10be5a7-1ff0-46fa-a173-ee2f0013a2c9/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/busybox-1.22.0/hostid.i -s /tmp/vcloud-vcloud-master/worker/run_dir_c10be5a7-1ff0-46fa-a173-ee2f0013a2c9/bin/uautomizer/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_c10be5a7-1ff0-46fa-a173-ee2f0013a2c9/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 64bit --witnessprinter.graph.data.programhash 8604245f5a4dee50703be8e530b281b92acb588c ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 12:47:13,044 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 12:47:13,046 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 12:47:13,056 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 12:47:13,056 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 12:47:13,057 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 12:47:13,058 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 12:47:13,060 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 12:47:13,062 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 12:47:13,063 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 12:47:13,064 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 12:47:13,065 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 12:47:13,065 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 12:47:13,066 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 12:47:13,067 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 12:47:13,068 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 12:47:13,069 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 12:47:13,070 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 12:47:13,071 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 12:47:13,073 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 12:47:13,075 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 12:47:13,076 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 12:47:13,077 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 12:47:13,077 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 12:47:13,079 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 12:47:13,079 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 12:47:13,080 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 12:47:13,080 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 12:47:13,081 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 12:47:13,082 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 12:47:13,082 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 12:47:13,082 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 12:47:13,083 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 12:47:13,083 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 12:47:13,084 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 12:47:13,084 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 12:47:13,084 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 12:47:13,085 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 12:47:13,085 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 12:47:13,085 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 12:47:13,086 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 12:47:13,086 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_c10be5a7-1ff0-46fa-a173-ee2f0013a2c9/bin/uautomizer/config/svcomp-Overflow-64bit-Automizer_Default.epf [2019-12-07 12:47:13,095 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 12:47:13,095 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 12:47:13,096 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 12:47:13,096 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 12:47:13,096 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 12:47:13,096 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 12:47:13,096 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 12:47:13,097 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 12:47:13,097 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 12:47:13,097 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 12:47:13,097 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 12:47:13,097 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 12:47:13,097 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2019-12-07 12:47:13,097 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 12:47:13,097 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 12:47:13,097 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 12:47:13,097 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 12:47:13,098 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 12:47:13,098 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 12:47:13,098 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 12:47:13,098 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 12:47:13,098 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 12:47:13,098 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 12:47:13,098 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 12:47:13,099 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 12:47:13,099 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 12:47:13,099 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 12:47:13,099 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 12:47:13,099 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_c10be5a7-1ff0-46fa-a173-ee2f0013a2c9/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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8604245f5a4dee50703be8e530b281b92acb588c [2019-12-07 12:47:13,202 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 12:47:13,212 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 12:47:13,214 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 12:47:13,216 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 12:47:13,216 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 12:47:13,217 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_c10be5a7-1ff0-46fa-a173-ee2f0013a2c9/bin/uautomizer/../../sv-benchmarks/c/busybox-1.22.0/hostid.i [2019-12-07 12:47:13,265 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c10be5a7-1ff0-46fa-a173-ee2f0013a2c9/bin/uautomizer/data/7364d4a14/c44f5842a600444d918e3c059d0eed1d/FLAG5061333b8 [2019-12-07 12:47:13,744 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 12:47:13,744 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_c10be5a7-1ff0-46fa-a173-ee2f0013a2c9/sv-benchmarks/c/busybox-1.22.0/hostid.i [2019-12-07 12:47:13,758 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c10be5a7-1ff0-46fa-a173-ee2f0013a2c9/bin/uautomizer/data/7364d4a14/c44f5842a600444d918e3c059d0eed1d/FLAG5061333b8 [2019-12-07 12:47:14,041 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_c10be5a7-1ff0-46fa-a173-ee2f0013a2c9/bin/uautomizer/data/7364d4a14/c44f5842a600444d918e3c059d0eed1d [2019-12-07 12:47:14,045 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 12:47:14,047 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 12:47:14,048 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 12:47:14,048 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 12:47:14,053 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 12:47:14,054 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:47:14" (1/1) ... [2019-12-07 12:47:14,057 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@640ec1cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:47:14, skipping insertion in model container [2019-12-07 12:47:14,058 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:47:14" (1/1) ... [2019-12-07 12:47:14,067 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 12:47:14,138 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 12:47:14,691 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 12:47:14,700 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 12:47:14,749 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 12:47:14,949 INFO L208 MainTranslator]: Completed translation [2019-12-07 12:47:14,949 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:47:14 WrapperNode [2019-12-07 12:47:14,949 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 12:47:14,950 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 12:47:14,950 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 12:47:14,950 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 12:47:14,956 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:47:14" (1/1) ... [2019-12-07 12:47:14,981 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:47:14" (1/1) ... [2019-12-07 12:47:15,003 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 12:47:15,004 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 12:47:15,004 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 12:47:15,004 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 12:47:15,011 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:47:14" (1/1) ... [2019-12-07 12:47:15,011 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:47:14" (1/1) ... [2019-12-07 12:47:15,015 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:47:14" (1/1) ... [2019-12-07 12:47:15,015 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:47:14" (1/1) ... [2019-12-07 12:47:15,025 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:47:14" (1/1) ... [2019-12-07 12:47:15,029 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:47:14" (1/1) ... [2019-12-07 12:47:15,033 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:47:14" (1/1) ... [2019-12-07 12:47:15,037 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 12:47:15,038 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 12:47:15,038 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 12:47:15,038 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 12:47:15,038 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:47:14" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c10be5a7-1ff0-46fa-a173-ee2f0013a2c9/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-12-07 12:47:15,088 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 12:47:15,088 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 12:47:15,088 INFO L130 BoogieDeclarations]: Found specification of procedure fflush [2019-12-07 12:47:15,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 12:47:15,088 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 12:47:15,088 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 12:47:15,088 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 12:47:15,089 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 12:47:15,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 12:47:15,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-12-07 12:47:15,434 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 12:47:15,434 INFO L287 CfgBuilder]: Removed 16 assume(true) statements. [2019-12-07 12:47:15,435 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:47:15 BoogieIcfgContainer [2019-12-07 12:47:15,435 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 12:47:15,436 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 12:47:15,436 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 12:47:15,438 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 12:47:15,438 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 12:47:14" (1/3) ... [2019-12-07 12:47:15,439 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@642014b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:47:15, skipping insertion in model container [2019-12-07 12:47:15,439 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:47:14" (2/3) ... [2019-12-07 12:47:15,439 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@642014b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:47:15, skipping insertion in model container [2019-12-07 12:47:15,440 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:47:15" (3/3) ... [2019-12-07 12:47:15,441 INFO L109 eAbstractionObserver]: Analyzing ICFG hostid.i [2019-12-07 12:47:15,448 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 12:47:15,453 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2019-12-07 12:47:15,460 INFO L249 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2019-12-07 12:47:15,476 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 12:47:15,476 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 12:47:15,476 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 12:47:15,476 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 12:47:15,476 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 12:47:15,476 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 12:47:15,477 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 12:47:15,477 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 12:47:15,488 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states. [2019-12-07 12:47:15,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-12-07 12:47:15,492 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:47:15,493 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-12-07 12:47:15,493 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 12:47:15,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:47:15,497 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2019-12-07 12:47:15,502 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:47:15,503 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599715029] [2019-12-07 12:47:15,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:47:15,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:47:15,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:47:15,701 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599715029] [2019-12-07 12:47:15,702 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:47:15,702 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:47:15,703 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444304878] [2019-12-07 12:47:15,706 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:47:15,706 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:47:15,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:47:15,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:47:15,717 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 3 states. [2019-12-07 12:47:15,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:47:15,749 INFO L93 Difference]: Finished difference Result 92 states and 108 transitions. [2019-12-07 12:47:15,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:47:15,750 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-12-07 12:47:15,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:47:15,757 INFO L225 Difference]: With dead ends: 92 [2019-12-07 12:47:15,757 INFO L226 Difference]: Without dead ends: 45 [2019-12-07 12:47:15,759 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:47:15,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-12-07 12:47:15,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-12-07 12:47:15,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-12-07 12:47:15,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2019-12-07 12:47:15,785 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 4 [2019-12-07 12:47:15,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:47:15,785 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2019-12-07 12:47:15,785 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:47:15,785 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2019-12-07 12:47:15,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 12:47:15,786 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:47:15,786 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-07 12:47:15,786 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 12:47:15,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:47:15,786 INFO L82 PathProgramCache]: Analyzing trace with hash 28698760, now seen corresponding path program 1 times [2019-12-07 12:47:15,787 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:47:15,787 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789592170] [2019-12-07 12:47:15,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:47:15,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:47:15,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:47:15,851 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789592170] [2019-12-07 12:47:15,851 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:47:15,851 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:47:15,852 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89987646] [2019-12-07 12:47:15,853 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:47:15,853 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:47:15,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:47:15,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:47:15,853 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 3 states. [2019-12-07 12:47:15,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:47:15,871 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2019-12-07 12:47:15,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:47:15,872 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-07 12:47:15,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:47:15,873 INFO L225 Difference]: With dead ends: 48 [2019-12-07 12:47:15,873 INFO L226 Difference]: Without dead ends: 47 [2019-12-07 12:47:15,874 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:47:15,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-12-07 12:47:15,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-12-07 12:47:15,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-12-07 12:47:15,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2019-12-07 12:47:15,881 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 5 [2019-12-07 12:47:15,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:47:15,881 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2019-12-07 12:47:15,881 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:47:15,881 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2019-12-07 12:47:15,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-07 12:47:15,882 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:47:15,882 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:47:15,882 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 12:47:15,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:47:15,883 INFO L82 PathProgramCache]: Analyzing trace with hash 266305344, now seen corresponding path program 1 times [2019-12-07 12:47:15,883 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:47:15,883 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592695990] [2019-12-07 12:47:15,883 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:47:15,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:47:15,947 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 12:47:15,948 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592695990] [2019-12-07 12:47:15,948 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:47:15,948 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:47:15,948 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501614060] [2019-12-07 12:47:15,948 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:47:15,949 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:47:15,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:47:15,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:47:15,949 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 3 states. [2019-12-07 12:47:15,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:47:15,991 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2019-12-07 12:47:15,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:47:15,991 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-12-07 12:47:15,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:47:15,992 INFO L225 Difference]: With dead ends: 47 [2019-12-07 12:47:15,992 INFO L226 Difference]: Without dead ends: 43 [2019-12-07 12:47:15,992 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:47:15,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-12-07 12:47:15,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-12-07 12:47:15,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-12-07 12:47:15,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2019-12-07 12:47:15,998 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 8 [2019-12-07 12:47:15,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:47:15,998 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2019-12-07 12:47:15,998 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:47:15,998 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2019-12-07 12:47:15,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-07 12:47:15,999 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:47:15,999 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2019-12-07 12:47:15,999 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 12:47:15,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:47:16,000 INFO L82 PathProgramCache]: Analyzing trace with hash 266307074, now seen corresponding path program 1 times [2019-12-07 12:47:16,000 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:47:16,000 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165906770] [2019-12-07 12:47:16,000 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:47:16,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:47:16,047 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:47:16,047 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165906770] [2019-12-07 12:47:16,048 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:47:16,048 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:47:16,048 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726686499] [2019-12-07 12:47:16,048 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:47:16,048 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:47:16,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:47:16,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:47:16,049 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 3 states. [2019-12-07 12:47:16,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:47:16,063 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2019-12-07 12:47:16,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:47:16,063 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-12-07 12:47:16,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:47:16,064 INFO L225 Difference]: With dead ends: 43 [2019-12-07 12:47:16,064 INFO L226 Difference]: Without dead ends: 42 [2019-12-07 12:47:16,064 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:47:16,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-12-07 12:47:16,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2019-12-07 12:47:16,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-12-07 12:47:16,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2019-12-07 12:47:16,069 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 8 [2019-12-07 12:47:16,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:47:16,069 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2019-12-07 12:47:16,069 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:47:16,069 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2019-12-07 12:47:16,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 12:47:16,070 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:47:16,070 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:47:16,070 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 12:47:16,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:47:16,071 INFO L82 PathProgramCache]: Analyzing trace with hash -334468875, now seen corresponding path program 1 times [2019-12-07 12:47:16,071 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:47:16,071 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872663087] [2019-12-07 12:47:16,071 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:47:16,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:47:16,115 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 12:47:16,115 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872663087] [2019-12-07 12:47:16,116 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:47:16,116 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:47:16,116 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87250322] [2019-12-07 12:47:16,116 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:47:16,116 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:47:16,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:47:16,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:47:16,117 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 3 states. [2019-12-07 12:47:16,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:47:16,159 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2019-12-07 12:47:16,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:47:16,160 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-07 12:47:16,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:47:16,160 INFO L225 Difference]: With dead ends: 40 [2019-12-07 12:47:16,160 INFO L226 Difference]: Without dead ends: 38 [2019-12-07 12:47:16,161 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:47:16,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-12-07 12:47:16,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-12-07 12:47:16,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-12-07 12:47:16,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2019-12-07 12:47:16,165 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 9 [2019-12-07 12:47:16,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:47:16,166 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2019-12-07 12:47:16,166 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:47:16,166 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2019-12-07 12:47:16,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 12:47:16,166 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:47:16,166 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:47:16,166 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 12:47:16,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:47:16,167 INFO L82 PathProgramCache]: Analyzing trace with hash 697960087, now seen corresponding path program 1 times [2019-12-07 12:47:16,167 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:47:16,167 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878313782] [2019-12-07 12:47:16,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:47:16,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:47:16,215 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 12:47:16,216 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878313782] [2019-12-07 12:47:16,216 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:47:16,216 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:47:16,216 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779682848] [2019-12-07 12:47:16,216 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:47:16,217 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:47:16,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:47:16,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:47:16,217 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand 3 states. [2019-12-07 12:47:16,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:47:16,257 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2019-12-07 12:47:16,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:47:16,258 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-07 12:47:16,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:47:16,258 INFO L225 Difference]: With dead ends: 38 [2019-12-07 12:47:16,259 INFO L226 Difference]: Without dead ends: 36 [2019-12-07 12:47:16,259 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:47:16,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-12-07 12:47:16,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-12-07 12:47:16,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-12-07 12:47:16,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2019-12-07 12:47:16,263 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 11 [2019-12-07 12:47:16,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:47:16,264 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2019-12-07 12:47:16,264 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:47:16,264 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2019-12-07 12:47:16,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 12:47:16,264 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:47:16,265 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:47:16,265 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 12:47:16,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:47:16,265 INFO L82 PathProgramCache]: Analyzing trace with hash -557684678, now seen corresponding path program 1 times [2019-12-07 12:47:16,265 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:47:16,266 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390312980] [2019-12-07 12:47:16,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:47:16,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:47:16,316 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 12:47:16,316 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390312980] [2019-12-07 12:47:16,316 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:47:16,316 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:47:16,316 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295017282] [2019-12-07 12:47:16,316 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:47:16,317 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:47:16,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:47:16,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:47:16,317 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand 3 states. [2019-12-07 12:47:16,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:47:16,343 INFO L93 Difference]: Finished difference Result 60 states and 70 transitions. [2019-12-07 12:47:16,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:47:16,344 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-07 12:47:16,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:47:16,344 INFO L225 Difference]: With dead ends: 60 [2019-12-07 12:47:16,344 INFO L226 Difference]: Without dead ends: 39 [2019-12-07 12:47:16,345 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:47:16,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-12-07 12:47:16,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-12-07 12:47:16,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-12-07 12:47:16,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2019-12-07 12:47:16,348 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 18 [2019-12-07 12:47:16,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:47:16,348 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2019-12-07 12:47:16,348 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:47:16,348 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2019-12-07 12:47:16,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 12:47:16,349 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:47:16,349 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:47:16,349 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 12:47:16,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:47:16,349 INFO L82 PathProgramCache]: Analyzing trace with hash -1049017679, now seen corresponding path program 1 times [2019-12-07 12:47:16,349 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:47:16,349 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979825239] [2019-12-07 12:47:16,349 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:47:16,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:47:16,411 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 12:47:16,411 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979825239] [2019-12-07 12:47:16,411 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:47:16,411 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:47:16,412 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144827997] [2019-12-07 12:47:16,412 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:47:16,412 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:47:16,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:47:16,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:47:16,412 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 4 states. [2019-12-07 12:47:16,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:47:16,487 INFO L93 Difference]: Finished difference Result 51 states and 57 transitions. [2019-12-07 12:47:16,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:47:16,488 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-12-07 12:47:16,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:47:16,489 INFO L225 Difference]: With dead ends: 51 [2019-12-07 12:47:16,489 INFO L226 Difference]: Without dead ends: 50 [2019-12-07 12:47:16,489 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:47:16,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-12-07 12:47:16,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 38. [2019-12-07 12:47:16,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-12-07 12:47:16,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2019-12-07 12:47:16,493 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 21 [2019-12-07 12:47:16,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:47:16,493 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2019-12-07 12:47:16,493 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:47:16,493 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2019-12-07 12:47:16,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 12:47:16,494 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:47:16,494 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:47:16,495 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 12:47:16,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:47:16,495 INFO L82 PathProgramCache]: Analyzing trace with hash -1049017624, now seen corresponding path program 1 times [2019-12-07 12:47:16,495 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:47:16,495 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109793321] [2019-12-07 12:47:16,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:47:16,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:47:16,542 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 12:47:16,543 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109793321] [2019-12-07 12:47:16,543 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:47:16,543 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:47:16,543 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470929935] [2019-12-07 12:47:16,543 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:47:16,543 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:47:16,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:47:16,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:47:16,544 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand 3 states. [2019-12-07 12:47:16,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:47:16,565 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2019-12-07 12:47:16,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:47:16,565 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-12-07 12:47:16,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:47:16,566 INFO L225 Difference]: With dead ends: 38 [2019-12-07 12:47:16,566 INFO L226 Difference]: Without dead ends: 37 [2019-12-07 12:47:16,566 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:47:16,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-12-07 12:47:16,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-12-07 12:47:16,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-12-07 12:47:16,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2019-12-07 12:47:16,570 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 21 [2019-12-07 12:47:16,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:47:16,570 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2019-12-07 12:47:16,570 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:47:16,571 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2019-12-07 12:47:16,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 12:47:16,571 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:47:16,571 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:47:16,572 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 12:47:16,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:47:16,572 INFO L82 PathProgramCache]: Analyzing trace with hash 1840190412, now seen corresponding path program 1 times [2019-12-07 12:47:16,572 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:47:16,572 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611558483] [2019-12-07 12:47:16,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:47:16,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:47:16,620 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 12:47:16,620 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611558483] [2019-12-07 12:47:16,621 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:47:16,621 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:47:16,621 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488170635] [2019-12-07 12:47:16,621 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:47:16,621 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:47:16,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:47:16,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:47:16,622 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 3 states. [2019-12-07 12:47:16,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:47:16,663 INFO L93 Difference]: Finished difference Result 59 states and 66 transitions. [2019-12-07 12:47:16,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:47:16,663 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-12-07 12:47:16,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:47:16,664 INFO L225 Difference]: With dead ends: 59 [2019-12-07 12:47:16,664 INFO L226 Difference]: Without dead ends: 58 [2019-12-07 12:47:16,664 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:47:16,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-12-07 12:47:16,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 46. [2019-12-07 12:47:16,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-12-07 12:47:16,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2019-12-07 12:47:16,669 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 22 [2019-12-07 12:47:16,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:47:16,669 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2019-12-07 12:47:16,669 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:47:16,669 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2019-12-07 12:47:16,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 12:47:16,669 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:47:16,670 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:47:16,670 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 12:47:16,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:47:16,670 INFO L82 PathProgramCache]: Analyzing trace with hash 1840192110, now seen corresponding path program 1 times [2019-12-07 12:47:16,670 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:47:16,670 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236098967] [2019-12-07 12:47:16,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:47:16,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:47:16,705 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 12:47:16,705 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236098967] [2019-12-07 12:47:16,705 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:47:16,705 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:47:16,706 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142987822] [2019-12-07 12:47:16,706 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:47:16,706 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:47:16,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:47:16,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:47:16,707 INFO L87 Difference]: Start difference. First operand 46 states and 53 transitions. Second operand 3 states. [2019-12-07 12:47:16,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:47:16,724 INFO L93 Difference]: Finished difference Result 57 states and 65 transitions. [2019-12-07 12:47:16,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:47:16,725 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-12-07 12:47:16,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:47:16,726 INFO L225 Difference]: With dead ends: 57 [2019-12-07 12:47:16,726 INFO L226 Difference]: Without dead ends: 56 [2019-12-07 12:47:16,726 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:47:16,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-12-07 12:47:16,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 41. [2019-12-07 12:47:16,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-12-07 12:47:16,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2019-12-07 12:47:16,731 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 22 [2019-12-07 12:47:16,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:47:16,731 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2019-12-07 12:47:16,731 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:47:16,732 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2019-12-07 12:47:16,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 12:47:16,732 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:47:16,732 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] [2019-12-07 12:47:16,733 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 12:47:16,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:47:16,733 INFO L82 PathProgramCache]: Analyzing trace with hash -2077877290, now seen corresponding path program 1 times [2019-12-07 12:47:16,733 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:47:16,733 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474725402] [2019-12-07 12:47:16,733 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:47:16,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:47:16,797 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 12:47:16,797 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474725402] [2019-12-07 12:47:16,797 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:47:16,798 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:47:16,798 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769983581] [2019-12-07 12:47:16,798 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:47:16,798 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:47:16,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:47:16,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:47:16,799 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand 4 states. [2019-12-07 12:47:16,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:47:16,865 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2019-12-07 12:47:16,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:47:16,865 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-12-07 12:47:16,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:47:16,865 INFO L225 Difference]: With dead ends: 42 [2019-12-07 12:47:16,866 INFO L226 Difference]: Without dead ends: 41 [2019-12-07 12:47:16,866 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:47:16,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-12-07 12:47:16,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2019-12-07 12:47:16,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-12-07 12:47:16,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2019-12-07 12:47:16,869 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 24 [2019-12-07 12:47:16,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:47:16,869 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2019-12-07 12:47:16,869 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:47:16,869 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2019-12-07 12:47:16,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 12:47:16,870 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:47:16,870 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] [2019-12-07 12:47:16,870 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 12:47:16,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:47:16,870 INFO L82 PathProgramCache]: Analyzing trace with hash 10313574, now seen corresponding path program 1 times [2019-12-07 12:47:16,870 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:47:16,870 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896767961] [2019-12-07 12:47:16,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:47:16,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:47:16,901 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 12:47:16,901 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896767961] [2019-12-07 12:47:16,902 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:47:16,902 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:47:16,902 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004947560] [2019-12-07 12:47:16,902 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:47:16,902 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:47:16,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:47:16,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:47:16,903 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. Second operand 3 states. [2019-12-07 12:47:16,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:47:16,919 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2019-12-07 12:47:16,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:47:16,919 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-12-07 12:47:16,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:47:16,920 INFO L225 Difference]: With dead ends: 44 [2019-12-07 12:47:16,920 INFO L226 Difference]: Without dead ends: 43 [2019-12-07 12:47:16,920 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:47:16,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-12-07 12:47:16,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-12-07 12:47:16,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-12-07 12:47:16,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2019-12-07 12:47:16,924 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 25 [2019-12-07 12:47:16,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:47:16,925 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2019-12-07 12:47:16,925 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:47:16,925 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2019-12-07 12:47:16,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 12:47:16,926 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:47:16,926 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:47:16,926 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 12:47:16,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:47:16,926 INFO L82 PathProgramCache]: Analyzing trace with hash -1985844013, now seen corresponding path program 1 times [2019-12-07 12:47:16,926 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:47:16,927 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828739724] [2019-12-07 12:47:16,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:47:16,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:47:16,969 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 12:47:16,969 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828739724] [2019-12-07 12:47:16,969 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:47:16,969 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:47:16,969 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274330769] [2019-12-07 12:47:16,970 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:47:16,970 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:47:16,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:47:16,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:47:16,970 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand 3 states. [2019-12-07 12:47:16,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:47:16,981 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2019-12-07 12:47:16,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:47:16,981 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-12-07 12:47:16,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:47:16,982 INFO L225 Difference]: With dead ends: 43 [2019-12-07 12:47:16,982 INFO L226 Difference]: Without dead ends: 30 [2019-12-07 12:47:16,982 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:47:16,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-12-07 12:47:16,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-12-07 12:47:16,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-12-07 12:47:16,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2019-12-07 12:47:16,985 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 28 [2019-12-07 12:47:16,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:47:16,986 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2019-12-07 12:47:16,986 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:47:16,986 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2019-12-07 12:47:16,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 12:47:16,986 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:47:16,987 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:47:16,987 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-12-07 12:47:16,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:47:16,987 INFO L82 PathProgramCache]: Analyzing trace with hash -1042497349, now seen corresponding path program 1 times [2019-12-07 12:47:16,987 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:47:16,987 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103202878] [2019-12-07 12:47:16,988 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:47:17,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:47:17,039 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 12:47:17,040 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103202878] [2019-12-07 12:47:17,040 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:47:17,040 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:47:17,040 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128199812] [2019-12-07 12:47:17,040 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:47:17,041 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:47:17,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:47:17,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:47:17,041 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand 3 states. [2019-12-07 12:47:17,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:47:17,058 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2019-12-07 12:47:17,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:47:17,059 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-12-07 12:47:17,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:47:17,059 INFO L225 Difference]: With dead ends: 30 [2019-12-07 12:47:17,059 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 12:47:17,060 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:47:17,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 12:47:17,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 12:47:17,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 12:47:17,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 12:47:17,060 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2019-12-07 12:47:17,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:47:17,061 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 12:47:17,061 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:47:17,061 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 12:47:17,061 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 12:47:17,063 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 12:47:17,368 INFO L242 CegarLoopResult]: At program point L1761(lines 1757 1762) the Hoare annotation is: (and (<= ULTIMATE.start_main_~argc~0 10000) (<= 1 ULTIMATE.start_main_~argc~0) (<= 0 (+ ULTIMATE.start_main_~i~3 2147483648))) [2019-12-07 12:47:17,368 INFO L249 CegarLoopResult]: At program point L1889(lines 1861 1890) the Hoare annotation is: true [2019-12-07 12:47:17,368 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1872) no Hoare annotation was computed. [2019-12-07 12:47:17,368 INFO L246 CegarLoopResult]: For program point L1873(line 1873) no Hoare annotation was computed. [2019-12-07 12:47:17,368 INFO L246 CegarLoopResult]: For program point L1873-1(line 1873) no Hoare annotation was computed. [2019-12-07 12:47:17,368 INFO L246 CegarLoopResult]: For program point L1873-2(line 1873) no Hoare annotation was computed. [2019-12-07 12:47:17,368 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1884) no Hoare annotation was computed. [2019-12-07 12:47:17,368 INFO L246 CegarLoopResult]: For program point L1873-3(line 1873) no Hoare annotation was computed. [2019-12-07 12:47:17,369 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1880) no Hoare annotation was computed. [2019-12-07 12:47:17,369 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1873) no Hoare annotation was computed. [2019-12-07 12:47:17,369 INFO L246 CegarLoopResult]: For program point L1865-2(lines 1865 1866) no Hoare annotation was computed. [2019-12-07 12:47:17,369 INFO L246 CegarLoopResult]: For program point L1865-3(line 1865) no Hoare annotation was computed. [2019-12-07 12:47:17,369 INFO L242 CegarLoopResult]: At program point L1865-4(lines 1865 1866) the Hoare annotation is: (<= 0 (+ ULTIMATE.start_main_~i~3 2147483648)) [2019-12-07 12:47:17,369 INFO L246 CegarLoopResult]: For program point L1865-5(lines 1865 1866) no Hoare annotation was computed. [2019-12-07 12:47:17,369 INFO L246 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2019-12-07 12:47:17,369 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1865) no Hoare annotation was computed. [2019-12-07 12:47:17,369 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-12-07 12:47:17,369 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1872) no Hoare annotation was computed. [2019-12-07 12:47:17,369 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-12-07 12:47:17,369 INFO L242 CegarLoopResult]: At program point L1779(lines 1777 1780) the Hoare annotation is: (and (<= ULTIMATE.start_main_~argc~0 10000) (<= 1 ULTIMATE.start_main_~argc~0) (<= 0 (+ ULTIMATE.start_main_~i~3 2147483648))) [2019-12-07 12:47:17,369 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1875) no Hoare annotation was computed. [2019-12-07 12:47:17,369 INFO L242 CegarLoopResult]: At program point L1775(lines 1766 1776) the Hoare annotation is: (and (<= ULTIMATE.start_main_~argc~0 10000) (<= 1 ULTIMATE.start_main_~argc~0) (<= 0 (+ ULTIMATE.start_main_~i~3 2147483648))) [2019-12-07 12:47:17,369 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1873) no Hoare annotation was computed. [2019-12-07 12:47:17,370 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1865) no Hoare annotation was computed. [2019-12-07 12:47:17,370 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 12:47:17,370 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1872) no Hoare annotation was computed. [2019-12-07 12:47:17,370 INFO L246 CegarLoopResult]: For program point L1875-2(lines 1875 1882) no Hoare annotation was computed. [2019-12-07 12:47:17,370 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1875) no Hoare annotation was computed. [2019-12-07 12:47:17,370 INFO L246 CegarLoopResult]: For program point L1875-3(line 1875) no Hoare annotation was computed. [2019-12-07 12:47:17,370 INFO L242 CegarLoopResult]: At program point L1875-4(lines 1875 1882) the Hoare annotation is: (let ((.cse0 (<= 1 ULTIMATE.start_main_~argc~0)) (.cse1 (<= ULTIMATE.start_main_~argc~0 10000)) (.cse2 (<= 0 (+ ULTIMATE.start_main_~i~3 2147483648)))) (or (and (<= 0 (+ ULTIMATE.start_main_~j~0 2147483648)) (<= 0 (+ ULTIMATE.start_main_~i~4 2147483648)) .cse0 .cse1 .cse2) (and .cse0 .cse1 .cse2 (= ULTIMATE.start_main_~i~4 0)))) [2019-12-07 12:47:17,370 INFO L246 CegarLoopResult]: For program point L1875-5(lines 1875 1882) no Hoare annotation was computed. [2019-12-07 12:47:17,370 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1873) no Hoare annotation was computed. [2019-12-07 12:47:17,370 INFO L246 CegarLoopResult]: For program point L1768(lines 1768 1769) no Hoare annotation was computed. [2019-12-07 12:47:17,370 INFO L246 CegarLoopResult]: For program point L1768-1(lines 1768 1769) no Hoare annotation was computed. [2019-12-07 12:47:17,370 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1872) no Hoare annotation was computed. [2019-12-07 12:47:17,370 INFO L246 CegarLoopResult]: For program point L1884-2(lines 1884 1885) no Hoare annotation was computed. [2019-12-07 12:47:17,370 INFO L246 CegarLoopResult]: For program point L1884-3(line 1884) no Hoare annotation was computed. [2019-12-07 12:47:17,370 INFO L242 CegarLoopResult]: At program point L1884-4(lines 1884 1885) the Hoare annotation is: (and (<= ULTIMATE.start_main_~argc~0 10000) (<= 1 ULTIMATE.start_main_~argc~0) (<= 0 (+ ULTIMATE.start_main_~i~5 2147483648)) (<= 0 (+ ULTIMATE.start_main_~i~3 2147483648))) [2019-12-07 12:47:17,371 INFO L246 CegarLoopResult]: For program point L1884-5(lines 1884 1885) no Hoare annotation was computed. [2019-12-07 12:47:17,371 INFO L246 CegarLoopResult]: For program point L1880-2(lines 1880 1881) no Hoare annotation was computed. [2019-12-07 12:47:17,371 INFO L246 CegarLoopResult]: For program point L1880-3(line 1880) no Hoare annotation was computed. [2019-12-07 12:47:17,371 INFO L242 CegarLoopResult]: At program point L1880-4(lines 1880 1881) the Hoare annotation is: (and (<= ULTIMATE.start_main_~i~4 9999) (<= 0 (+ ULTIMATE.start_main_~j~0 2147483648)) (<= 0 (+ ULTIMATE.start_main_~i~4 2147483648)) (<= ULTIMATE.start_main_~argc~0 10000) (<= 1 ULTIMATE.start_main_~argc~0) (<= 0 (+ ULTIMATE.start_main_~i~3 2147483648))) [2019-12-07 12:47:17,371 INFO L246 CegarLoopResult]: For program point L1872(line 1872) no Hoare annotation was computed. [2019-12-07 12:47:17,371 INFO L246 CegarLoopResult]: For program point L1872-1(line 1872) no Hoare annotation was computed. [2019-12-07 12:47:17,371 INFO L246 CegarLoopResult]: For program point L1872-2(line 1872) no Hoare annotation was computed. [2019-12-07 12:47:17,371 INFO L246 CegarLoopResult]: For program point L1872-3(line 1872) no Hoare annotation was computed. [2019-12-07 12:47:17,371 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1884) no Hoare annotation was computed. [2019-12-07 12:47:17,371 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1880) no Hoare annotation was computed. [2019-12-07 12:47:17,371 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1873) no Hoare annotation was computed. [2019-12-07 12:47:17,386 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 12:47:17 BoogieIcfgContainer [2019-12-07 12:47:17,386 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 12:47:17,386 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 12:47:17,387 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 12:47:17,387 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 12:47:17,387 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:47:15" (3/4) ... [2019-12-07 12:47:17,389 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 12:47:17,398 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2019-12-07 12:47:17,398 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2019-12-07 12:47:17,398 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-12-07 12:47:17,399 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-12-07 12:47:17,440 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_c10be5a7-1ff0-46fa-a173-ee2f0013a2c9/bin/uautomizer/witness.graphml [2019-12-07 12:47:17,440 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 12:47:17,441 INFO L168 Benchmark]: Toolchain (without parser) took 3394.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.1 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -168.5 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 12:47:17,442 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 960.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 12:47:17,442 INFO L168 Benchmark]: CACSL2BoogieTranslator took 901.58 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 93.3 MB). Free memory was 939.4 MB in the beginning and 918.1 MB in the end (delta: 21.3 MB). Peak memory consumption was 127.7 MB. Max. memory is 11.5 GB. [2019-12-07 12:47:17,442 INFO L168 Benchmark]: Boogie Procedure Inliner took 53.74 ms. Allocated memory is still 1.1 GB. Free memory is still 918.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 12:47:17,442 INFO L168 Benchmark]: Boogie Preprocessor took 33.60 ms. Allocated memory is still 1.1 GB. Free memory was 918.1 MB in the beginning and 912.7 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 12:47:17,442 INFO L168 Benchmark]: RCFGBuilder took 397.37 ms. Allocated memory is still 1.1 GB. Free memory was 912.7 MB in the beginning and 868.8 MB in the end (delta: 43.9 MB). Peak memory consumption was 43.9 MB. Max. memory is 11.5 GB. [2019-12-07 12:47:17,443 INFO L168 Benchmark]: TraceAbstraction took 1950.67 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 59.8 MB). Free memory was 868.8 MB in the beginning and 1.1 GB in the end (delta: -247.7 MB). Peak memory consumption was 54.9 MB. Max. memory is 11.5 GB. [2019-12-07 12:47:17,443 INFO L168 Benchmark]: Witness Printer took 53.39 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: 8.7 MB). Peak memory consumption was 8.7 MB. Max. memory is 11.5 GB. [2019-12-07 12:47:17,444 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 960.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 901.58 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 93.3 MB). Free memory was 939.4 MB in the beginning and 918.1 MB in the end (delta: 21.3 MB). Peak memory consumption was 127.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 53.74 ms. Allocated memory is still 1.1 GB. Free memory is still 918.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 33.60 ms. Allocated memory is still 1.1 GB. Free memory was 918.1 MB in the beginning and 912.7 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 397.37 ms. Allocated memory is still 1.1 GB. Free memory was 912.7 MB in the beginning and 868.8 MB in the end (delta: 43.9 MB). Peak memory consumption was 43.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1950.67 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 59.8 MB). Free memory was 868.8 MB in the beginning and 1.1 GB in the end (delta: -247.7 MB). Peak memory consumption was 54.9 MB. Max. memory is 11.5 GB. * Witness Printer took 53.39 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: 8.7 MB). Peak memory consumption was 8.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1872]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1880]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1872]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1872]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1875]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1873]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1880]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1873]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1873]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1873]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1875]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1884]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1884]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1865]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1872]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1865]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - AllSpecificationsHoldResult: All specifications hold 16 specifications checked. All of them hold - InvariantResult [Line: 1777]: Loop Invariant Derived loop invariant: (argc <= 10000 && 1 <= argc) && 0 <= i + 2147483648 - InvariantResult [Line: 1880]: Loop Invariant Derived loop invariant: ((((i <= 9999 && 0 <= j + 2147483648) && 0 <= i + 2147483648) && argc <= 10000) && 1 <= argc) && 0 <= i + 2147483648 - InvariantResult [Line: 1884]: Loop Invariant Derived loop invariant: ((argc <= 10000 && 1 <= argc) && 0 <= i + 2147483648) && 0 <= i + 2147483648 - InvariantResult [Line: 1757]: Loop Invariant Derived loop invariant: (argc <= 10000 && 1 <= argc) && 0 <= i + 2147483648 - InvariantResult [Line: 1861]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1766]: Loop Invariant Derived loop invariant: (argc <= 10000 && 1 <= argc) && 0 <= i + 2147483648 - InvariantResult [Line: 1875]: Loop Invariant Derived loop invariant: ((((0 <= j + 2147483648 && 0 <= i + 2147483648) && 1 <= argc) && argc <= 10000) && 0 <= i + 2147483648) || (((1 <= argc && argc <= 10000) && 0 <= i + 2147483648) && i == 0) - InvariantResult [Line: 1865]: Loop Invariant Derived loop invariant: 0 <= i + 2147483648 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 49 locations, 16 error locations. Result: SAFE, OverallTime: 1.5s, OverallIterations: 15, TraceHistogramMax: 2, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, HoareTripleCheckerStatistics: 484 SDtfs, 241 SDslu, 337 SDs, 0 SdLazy, 172 SolverSat, 18 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 35 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=49occurred 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.0s AutomataMinimizationTime, 15 MinimizatonAttempts, 42 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 8 PreInvPairs, 21 NumberOfFragments, 122 HoareAnnotationTreeSize, 8 FomulaSimplifications, 1186 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 167 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 255 NumberOfCodeBlocks, 255 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 240 ConstructedInterpolants, 0 QuantifiedInterpolants, 8362 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 36/36 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...