./Ultimate.py --spec /storage/repos/svcomp/c/properties/no-overflow.prp --file /storage/repos/svcomp/c/busybox-1.22.0/hostid_true-no-overflow_true-valid-memsafety.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 0ed9222f Calling Ultimate with: 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 /storage/repos/svcomp/c/busybox-1.22.0/hostid_true-no-overflow_true-valid-memsafety.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.24-0ed9222-m [2019-01-14 02:00:24,149 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 02:00:24,152 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 02:00:24,164 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 02:00:24,165 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 02:00:24,166 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 02:00:24,167 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 02:00:24,169 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 02:00:24,171 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 02:00:24,172 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 02:00:24,173 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 02:00:24,173 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 02:00:24,174 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 02:00:24,175 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 02:00:24,177 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 02:00:24,177 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 02:00:24,178 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 02:00:24,180 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 02:00:24,182 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 02:00:24,184 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 02:00:24,185 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 02:00:24,186 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 02:00:24,189 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 02:00:24,189 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 02:00:24,190 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 02:00:24,191 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 02:00:24,192 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 02:00:24,193 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 02:00:24,193 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 02:00:24,195 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 02:00:24,195 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 02:00:24,196 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 02:00:24,196 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 02:00:24,196 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 02:00:24,197 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 02:00:24,198 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 02:00:24,199 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2019-01-14 02:00:24,215 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 02:00:24,215 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 02:00:24,217 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 02:00:24,217 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 02:00:24,217 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 02:00:24,218 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 02:00:24,218 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 02:00:24,218 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 02:00:24,218 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 02:00:24,218 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-14 02:00:24,219 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-14 02:00:24,219 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-14 02:00:24,219 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2019-01-14 02:00:24,219 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 02:00:24,220 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 02:00:24,220 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-14 02:00:24,220 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 02:00:24,220 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 02:00:24,221 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-14 02:00:24,221 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-14 02:00:24,221 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 02:00:24,221 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 02:00:24,221 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-14 02:00:24,222 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-14 02:00:24,222 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 02:00:24,222 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-14 02:00:24,222 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-14 02:00:24,223 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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-01-14 02:00:24,262 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 02:00:24,274 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 02:00:24,278 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 02:00:24,279 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 02:00:24,280 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 02:00:24,280 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/busybox-1.22.0/hostid_true-no-overflow_true-valid-memsafety.i [2019-01-14 02:00:24,349 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/535117065/7546c38735e24ff9b406875909229cbd/FLAG973d70fe8 [2019-01-14 02:00:24,973 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 02:00:24,973 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/busybox-1.22.0/hostid_true-no-overflow_true-valid-memsafety.i [2019-01-14 02:00:24,995 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/535117065/7546c38735e24ff9b406875909229cbd/FLAG973d70fe8 [2019-01-14 02:00:25,200 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/535117065/7546c38735e24ff9b406875909229cbd [2019-01-14 02:00:25,204 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 02:00:25,206 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 02:00:25,207 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 02:00:25,208 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 02:00:25,214 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 02:00:25,215 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:00:25" (1/1) ... [2019-01-14 02:00:25,218 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1cc1f183 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:00:25, skipping insertion in model container [2019-01-14 02:00:25,219 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:00:25" (1/1) ... [2019-01-14 02:00:25,227 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 02:00:25,301 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 02:00:26,289 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:00:26,324 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 02:00:26,585 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:00:27,132 INFO L195 MainTranslator]: Completed translation [2019-01-14 02:00:27,132 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:00:27 WrapperNode [2019-01-14 02:00:27,133 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 02:00:27,134 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 02:00:27,134 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 02:00:27,134 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 02:00:27,142 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:00:27" (1/1) ... [2019-01-14 02:00:27,179 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:00:27" (1/1) ... [2019-01-14 02:00:27,215 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 02:00:27,215 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 02:00:27,215 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 02:00:27,216 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 02:00:27,227 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:00:27" (1/1) ... [2019-01-14 02:00:27,227 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:00:27" (1/1) ... [2019-01-14 02:00:27,234 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:00:27" (1/1) ... [2019-01-14 02:00:27,235 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:00:27" (1/1) ... [2019-01-14 02:00:27,252 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:00:27" (1/1) ... [2019-01-14 02:00:27,259 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:00:27" (1/1) ... [2019-01-14 02:00:27,265 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:00:27" (1/1) ... [2019-01-14 02:00:27,275 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 02:00:27,275 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 02:00:27,276 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 02:00:27,276 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 02:00:27,277 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:00:27" (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-01-14 02:00:27,374 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 02:00:27,375 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-14 02:00:27,375 INFO L130 BoogieDeclarations]: Found specification of procedure fflush [2019-01-14 02:00:27,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-01-14 02:00:27,375 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 02:00:27,376 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 02:00:27,376 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 02:00:27,376 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-01-14 02:00:27,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 02:00:27,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-14 02:00:28,241 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 02:00:28,241 INFO L286 CfgBuilder]: Removed 16 assue(true) statements. [2019-01-14 02:00:28,242 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:00:28 BoogieIcfgContainer [2019-01-14 02:00:28,243 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 02:00:28,243 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-14 02:00:28,244 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-14 02:00:28,247 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-14 02:00:28,247 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.01 02:00:25" (1/3) ... [2019-01-14 02:00:28,248 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f991da4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 02:00:28, skipping insertion in model container [2019-01-14 02:00:28,248 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:00:27" (2/3) ... [2019-01-14 02:00:28,248 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f991da4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 02:00:28, skipping insertion in model container [2019-01-14 02:00:28,249 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:00:28" (3/3) ... [2019-01-14 02:00:28,250 INFO L112 eAbstractionObserver]: Analyzing ICFG hostid_true-no-overflow_true-valid-memsafety.i [2019-01-14 02:00:28,261 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-14 02:00:28,269 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2019-01-14 02:00:28,287 INFO L257 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2019-01-14 02:00:28,317 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 02:00:28,317 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-14 02:00:28,318 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-14 02:00:28,318 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-14 02:00:28,318 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 02:00:28,318 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 02:00:28,318 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-14 02:00:28,318 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 02:00:28,319 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-14 02:00:28,337 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states. [2019-01-14 02:00:28,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-14 02:00:28,343 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 02:00:28,345 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-14 02:00:28,348 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 02:00:28,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:00:28,355 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2019-01-14 02:00:28,358 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:00:28,358 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:00:28,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:00:28,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:00:28,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:00:28,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:00:28,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:00:28,761 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:00:28,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 02:00:28,764 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 02:00:28,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 02:00:28,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 02:00:28,776 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 3 states. [2019-01-14 02:00:28,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:00:28,836 INFO L93 Difference]: Finished difference Result 92 states and 108 transitions. [2019-01-14 02:00:28,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 02:00:28,837 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-01-14 02:00:28,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 02:00:28,849 INFO L225 Difference]: With dead ends: 92 [2019-01-14 02:00:28,849 INFO L226 Difference]: Without dead ends: 45 [2019-01-14 02:00:28,853 INFO L631 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-01-14 02:00:28,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-01-14 02:00:28,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-01-14 02:00:28,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-01-14 02:00:28,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2019-01-14 02:00:28,888 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 4 [2019-01-14 02:00:28,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 02:00:28,888 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2019-01-14 02:00:28,889 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 02:00:28,889 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2019-01-14 02:00:28,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-14 02:00:28,889 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 02:00:28,890 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-14 02:00:28,890 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 02:00:28,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:00:28,891 INFO L82 PathProgramCache]: Analyzing trace with hash 28698760, now seen corresponding path program 1 times [2019-01-14 02:00:28,891 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:00:28,891 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:00:28,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:00:28,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:00:28,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:00:28,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:00:29,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:00:29,017 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:00:29,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 02:00:29,019 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 02:00:29,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 02:00:29,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 02:00:29,021 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 3 states. [2019-01-14 02:00:29,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:00:29,102 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2019-01-14 02:00:29,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 02:00:29,103 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-01-14 02:00:29,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 02:00:29,105 INFO L225 Difference]: With dead ends: 48 [2019-01-14 02:00:29,105 INFO L226 Difference]: Without dead ends: 47 [2019-01-14 02:00:29,106 INFO L631 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-01-14 02:00:29,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-01-14 02:00:29,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-01-14 02:00:29,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-01-14 02:00:29,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2019-01-14 02:00:29,118 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 5 [2019-01-14 02:00:29,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 02:00:29,118 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2019-01-14 02:00:29,118 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 02:00:29,119 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2019-01-14 02:00:29,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-14 02:00:29,119 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 02:00:29,119 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:00:29,120 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 02:00:29,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:00:29,121 INFO L82 PathProgramCache]: Analyzing trace with hash 266305344, now seen corresponding path program 1 times [2019-01-14 02:00:29,121 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:00:29,121 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:00:29,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:00:29,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:00:29,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:00:29,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:00:29,240 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 02:00:29,240 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:00:29,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 02:00:29,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 02:00:29,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 02:00:29,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 02:00:29,241 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 3 states. [2019-01-14 02:00:29,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:00:29,361 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2019-01-14 02:00:29,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 02:00:29,362 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-01-14 02:00:29,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 02:00:29,363 INFO L225 Difference]: With dead ends: 47 [2019-01-14 02:00:29,363 INFO L226 Difference]: Without dead ends: 43 [2019-01-14 02:00:29,365 INFO L631 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-01-14 02:00:29,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-01-14 02:00:29,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-01-14 02:00:29,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-01-14 02:00:29,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2019-01-14 02:00:29,371 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 8 [2019-01-14 02:00:29,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 02:00:29,372 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2019-01-14 02:00:29,372 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 02:00:29,372 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2019-01-14 02:00:29,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-14 02:00:29,372 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 02:00:29,373 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2019-01-14 02:00:29,374 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 02:00:29,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:00:29,375 INFO L82 PathProgramCache]: Analyzing trace with hash 266307074, now seen corresponding path program 1 times [2019-01-14 02:00:29,375 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:00:29,375 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:00:29,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:00:29,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:00:29,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:00:29,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:00:29,487 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:00:29,487 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:00:29,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 02:00:29,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 02:00:29,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 02:00:29,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 02:00:29,489 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 3 states. [2019-01-14 02:00:29,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:00:29,563 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2019-01-14 02:00:29,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 02:00:29,564 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-01-14 02:00:29,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 02:00:29,565 INFO L225 Difference]: With dead ends: 43 [2019-01-14 02:00:29,565 INFO L226 Difference]: Without dead ends: 42 [2019-01-14 02:00:29,566 INFO L631 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-01-14 02:00:29,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-01-14 02:00:29,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2019-01-14 02:00:29,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-14 02:00:29,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2019-01-14 02:00:29,572 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 8 [2019-01-14 02:00:29,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 02:00:29,573 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2019-01-14 02:00:29,573 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 02:00:29,573 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2019-01-14 02:00:29,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-14 02:00:29,573 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 02:00:29,573 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:00:29,576 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 02:00:29,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:00:29,577 INFO L82 PathProgramCache]: Analyzing trace with hash -334468875, now seen corresponding path program 1 times [2019-01-14 02:00:29,577 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:00:29,577 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:00:29,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:00:29,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:00:29,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:00:29,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:00:29,716 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 02:00:29,718 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:00:29,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 02:00:29,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 02:00:29,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 02:00:29,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 02:00:29,720 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 3 states. [2019-01-14 02:00:29,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:00:29,896 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2019-01-14 02:00:29,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 02:00:29,897 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-01-14 02:00:29,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 02:00:29,897 INFO L225 Difference]: With dead ends: 40 [2019-01-14 02:00:29,898 INFO L226 Difference]: Without dead ends: 38 [2019-01-14 02:00:29,898 INFO L631 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-01-14 02:00:29,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-01-14 02:00:29,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-01-14 02:00:29,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-14 02:00:29,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2019-01-14 02:00:29,905 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 9 [2019-01-14 02:00:29,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 02:00:29,905 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2019-01-14 02:00:29,905 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 02:00:29,905 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2019-01-14 02:00:29,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-14 02:00:29,906 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 02:00:29,906 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:00:29,907 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 02:00:29,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:00:29,907 INFO L82 PathProgramCache]: Analyzing trace with hash 697960087, now seen corresponding path program 1 times [2019-01-14 02:00:29,907 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:00:29,907 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:00:29,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:00:29,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:00:29,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:00:29,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:00:30,020 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 02:00:30,021 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:00:30,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 02:00:30,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 02:00:30,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 02:00:30,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 02:00:30,022 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand 3 states. [2019-01-14 02:00:30,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:00:30,232 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2019-01-14 02:00:30,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 02:00:30,233 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-01-14 02:00:30,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 02:00:30,234 INFO L225 Difference]: With dead ends: 38 [2019-01-14 02:00:30,234 INFO L226 Difference]: Without dead ends: 36 [2019-01-14 02:00:30,235 INFO L631 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-01-14 02:00:30,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-01-14 02:00:30,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-01-14 02:00:30,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-14 02:00:30,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2019-01-14 02:00:30,245 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 11 [2019-01-14 02:00:30,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 02:00:30,246 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2019-01-14 02:00:30,248 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 02:00:30,248 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2019-01-14 02:00:30,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-14 02:00:30,250 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 02:00:30,250 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:00:30,251 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 02:00:30,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:00:30,251 INFO L82 PathProgramCache]: Analyzing trace with hash -557684678, now seen corresponding path program 1 times [2019-01-14 02:00:30,252 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:00:30,252 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:00:30,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:00:30,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:00:30,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:00:30,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:00:30,383 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 02:00:30,383 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:00:30,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 02:00:30,384 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 02:00:30,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 02:00:30,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 02:00:30,387 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand 3 states. [2019-01-14 02:00:30,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:00:30,435 INFO L93 Difference]: Finished difference Result 60 states and 70 transitions. [2019-01-14 02:00:30,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 02:00:30,441 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-01-14 02:00:30,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 02:00:30,442 INFO L225 Difference]: With dead ends: 60 [2019-01-14 02:00:30,443 INFO L226 Difference]: Without dead ends: 39 [2019-01-14 02:00:30,443 INFO L631 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-01-14 02:00:30,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-01-14 02:00:30,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-01-14 02:00:30,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-14 02:00:30,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2019-01-14 02:00:30,453 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 18 [2019-01-14 02:00:30,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 02:00:30,453 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2019-01-14 02:00:30,453 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 02:00:30,453 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2019-01-14 02:00:30,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-14 02:00:30,454 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 02:00:30,454 INFO L402 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-01-14 02:00:30,455 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 02:00:30,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:00:30,456 INFO L82 PathProgramCache]: Analyzing trace with hash -1049017679, now seen corresponding path program 1 times [2019-01-14 02:00:30,456 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:00:30,456 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:00:30,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:00:30,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:00:30,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:00:30,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:00:30,703 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-14 02:00:30,703 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:00:30,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 02:00:30,704 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 02:00:30,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 02:00:30,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 02:00:30,705 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 4 states. [2019-01-14 02:00:31,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:00:31,023 INFO L93 Difference]: Finished difference Result 51 states and 57 transitions. [2019-01-14 02:00:31,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 02:00:31,024 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-01-14 02:00:31,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 02:00:31,025 INFO L225 Difference]: With dead ends: 51 [2019-01-14 02:00:31,025 INFO L226 Difference]: Without dead ends: 50 [2019-01-14 02:00:31,026 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 02:00:31,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-01-14 02:00:31,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 38. [2019-01-14 02:00:31,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-14 02:00:31,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2019-01-14 02:00:31,032 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 21 [2019-01-14 02:00:31,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 02:00:31,033 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2019-01-14 02:00:31,033 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 02:00:31,033 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2019-01-14 02:00:31,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-14 02:00:31,035 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 02:00:31,035 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:00:31,036 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 02:00:31,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:00:31,036 INFO L82 PathProgramCache]: Analyzing trace with hash -1049017624, now seen corresponding path program 1 times [2019-01-14 02:00:31,036 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:00:31,037 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:00:31,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:00:31,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:00:31,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:00:31,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:00:31,150 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-14 02:00:31,151 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:00:31,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 02:00:31,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 02:00:31,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 02:00:31,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 02:00:31,152 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand 3 states. [2019-01-14 02:00:31,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:00:31,268 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2019-01-14 02:00:31,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 02:00:31,269 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-01-14 02:00:31,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 02:00:31,271 INFO L225 Difference]: With dead ends: 38 [2019-01-14 02:00:31,271 INFO L226 Difference]: Without dead ends: 37 [2019-01-14 02:00:31,272 INFO L631 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-01-14 02:00:31,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-01-14 02:00:31,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-01-14 02:00:31,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-01-14 02:00:31,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2019-01-14 02:00:31,278 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 21 [2019-01-14 02:00:31,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 02:00:31,278 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2019-01-14 02:00:31,278 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 02:00:31,279 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2019-01-14 02:00:31,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-14 02:00:31,281 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 02:00:31,281 INFO L402 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-01-14 02:00:31,281 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 02:00:31,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:00:31,283 INFO L82 PathProgramCache]: Analyzing trace with hash 1840190412, now seen corresponding path program 1 times [2019-01-14 02:00:31,283 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:00:31,283 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:00:31,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:00:31,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:00:31,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:00:31,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:00:31,396 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-14 02:00:31,396 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:00:31,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 02:00:31,397 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 02:00:31,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 02:00:31,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 02:00:31,398 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 3 states. [2019-01-14 02:00:31,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:00:31,579 INFO L93 Difference]: Finished difference Result 59 states and 66 transitions. [2019-01-14 02:00:31,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 02:00:31,581 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-01-14 02:00:31,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 02:00:31,582 INFO L225 Difference]: With dead ends: 59 [2019-01-14 02:00:31,582 INFO L226 Difference]: Without dead ends: 58 [2019-01-14 02:00:31,582 INFO L631 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-01-14 02:00:31,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-01-14 02:00:31,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 46. [2019-01-14 02:00:31,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-01-14 02:00:31,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2019-01-14 02:00:31,603 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 22 [2019-01-14 02:00:31,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 02:00:31,604 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2019-01-14 02:00:31,610 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 02:00:31,610 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2019-01-14 02:00:31,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-14 02:00:31,611 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 02:00:31,611 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:00:31,615 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 02:00:31,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:00:31,617 INFO L82 PathProgramCache]: Analyzing trace with hash 1840192110, now seen corresponding path program 1 times [2019-01-14 02:00:31,617 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:00:31,618 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:00:31,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:00:31,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:00:31,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:00:31,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:00:31,765 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 02:00:31,766 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:00:31,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 02:00:31,766 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 02:00:31,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 02:00:31,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 02:00:31,767 INFO L87 Difference]: Start difference. First operand 46 states and 53 transitions. Second operand 3 states. [2019-01-14 02:00:31,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:00:31,861 INFO L93 Difference]: Finished difference Result 57 states and 65 transitions. [2019-01-14 02:00:31,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 02:00:31,863 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-01-14 02:00:31,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 02:00:31,863 INFO L225 Difference]: With dead ends: 57 [2019-01-14 02:00:31,864 INFO L226 Difference]: Without dead ends: 56 [2019-01-14 02:00:31,864 INFO L631 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-01-14 02:00:31,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-01-14 02:00:31,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 41. [2019-01-14 02:00:31,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-14 02:00:31,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2019-01-14 02:00:31,874 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 22 [2019-01-14 02:00:31,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 02:00:31,875 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2019-01-14 02:00:31,875 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 02:00:31,875 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2019-01-14 02:00:31,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-14 02:00:31,879 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 02:00:31,879 INFO L402 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-01-14 02:00:31,881 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 02:00:31,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:00:31,882 INFO L82 PathProgramCache]: Analyzing trace with hash -2077877290, now seen corresponding path program 1 times [2019-01-14 02:00:31,883 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:00:31,883 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:00:31,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:00:31,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:00:31,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:00:31,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:00:32,136 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 02:00:32,136 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:00:32,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 02:00:32,137 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 02:00:32,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 02:00:32,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 02:00:32,138 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand 4 states. [2019-01-14 02:00:32,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:00:32,458 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2019-01-14 02:00:32,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 02:00:32,460 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-01-14 02:00:32,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 02:00:32,462 INFO L225 Difference]: With dead ends: 42 [2019-01-14 02:00:32,462 INFO L226 Difference]: Without dead ends: 41 [2019-01-14 02:00:32,462 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 02:00:32,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-01-14 02:00:32,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2019-01-14 02:00:32,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-14 02:00:32,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2019-01-14 02:00:32,480 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 24 [2019-01-14 02:00:32,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 02:00:32,480 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2019-01-14 02:00:32,480 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 02:00:32,480 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2019-01-14 02:00:32,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-01-14 02:00:32,481 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 02:00:32,481 INFO L402 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-01-14 02:00:32,481 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 02:00:32,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:00:32,487 INFO L82 PathProgramCache]: Analyzing trace with hash 10313574, now seen corresponding path program 1 times [2019-01-14 02:00:32,487 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:00:32,487 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:00:32,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:00:32,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:00:32,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:00:32,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:00:32,614 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 02:00:32,614 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:00:32,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 02:00:32,615 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 02:00:32,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 02:00:32,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 02:00:32,615 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. Second operand 3 states. [2019-01-14 02:00:32,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:00:32,734 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2019-01-14 02:00:32,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 02:00:32,736 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-01-14 02:00:32,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 02:00:32,736 INFO L225 Difference]: With dead ends: 44 [2019-01-14 02:00:32,737 INFO L226 Difference]: Without dead ends: 43 [2019-01-14 02:00:32,738 INFO L631 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-01-14 02:00:32,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-01-14 02:00:32,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-01-14 02:00:32,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-01-14 02:00:32,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2019-01-14 02:00:32,751 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 25 [2019-01-14 02:00:32,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 02:00:32,752 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2019-01-14 02:00:32,752 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 02:00:32,752 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2019-01-14 02:00:32,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-01-14 02:00:32,759 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 02:00:32,759 INFO L402 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-01-14 02:00:32,760 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 02:00:32,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:00:32,760 INFO L82 PathProgramCache]: Analyzing trace with hash -1985844013, now seen corresponding path program 1 times [2019-01-14 02:00:32,760 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:00:32,760 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:00:32,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:00:32,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:00:32,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:00:32,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:00:32,877 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 02:00:32,877 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:00:32,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 02:00:32,880 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 02:00:32,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 02:00:32,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 02:00:32,881 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand 3 states. [2019-01-14 02:00:32,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:00:32,915 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2019-01-14 02:00:32,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 02:00:32,916 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-01-14 02:00:32,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 02:00:32,917 INFO L225 Difference]: With dead ends: 43 [2019-01-14 02:00:32,917 INFO L226 Difference]: Without dead ends: 30 [2019-01-14 02:00:32,917 INFO L631 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-01-14 02:00:32,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-01-14 02:00:32,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-01-14 02:00:32,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-01-14 02:00:32,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2019-01-14 02:00:32,924 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 28 [2019-01-14 02:00:32,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 02:00:32,924 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2019-01-14 02:00:32,924 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 02:00:32,925 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2019-01-14 02:00:32,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-01-14 02:00:32,925 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 02:00:32,925 INFO L402 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-01-14 02:00:32,926 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 02:00:32,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:00:32,926 INFO L82 PathProgramCache]: Analyzing trace with hash -1042497349, now seen corresponding path program 1 times [2019-01-14 02:00:32,926 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:00:32,927 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:00:32,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:00:32,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:00:32,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:00:32,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:00:33,073 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-14 02:00:33,075 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:00:33,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 02:00:33,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 02:00:33,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 02:00:33,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 02:00:33,077 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand 3 states. [2019-01-14 02:00:33,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:00:33,164 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2019-01-14 02:00:33,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 02:00:33,165 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-01-14 02:00:33,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 02:00:33,166 INFO L225 Difference]: With dead ends: 30 [2019-01-14 02:00:33,166 INFO L226 Difference]: Without dead ends: 0 [2019-01-14 02:00:33,166 INFO L631 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-01-14 02:00:33,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-14 02:00:33,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-14 02:00:33,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-14 02:00:33,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-14 02:00:33,167 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2019-01-14 02:00:33,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 02:00:33,167 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:00:33,167 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 02:00:33,168 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-14 02:00:33,172 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-14 02:00:33,178 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-14 02:00:33,372 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 11 [2019-01-14 02:00:33,576 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 15 [2019-01-14 02:00:33,770 WARN L181 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 20 [2019-01-14 02:00:33,816 INFO L444 ceAbstractionStarter]: 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-01-14 02:00:33,817 INFO L451 ceAbstractionStarter]: At program point L1889(lines 1861 1890) the Hoare annotation is: true [2019-01-14 02:00:33,817 INFO L448 ceAbstractionStarter]: For program point L1873(line 1873) no Hoare annotation was computed. [2019-01-14 02:00:33,817 INFO L448 ceAbstractionStarter]: For program point L1873-1(line 1873) no Hoare annotation was computed. [2019-01-14 02:00:33,817 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1872) no Hoare annotation was computed. [2019-01-14 02:00:33,817 INFO L448 ceAbstractionStarter]: For program point L1873-2(line 1873) no Hoare annotation was computed. [2019-01-14 02:00:33,817 INFO L448 ceAbstractionStarter]: For program point L1873-3(line 1873) no Hoare annotation was computed. [2019-01-14 02:00:33,817 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1872) no Hoare annotation was computed. [2019-01-14 02:00:33,817 INFO L448 ceAbstractionStarter]: For program point L1865-2(lines 1865 1866) no Hoare annotation was computed. [2019-01-14 02:00:33,818 INFO L448 ceAbstractionStarter]: For program point L1865-3(line 1865) no Hoare annotation was computed. [2019-01-14 02:00:33,818 INFO L444 ceAbstractionStarter]: At program point L1865-4(lines 1865 1866) the Hoare annotation is: (<= 0 (+ ULTIMATE.start_main_~i~3 2147483648)) [2019-01-14 02:00:33,818 INFO L448 ceAbstractionStarter]: For program point L1865-5(lines 1865 1866) no Hoare annotation was computed. [2019-01-14 02:00:33,818 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-14 02:00:33,818 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-14 02:00:33,818 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-14 02:00:33,818 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1880) no Hoare annotation was computed. [2019-01-14 02:00:33,818 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1873) no Hoare annotation was computed. [2019-01-14 02:00:33,818 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1875) no Hoare annotation was computed. [2019-01-14 02:00:33,819 INFO L444 ceAbstractionStarter]: 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-01-14 02:00:33,819 INFO L444 ceAbstractionStarter]: 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-01-14 02:00:33,819 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1884) no Hoare annotation was computed. [2019-01-14 02:00:33,819 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-14 02:00:33,819 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1865) no Hoare annotation was computed. [2019-01-14 02:00:33,819 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1873) no Hoare annotation was computed. [2019-01-14 02:00:33,819 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1880) no Hoare annotation was computed. [2019-01-14 02:00:33,819 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1875) no Hoare annotation was computed. [2019-01-14 02:00:33,820 INFO L448 ceAbstractionStarter]: For program point L1875-2(lines 1875 1882) no Hoare annotation was computed. [2019-01-14 02:00:33,820 INFO L448 ceAbstractionStarter]: For program point L1875-3(line 1875) no Hoare annotation was computed. [2019-01-14 02:00:33,820 INFO L444 ceAbstractionStarter]: 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 .cse0 .cse1 .cse2 (= ULTIMATE.start_main_~i~4 0)) (and (<= 0 (+ ULTIMATE.start_main_~j~0 2147483648)) (<= 0 (+ ULTIMATE.start_main_~i~4 2147483648)) .cse0 .cse1 .cse2))) [2019-01-14 02:00:33,820 INFO L448 ceAbstractionStarter]: For program point L1875-5(lines 1875 1882) no Hoare annotation was computed. [2019-01-14 02:00:33,824 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1884) no Hoare annotation was computed. [2019-01-14 02:00:33,824 INFO L448 ceAbstractionStarter]: For program point L1768(lines 1768 1769) no Hoare annotation was computed. [2019-01-14 02:00:33,824 INFO L448 ceAbstractionStarter]: For program point L1768-1(lines 1768 1769) no Hoare annotation was computed. [2019-01-14 02:00:33,824 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1873) no Hoare annotation was computed. [2019-01-14 02:00:33,824 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1865) no Hoare annotation was computed. [2019-01-14 02:00:33,824 INFO L448 ceAbstractionStarter]: For program point L1884-2(lines 1884 1885) no Hoare annotation was computed. [2019-01-14 02:00:33,824 INFO L448 ceAbstractionStarter]: For program point L1884-3(line 1884) no Hoare annotation was computed. [2019-01-14 02:00:33,825 INFO L444 ceAbstractionStarter]: 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-01-14 02:00:33,825 INFO L448 ceAbstractionStarter]: For program point L1884-5(lines 1884 1885) no Hoare annotation was computed. [2019-01-14 02:00:33,825 INFO L448 ceAbstractionStarter]: For program point L1880-2(lines 1880 1881) no Hoare annotation was computed. [2019-01-14 02:00:33,825 INFO L448 ceAbstractionStarter]: For program point L1880-3(line 1880) no Hoare annotation was computed. [2019-01-14 02:00:33,825 INFO L444 ceAbstractionStarter]: 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-01-14 02:00:33,825 INFO L448 ceAbstractionStarter]: For program point L1872(line 1872) no Hoare annotation was computed. [2019-01-14 02:00:33,825 INFO L448 ceAbstractionStarter]: For program point L1872-1(line 1872) no Hoare annotation was computed. [2019-01-14 02:00:33,825 INFO L448 ceAbstractionStarter]: For program point L1872-2(line 1872) no Hoare annotation was computed. [2019-01-14 02:00:33,826 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1872) no Hoare annotation was computed. [2019-01-14 02:00:33,826 INFO L448 ceAbstractionStarter]: For program point L1872-3(line 1872) no Hoare annotation was computed. [2019-01-14 02:00:33,826 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1872) no Hoare annotation was computed. [2019-01-14 02:00:33,826 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1873) no Hoare annotation was computed. [2019-01-14 02:00:33,844 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.01 02:00:33 BoogieIcfgContainer [2019-01-14 02:00:33,844 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-14 02:00:33,845 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 02:00:33,845 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 02:00:33,845 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 02:00:33,847 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:00:28" (3/4) ... [2019-01-14 02:00:33,852 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-14 02:00:33,866 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2019-01-14 02:00:33,867 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2019-01-14 02:00:33,867 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-01-14 02:00:33,981 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 02:00:33,984 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 02:00:33,986 INFO L168 Benchmark]: Toolchain (without parser) took 8780.80 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 222.3 MB). Free memory was 945.8 MB in the beginning and 996.9 MB in the end (delta: -51.1 MB). Peak memory consumption was 171.2 MB. Max. memory is 11.5 GB. [2019-01-14 02:00:33,986 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:00:33,988 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1925.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 945.8 MB in the beginning and 978.7 MB in the end (delta: -32.9 MB). Peak memory consumption was 120.1 MB. Max. memory is 11.5 GB. [2019-01-14 02:00:33,988 INFO L168 Benchmark]: Boogie Procedure Inliner took 81.39 ms. Allocated memory is still 1.2 GB. Free memory was 978.7 MB in the beginning and 971.9 MB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-01-14 02:00:33,988 INFO L168 Benchmark]: Boogie Preprocessor took 59.85 ms. Allocated memory is still 1.2 GB. Free memory is still 971.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:00:33,989 INFO L168 Benchmark]: RCFGBuilder took 967.26 ms. Allocated memory is still 1.2 GB. Free memory was 971.9 MB in the beginning and 925.6 MB in the end (delta: 46.3 MB). Peak memory consumption was 46.3 MB. Max. memory is 11.5 GB. [2019-01-14 02:00:33,989 INFO L168 Benchmark]: TraceAbstraction took 5600.73 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 84.9 MB). Free memory was 925.6 MB in the beginning and 1.0 GB in the end (delta: -79.5 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-01-14 02:00:33,989 INFO L168 Benchmark]: Witness Printer took 140.17 ms. Allocated memory is still 1.3 GB. Free memory was 1.0 GB in the beginning and 996.9 MB in the end (delta: 8.3 MB). Peak memory consumption was 8.3 MB. Max. memory is 11.5 GB. [2019-01-14 02:00:33,995 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1925.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 945.8 MB in the beginning and 978.7 MB in the end (delta: -32.9 MB). Peak memory consumption was 120.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 81.39 ms. Allocated memory is still 1.2 GB. Free memory was 978.7 MB in the beginning and 971.9 MB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 59.85 ms. Allocated memory is still 1.2 GB. Free memory is still 971.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 967.26 ms. Allocated memory is still 1.2 GB. Free memory was 971.9 MB in the beginning and 925.6 MB in the end (delta: 46.3 MB). Peak memory consumption was 46.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5600.73 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 84.9 MB). Free memory was 925.6 MB in the beginning and 1.0 GB in the end (delta: -79.5 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Witness Printer took 140.17 ms. Allocated memory is still 1.3 GB. Free memory was 1.0 GB in the beginning and 996.9 MB in the end (delta: 8.3 MB). Peak memory consumption was 8.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1872]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 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: 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: 1875]: 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: 1873]: 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: 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: 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: 1880]: 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: (((1 <= argc && argc <= 10000) && 0 <= i + 2147483648) && i == 0) || ((((0 <= j + 2147483648 && 0 <= i + 2147483648) && 1 <= argc) && argc <= 10000) && 0 <= i + 2147483648) - 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. SAFE Result, 5.5s OverallTime, 15 OverallIterations, 2 TraceHistogramMax, 2.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 484 SDtfs, 241 SDslu, 337 SDs, 0 SdLazy, 172 SolverSat, 18 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 35 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s 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 AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 42 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 8 PreInvPairs, 21 NumberOfFragments, 123 HoareAnnotationTreeSize, 8 FomulaSimplifications, 1073 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 166 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.7s 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, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...