./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/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/busybox-1.22.0/hostid.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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-11-28 20:27:54,624 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 20:27:54,626 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 20:27:54,639 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 20:27:54,639 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 20:27:54,640 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 20:27:54,641 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 20:27:54,643 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 20:27:54,645 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 20:27:54,646 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 20:27:54,647 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 20:27:54,648 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 20:27:54,648 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 20:27:54,649 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 20:27:54,650 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 20:27:54,651 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 20:27:54,652 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 20:27:54,653 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 20:27:54,655 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 20:27:54,657 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 20:27:54,658 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 20:27:54,661 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 20:27:54,662 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 20:27:54,664 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 20:27:54,667 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 20:27:54,668 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 20:27:54,668 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 20:27:54,669 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 20:27:54,669 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 20:27:54,671 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 20:27:54,672 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 20:27:54,673 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 20:27:54,673 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 20:27:54,674 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 20:27:54,675 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 20:27:54,675 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 20:27:54,676 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 20:27:54,676 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 20:27:54,677 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 20:27:54,677 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 20:27:54,678 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 20:27:54,679 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2019-11-28 20:27:54,701 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 20:27:54,702 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 20:27:54,704 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 20:27:54,705 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 20:27:54,705 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 20:27:54,705 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 20:27:54,706 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 20:27:54,706 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 20:27:54,706 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 20:27:54,706 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 20:27:54,708 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 20:27:54,708 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 20:27:54,708 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2019-11-28 20:27:54,709 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 20:27:54,709 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 20:27:54,709 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 20:27:54,710 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 20:27:54,710 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 20:27:54,710 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 20:27:54,710 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 20:27:54,711 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 20:27:54,711 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 20:27:54,711 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 20:27:54,712 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 20:27:54,712 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 20:27:54,712 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 20:27:54,713 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 20:27:54,713 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 20:27:54,713 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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-11-28 20:27:55,055 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 20:27:55,066 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 20:27:55,070 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 20:27:55,073 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 20:27:55,074 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 20:27:55,074 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/hostid.i [2019-11-28 20:27:55,144 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ee6ca34d/08355dd0aa174da18f38f604d86d5db8/FLAGa9d107d2f [2019-11-28 20:27:55,752 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 20:27:55,753 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/hostid.i [2019-11-28 20:27:55,779 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ee6ca34d/08355dd0aa174da18f38f604d86d5db8/FLAGa9d107d2f [2019-11-28 20:27:55,963 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ee6ca34d/08355dd0aa174da18f38f604d86d5db8 [2019-11-28 20:27:55,966 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 20:27:55,967 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 20:27:55,968 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 20:27:55,968 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 20:27:55,971 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 20:27:55,971 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:27:55" (1/1) ... [2019-11-28 20:27:55,974 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78d69795 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:27:55, skipping insertion in model container [2019-11-28 20:27:55,974 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:27:55" (1/1) ... [2019-11-28 20:27:55,981 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 20:27:56,058 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 20:27:57,087 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:27:57,106 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 20:27:57,222 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:27:57,680 INFO L208 MainTranslator]: Completed translation [2019-11-28 20:27:57,681 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:27:57 WrapperNode [2019-11-28 20:27:57,681 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 20:27:57,682 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 20:27:57,682 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 20:27:57,682 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 20:27:57,689 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:27:57" (1/1) ... [2019-11-28 20:27:57,725 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:27:57" (1/1) ... [2019-11-28 20:27:57,759 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 20:27:57,760 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 20:27:57,760 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 20:27:57,760 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 20:27:57,774 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:27:57" (1/1) ... [2019-11-28 20:27:57,774 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:27:57" (1/1) ... [2019-11-28 20:27:57,781 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:27:57" (1/1) ... [2019-11-28 20:27:57,781 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:27:57" (1/1) ... [2019-11-28 20:27:57,803 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:27:57" (1/1) ... [2019-11-28 20:27:57,811 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:27:57" (1/1) ... [2019-11-28 20:27:57,817 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:27:57" (1/1) ... [2019-11-28 20:27:57,835 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 20:27:57,836 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 20:27:57,837 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 20:27:57,842 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 20:27:57,843 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:27:57" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 20:27:57,913 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 20:27:57,913 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-28 20:27:57,914 INFO L130 BoogieDeclarations]: Found specification of procedure fflush [2019-11-28 20:27:57,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-28 20:27:57,915 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 20:27:57,915 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 20:27:57,916 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 20:27:57,916 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-28 20:27:57,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 20:27:57,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-28 20:27:58,649 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 20:27:58,649 INFO L287 CfgBuilder]: Removed 16 assume(true) statements. [2019-11-28 20:27:58,650 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:27:58 BoogieIcfgContainer [2019-11-28 20:27:58,651 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 20:27:58,652 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 20:27:58,652 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 20:27:58,655 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 20:27:58,655 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 08:27:55" (1/3) ... [2019-11-28 20:27:58,656 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79b1cfde and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:27:58, skipping insertion in model container [2019-11-28 20:27:58,656 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:27:57" (2/3) ... [2019-11-28 20:27:58,657 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79b1cfde and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:27:58, skipping insertion in model container [2019-11-28 20:27:58,657 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:27:58" (3/3) ... [2019-11-28 20:27:58,659 INFO L109 eAbstractionObserver]: Analyzing ICFG hostid.i [2019-11-28 20:27:58,667 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 20:27:58,674 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2019-11-28 20:27:58,687 INFO L249 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2019-11-28 20:27:58,713 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 20:27:58,713 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 20:27:58,713 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 20:27:58,713 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 20:27:58,713 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 20:27:58,714 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 20:27:58,714 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 20:27:58,714 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 20:27:58,734 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states. [2019-11-28 20:27:58,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-11-28 20:27:58,740 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:27:58,741 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-11-28 20:27:58,742 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-11-28 20:27:58,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:27:58,748 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2019-11-28 20:27:58,758 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:27:58,758 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368098249] [2019-11-28 20:27:58,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:27:58,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:27:59,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:27:59,141 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368098249] [2019-11-28 20:27:59,143 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:27:59,143 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 20:27:59,144 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645581862] [2019-11-28 20:27:59,150 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 20:27:59,150 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:27:59,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:27:59,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:27:59,169 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 3 states. [2019-11-28 20:27:59,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:27:59,231 INFO L93 Difference]: Finished difference Result 92 states and 108 transitions. [2019-11-28 20:27:59,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:27:59,236 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-11-28 20:27:59,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:27:59,251 INFO L225 Difference]: With dead ends: 92 [2019-11-28 20:27:59,251 INFO L226 Difference]: Without dead ends: 45 [2019-11-28 20:27:59,261 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:27:59,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-11-28 20:27:59,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-11-28 20:27:59,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-11-28 20:27:59,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2019-11-28 20:27:59,302 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 4 [2019-11-28 20:27:59,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:27:59,302 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2019-11-28 20:27:59,302 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 20:27:59,303 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2019-11-28 20:27:59,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-11-28 20:27:59,303 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:27:59,303 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-11-28 20:27:59,304 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-11-28 20:27:59,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:27:59,304 INFO L82 PathProgramCache]: Analyzing trace with hash 28698760, now seen corresponding path program 1 times [2019-11-28 20:27:59,305 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:27:59,305 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274821219] [2019-11-28 20:27:59,305 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:27:59,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:27:59,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:27:59,410 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274821219] [2019-11-28 20:27:59,410 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:27:59,410 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 20:27:59,411 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536678722] [2019-11-28 20:27:59,412 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 20:27:59,412 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:27:59,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:27:59,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:27:59,413 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 3 states. [2019-11-28 20:27:59,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:27:59,449 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2019-11-28 20:27:59,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:27:59,450 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-11-28 20:27:59,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:27:59,451 INFO L225 Difference]: With dead ends: 48 [2019-11-28 20:27:59,451 INFO L226 Difference]: Without dead ends: 47 [2019-11-28 20:27:59,454 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:27:59,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-11-28 20:27:59,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-11-28 20:27:59,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-11-28 20:27:59,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2019-11-28 20:27:59,466 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 5 [2019-11-28 20:27:59,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:27:59,467 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2019-11-28 20:27:59,467 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 20:27:59,467 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2019-11-28 20:27:59,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-28 20:27:59,468 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:27:59,468 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:27:59,469 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-11-28 20:27:59,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:27:59,469 INFO L82 PathProgramCache]: Analyzing trace with hash 266305344, now seen corresponding path program 1 times [2019-11-28 20:27:59,470 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:27:59,470 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969144049] [2019-11-28 20:27:59,470 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:27:59,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:27:59,581 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 20:27:59,582 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969144049] [2019-11-28 20:27:59,583 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:27:59,583 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 20:27:59,584 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601873993] [2019-11-28 20:27:59,585 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 20:27:59,585 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:27:59,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:27:59,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:27:59,586 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 3 states. [2019-11-28 20:27:59,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:27:59,667 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2019-11-28 20:27:59,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:27:59,667 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-11-28 20:27:59,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:27:59,668 INFO L225 Difference]: With dead ends: 47 [2019-11-28 20:27:59,669 INFO L226 Difference]: Without dead ends: 43 [2019-11-28 20:27:59,669 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:27:59,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-11-28 20:27:59,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-11-28 20:27:59,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-11-28 20:27:59,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2019-11-28 20:27:59,678 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 8 [2019-11-28 20:27:59,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:27:59,679 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2019-11-28 20:27:59,679 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 20:27:59,679 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2019-11-28 20:27:59,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-28 20:27:59,680 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:27:59,680 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2019-11-28 20:27:59,680 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-11-28 20:27:59,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:27:59,683 INFO L82 PathProgramCache]: Analyzing trace with hash 266307074, now seen corresponding path program 1 times [2019-11-28 20:27:59,683 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:27:59,684 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867263978] [2019-11-28 20:27:59,684 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:27:59,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:27:59,773 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:27:59,773 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867263978] [2019-11-28 20:27:59,774 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:27:59,774 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 20:27:59,774 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524030126] [2019-11-28 20:27:59,774 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 20:27:59,775 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:27:59,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:27:59,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:27:59,776 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 3 states. [2019-11-28 20:27:59,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:27:59,801 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2019-11-28 20:27:59,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:27:59,803 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-11-28 20:27:59,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:27:59,804 INFO L225 Difference]: With dead ends: 43 [2019-11-28 20:27:59,805 INFO L226 Difference]: Without dead ends: 42 [2019-11-28 20:27:59,806 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:27:59,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-11-28 20:27:59,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2019-11-28 20:27:59,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-11-28 20:27:59,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2019-11-28 20:27:59,820 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 8 [2019-11-28 20:27:59,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:27:59,821 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2019-11-28 20:27:59,823 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 20:27:59,824 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2019-11-28 20:27:59,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-28 20:27:59,824 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:27:59,824 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:27:59,825 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-11-28 20:27:59,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:27:59,826 INFO L82 PathProgramCache]: Analyzing trace with hash -334468875, now seen corresponding path program 1 times [2019-11-28 20:27:59,826 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:27:59,826 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541787595] [2019-11-28 20:27:59,827 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:27:59,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:27:59,928 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 20:27:59,929 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541787595] [2019-11-28 20:27:59,929 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:27:59,929 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 20:27:59,931 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814779742] [2019-11-28 20:27:59,931 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 20:27:59,932 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:27:59,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:27:59,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:27:59,933 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 3 states. [2019-11-28 20:28:00,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:28:00,007 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2019-11-28 20:28:00,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:28:00,008 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-11-28 20:28:00,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:28:00,009 INFO L225 Difference]: With dead ends: 40 [2019-11-28 20:28:00,009 INFO L226 Difference]: Without dead ends: 38 [2019-11-28 20:28:00,010 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:28:00,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-11-28 20:28:00,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-11-28 20:28:00,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-11-28 20:28:00,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2019-11-28 20:28:00,023 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 9 [2019-11-28 20:28:00,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:28:00,024 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2019-11-28 20:28:00,024 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 20:28:00,024 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2019-11-28 20:28:00,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 20:28:00,027 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:28:00,027 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:28:00,027 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-11-28 20:28:00,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:28:00,028 INFO L82 PathProgramCache]: Analyzing trace with hash 697960087, now seen corresponding path program 1 times [2019-11-28 20:28:00,028 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:28:00,028 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758753529] [2019-11-28 20:28:00,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:28:00,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:28:00,117 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 20:28:00,119 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758753529] [2019-11-28 20:28:00,119 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:28:00,119 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 20:28:00,120 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127756383] [2019-11-28 20:28:00,120 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 20:28:00,121 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:28:00,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:28:00,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:28:00,122 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand 3 states. [2019-11-28 20:28:00,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:28:00,187 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2019-11-28 20:28:00,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:28:00,189 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-11-28 20:28:00,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:28:00,192 INFO L225 Difference]: With dead ends: 38 [2019-11-28 20:28:00,192 INFO L226 Difference]: Without dead ends: 36 [2019-11-28 20:28:00,192 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:28:00,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-11-28 20:28:00,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-11-28 20:28:00,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-11-28 20:28:00,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2019-11-28 20:28:00,199 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 11 [2019-11-28 20:28:00,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:28:00,200 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2019-11-28 20:28:00,200 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 20:28:00,200 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2019-11-28 20:28:00,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-28 20:28:00,201 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:28:00,201 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:28:00,202 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-11-28 20:28:00,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:28:00,202 INFO L82 PathProgramCache]: Analyzing trace with hash -557684678, now seen corresponding path program 1 times [2019-11-28 20:28:00,202 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:28:00,203 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587801851] [2019-11-28 20:28:00,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:28:00,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:28:00,305 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 20:28:00,306 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587801851] [2019-11-28 20:28:00,306 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:28:00,306 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 20:28:00,310 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502589177] [2019-11-28 20:28:00,310 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 20:28:00,311 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:28:00,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:28:00,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:28:00,311 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand 3 states. [2019-11-28 20:28:00,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:28:00,358 INFO L93 Difference]: Finished difference Result 60 states and 70 transitions. [2019-11-28 20:28:00,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:28:00,359 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-28 20:28:00,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:28:00,359 INFO L225 Difference]: With dead ends: 60 [2019-11-28 20:28:00,360 INFO L226 Difference]: Without dead ends: 39 [2019-11-28 20:28:00,360 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-11-28 20:28:00,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-11-28 20:28:00,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-11-28 20:28:00,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-28 20:28:00,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2019-11-28 20:28:00,373 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 18 [2019-11-28 20:28:00,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:28:00,373 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2019-11-28 20:28:00,373 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 20:28:00,373 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2019-11-28 20:28:00,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-28 20:28:00,375 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:28:00,375 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:28:00,376 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-11-28 20:28:00,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:28:00,376 INFO L82 PathProgramCache]: Analyzing trace with hash -1049017679, now seen corresponding path program 1 times [2019-11-28 20:28:00,376 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:28:00,377 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179908282] [2019-11-28 20:28:00,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:28:00,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:28:00,535 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 20:28:00,535 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179908282] [2019-11-28 20:28:00,536 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:28:00,536 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 20:28:00,536 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140240220] [2019-11-28 20:28:00,536 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 20:28:00,537 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:28:00,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 20:28:00,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:28:00,537 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 4 states. [2019-11-28 20:28:00,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:28:00,656 INFO L93 Difference]: Finished difference Result 51 states and 57 transitions. [2019-11-28 20:28:00,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 20:28:00,656 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-11-28 20:28:00,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:28:00,657 INFO L225 Difference]: With dead ends: 51 [2019-11-28 20:28:00,657 INFO L226 Difference]: Without dead ends: 50 [2019-11-28 20:28:00,658 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-11-28 20:28:00,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-11-28 20:28:00,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 38. [2019-11-28 20:28:00,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-11-28 20:28:00,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2019-11-28 20:28:00,664 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 21 [2019-11-28 20:28:00,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:28:00,664 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2019-11-28 20:28:00,664 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 20:28:00,664 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2019-11-28 20:28:00,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-28 20:28:00,665 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:28:00,665 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-11-28 20:28:00,665 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-11-28 20:28:00,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:28:00,666 INFO L82 PathProgramCache]: Analyzing trace with hash -1049017624, now seen corresponding path program 1 times [2019-11-28 20:28:00,666 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:28:00,666 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732580673] [2019-11-28 20:28:00,667 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:28:00,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:28:00,743 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 20:28:00,744 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732580673] [2019-11-28 20:28:00,744 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:28:00,745 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 20:28:00,745 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705394071] [2019-11-28 20:28:00,745 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 20:28:00,745 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:28:00,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:28:00,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:28:00,746 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand 3 states. [2019-11-28 20:28:00,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:28:00,778 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2019-11-28 20:28:00,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:28:00,778 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-28 20:28:00,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:28:00,779 INFO L225 Difference]: With dead ends: 38 [2019-11-28 20:28:00,779 INFO L226 Difference]: Without dead ends: 37 [2019-11-28 20:28:00,780 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:28:00,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-11-28 20:28:00,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-11-28 20:28:00,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-11-28 20:28:00,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2019-11-28 20:28:00,784 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 21 [2019-11-28 20:28:00,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:28:00,785 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2019-11-28 20:28:00,785 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 20:28:00,785 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2019-11-28 20:28:00,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 20:28:00,786 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:28:00,786 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-11-28 20:28:00,786 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-11-28 20:28:00,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:28:00,787 INFO L82 PathProgramCache]: Analyzing trace with hash 1840190412, now seen corresponding path program 1 times [2019-11-28 20:28:00,787 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:28:00,787 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588608780] [2019-11-28 20:28:00,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:28:00,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:28:00,852 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 20:28:00,853 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588608780] [2019-11-28 20:28:00,853 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:28:00,853 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 20:28:00,853 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141627949] [2019-11-28 20:28:00,854 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 20:28:00,854 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:28:00,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:28:00,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:28:00,855 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 3 states. [2019-11-28 20:28:00,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:28:00,904 INFO L93 Difference]: Finished difference Result 59 states and 66 transitions. [2019-11-28 20:28:00,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:28:00,905 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-28 20:28:00,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:28:00,906 INFO L225 Difference]: With dead ends: 59 [2019-11-28 20:28:00,906 INFO L226 Difference]: Without dead ends: 58 [2019-11-28 20:28:00,907 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:28:00,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-11-28 20:28:00,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 46. [2019-11-28 20:28:00,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-11-28 20:28:00,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2019-11-28 20:28:00,913 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 22 [2019-11-28 20:28:00,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:28:00,913 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2019-11-28 20:28:00,914 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 20:28:00,914 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2019-11-28 20:28:00,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 20:28:00,915 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:28:00,915 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-11-28 20:28:00,915 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-11-28 20:28:00,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:28:00,916 INFO L82 PathProgramCache]: Analyzing trace with hash 1840192110, now seen corresponding path program 1 times [2019-11-28 20:28:00,916 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:28:00,916 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867375247] [2019-11-28 20:28:00,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:28:00,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:28:00,976 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 20:28:00,977 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867375247] [2019-11-28 20:28:00,977 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:28:00,977 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 20:28:00,977 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145439422] [2019-11-28 20:28:00,978 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 20:28:00,978 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:28:00,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:28:00,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:28:00,979 INFO L87 Difference]: Start difference. First operand 46 states and 53 transitions. Second operand 3 states. [2019-11-28 20:28:01,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:28:01,003 INFO L93 Difference]: Finished difference Result 57 states and 65 transitions. [2019-11-28 20:28:01,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:28:01,004 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-28 20:28:01,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:28:01,004 INFO L225 Difference]: With dead ends: 57 [2019-11-28 20:28:01,005 INFO L226 Difference]: Without dead ends: 56 [2019-11-28 20:28:01,005 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:28:01,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-11-28 20:28:01,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 41. [2019-11-28 20:28:01,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-11-28 20:28:01,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2019-11-28 20:28:01,011 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 22 [2019-11-28 20:28:01,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:28:01,012 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2019-11-28 20:28:01,012 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 20:28:01,012 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2019-11-28 20:28:01,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-28 20:28:01,013 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:28:01,013 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-11-28 20:28:01,014 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-11-28 20:28:01,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:28:01,014 INFO L82 PathProgramCache]: Analyzing trace with hash -2077877290, now seen corresponding path program 1 times [2019-11-28 20:28:01,015 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:28:01,015 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970724722] [2019-11-28 20:28:01,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:28:01,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:28:01,104 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 20:28:01,105 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970724722] [2019-11-28 20:28:01,105 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:28:01,105 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 20:28:01,106 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386097137] [2019-11-28 20:28:01,106 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 20:28:01,106 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:28:01,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 20:28:01,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:28:01,107 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand 4 states. [2019-11-28 20:28:01,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:28:01,197 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2019-11-28 20:28:01,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 20:28:01,198 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-11-28 20:28:01,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:28:01,198 INFO L225 Difference]: With dead ends: 42 [2019-11-28 20:28:01,199 INFO L226 Difference]: Without dead ends: 41 [2019-11-28 20:28:01,199 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-11-28 20:28:01,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-11-28 20:28:01,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2019-11-28 20:28:01,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-11-28 20:28:01,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2019-11-28 20:28:01,210 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 24 [2019-11-28 20:28:01,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:28:01,211 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2019-11-28 20:28:01,211 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 20:28:01,211 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2019-11-28 20:28:01,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-28 20:28:01,212 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:28:01,212 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-11-28 20:28:01,212 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-11-28 20:28:01,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:28:01,213 INFO L82 PathProgramCache]: Analyzing trace with hash 10313574, now seen corresponding path program 1 times [2019-11-28 20:28:01,213 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:28:01,213 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505298511] [2019-11-28 20:28:01,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:28:01,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:28:01,324 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 20:28:01,324 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505298511] [2019-11-28 20:28:01,324 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:28:01,325 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 20:28:01,325 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896037710] [2019-11-28 20:28:01,325 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 20:28:01,326 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:28:01,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:28:01,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:28:01,328 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. Second operand 3 states. [2019-11-28 20:28:01,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:28:01,362 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2019-11-28 20:28:01,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:28:01,363 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-28 20:28:01,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:28:01,363 INFO L225 Difference]: With dead ends: 44 [2019-11-28 20:28:01,363 INFO L226 Difference]: Without dead ends: 43 [2019-11-28 20:28:01,364 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:28:01,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-11-28 20:28:01,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-11-28 20:28:01,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-11-28 20:28:01,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2019-11-28 20:28:01,376 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 25 [2019-11-28 20:28:01,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:28:01,376 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2019-11-28 20:28:01,377 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 20:28:01,377 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2019-11-28 20:28:01,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-28 20:28:01,378 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:28:01,381 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-11-28 20:28:01,381 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-11-28 20:28:01,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:28:01,382 INFO L82 PathProgramCache]: Analyzing trace with hash -1985844013, now seen corresponding path program 1 times [2019-11-28 20:28:01,382 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:28:01,382 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773199042] [2019-11-28 20:28:01,382 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:28:01,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:28:01,461 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 20:28:01,461 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773199042] [2019-11-28 20:28:01,462 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:28:01,462 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 20:28:01,462 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860993759] [2019-11-28 20:28:01,462 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 20:28:01,463 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:28:01,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:28:01,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:28:01,463 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand 3 states. [2019-11-28 20:28:01,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:28:01,481 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2019-11-28 20:28:01,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:28:01,481 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-11-28 20:28:01,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:28:01,482 INFO L225 Difference]: With dead ends: 43 [2019-11-28 20:28:01,482 INFO L226 Difference]: Without dead ends: 30 [2019-11-28 20:28:01,483 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:28:01,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-11-28 20:28:01,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-11-28 20:28:01,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-28 20:28:01,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2019-11-28 20:28:01,489 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 28 [2019-11-28 20:28:01,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:28:01,489 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2019-11-28 20:28:01,489 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 20:28:01,489 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2019-11-28 20:28:01,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-28 20:28:01,490 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:28:01,490 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-11-28 20:28:01,490 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-11-28 20:28:01,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:28:01,491 INFO L82 PathProgramCache]: Analyzing trace with hash -1042497349, now seen corresponding path program 1 times [2019-11-28 20:28:01,491 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:28:01,491 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052439716] [2019-11-28 20:28:01,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:28:01,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:28:01,587 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-28 20:28:01,588 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052439716] [2019-11-28 20:28:01,588 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:28:01,588 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 20:28:01,588 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997222597] [2019-11-28 20:28:01,590 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 20:28:01,590 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:28:01,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:28:01,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:28:01,590 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand 3 states. [2019-11-28 20:28:01,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:28:01,620 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2019-11-28 20:28:01,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:28:01,620 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-11-28 20:28:01,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:28:01,621 INFO L225 Difference]: With dead ends: 30 [2019-11-28 20:28:01,621 INFO L226 Difference]: Without dead ends: 0 [2019-11-28 20:28:01,621 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:28:01,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-28 20:28:01,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-28 20:28:01,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-28 20:28:01,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 20:28:01,623 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2019-11-28 20:28:01,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:28:01,624 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 20:28:01,624 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 20:28:01,624 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-28 20:28:01,625 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-28 20:28:01,627 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-28 20:28:01,957 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 15 [2019-11-28 20:28:02,131 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 20 [2019-11-28 20:28:02,196 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-11-28 20:28:02,196 INFO L249 CegarLoopResult]: At program point L1889(lines 1861 1890) the Hoare annotation is: true [2019-11-28 20:28:02,196 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1872) no Hoare annotation was computed. [2019-11-28 20:28:02,197 INFO L246 CegarLoopResult]: For program point L1873(line 1873) no Hoare annotation was computed. [2019-11-28 20:28:02,197 INFO L246 CegarLoopResult]: For program point L1873-1(line 1873) no Hoare annotation was computed. [2019-11-28 20:28:02,197 INFO L246 CegarLoopResult]: For program point L1873-2(line 1873) no Hoare annotation was computed. [2019-11-28 20:28:02,197 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1884) no Hoare annotation was computed. [2019-11-28 20:28:02,197 INFO L246 CegarLoopResult]: For program point L1873-3(line 1873) no Hoare annotation was computed. [2019-11-28 20:28:02,197 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1880) no Hoare annotation was computed. [2019-11-28 20:28:02,197 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1873) no Hoare annotation was computed. [2019-11-28 20:28:02,197 INFO L246 CegarLoopResult]: For program point L1865-2(lines 1865 1866) no Hoare annotation was computed. [2019-11-28 20:28:02,197 INFO L246 CegarLoopResult]: For program point L1865-3(line 1865) no Hoare annotation was computed. [2019-11-28 20:28:02,199 INFO L242 CegarLoopResult]: At program point L1865-4(lines 1865 1866) the Hoare annotation is: (<= 0 (+ ULTIMATE.start_main_~i~3 2147483648)) [2019-11-28 20:28:02,199 INFO L246 CegarLoopResult]: For program point L1865-5(lines 1865 1866) no Hoare annotation was computed. [2019-11-28 20:28:02,199 INFO L246 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-28 20:28:02,200 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1865) no Hoare annotation was computed. [2019-11-28 20:28:02,200 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-28 20:28:02,200 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1872) no Hoare annotation was computed. [2019-11-28 20:28:02,200 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-28 20:28:02,200 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-11-28 20:28:02,200 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1875) no Hoare annotation was computed. [2019-11-28 20:28:02,200 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-11-28 20:28:02,200 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1873) no Hoare annotation was computed. [2019-11-28 20:28:02,201 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1865) no Hoare annotation was computed. [2019-11-28 20:28:02,202 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-28 20:28:02,203 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1872) no Hoare annotation was computed. [2019-11-28 20:28:02,203 INFO L246 CegarLoopResult]: For program point L1875-2(lines 1875 1882) no Hoare annotation was computed. [2019-11-28 20:28:02,203 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1875) no Hoare annotation was computed. [2019-11-28 20:28:02,203 INFO L246 CegarLoopResult]: For program point L1875-3(line 1875) no Hoare annotation was computed. [2019-11-28 20:28:02,204 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-11-28 20:28:02,204 INFO L246 CegarLoopResult]: For program point L1875-5(lines 1875 1882) no Hoare annotation was computed. [2019-11-28 20:28:02,204 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1873) no Hoare annotation was computed. [2019-11-28 20:28:02,204 INFO L246 CegarLoopResult]: For program point L1768(lines 1768 1769) no Hoare annotation was computed. [2019-11-28 20:28:02,204 INFO L246 CegarLoopResult]: For program point L1768-1(lines 1768 1769) no Hoare annotation was computed. [2019-11-28 20:28:02,205 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1872) no Hoare annotation was computed. [2019-11-28 20:28:02,205 INFO L246 CegarLoopResult]: For program point L1884-2(lines 1884 1885) no Hoare annotation was computed. [2019-11-28 20:28:02,205 INFO L246 CegarLoopResult]: For program point L1884-3(line 1884) no Hoare annotation was computed. [2019-11-28 20:28:02,205 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-11-28 20:28:02,206 INFO L246 CegarLoopResult]: For program point L1884-5(lines 1884 1885) no Hoare annotation was computed. [2019-11-28 20:28:02,206 INFO L246 CegarLoopResult]: For program point L1880-2(lines 1880 1881) no Hoare annotation was computed. [2019-11-28 20:28:02,206 INFO L246 CegarLoopResult]: For program point L1880-3(line 1880) no Hoare annotation was computed. [2019-11-28 20:28:02,206 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-11-28 20:28:02,206 INFO L246 CegarLoopResult]: For program point L1872(line 1872) no Hoare annotation was computed. [2019-11-28 20:28:02,207 INFO L246 CegarLoopResult]: For program point L1872-1(line 1872) no Hoare annotation was computed. [2019-11-28 20:28:02,207 INFO L246 CegarLoopResult]: For program point L1872-2(line 1872) no Hoare annotation was computed. [2019-11-28 20:28:02,207 INFO L246 CegarLoopResult]: For program point L1872-3(line 1872) no Hoare annotation was computed. [2019-11-28 20:28:02,207 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1884) no Hoare annotation was computed. [2019-11-28 20:28:02,207 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1880) no Hoare annotation was computed. [2019-11-28 20:28:02,209 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1873) no Hoare annotation was computed. [2019-11-28 20:28:02,249 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 08:28:02 BoogieIcfgContainer [2019-11-28 20:28:02,251 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 20:28:02,251 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 20:28:02,252 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 20:28:02,252 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 20:28:02,253 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:27:58" (3/4) ... [2019-11-28 20:28:02,257 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-28 20:28:02,276 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2019-11-28 20:28:02,277 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2019-11-28 20:28:02,277 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-28 20:28:02,278 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-28 20:28:02,396 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 20:28:02,396 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 20:28:02,398 INFO L168 Benchmark]: Toolchain (without parser) took 6430.65 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 186.1 MB). Free memory was 952.3 MB in the beginning and 931.8 MB in the end (delta: 20.4 MB). Peak memory consumption was 206.6 MB. Max. memory is 11.5 GB. [2019-11-28 20:28:02,398 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:28:02,399 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1713.31 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 83.4 MB). Free memory was 952.3 MB in the beginning and 902.1 MB in the end (delta: 50.1 MB). Peak memory consumption was 144.3 MB. Max. memory is 11.5 GB. [2019-11-28 20:28:02,399 INFO L168 Benchmark]: Boogie Procedure Inliner took 77.26 ms. Allocated memory is still 1.1 GB. Free memory is still 902.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:28:02,400 INFO L168 Benchmark]: Boogie Preprocessor took 76.10 ms. Allocated memory is still 1.1 GB. Free memory was 902.1 MB in the beginning and 895.1 MB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2019-11-28 20:28:02,400 INFO L168 Benchmark]: RCFGBuilder took 814.91 ms. Allocated memory is still 1.1 GB. Free memory was 895.1 MB in the beginning and 855.2 MB in the end (delta: 39.9 MB). Peak memory consumption was 39.9 MB. Max. memory is 11.5 GB. [2019-11-28 20:28:02,401 INFO L168 Benchmark]: TraceAbstraction took 3599.10 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 102.8 MB). Free memory was 855.2 MB in the beginning and 931.8 MB in the end (delta: -76.6 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. [2019-11-28 20:28:02,401 INFO L168 Benchmark]: Witness Printer took 144.98 ms. Allocated memory is still 1.2 GB. Free memory was 931.8 MB in the beginning and 931.8 MB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. [2019-11-28 20:28:02,403 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1713.31 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 83.4 MB). Free memory was 952.3 MB in the beginning and 902.1 MB in the end (delta: 50.1 MB). Peak memory consumption was 144.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 77.26 ms. Allocated memory is still 1.1 GB. Free memory is still 902.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 76.10 ms. Allocated memory is still 1.1 GB. Free memory was 902.1 MB in the beginning and 895.1 MB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 814.91 ms. Allocated memory is still 1.1 GB. Free memory was 895.1 MB in the beginning and 855.2 MB in the end (delta: 39.9 MB). Peak memory consumption was 39.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3599.10 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 102.8 MB). Free memory was 855.2 MB in the beginning and 931.8 MB in the end (delta: -76.6 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. * Witness Printer took 144.98 ms. Allocated memory is still 1.2 GB. Free memory was 931.8 MB in the beginning and 931.8 MB in the end (delta: 24 B). Peak memory consumption was 24 B. 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: 2.9s, OverallIterations: 15, TraceHistogramMax: 2, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.5s, HoareTripleCheckerStatistics: 484 SDtfs, 241 SDslu, 337 SDs, 0 SdLazy, 172 SolverSat, 18 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 35 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s 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.1s 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.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s 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...