./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/bitvector/byte_add-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 20ed64ec Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector/byte_add-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-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 32bit --witnessprinter.graph.data.programhash 57155ec4d1c294d255486bcf60492b490ef9efa5 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Overflow*32bit*_Bitvector*.epf No suitable settings file found using Overflow*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample --- Real Ultimate output --- This is Ultimate 0.2.1-dev-20ed64e [2021-08-27 11:25:26,086 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-27 11:25:26,089 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-27 11:25:26,127 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-27 11:25:26,127 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-27 11:25:26,132 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-27 11:25:26,133 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-27 11:25:26,139 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-27 11:25:26,141 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-27 11:25:26,147 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-27 11:25:26,148 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-27 11:25:26,152 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-27 11:25:26,152 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-27 11:25:26,155 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-27 11:25:26,156 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-27 11:25:26,160 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-27 11:25:26,161 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-27 11:25:26,164 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-27 11:25:26,167 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-27 11:25:26,169 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-27 11:25:26,173 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-27 11:25:26,174 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-27 11:25:26,175 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-27 11:25:26,177 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-27 11:25:26,181 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-27 11:25:26,181 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-27 11:25:26,182 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-27 11:25:26,183 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-27 11:25:26,184 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-27 11:25:26,184 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-27 11:25:26,185 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-27 11:25:26,186 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-27 11:25:26,187 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-27 11:25:26,188 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-27 11:25:26,189 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-27 11:25:26,189 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-27 11:25:26,190 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-27 11:25:26,190 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-27 11:25:26,190 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-27 11:25:26,192 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-27 11:25:26,192 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-27 11:25:26,196 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2021-08-27 11:25:26,236 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-27 11:25:26,243 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-27 11:25:26,244 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-27 11:25:26,244 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-27 11:25:26,246 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-27 11:25:26,246 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-27 11:25:26,247 INFO L138 SettingsManager]: * Use SBE=true [2021-08-27 11:25:26,247 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-27 11:25:26,247 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-27 11:25:26,247 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-08-27 11:25:26,248 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-27 11:25:26,248 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-27 11:25:26,249 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-27 11:25:26,249 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-27 11:25:26,249 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-27 11:25:26,249 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-27 11:25:26,249 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2021-08-27 11:25:26,249 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-27 11:25:26,250 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-27 11:25:26,250 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-27 11:25:26,250 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-27 11:25:26,250 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-27 11:25:26,251 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-27 11:25:26,251 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-27 11:25:26,251 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-27 11:25:26,251 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-27 11:25:26,251 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-27 11:25:26,252 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-27 11:25:26,252 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-27 11:25:26,252 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-27 11:25:26,252 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-27 11:25:26,252 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-27 11:25:26,253 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 57155ec4d1c294d255486bcf60492b490ef9efa5 [2021-08-27 11:25:26,537 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-27 11:25:26,567 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-27 11:25:26,569 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-27 11:25:26,570 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-27 11:25:26,571 INFO L275 PluginConnector]: CDTParser initialized [2021-08-27 11:25:26,573 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/byte_add-2.i [2021-08-27 11:25:26,636 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e9cef616/ca87c8a99bff41e5a901bc87f87a75fb/FLAGc73acc5aa [2021-08-27 11:25:27,083 INFO L306 CDTParser]: Found 1 translation units. [2021-08-27 11:25:27,084 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add-2.i [2021-08-27 11:25:27,096 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e9cef616/ca87c8a99bff41e5a901bc87f87a75fb/FLAGc73acc5aa [2021-08-27 11:25:27,113 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e9cef616/ca87c8a99bff41e5a901bc87f87a75fb [2021-08-27 11:25:27,115 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-27 11:25:27,117 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-27 11:25:27,119 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-27 11:25:27,119 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-27 11:25:27,123 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-27 11:25:27,123 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 11:25:27" (1/1) ... [2021-08-27 11:25:27,125 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78d00795 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 11:25:27, skipping insertion in model container [2021-08-27 11:25:27,125 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 11:25:27" (1/1) ... [2021-08-27 11:25:27,131 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-27 11:25:27,150 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-27 11:25:27,253 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add-2.i[861,874] [2021-08-27 11:25:27,301 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 11:25:27,315 INFO L203 MainTranslator]: Completed pre-run [2021-08-27 11:25:27,345 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add-2.i[861,874] [2021-08-27 11:25:27,371 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 11:25:27,392 INFO L208 MainTranslator]: Completed translation [2021-08-27 11:25:27,392 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 11:25:27 WrapperNode [2021-08-27 11:25:27,392 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-27 11:25:27,393 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-27 11:25:27,394 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-27 11:25:27,394 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-27 11:25:27,399 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 11:25:27" (1/1) ... [2021-08-27 11:25:27,406 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 11:25:27" (1/1) ... [2021-08-27 11:25:27,427 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-27 11:25:27,428 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-27 11:25:27,429 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-27 11:25:27,429 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-27 11:25:27,435 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 11:25:27" (1/1) ... [2021-08-27 11:25:27,436 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 11:25:27" (1/1) ... [2021-08-27 11:25:27,438 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 11:25:27" (1/1) ... [2021-08-27 11:25:27,438 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 11:25:27" (1/1) ... [2021-08-27 11:25:27,443 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 11:25:27" (1/1) ... [2021-08-27 11:25:27,454 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 11:25:27" (1/1) ... [2021-08-27 11:25:27,455 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 11:25:27" (1/1) ... [2021-08-27 11:25:27,466 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-27 11:25:27,467 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-27 11:25:27,467 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-27 11:25:27,467 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-27 11:25:27,468 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 11:25:27" (1/1) ... [2021-08-27 11:25:27,477 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-27 11:25:27,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 11:25:27,495 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-08-27 11:25:27,497 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-08-27 11:25:27,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-27 11:25:27,528 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-27 11:25:27,529 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-27 11:25:27,529 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-27 11:25:27,886 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-27 11:25:27,886 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-08-27 11:25:27,888 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 11:25:27 BoogieIcfgContainer [2021-08-27 11:25:27,888 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-27 11:25:27,890 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-27 11:25:27,898 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-27 11:25:27,901 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-27 11:25:27,901 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 11:25:27" (1/3) ... [2021-08-27 11:25:27,902 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c1bee75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 11:25:27, skipping insertion in model container [2021-08-27 11:25:27,902 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 11:25:27" (2/3) ... [2021-08-27 11:25:27,902 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c1bee75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 11:25:27, skipping insertion in model container [2021-08-27 11:25:27,902 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 11:25:27" (3/3) ... [2021-08-27 11:25:27,904 INFO L111 eAbstractionObserver]: Analyzing ICFG byte_add-2.i [2021-08-27 11:25:27,914 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-27 11:25:27,914 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 38 error locations. [2021-08-27 11:25:27,953 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-27 11:25:27,959 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-08-27 11:25:27,959 INFO L340 AbstractCegarLoop]: Starting to check reachability of 38 error locations. [2021-08-27 11:25:27,974 INFO L276 IsEmpty]: Start isEmpty. Operand has 114 states, 75 states have (on average 1.9066666666666667) internal successors, (143), 113 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:25:27,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-08-27 11:25:27,978 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 11:25:27,978 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2021-08-27 11:25:27,979 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-08-27 11:25:27,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 11:25:27,983 INFO L82 PathProgramCache]: Analyzing trace with hash 925604, now seen corresponding path program 1 times [2021-08-27 11:25:27,991 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 11:25:27,991 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940532346] [2021-08-27 11:25:27,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:25:27,992 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 11:25:28,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:25:28,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 11:25:28,154 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 11:25:28,155 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940532346] [2021-08-27 11:25:28,155 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940532346] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 11:25:28,156 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 11:25:28,156 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-08-27 11:25:28,158 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796719509] [2021-08-27 11:25:28,164 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-08-27 11:25:28,165 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 11:25:28,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-08-27 11:25:28,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-08-27 11:25:28,183 INFO L87 Difference]: Start difference. First operand has 114 states, 75 states have (on average 1.9066666666666667) internal successors, (143), 113 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 1 states have (on average 4.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:25:28,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 11:25:28,209 INFO L93 Difference]: Finished difference Result 135 states and 177 transitions. [2021-08-27 11:25:28,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-08-27 11:25:28,210 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 4.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2021-08-27 11:25:28,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 11:25:28,219 INFO L225 Difference]: With dead ends: 135 [2021-08-27 11:25:28,219 INFO L226 Difference]: Without dead ends: 69 [2021-08-27 11:25:28,223 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-08-27 11:25:28,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2021-08-27 11:25:28,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2021-08-27 11:25:28,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 68 states have (on average 1.3970588235294117) internal successors, (95), 68 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:25:28,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 95 transitions. [2021-08-27 11:25:28,276 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 95 transitions. Word has length 4 [2021-08-27 11:25:28,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 11:25:28,277 INFO L470 AbstractCegarLoop]: Abstraction has 69 states and 95 transitions. [2021-08-27 11:25:28,277 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 4.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:25:28,278 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 95 transitions. [2021-08-27 11:25:28,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-08-27 11:25:28,279 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 11:25:28,279 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 11:25:28,280 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-27 11:25:28,280 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-08-27 11:25:28,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 11:25:28,284 INFO L82 PathProgramCache]: Analyzing trace with hash 1944470950, now seen corresponding path program 1 times [2021-08-27 11:25:28,284 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 11:25:28,284 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871662361] [2021-08-27 11:25:28,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:25:28,284 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 11:25:28,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:25:28,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 11:25:28,414 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 11:25:28,414 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871662361] [2021-08-27 11:25:28,414 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871662361] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 11:25:28,414 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 11:25:28,414 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 11:25:28,415 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733141345] [2021-08-27 11:25:28,416 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-27 11:25:28,416 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 11:25:28,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 11:25:28,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 11:25:28,417 INFO L87 Difference]: Start difference. First operand 69 states and 95 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:25:28,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 11:25:28,588 INFO L93 Difference]: Finished difference Result 145 states and 212 transitions. [2021-08-27 11:25:28,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 11:25:28,589 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-08-27 11:25:28,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 11:25:28,591 INFO L225 Difference]: With dead ends: 145 [2021-08-27 11:25:28,592 INFO L226 Difference]: Without dead ends: 98 [2021-08-27 11:25:28,593 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 11:25:28,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2021-08-27 11:25:28,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 94. [2021-08-27 11:25:28,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 93 states have (on average 1.3333333333333333) internal successors, (124), 93 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:25:28,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 124 transitions. [2021-08-27 11:25:28,614 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 124 transitions. Word has length 13 [2021-08-27 11:25:28,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 11:25:28,614 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 124 transitions. [2021-08-27 11:25:28,615 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:25:28,615 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 124 transitions. [2021-08-27 11:25:28,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-08-27 11:25:28,616 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 11:25:28,617 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 11:25:28,617 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-27 11:25:28,618 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-08-27 11:25:28,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 11:25:28,619 INFO L82 PathProgramCache]: Analyzing trace with hash 565405448, now seen corresponding path program 1 times [2021-08-27 11:25:28,620 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 11:25:28,620 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418760474] [2021-08-27 11:25:28,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:25:28,621 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 11:25:28,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:25:28,796 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 11:25:28,797 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 11:25:28,797 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418760474] [2021-08-27 11:25:28,798 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418760474] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 11:25:28,799 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 11:25:28,799 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 11:25:28,800 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139344217] [2021-08-27 11:25:28,801 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 11:25:28,801 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 11:25:28,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 11:25:28,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 11:25:28,803 INFO L87 Difference]: Start difference. First operand 94 states and 124 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:25:29,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 11:25:29,006 INFO L93 Difference]: Finished difference Result 221 states and 296 transitions. [2021-08-27 11:25:29,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 11:25:29,007 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-08-27 11:25:29,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 11:25:29,012 INFO L225 Difference]: With dead ends: 221 [2021-08-27 11:25:29,012 INFO L226 Difference]: Without dead ends: 164 [2021-08-27 11:25:29,013 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 35.3ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 11:25:29,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2021-08-27 11:25:29,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 104. [2021-08-27 11:25:29,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 103 states have (on average 1.3106796116504855) internal successors, (135), 103 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:25:29,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 135 transitions. [2021-08-27 11:25:29,020 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 135 transitions. Word has length 20 [2021-08-27 11:25:29,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 11:25:29,020 INFO L470 AbstractCegarLoop]: Abstraction has 104 states and 135 transitions. [2021-08-27 11:25:29,020 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:25:29,020 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 135 transitions. [2021-08-27 11:25:29,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-08-27 11:25:29,021 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 11:25:29,021 INFO L512 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] [2021-08-27 11:25:29,021 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-27 11:25:29,021 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-08-27 11:25:29,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 11:25:29,022 INFO L82 PathProgramCache]: Analyzing trace with hash -1055427225, now seen corresponding path program 1 times [2021-08-27 11:25:29,022 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 11:25:29,022 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919415688] [2021-08-27 11:25:29,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:25:29,022 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 11:25:29,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:25:29,098 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 11:25:29,099 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 11:25:29,099 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919415688] [2021-08-27 11:25:29,099 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919415688] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 11:25:29,100 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 11:25:29,100 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 11:25:29,100 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915582863] [2021-08-27 11:25:29,100 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 11:25:29,101 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 11:25:29,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 11:25:29,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 11:25:29,102 INFO L87 Difference]: Start difference. First operand 104 states and 135 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:25:29,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 11:25:29,285 INFO L93 Difference]: Finished difference Result 259 states and 340 transitions. [2021-08-27 11:25:29,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 11:25:29,286 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-08-27 11:25:29,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 11:25:29,287 INFO L225 Difference]: With dead ends: 259 [2021-08-27 11:25:29,287 INFO L226 Difference]: Without dead ends: 194 [2021-08-27 11:25:29,288 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 20.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 11:25:29,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2021-08-27 11:25:29,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 120. [2021-08-27 11:25:29,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 119 states have (on average 1.2941176470588236) internal successors, (154), 119 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:25:29,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 154 transitions. [2021-08-27 11:25:29,313 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 154 transitions. Word has length 23 [2021-08-27 11:25:29,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 11:25:29,313 INFO L470 AbstractCegarLoop]: Abstraction has 120 states and 154 transitions. [2021-08-27 11:25:29,314 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:25:29,314 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 154 transitions. [2021-08-27 11:25:29,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-08-27 11:25:29,316 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 11:25:29,316 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 11:25:29,316 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-27 11:25:29,316 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-08-27 11:25:29,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 11:25:29,319 INFO L82 PathProgramCache]: Analyzing trace with hash -2113419709, now seen corresponding path program 1 times [2021-08-27 11:25:29,319 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 11:25:29,320 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448606575] [2021-08-27 11:25:29,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:25:29,320 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 11:25:29,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:25:29,392 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 11:25:29,393 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 11:25:29,393 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448606575] [2021-08-27 11:25:29,393 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448606575] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 11:25:29,394 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1626837988] [2021-08-27 11:25:29,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:25:29,394 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 11:25:29,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 11:25:29,396 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 11:25:29,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-08-27 11:25:29,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:25:29,452 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-27 11:25:29,456 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 11:25:29,677 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 11:25:29,677 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1626837988] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 11:25:29,677 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-08-27 11:25:29,678 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2021-08-27 11:25:29,678 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023943797] [2021-08-27 11:25:29,678 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 11:25:29,678 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 11:25:29,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 11:25:29,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-08-27 11:25:29,679 INFO L87 Difference]: Start difference. First operand 120 states and 154 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:25:29,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 11:25:29,869 INFO L93 Difference]: Finished difference Result 216 states and 307 transitions. [2021-08-27 11:25:29,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 11:25:29,869 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-08-27 11:25:29,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 11:25:29,870 INFO L225 Difference]: With dead ends: 216 [2021-08-27 11:25:29,870 INFO L226 Difference]: Without dead ends: 169 [2021-08-27 11:25:29,871 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 39.3ms TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-08-27 11:25:29,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2021-08-27 11:25:29,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 145. [2021-08-27 11:25:29,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 144 states have (on average 1.2708333333333333) internal successors, (183), 144 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:25:29,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 183 transitions. [2021-08-27 11:25:29,876 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 183 transitions. Word has length 26 [2021-08-27 11:25:29,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 11:25:29,876 INFO L470 AbstractCegarLoop]: Abstraction has 145 states and 183 transitions. [2021-08-27 11:25:29,877 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:25:29,877 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 183 transitions. [2021-08-27 11:25:29,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-08-27 11:25:29,878 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 11:25:29,878 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 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] [2021-08-27 11:25:29,907 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-08-27 11:25:30,097 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 11:25:30,097 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-08-27 11:25:30,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 11:25:30,097 INFO L82 PathProgramCache]: Analyzing trace with hash 1301565703, now seen corresponding path program 1 times [2021-08-27 11:25:30,098 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 11:25:30,098 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888325288] [2021-08-27 11:25:30,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:25:30,098 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 11:25:30,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:25:30,204 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 11:25:30,205 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 11:25:30,205 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888325288] [2021-08-27 11:25:30,205 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888325288] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 11:25:30,205 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [99019394] [2021-08-27 11:25:30,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:25:30,206 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 11:25:30,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 11:25:30,221 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 11:25:30,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-08-27 11:25:30,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:25:30,298 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 5 conjunts are in the unsatisfiable core [2021-08-27 11:25:30,299 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 11:25:30,524 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-08-27 11:25:30,524 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [99019394] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 11:25:30,524 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-08-27 11:25:30,525 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2021-08-27 11:25:30,525 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646557557] [2021-08-27 11:25:30,526 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 11:25:30,526 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 11:25:30,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 11:25:30,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-08-27 11:25:30,527 INFO L87 Difference]: Start difference. First operand 145 states and 183 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:25:30,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 11:25:30,779 INFO L93 Difference]: Finished difference Result 290 states and 391 transitions. [2021-08-27 11:25:30,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 11:25:30,780 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2021-08-27 11:25:30,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 11:25:30,781 INFO L225 Difference]: With dead ends: 290 [2021-08-27 11:25:30,781 INFO L226 Difference]: Without dead ends: 198 [2021-08-27 11:25:30,781 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 61.8ms TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-08-27 11:25:30,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2021-08-27 11:25:30,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 170. [2021-08-27 11:25:30,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 169 states have (on average 1.2544378698224852) internal successors, (212), 169 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:25:30,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 212 transitions. [2021-08-27 11:25:30,787 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 212 transitions. Word has length 33 [2021-08-27 11:25:30,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 11:25:30,787 INFO L470 AbstractCegarLoop]: Abstraction has 170 states and 212 transitions. [2021-08-27 11:25:30,787 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:25:30,788 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 212 transitions. [2021-08-27 11:25:30,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-08-27 11:25:30,789 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 11:25:30,789 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 11:25:30,816 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-08-27 11:25:31,008 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2021-08-27 11:25:31,009 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-08-27 11:25:31,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 11:25:31,010 INFO L82 PathProgramCache]: Analyzing trace with hash -665492217, now seen corresponding path program 1 times [2021-08-27 11:25:31,010 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 11:25:31,010 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959506775] [2021-08-27 11:25:31,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:25:31,010 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 11:25:31,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:25:31,103 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 11:25:31,104 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 11:25:31,104 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959506775] [2021-08-27 11:25:31,104 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959506775] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 11:25:31,104 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [738884848] [2021-08-27 11:25:31,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:25:31,105 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 11:25:31,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 11:25:31,106 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 11:25:31,133 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-08-27 11:25:31,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:25:31,203 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 5 conjunts are in the unsatisfiable core [2021-08-27 11:25:31,206 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 11:25:31,409 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-08-27 11:25:31,409 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [738884848] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 11:25:31,410 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-08-27 11:25:31,410 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2021-08-27 11:25:31,410 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119082076] [2021-08-27 11:25:31,410 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 11:25:31,411 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 11:25:31,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 11:25:31,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-08-27 11:25:31,412 INFO L87 Difference]: Start difference. First operand 170 states and 212 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:25:31,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 11:25:31,639 INFO L93 Difference]: Finished difference Result 340 states and 447 transitions. [2021-08-27 11:25:31,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 11:25:31,640 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2021-08-27 11:25:31,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 11:25:31,641 INFO L225 Difference]: With dead ends: 340 [2021-08-27 11:25:31,641 INFO L226 Difference]: Without dead ends: 223 [2021-08-27 11:25:31,641 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 36.1ms TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-08-27 11:25:31,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2021-08-27 11:25:31,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 195. [2021-08-27 11:25:31,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 194 states have (on average 1.2422680412371134) internal successors, (241), 194 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:25:31,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 241 transitions. [2021-08-27 11:25:31,646 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 241 transitions. Word has length 40 [2021-08-27 11:25:31,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 11:25:31,647 INFO L470 AbstractCegarLoop]: Abstraction has 195 states and 241 transitions. [2021-08-27 11:25:31,647 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:25:31,647 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 241 transitions. [2021-08-27 11:25:31,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-08-27 11:25:31,648 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 11:25:31,648 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 11:25:31,679 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-08-27 11:25:31,867 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 11:25:31,867 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-08-27 11:25:31,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 11:25:31,868 INFO L82 PathProgramCache]: Analyzing trace with hash 973067587, now seen corresponding path program 1 times [2021-08-27 11:25:31,868 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 11:25:31,868 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435520772] [2021-08-27 11:25:31,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:25:31,868 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 11:25:31,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:25:31,914 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-08-27 11:25:31,915 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 11:25:31,915 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435520772] [2021-08-27 11:25:31,918 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435520772] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 11:25:31,918 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 11:25:31,918 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-27 11:25:31,919 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339031977] [2021-08-27 11:25:31,919 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-27 11:25:31,919 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 11:25:31,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 11:25:31,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 11:25:31,920 INFO L87 Difference]: Start difference. First operand 195 states and 241 transitions. Second operand has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:25:31,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 11:25:31,928 INFO L93 Difference]: Finished difference Result 232 states and 282 transitions. [2021-08-27 11:25:31,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 11:25:31,928 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2021-08-27 11:25:31,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 11:25:31,930 INFO L225 Difference]: With dead ends: 232 [2021-08-27 11:25:31,932 INFO L226 Difference]: Without dead ends: 169 [2021-08-27 11:25:31,934 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 11:25:31,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2021-08-27 11:25:31,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2021-08-27 11:25:31,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 168 states have (on average 1.2321428571428572) internal successors, (207), 168 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:25:31,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 207 transitions. [2021-08-27 11:25:31,940 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 207 transitions. Word has length 47 [2021-08-27 11:25:31,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 11:25:31,940 INFO L470 AbstractCegarLoop]: Abstraction has 169 states and 207 transitions. [2021-08-27 11:25:31,942 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:25:31,943 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 207 transitions. [2021-08-27 11:25:31,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-08-27 11:25:31,944 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 11:25:31,945 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 11:25:31,945 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-27 11:25:31,945 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-08-27 11:25:31,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 11:25:31,946 INFO L82 PathProgramCache]: Analyzing trace with hash 1501188431, now seen corresponding path program 1 times [2021-08-27 11:25:31,946 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 11:25:31,946 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883765950] [2021-08-27 11:25:31,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:25:31,946 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 11:25:31,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:25:32,038 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2021-08-27 11:25:32,039 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 11:25:32,039 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883765950] [2021-08-27 11:25:32,039 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883765950] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 11:25:32,039 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 11:25:32,039 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-27 11:25:32,040 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708901072] [2021-08-27 11:25:32,041 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-27 11:25:32,043 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 11:25:32,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 11:25:32,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-08-27 11:25:32,044 INFO L87 Difference]: Start difference. First operand 169 states and 207 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:25:32,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 11:25:32,200 INFO L93 Difference]: Finished difference Result 465 states and 573 transitions. [2021-08-27 11:25:32,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-27 11:25:32,200 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2021-08-27 11:25:32,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 11:25:32,202 INFO L225 Difference]: With dead ends: 465 [2021-08-27 11:25:32,202 INFO L226 Difference]: Without dead ends: 347 [2021-08-27 11:25:32,203 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 30.0ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-08-27 11:25:32,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2021-08-27 11:25:32,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 209. [2021-08-27 11:25:32,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 208 states have (on average 1.2307692307692308) internal successors, (256), 208 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:25:32,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 256 transitions. [2021-08-27 11:25:32,211 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 256 transitions. Word has length 59 [2021-08-27 11:25:32,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 11:25:32,211 INFO L470 AbstractCegarLoop]: Abstraction has 209 states and 256 transitions. [2021-08-27 11:25:32,211 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:25:32,211 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 256 transitions. [2021-08-27 11:25:32,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-08-27 11:25:32,212 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 11:25:32,212 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 11:25:32,212 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-27 11:25:32,213 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-08-27 11:25:32,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 11:25:32,213 INFO L82 PathProgramCache]: Analyzing trace with hash -451056364, now seen corresponding path program 1 times [2021-08-27 11:25:32,213 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 11:25:32,214 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948384259] [2021-08-27 11:25:32,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:25:32,214 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 11:25:32,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:25:32,268 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-08-27 11:25:32,269 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 11:25:32,269 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948384259] [2021-08-27 11:25:32,269 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948384259] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 11:25:32,269 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 11:25:32,269 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 11:25:32,270 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975723742] [2021-08-27 11:25:32,270 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 11:25:32,270 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 11:25:32,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 11:25:32,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 11:25:32,271 INFO L87 Difference]: Start difference. First operand 209 states and 256 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:25:32,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 11:25:32,329 INFO L93 Difference]: Finished difference Result 465 states and 569 transitions. [2021-08-27 11:25:32,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 11:25:32,329 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2021-08-27 11:25:32,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 11:25:32,330 INFO L225 Difference]: With dead ends: 465 [2021-08-27 11:25:32,331 INFO L226 Difference]: Without dead ends: 307 [2021-08-27 11:25:32,331 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 11:25:32,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2021-08-27 11:25:32,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 225. [2021-08-27 11:25:32,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 224 states have (on average 1.2633928571428572) internal successors, (283), 224 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:25:32,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 283 transitions. [2021-08-27 11:25:32,337 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 283 transitions. Word has length 62 [2021-08-27 11:25:32,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 11:25:32,338 INFO L470 AbstractCegarLoop]: Abstraction has 225 states and 283 transitions. [2021-08-27 11:25:32,338 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:25:32,338 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 283 transitions. [2021-08-27 11:25:32,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-08-27 11:25:32,339 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 11:25:32,339 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 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, 1, 1, 1, 1] [2021-08-27 11:25:32,339 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-27 11:25:32,339 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-08-27 11:25:32,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 11:25:32,340 INFO L82 PathProgramCache]: Analyzing trace with hash -1517528546, now seen corresponding path program 1 times [2021-08-27 11:25:32,340 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 11:25:32,340 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039932219] [2021-08-27 11:25:32,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:25:32,341 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 11:25:32,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:25:32,436 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-27 11:25:32,436 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 11:25:32,436 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039932219] [2021-08-27 11:25:32,437 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039932219] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 11:25:32,437 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 11:25:32,437 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-27 11:25:32,437 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082512693] [2021-08-27 11:25:32,437 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-27 11:25:32,437 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 11:25:32,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 11:25:32,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-27 11:25:32,438 INFO L87 Difference]: Start difference. First operand 225 states and 283 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:25:32,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 11:25:32,688 INFO L93 Difference]: Finished difference Result 619 states and 780 transitions. [2021-08-27 11:25:32,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-27 11:25:32,689 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2021-08-27 11:25:32,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 11:25:32,691 INFO L225 Difference]: With dead ends: 619 [2021-08-27 11:25:32,691 INFO L226 Difference]: Without dead ends: 440 [2021-08-27 11:25:32,692 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 41.9ms TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2021-08-27 11:25:32,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2021-08-27 11:25:32,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 361. [2021-08-27 11:25:32,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 360 states have (on average 1.2583333333333333) internal successors, (453), 360 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:25:32,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 453 transitions. [2021-08-27 11:25:32,704 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 453 transitions. Word has length 68 [2021-08-27 11:25:32,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 11:25:32,704 INFO L470 AbstractCegarLoop]: Abstraction has 361 states and 453 transitions. [2021-08-27 11:25:32,705 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:25:32,705 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 453 transitions. [2021-08-27 11:25:32,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-08-27 11:25:32,705 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 11:25:32,706 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 11:25:32,707 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-08-27 11:25:32,707 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-08-27 11:25:32,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 11:25:32,707 INFO L82 PathProgramCache]: Analyzing trace with hash 2020673026, now seen corresponding path program 1 times [2021-08-27 11:25:32,708 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 11:25:32,708 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643941027] [2021-08-27 11:25:32,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:25:32,708 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 11:25:32,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:25:32,760 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 46 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-08-27 11:25:32,760 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 11:25:32,760 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643941027] [2021-08-27 11:25:32,761 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643941027] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 11:25:32,761 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1360575252] [2021-08-27 11:25:32,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:25:32,761 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 11:25:32,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 11:25:32,765 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 11:25:32,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-08-27 11:25:32,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:25:32,870 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-27 11:25:32,879 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 11:25:33,106 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-08-27 11:25:33,106 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1360575252] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 11:25:33,106 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-08-27 11:25:33,106 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2021-08-27 11:25:33,107 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799048568] [2021-08-27 11:25:33,107 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 11:25:33,107 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 11:25:33,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 11:25:33,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-27 11:25:33,108 INFO L87 Difference]: Start difference. First operand 361 states and 453 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:25:33,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 11:25:33,213 INFO L93 Difference]: Finished difference Result 960 states and 1198 transitions. [2021-08-27 11:25:33,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 11:25:33,213 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2021-08-27 11:25:33,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 11:25:33,215 INFO L225 Difference]: With dead ends: 960 [2021-08-27 11:25:33,216 INFO L226 Difference]: Without dead ends: 616 [2021-08-27 11:25:33,216 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 68 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 11.0ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-27 11:25:33,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2021-08-27 11:25:33,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 496. [2021-08-27 11:25:33,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 496 states, 495 states have (on average 1.2585858585858587) internal successors, (623), 495 states have internal predecessors, (623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:25:33,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 623 transitions. [2021-08-27 11:25:33,230 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 623 transitions. Word has length 68 [2021-08-27 11:25:33,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 11:25:33,230 INFO L470 AbstractCegarLoop]: Abstraction has 496 states and 623 transitions. [2021-08-27 11:25:33,230 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:25:33,230 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 623 transitions. [2021-08-27 11:25:33,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-08-27 11:25:33,231 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 11:25:33,232 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 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, 1, 1, 1, 1] [2021-08-27 11:25:33,259 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-08-27 11:25:33,444 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 11:25:33,445 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-08-27 11:25:33,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 11:25:33,445 INFO L82 PathProgramCache]: Analyzing trace with hash 579694859, now seen corresponding path program 1 times [2021-08-27 11:25:33,445 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 11:25:33,445 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386965858] [2021-08-27 11:25:33,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:25:33,446 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 11:25:33,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:25:33,525 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-08-27 11:25:33,526 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 11:25:33,526 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386965858] [2021-08-27 11:25:33,526 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386965858] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 11:25:33,526 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 11:25:33,526 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-27 11:25:33,526 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030652466] [2021-08-27 11:25:33,527 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-27 11:25:33,527 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 11:25:33,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 11:25:33,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-27 11:25:33,528 INFO L87 Difference]: Start difference. First operand 496 states and 623 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:25:33,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 11:25:33,763 INFO L93 Difference]: Finished difference Result 1194 states and 1490 transitions. [2021-08-27 11:25:33,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-27 11:25:33,764 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2021-08-27 11:25:33,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 11:25:33,766 INFO L225 Difference]: With dead ends: 1194 [2021-08-27 11:25:33,766 INFO L226 Difference]: Without dead ends: 717 [2021-08-27 11:25:33,767 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 50.6ms TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2021-08-27 11:25:33,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2021-08-27 11:25:33,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 603. [2021-08-27 11:25:33,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 603 states, 602 states have (on average 1.255813953488372) internal successors, (756), 602 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:25:33,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 756 transitions. [2021-08-27 11:25:33,783 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 756 transitions. Word has length 68 [2021-08-27 11:25:33,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 11:25:33,784 INFO L470 AbstractCegarLoop]: Abstraction has 603 states and 756 transitions. [2021-08-27 11:25:33,784 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:25:33,784 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 756 transitions. [2021-08-27 11:25:33,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-08-27 11:25:33,787 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 11:25:33,787 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1] [2021-08-27 11:25:33,787 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-08-27 11:25:33,788 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-08-27 11:25:33,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 11:25:33,788 INFO L82 PathProgramCache]: Analyzing trace with hash 415029660, now seen corresponding path program 1 times [2021-08-27 11:25:33,788 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 11:25:33,789 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837691379] [2021-08-27 11:25:33,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:25:33,789 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 11:25:33,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:25:33,870 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-08-27 11:25:33,871 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 11:25:33,872 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837691379] [2021-08-27 11:25:33,873 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837691379] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 11:25:33,873 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 11:25:33,873 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-27 11:25:33,873 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387564328] [2021-08-27 11:25:33,874 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-27 11:25:33,874 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 11:25:33,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-27 11:25:33,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-08-27 11:25:33,874 INFO L87 Difference]: Start difference. First operand 603 states and 756 transitions. Second operand has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:25:34,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 11:25:34,225 INFO L93 Difference]: Finished difference Result 1482 states and 1841 transitions. [2021-08-27 11:25:34,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-27 11:25:34,226 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2021-08-27 11:25:34,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 11:25:34,228 INFO L225 Difference]: With dead ends: 1482 [2021-08-27 11:25:34,228 INFO L226 Difference]: Without dead ends: 825 [2021-08-27 11:25:34,229 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 73.8ms TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2021-08-27 11:25:34,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 825 states. [2021-08-27 11:25:34,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 825 to 717. [2021-08-27 11:25:34,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 717 states, 716 states have (on average 1.2569832402234637) internal successors, (900), 716 states have internal predecessors, (900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:25:34,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 717 states and 900 transitions. [2021-08-27 11:25:34,246 INFO L78 Accepts]: Start accepts. Automaton has 717 states and 900 transitions. Word has length 74 [2021-08-27 11:25:34,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 11:25:34,246 INFO L470 AbstractCegarLoop]: Abstraction has 717 states and 900 transitions. [2021-08-27 11:25:34,246 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:25:34,246 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 900 transitions. [2021-08-27 11:25:34,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-08-27 11:25:34,247 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 11:25:34,247 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 11:25:34,248 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-08-27 11:25:34,248 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-08-27 11:25:34,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 11:25:34,248 INFO L82 PathProgramCache]: Analyzing trace with hash -78732058, now seen corresponding path program 1 times [2021-08-27 11:25:34,249 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 11:25:34,249 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879266634] [2021-08-27 11:25:34,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:25:34,249 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 11:25:34,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:25:34,302 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 39 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2021-08-27 11:25:34,302 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 11:25:34,303 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879266634] [2021-08-27 11:25:34,303 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879266634] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 11:25:34,303 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [672878129] [2021-08-27 11:25:34,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:25:34,303 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 11:25:34,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 11:25:34,304 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 11:25:34,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-08-27 11:25:34,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:25:34,436 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 11 conjunts are in the unsatisfiable core [2021-08-27 11:25:34,438 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 11:25:34,782 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 26 proven. 43 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-08-27 11:25:34,782 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [672878129] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 11:25:34,782 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 11:25:34,783 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6] total 6 [2021-08-27 11:25:34,783 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137319141] [2021-08-27 11:25:34,783 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-27 11:25:34,784 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 11:25:34,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-27 11:25:34,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-08-27 11:25:34,785 INFO L87 Difference]: Start difference. First operand 717 states and 900 transitions. Second operand has 7 states, 6 states have (on average 12.666666666666666) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:25:35,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 11:25:35,527 INFO L93 Difference]: Finished difference Result 2236 states and 2670 transitions. [2021-08-27 11:25:35,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-08-27 11:25:35,527 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 12.666666666666666) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2021-08-27 11:25:35,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 11:25:35,534 INFO L225 Difference]: With dead ends: 2236 [2021-08-27 11:25:35,535 INFO L226 Difference]: Without dead ends: 2211 [2021-08-27 11:25:35,537 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 157.4ms TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2021-08-27 11:25:35,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2211 states. [2021-08-27 11:25:35,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2211 to 993. [2021-08-27 11:25:35,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 993 states, 992 states have (on average 1.3629032258064515) internal successors, (1352), 992 states have internal predecessors, (1352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:25:35,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 993 states to 993 states and 1352 transitions. [2021-08-27 11:25:35,575 INFO L78 Accepts]: Start accepts. Automaton has 993 states and 1352 transitions. Word has length 74 [2021-08-27 11:25:35,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 11:25:35,575 INFO L470 AbstractCegarLoop]: Abstraction has 993 states and 1352 transitions. [2021-08-27 11:25:35,575 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 12.666666666666666) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:25:35,575 INFO L276 IsEmpty]: Start isEmpty. Operand 993 states and 1352 transitions. [2021-08-27 11:25:35,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-08-27 11:25:35,577 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 11:25:35,577 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1] [2021-08-27 11:25:35,604 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-08-27 11:25:35,796 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-08-27 11:25:35,797 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-08-27 11:25:35,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 11:25:35,797 INFO L82 PathProgramCache]: Analyzing trace with hash -2110504499, now seen corresponding path program 1 times [2021-08-27 11:25:35,797 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 11:25:35,798 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222208594] [2021-08-27 11:25:35,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:25:35,798 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 11:25:35,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:25:35,883 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-08-27 11:25:35,883 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 11:25:35,883 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222208594] [2021-08-27 11:25:35,883 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222208594] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 11:25:35,883 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 11:25:35,883 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-27 11:25:35,884 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350169942] [2021-08-27 11:25:35,884 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-27 11:25:35,884 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 11:25:35,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-27 11:25:35,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-08-27 11:25:35,885 INFO L87 Difference]: Start difference. First operand 993 states and 1352 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:25:36,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 11:25:36,262 INFO L93 Difference]: Finished difference Result 2272 states and 3078 transitions. [2021-08-27 11:25:36,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-27 11:25:36,263 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2021-08-27 11:25:36,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 11:25:36,268 INFO L225 Difference]: With dead ends: 2272 [2021-08-27 11:25:36,268 INFO L226 Difference]: Without dead ends: 1264 [2021-08-27 11:25:36,269 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 80.7ms TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2021-08-27 11:25:36,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1264 states. [2021-08-27 11:25:36,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1264 to 1141. [2021-08-27 11:25:36,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1141 states, 1140 states have (on average 1.3666666666666667) internal successors, (1558), 1140 states have internal predecessors, (1558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:25:36,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1141 states to 1141 states and 1558 transitions. [2021-08-27 11:25:36,301 INFO L78 Accepts]: Start accepts. Automaton has 1141 states and 1558 transitions. Word has length 74 [2021-08-27 11:25:36,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 11:25:36,302 INFO L470 AbstractCegarLoop]: Abstraction has 1141 states and 1558 transitions. [2021-08-27 11:25:36,302 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:25:36,302 INFO L276 IsEmpty]: Start isEmpty. Operand 1141 states and 1558 transitions. [2021-08-27 11:25:36,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-08-27 11:25:36,303 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 11:25:36,304 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 11:25:36,304 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-08-27 11:25:36,304 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-08-27 11:25:36,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 11:25:36,304 INFO L82 PathProgramCache]: Analyzing trace with hash 220871532, now seen corresponding path program 1 times [2021-08-27 11:25:36,305 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 11:25:36,305 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145470607] [2021-08-27 11:25:36,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:25:36,305 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 11:25:36,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:25:36,427 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2021-08-27 11:25:36,427 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 11:25:36,427 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145470607] [2021-08-27 11:25:36,428 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145470607] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 11:25:36,428 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 11:25:36,428 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-27 11:25:36,428 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554844795] [2021-08-27 11:25:36,429 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-27 11:25:36,429 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 11:25:36,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 11:25:36,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-27 11:25:36,430 INFO L87 Difference]: Start difference. First operand 1141 states and 1558 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:25:36,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 11:25:36,718 INFO L93 Difference]: Finished difference Result 3568 states and 4858 transitions. [2021-08-27 11:25:36,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-27 11:25:36,719 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2021-08-27 11:25:36,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 11:25:36,731 INFO L225 Difference]: With dead ends: 3568 [2021-08-27 11:25:36,731 INFO L226 Difference]: Without dead ends: 3401 [2021-08-27 11:25:36,733 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 48.1ms TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-08-27 11:25:36,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3401 states. [2021-08-27 11:25:36,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3401 to 1141. [2021-08-27 11:25:36,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1141 states, 1140 states have (on average 1.3666666666666667) internal successors, (1558), 1140 states have internal predecessors, (1558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:25:36,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1141 states to 1141 states and 1558 transitions. [2021-08-27 11:25:36,789 INFO L78 Accepts]: Start accepts. Automaton has 1141 states and 1558 transitions. Word has length 80 [2021-08-27 11:25:36,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 11:25:36,790 INFO L470 AbstractCegarLoop]: Abstraction has 1141 states and 1558 transitions. [2021-08-27 11:25:36,790 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:25:36,790 INFO L276 IsEmpty]: Start isEmpty. Operand 1141 states and 1558 transitions. [2021-08-27 11:25:36,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-08-27 11:25:36,791 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 11:25:36,792 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 11:25:36,792 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-08-27 11:25:36,792 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-08-27 11:25:36,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 11:25:36,793 INFO L82 PathProgramCache]: Analyzing trace with hash 25170625, now seen corresponding path program 1 times [2021-08-27 11:25:36,793 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 11:25:36,793 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686094943] [2021-08-27 11:25:36,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:25:36,793 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 11:25:36,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:25:36,885 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2021-08-27 11:25:36,885 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 11:25:36,885 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686094943] [2021-08-27 11:25:36,886 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686094943] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 11:25:36,886 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 11:25:36,886 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-27 11:25:36,886 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971193514] [2021-08-27 11:25:36,887 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-27 11:25:36,887 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 11:25:36,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 11:25:36,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-27 11:25:36,888 INFO L87 Difference]: Start difference. First operand 1141 states and 1558 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:25:37,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 11:25:37,203 INFO L93 Difference]: Finished difference Result 3558 states and 4844 transitions. [2021-08-27 11:25:37,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-27 11:25:37,204 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2021-08-27 11:25:37,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 11:25:37,214 INFO L225 Difference]: With dead ends: 3558 [2021-08-27 11:25:37,214 INFO L226 Difference]: Without dead ends: 3384 [2021-08-27 11:25:37,216 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 38.5ms TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-08-27 11:25:37,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3384 states. [2021-08-27 11:25:37,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3384 to 1141. [2021-08-27 11:25:37,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1141 states, 1140 states have (on average 1.3666666666666667) internal successors, (1558), 1140 states have internal predecessors, (1558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:25:37,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1141 states to 1141 states and 1558 transitions. [2021-08-27 11:25:37,267 INFO L78 Accepts]: Start accepts. Automaton has 1141 states and 1558 transitions. Word has length 80 [2021-08-27 11:25:37,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 11:25:37,267 INFO L470 AbstractCegarLoop]: Abstraction has 1141 states and 1558 transitions. [2021-08-27 11:25:37,267 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:25:37,267 INFO L276 IsEmpty]: Start isEmpty. Operand 1141 states and 1558 transitions. [2021-08-27 11:25:37,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-08-27 11:25:37,268 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 11:25:37,269 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 11:25:37,269 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-08-27 11:25:37,269 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-08-27 11:25:37,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 11:25:37,269 INFO L82 PathProgramCache]: Analyzing trace with hash 1618881827, now seen corresponding path program 1 times [2021-08-27 11:25:37,270 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 11:25:37,270 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578928504] [2021-08-27 11:25:37,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:25:37,270 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 11:25:37,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:25:37,385 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2021-08-27 11:25:37,385 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 11:25:37,385 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578928504] [2021-08-27 11:25:37,386 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578928504] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 11:25:37,386 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 11:25:37,386 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-27 11:25:37,386 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138274062] [2021-08-27 11:25:37,387 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-27 11:25:37,387 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 11:25:37,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 11:25:37,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-27 11:25:37,388 INFO L87 Difference]: Start difference. First operand 1141 states and 1558 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:25:37,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 11:25:37,836 INFO L93 Difference]: Finished difference Result 4706 states and 6408 transitions. [2021-08-27 11:25:37,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-27 11:25:37,837 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2021-08-27 11:25:37,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 11:25:37,851 INFO L225 Difference]: With dead ends: 4706 [2021-08-27 11:25:37,852 INFO L226 Difference]: Without dead ends: 4539 [2021-08-27 11:25:37,854 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 61.0ms TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-08-27 11:25:37,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4539 states. [2021-08-27 11:25:37,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4539 to 1141. [2021-08-27 11:25:37,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1141 states, 1140 states have (on average 1.3666666666666667) internal successors, (1558), 1140 states have internal predecessors, (1558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:25:37,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1141 states to 1141 states and 1558 transitions. [2021-08-27 11:25:37,913 INFO L78 Accepts]: Start accepts. Automaton has 1141 states and 1558 transitions. Word has length 83 [2021-08-27 11:25:37,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 11:25:37,914 INFO L470 AbstractCegarLoop]: Abstraction has 1141 states and 1558 transitions. [2021-08-27 11:25:37,914 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:25:37,914 INFO L276 IsEmpty]: Start isEmpty. Operand 1141 states and 1558 transitions. [2021-08-27 11:25:37,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-08-27 11:25:37,917 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 11:25:37,917 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 11:25:37,917 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-08-27 11:25:37,917 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-08-27 11:25:37,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 11:25:37,918 INFO L82 PathProgramCache]: Analyzing trace with hash -705708941, now seen corresponding path program 1 times [2021-08-27 11:25:37,918 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 11:25:37,918 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969882738] [2021-08-27 11:25:37,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:25:37,919 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 11:25:37,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:25:38,036 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2021-08-27 11:25:38,037 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 11:25:38,037 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969882738] [2021-08-27 11:25:38,037 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969882738] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 11:25:38,037 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 11:25:38,037 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-27 11:25:38,038 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315603947] [2021-08-27 11:25:38,038 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-27 11:25:38,038 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 11:25:38,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 11:25:38,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-27 11:25:38,039 INFO L87 Difference]: Start difference. First operand 1141 states and 1558 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:25:38,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 11:25:38,498 INFO L93 Difference]: Finished difference Result 4686 states and 6381 transitions. [2021-08-27 11:25:38,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-27 11:25:38,499 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2021-08-27 11:25:38,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 11:25:38,514 INFO L225 Difference]: With dead ends: 4686 [2021-08-27 11:25:38,514 INFO L226 Difference]: Without dead ends: 4512 [2021-08-27 11:25:38,516 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 64.6ms TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-08-27 11:25:38,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4512 states. [2021-08-27 11:25:38,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4512 to 1141. [2021-08-27 11:25:38,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1141 states, 1140 states have (on average 1.3666666666666667) internal successors, (1558), 1140 states have internal predecessors, (1558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:25:38,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1141 states to 1141 states and 1558 transitions. [2021-08-27 11:25:38,596 INFO L78 Accepts]: Start accepts. Automaton has 1141 states and 1558 transitions. Word has length 83 [2021-08-27 11:25:38,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 11:25:38,596 INFO L470 AbstractCegarLoop]: Abstraction has 1141 states and 1558 transitions. [2021-08-27 11:25:38,596 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:25:38,597 INFO L276 IsEmpty]: Start isEmpty. Operand 1141 states and 1558 transitions. [2021-08-27 11:25:38,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-08-27 11:25:38,598 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 11:25:38,598 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 11:25:38,599 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-08-27 11:25:38,599 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-08-27 11:25:38,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 11:25:38,599 INFO L82 PathProgramCache]: Analyzing trace with hash -1508814206, now seen corresponding path program 1 times [2021-08-27 11:25:38,600 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 11:25:38,600 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904327711] [2021-08-27 11:25:38,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:25:38,601 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 11:25:38,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:25:38,704 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 50 proven. 3 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2021-08-27 11:25:38,704 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 11:25:38,704 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904327711] [2021-08-27 11:25:38,705 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904327711] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 11:25:38,705 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [185493556] [2021-08-27 11:25:38,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:25:38,705 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 11:25:38,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 11:25:38,706 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 11:25:38,707 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-08-27 11:25:38,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:25:38,903 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 5 conjunts are in the unsatisfiable core [2021-08-27 11:25:38,913 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 11:25:39,167 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 49 proven. 3 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-08-27 11:25:39,167 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [185493556] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 11:25:39,168 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 11:25:39,168 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 7 [2021-08-27 11:25:39,168 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337837155] [2021-08-27 11:25:39,168 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-27 11:25:39,168 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 11:25:39,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-27 11:25:39,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-08-27 11:25:39,169 INFO L87 Difference]: Start difference. First operand 1141 states and 1558 transitions. Second operand has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 7 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:25:39,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 11:25:39,338 INFO L93 Difference]: Finished difference Result 2890 states and 3972 transitions. [2021-08-27 11:25:39,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 11:25:39,339 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 7 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2021-08-27 11:25:39,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 11:25:39,344 INFO L225 Difference]: With dead ends: 2890 [2021-08-27 11:25:39,345 INFO L226 Difference]: Without dead ends: 1772 [2021-08-27 11:25:39,346 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 50.4ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-27 11:25:39,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1772 states. [2021-08-27 11:25:39,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1772 to 1710. [2021-08-27 11:25:39,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1710 states, 1709 states have (on average 1.366296079578701) internal successors, (2335), 1709 states have internal predecessors, (2335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:25:39,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1710 states to 1710 states and 2335 transitions. [2021-08-27 11:25:39,391 INFO L78 Accepts]: Start accepts. Automaton has 1710 states and 2335 transitions. Word has length 83 [2021-08-27 11:25:39,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 11:25:39,392 INFO L470 AbstractCegarLoop]: Abstraction has 1710 states and 2335 transitions. [2021-08-27 11:25:39,392 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 7 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:25:39,392 INFO L276 IsEmpty]: Start isEmpty. Operand 1710 states and 2335 transitions. [2021-08-27 11:25:39,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-08-27 11:25:39,394 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 11:25:39,394 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 11:25:39,418 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-08-27 11:25:39,610 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 11:25:39,610 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-08-27 11:25:39,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 11:25:39,610 INFO L82 PathProgramCache]: Analyzing trace with hash 335021134, now seen corresponding path program 1 times [2021-08-27 11:25:39,611 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 11:25:39,611 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992950728] [2021-08-27 11:25:39,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:25:39,611 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 11:25:39,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:25:39,715 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 54 proven. 3 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2021-08-27 11:25:39,716 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 11:25:39,716 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992950728] [2021-08-27 11:25:39,716 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992950728] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 11:25:39,716 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2056013110] [2021-08-27 11:25:39,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:25:39,717 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 11:25:39,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 11:25:39,717 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 11:25:39,744 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-08-27 11:25:39,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:25:39,941 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 5 conjunts are in the unsatisfiable core [2021-08-27 11:25:39,946 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 11:25:40,202 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2021-08-27 11:25:40,202 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2056013110] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 11:25:40,203 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-08-27 11:25:40,203 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2021-08-27 11:25:40,203 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580076049] [2021-08-27 11:25:40,205 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 11:25:40,205 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 11:25:40,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 11:25:40,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-08-27 11:25:40,206 INFO L87 Difference]: Start difference. First operand 1710 states and 2335 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:25:40,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 11:25:40,332 INFO L93 Difference]: Finished difference Result 3688 states and 5024 transitions. [2021-08-27 11:25:40,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 11:25:40,333 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2021-08-27 11:25:40,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 11:25:40,355 INFO L225 Difference]: With dead ends: 3688 [2021-08-27 11:25:40,356 INFO L226 Difference]: Without dead ends: 3308 [2021-08-27 11:25:40,358 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 43.4ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-08-27 11:25:40,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3308 states. [2021-08-27 11:25:40,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3308 to 2800. [2021-08-27 11:25:40,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2800 states, 2799 states have (on average 1.3615576991782778) internal successors, (3811), 2799 states have internal predecessors, (3811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:25:40,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2800 states to 2800 states and 3811 transitions. [2021-08-27 11:25:40,432 INFO L78 Accepts]: Start accepts. Automaton has 2800 states and 3811 transitions. Word has length 83 [2021-08-27 11:25:40,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 11:25:40,432 INFO L470 AbstractCegarLoop]: Abstraction has 2800 states and 3811 transitions. [2021-08-27 11:25:40,433 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:25:40,433 INFO L276 IsEmpty]: Start isEmpty. Operand 2800 states and 3811 transitions. [2021-08-27 11:25:40,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-08-27 11:25:40,435 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 11:25:40,435 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 11:25:40,463 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-08-27 11:25:40,648 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 11:25:40,649 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-08-27 11:25:40,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 11:25:40,649 INFO L82 PathProgramCache]: Analyzing trace with hash 1670983295, now seen corresponding path program 1 times [2021-08-27 11:25:40,649 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 11:25:40,650 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057402114] [2021-08-27 11:25:40,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:25:40,650 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 11:25:40,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:25:40,759 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2021-08-27 11:25:40,759 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 11:25:40,759 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057402114] [2021-08-27 11:25:40,759 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057402114] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 11:25:40,759 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 11:25:40,760 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-27 11:25:40,760 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855889495] [2021-08-27 11:25:40,760 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-27 11:25:40,760 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 11:25:40,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-27 11:25:40,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-08-27 11:25:40,761 INFO L87 Difference]: Start difference. First operand 2800 states and 3811 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:25:41,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 11:25:41,390 INFO L93 Difference]: Finished difference Result 6496 states and 8813 transitions. [2021-08-27 11:25:41,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-27 11:25:41,391 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2021-08-27 11:25:41,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 11:25:41,403 INFO L225 Difference]: With dead ends: 6496 [2021-08-27 11:25:41,404 INFO L226 Difference]: Without dead ends: 6329 [2021-08-27 11:25:41,407 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 84.1ms TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-08-27 11:25:41,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6329 states. [2021-08-27 11:25:41,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6329 to 2779. [2021-08-27 11:25:41,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2779 states, 2778 states have (on average 1.3621310295176385) internal successors, (3784), 2778 states have internal predecessors, (3784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:25:41,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2779 states to 2779 states and 3784 transitions. [2021-08-27 11:25:41,514 INFO L78 Accepts]: Start accepts. Automaton has 2779 states and 3784 transitions. Word has length 85 [2021-08-27 11:25:41,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 11:25:41,515 INFO L470 AbstractCegarLoop]: Abstraction has 2779 states and 3784 transitions. [2021-08-27 11:25:41,515 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:25:41,515 INFO L276 IsEmpty]: Start isEmpty. Operand 2779 states and 3784 transitions. [2021-08-27 11:25:41,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-08-27 11:25:41,517 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 11:25:41,517 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 11:25:41,518 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-08-27 11:25:41,518 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-08-27 11:25:41,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 11:25:41,518 INFO L82 PathProgramCache]: Analyzing trace with hash -1447135889, now seen corresponding path program 1 times [2021-08-27 11:25:41,519 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 11:25:41,521 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621875286] [2021-08-27 11:25:41,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:25:41,521 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 11:25:41,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:25:41,646 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2021-08-27 11:25:41,646 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 11:25:41,646 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621875286] [2021-08-27 11:25:41,646 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621875286] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 11:25:41,646 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 11:25:41,647 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-27 11:25:41,647 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129642382] [2021-08-27 11:25:41,647 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-27 11:25:41,647 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 11:25:41,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-27 11:25:41,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-08-27 11:25:41,648 INFO L87 Difference]: Start difference. First operand 2779 states and 3784 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:25:42,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 11:25:42,238 INFO L93 Difference]: Finished difference Result 7009 states and 9507 transitions. [2021-08-27 11:25:42,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-27 11:25:42,239 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2021-08-27 11:25:42,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 11:25:42,253 INFO L225 Difference]: With dead ends: 7009 [2021-08-27 11:25:42,253 INFO L226 Difference]: Without dead ends: 6685 [2021-08-27 11:25:42,256 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 76.3ms TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-08-27 11:25:42,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6685 states. [2021-08-27 11:25:42,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6685 to 2771. [2021-08-27 11:25:42,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2771 states, 2770 states have (on average 1.3631768953068593) internal successors, (3776), 2770 states have internal predecessors, (3776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:25:42,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2771 states to 2771 states and 3776 transitions. [2021-08-27 11:25:42,353 INFO L78 Accepts]: Start accepts. Automaton has 2771 states and 3776 transitions. Word has length 85 [2021-08-27 11:25:42,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 11:25:42,353 INFO L470 AbstractCegarLoop]: Abstraction has 2771 states and 3776 transitions. [2021-08-27 11:25:42,353 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:25:42,353 INFO L276 IsEmpty]: Start isEmpty. Operand 2771 states and 3776 transitions. [2021-08-27 11:25:42,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-08-27 11:25:42,355 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 11:25:42,356 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 11:25:42,356 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-08-27 11:25:42,356 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-08-27 11:25:42,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 11:25:42,357 INFO L82 PathProgramCache]: Analyzing trace with hash -566259362, now seen corresponding path program 1 times [2021-08-27 11:25:42,357 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 11:25:42,357 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690388694] [2021-08-27 11:25:42,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:25:42,357 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 11:25:42,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:25:42,464 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 49 proven. 5 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2021-08-27 11:25:42,465 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 11:25:42,465 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690388694] [2021-08-27 11:25:42,465 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690388694] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 11:25:42,465 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1037246663] [2021-08-27 11:25:42,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:25:42,465 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 11:25:42,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 11:25:42,466 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 11:25:42,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-08-27 11:25:42,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:25:42,911 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 8 conjunts are in the unsatisfiable core [2021-08-27 11:25:42,912 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 11:25:43,511 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 49 proven. 3 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-08-27 11:25:43,511 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1037246663] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 11:25:43,511 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 11:25:43,511 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2021-08-27 11:25:43,511 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165544530] [2021-08-27 11:25:43,512 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-27 11:25:43,512 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 11:25:43,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-27 11:25:43,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2021-08-27 11:25:43,513 INFO L87 Difference]: Start difference. First operand 2771 states and 3776 transitions. Second operand has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:25:44,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 11:25:44,038 INFO L93 Difference]: Finished difference Result 7103 states and 9866 transitions. [2021-08-27 11:25:44,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-27 11:25:44,039 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2021-08-27 11:25:44,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 11:25:44,046 INFO L225 Difference]: With dead ends: 7103 [2021-08-27 11:25:44,047 INFO L226 Difference]: Without dead ends: 3949 [2021-08-27 11:25:44,051 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 83 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 137.6ms TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2021-08-27 11:25:44,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3949 states. [2021-08-27 11:25:44,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3949 to 3270. [2021-08-27 11:25:44,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3270 states, 3269 states have (on average 1.343530131538697) internal successors, (4392), 3269 states have internal predecessors, (4392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:25:44,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3270 states to 3270 states and 4392 transitions. [2021-08-27 11:25:44,181 INFO L78 Accepts]: Start accepts. Automaton has 3270 states and 4392 transitions. Word has length 86 [2021-08-27 11:25:44,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 11:25:44,181 INFO L470 AbstractCegarLoop]: Abstraction has 3270 states and 4392 transitions. [2021-08-27 11:25:44,182 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:25:44,182 INFO L276 IsEmpty]: Start isEmpty. Operand 3270 states and 4392 transitions. [2021-08-27 11:25:44,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-08-27 11:25:44,184 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 11:25:44,184 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 11:25:44,193 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2021-08-27 11:25:44,391 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2021-08-27 11:25:44,392 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-08-27 11:25:44,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 11:25:44,392 INFO L82 PathProgramCache]: Analyzing trace with hash 1279960591, now seen corresponding path program 1 times [2021-08-27 11:25:44,392 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 11:25:44,392 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991739493] [2021-08-27 11:25:44,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:25:44,393 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 11:25:44,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:25:44,504 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 51 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2021-08-27 11:25:44,504 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 11:25:44,504 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991739493] [2021-08-27 11:25:44,504 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991739493] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 11:25:44,504 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1903294975] [2021-08-27 11:25:44,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:25:44,505 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 11:25:44,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 11:25:44,506 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 11:25:44,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-08-27 11:25:44,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:25:44,962 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 8 conjunts are in the unsatisfiable core [2021-08-27 11:25:44,963 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 11:25:45,569 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 51 proven. 4 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-08-27 11:25:45,570 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1903294975] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 11:25:45,570 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 11:25:45,570 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 10 [2021-08-27 11:25:45,570 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657440707] [2021-08-27 11:25:45,571 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-27 11:25:45,571 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 11:25:45,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-27 11:25:45,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2021-08-27 11:25:45,572 INFO L87 Difference]: Start difference. First operand 3270 states and 4392 transitions. Second operand has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:25:46,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 11:25:46,126 INFO L93 Difference]: Finished difference Result 6924 states and 9194 transitions. [2021-08-27 11:25:46,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-27 11:25:46,126 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2021-08-27 11:25:46,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 11:25:46,137 INFO L225 Difference]: With dead ends: 6924 [2021-08-27 11:25:46,137 INFO L226 Difference]: Without dead ends: 5746 [2021-08-27 11:25:46,140 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 83 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 122.6ms TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2021-08-27 11:25:46,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5746 states. [2021-08-27 11:25:46,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5746 to 4068. [2021-08-27 11:25:46,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4068 states, 4067 states have (on average 1.3420211458077207) internal successors, (5458), 4067 states have internal predecessors, (5458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:25:46,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4068 states to 4068 states and 5458 transitions. [2021-08-27 11:25:46,254 INFO L78 Accepts]: Start accepts. Automaton has 4068 states and 5458 transitions. Word has length 86 [2021-08-27 11:25:46,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 11:25:46,255 INFO L470 AbstractCegarLoop]: Abstraction has 4068 states and 5458 transitions. [2021-08-27 11:25:46,255 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:25:46,255 INFO L276 IsEmpty]: Start isEmpty. Operand 4068 states and 5458 transitions. [2021-08-27 11:25:46,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-08-27 11:25:46,258 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 11:25:46,258 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 11:25:46,264 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2021-08-27 11:25:46,463 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2021-08-27 11:25:46,464 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-08-27 11:25:46,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 11:25:46,464 INFO L82 PathProgramCache]: Analyzing trace with hash -1246814763, now seen corresponding path program 1 times [2021-08-27 11:25:46,464 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 11:25:46,465 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919527199] [2021-08-27 11:25:46,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:25:46,465 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 11:25:46,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:25:46,578 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 49 proven. 5 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2021-08-27 11:25:46,579 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 11:25:46,579 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919527199] [2021-08-27 11:25:46,579 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919527199] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 11:25:46,579 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1778939227] [2021-08-27 11:25:46,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:25:46,579 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 11:25:46,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 11:25:46,580 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 11:25:46,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-08-27 11:25:47,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:25:47,113 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 10 conjunts are in the unsatisfiable core [2021-08-27 11:25:47,114 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 11:25:48,279 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 49 proven. 3 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-08-27 11:25:48,280 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1778939227] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 11:25:48,280 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 11:25:48,280 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2021-08-27 11:25:48,280 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878934421] [2021-08-27 11:25:48,280 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-08-27 11:25:48,281 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 11:25:48,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-27 11:25:48,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-08-27 11:25:48,281 INFO L87 Difference]: Start difference. First operand 4068 states and 5458 transitions. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:25:49,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 11:25:49,087 INFO L93 Difference]: Finished difference Result 6995 states and 9340 transitions. [2021-08-27 11:25:49,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-27 11:25:49,088 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2021-08-27 11:25:49,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 11:25:49,098 INFO L225 Difference]: With dead ends: 6995 [2021-08-27 11:25:49,098 INFO L226 Difference]: Without dead ends: 4763 [2021-08-27 11:25:49,102 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 85 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 229.6ms TimeCoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2021-08-27 11:25:49,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4763 states. [2021-08-27 11:25:49,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4763 to 4262. [2021-08-27 11:25:49,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4262 states, 4261 states have (on average 1.335836658061488) internal successors, (5692), 4261 states have internal predecessors, (5692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:25:49,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4262 states to 4262 states and 5692 transitions. [2021-08-27 11:25:49,206 INFO L78 Accepts]: Start accepts. Automaton has 4262 states and 5692 transitions. Word has length 89 [2021-08-27 11:25:49,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 11:25:49,206 INFO L470 AbstractCegarLoop]: Abstraction has 4262 states and 5692 transitions. [2021-08-27 11:25:49,206 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:25:49,207 INFO L276 IsEmpty]: Start isEmpty. Operand 4262 states and 5692 transitions. [2021-08-27 11:25:49,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-08-27 11:25:49,209 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 11:25:49,209 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 11:25:49,218 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-08-27 11:25:49,416 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2021-08-27 11:25:49,417 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-08-27 11:25:49,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 11:25:49,417 INFO L82 PathProgramCache]: Analyzing trace with hash -1767062975, now seen corresponding path program 1 times [2021-08-27 11:25:49,417 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 11:25:49,417 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095408136] [2021-08-27 11:25:49,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:25:49,418 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 11:25:49,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:25:49,531 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 51 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2021-08-27 11:25:49,531 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 11:25:49,531 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095408136] [2021-08-27 11:25:49,531 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095408136] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 11:25:49,531 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2000801657] [2021-08-27 11:25:49,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:25:49,532 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 11:25:49,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 11:25:49,537 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 11:25:49,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-08-27 11:25:49,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 11:25:49,988 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 9 conjunts are in the unsatisfiable core [2021-08-27 11:25:49,989 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 11:25:51,636 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2021-08-27 11:25:51,637 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2000801657] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 11:25:51,637 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-08-27 11:25:51,637 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 11 [2021-08-27 11:25:51,637 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871405888] [2021-08-27 11:25:51,638 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-27 11:25:51,638 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 11:25:51,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 11:25:51,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2021-08-27 11:25:51,639 INFO L87 Difference]: Start difference. First operand 4262 states and 5692 transitions. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:25:52,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 11:25:52,034 INFO L93 Difference]: Finished difference Result 8750 states and 11567 transitions. [2021-08-27 11:25:52,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-27 11:25:52,035 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2021-08-27 11:25:52,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 11:25:52,048 INFO L225 Difference]: With dead ends: 8750 [2021-08-27 11:25:52,049 INFO L226 Difference]: Without dead ends: 8338 [2021-08-27 11:25:52,050 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 86 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 105.1ms TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2021-08-27 11:25:52,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8338 states. [2021-08-27 11:25:52,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8338 to 4262. [2021-08-27 11:25:52,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4262 states, 4261 states have (on average 1.335836658061488) internal successors, (5692), 4261 states have internal predecessors, (5692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:25:52,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4262 states to 4262 states and 5692 transitions. [2021-08-27 11:25:52,178 INFO L78 Accepts]: Start accepts. Automaton has 4262 states and 5692 transitions. Word has length 89 [2021-08-27 11:25:52,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 11:25:52,178 INFO L470 AbstractCegarLoop]: Abstraction has 4262 states and 5692 transitions. [2021-08-27 11:25:52,179 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 11:25:52,179 INFO L276 IsEmpty]: Start isEmpty. Operand 4262 states and 5692 transitions. [2021-08-27 11:25:52,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-08-27 11:25:52,185 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 11:25:52,185 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 11:25:52,193 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-08-27 11:25:52,391 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2021-08-27 11:25:52,391 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2021-08-27 11:25:52,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 11:25:52,392 INFO L82 PathProgramCache]: Analyzing trace with hash -1585272271, now seen corresponding path program 1 times [2021-08-27 11:25:52,392 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 11:25:52,392 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361924966] [2021-08-27 11:25:52,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 11:25:52,392 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 11:25:52,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 11:25:52,435 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 11:25:52,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 11:25:52,489 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 11:25:52,490 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-08-27 11:25:52,490 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:25:52,492 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:25:52,492 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:25:52,492 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:25:52,493 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:25:52,493 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:25:52,493 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:25:52,493 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:25:52,493 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:25:52,493 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:25:52,494 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:25:52,494 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:25:52,494 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:25:52,494 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:25:52,494 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:25:52,494 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:25:52,495 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:25:52,495 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:25:52,495 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:25:52,495 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:25:52,495 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:25:52,495 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:25:52,496 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:25:52,496 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:25:52,496 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:25:52,496 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:25:52,496 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:25:52,496 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:25:52,497 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:25:52,497 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:25:52,497 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:25:52,497 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:25:52,497 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:25:52,497 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:25:52,498 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:25:52,498 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:25:52,498 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:25:52,499 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 11:25:52,499 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-08-27 11:25:52,504 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-27 11:25:52,580 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.08 11:25:52 BoogieIcfgContainer [2021-08-27 11:25:52,580 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-27 11:25:52,581 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-27 11:25:52,582 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-27 11:25:52,582 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-27 11:25:52,582 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 11:25:27" (3/4) ... [2021-08-27 11:25:52,585 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-08-27 11:25:52,585 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-27 11:25:52,586 INFO L168 Benchmark]: Toolchain (without parser) took 25468.10 ms. Allocated memory was 50.3 MB in the beginning and 423.6 MB in the end (delta: 373.3 MB). Free memory was 26.1 MB in the beginning and 263.9 MB in the end (delta: -237.9 MB). Peak memory consumption was 133.9 MB. Max. memory is 16.1 GB. [2021-08-27 11:25:52,586 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 50.3 MB. Free memory was 32.4 MB in the beginning and 32.3 MB in the end (delta: 31.4 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 11:25:52,587 INFO L168 Benchmark]: CACSL2BoogieTranslator took 273.55 ms. Allocated memory was 50.3 MB in the beginning and 60.8 MB in the end (delta: 10.5 MB). Free memory was 25.9 MB in the beginning and 43.4 MB in the end (delta: -17.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 16.1 GB. [2021-08-27 11:25:52,587 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.43 ms. Allocated memory is still 60.8 MB. Free memory was 43.4 MB in the beginning and 41.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-27 11:25:52,587 INFO L168 Benchmark]: Boogie Preprocessor took 37.52 ms. Allocated memory is still 60.8 MB. Free memory was 41.3 MB in the beginning and 39.9 MB in the end (delta: 1.3 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 11:25:52,588 INFO L168 Benchmark]: RCFGBuilder took 421.57 ms. Allocated memory is still 60.8 MB. Free memory was 39.8 MB in the beginning and 26.0 MB in the end (delta: 13.8 MB). Peak memory consumption was 16.4 MB. Max. memory is 16.1 GB. [2021-08-27 11:25:52,588 INFO L168 Benchmark]: TraceAbstraction took 24690.43 ms. Allocated memory was 60.8 MB in the beginning and 423.6 MB in the end (delta: 362.8 MB). Free memory was 25.7 MB in the beginning and 263.9 MB in the end (delta: -238.3 MB). Peak memory consumption was 123.9 MB. Max. memory is 16.1 GB. [2021-08-27 11:25:52,588 INFO L168 Benchmark]: Witness Printer took 4.15 ms. Allocated memory is still 423.6 MB. Free memory is still 263.9 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 11:25:52,590 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 50.3 MB. Free memory was 32.4 MB in the beginning and 32.3 MB in the end (delta: 31.4 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 273.55 ms. Allocated memory was 50.3 MB in the beginning and 60.8 MB in the end (delta: 10.5 MB). Free memory was 25.9 MB in the beginning and 43.4 MB in the end (delta: -17.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 34.43 ms. Allocated memory is still 60.8 MB. Free memory was 43.4 MB in the beginning and 41.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 37.52 ms. Allocated memory is still 60.8 MB. Free memory was 41.3 MB in the beginning and 39.9 MB in the end (delta: 1.3 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 421.57 ms. Allocated memory is still 60.8 MB. Free memory was 39.8 MB in the beginning and 26.0 MB in the end (delta: 13.8 MB). Peak memory consumption was 16.4 MB. Max. memory is 16.1 GB. * TraceAbstraction took 24690.43 ms. Allocated memory was 60.8 MB in the beginning and 423.6 MB in the end (delta: 362.8 MB). Free memory was 25.7 MB in the beginning and 263.9 MB in the end (delta: -238.3 MB). Peak memory consumption was 123.9 MB. Max. memory is 16.1 GB. * Witness Printer took 4.15 ms. Allocated memory is still 423.6 MB. Free memory is still 263.9 MB. There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 108]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of bitwiseAnd at line 88. Possible FailurePath: [L116] unsigned int a, b, r; [L118] a = __VERIFIER_nondet_uint() [L119] b = __VERIFIER_nondet_uint() [L34] unsigned char a0, a1, a2, a3; [L35] unsigned char b0, b1, b2, b3; [L36] unsigned char r0, r1, r2, r3; [L37] unsigned short carry; [L38] unsigned short partial_sum; [L39] unsigned int r; [L40] unsigned char i; [L41] unsigned char na, nb; [L42] a0 = a [L43] a1 = a >> 8 [L44] a2 = a >> 16U [L45] a3 = a >> 24U [L46] b0 = b [L47] b1 = b >> 8U [L48] b2 = b >> 16U [L49] b3 = b >> 24U [L50] na = (unsigned char)4 [L51] COND TRUE a3 == (unsigned char)0 [L52] EXPR na - 1 [L52] na = na - 1 [L53] COND TRUE a2 == (unsigned char)0 [L54] EXPR na - 1 [L54] na = na - 1 [L55] COND TRUE a1 == (unsigned char)0 [L56] EXPR na - 1 [L56] na = na - 1 [L60] nb = (unsigned char)4 [L61] COND FALSE !(b3 == (unsigned char)0) [L70] carry = (unsigned short)0 [L71] i = (unsigned char)0 [L72] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L73] partial_sum = carry [L74] carry = (unsigned short)0 [L75] COND TRUE i < na [L76] COND TRUE i == (unsigned char)0 [L76] EXPR partial_sum + a0 [L76] partial_sum = partial_sum + a0 [L77] COND FALSE !(i == (unsigned char)1) [L78] COND FALSE !(i == (unsigned char)2) [L79] COND FALSE !(i == (unsigned char)3) [L81] COND TRUE i < nb [L82] COND TRUE i == (unsigned char)0 [L82] EXPR partial_sum + b0 [L82] partial_sum = partial_sum + b0 [L83] COND FALSE !(i == (unsigned char)1) [L84] COND FALSE !(i == (unsigned char)2) [L85] COND FALSE !(i == (unsigned char)3) [L87] COND TRUE partial_sum > ((unsigned char)254) [L88] partial_sum = partial_sum & ((unsigned char)255) [L89] carry = (unsigned short)1 [L91] COND TRUE i == (unsigned char)0 [L91] r0 = (unsigned char)partial_sum [L92] COND FALSE !(i == (unsigned char)1) [L93] COND FALSE !(i == (unsigned char)2) [L94] COND FALSE !(i == (unsigned char)3) [L96] EXPR i + (unsigned char)1 [L96] i = i + (unsigned char)1 [L72] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L73] partial_sum = carry [L74] carry = (unsigned short)0 [L75] COND FALSE !(i < na) [L81] COND TRUE i < nb [L82] COND FALSE !(i == (unsigned char)0) [L83] COND TRUE i == (unsigned char)1 [L83] EXPR partial_sum + b1 [L83] partial_sum = partial_sum + b1 [L84] COND FALSE !(i == (unsigned char)2) [L85] COND FALSE !(i == (unsigned char)3) [L87] COND TRUE partial_sum > ((unsigned char)254) [L88] partial_sum = partial_sum & ((unsigned char)255) [L89] carry = (unsigned short)1 [L91] COND FALSE !(i == (unsigned char)0) [L92] COND TRUE i == (unsigned char)1 [L92] r1 = (unsigned char)partial_sum [L93] COND FALSE !(i == (unsigned char)2) [L94] COND FALSE !(i == (unsigned char)3) [L96] EXPR i + (unsigned char)1 [L96] i = i + (unsigned char)1 [L72] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L73] partial_sum = carry [L74] carry = (unsigned short)0 [L75] COND FALSE !(i < na) [L81] COND TRUE i < nb [L82] COND FALSE !(i == (unsigned char)0) [L83] COND FALSE !(i == (unsigned char)1) [L84] COND TRUE i == (unsigned char)2 [L84] EXPR partial_sum + b2 [L84] partial_sum = partial_sum + b2 [L85] COND FALSE !(i == (unsigned char)3) [L87] COND TRUE partial_sum > ((unsigned char)254) [L88] partial_sum = partial_sum & ((unsigned char)255) [L89] carry = (unsigned short)1 [L91] COND FALSE !(i == (unsigned char)0) [L92] COND FALSE !(i == (unsigned char)1) [L93] COND TRUE i == (unsigned char)2 [L93] r2 = (unsigned char)partial_sum [L94] COND FALSE !(i == (unsigned char)3) [L96] EXPR i + (unsigned char)1 [L96] i = i + (unsigned char)1 [L72] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L73] partial_sum = carry [L74] carry = (unsigned short)0 [L75] COND FALSE !(i < na) [L81] COND TRUE i < nb [L82] COND FALSE !(i == (unsigned char)0) [L83] COND FALSE !(i == (unsigned char)1) [L84] COND FALSE !(i == (unsigned char)2) [L85] COND TRUE i == (unsigned char)3 [L85] EXPR partial_sum + b3 [L85] partial_sum = partial_sum + b3 [L87] COND FALSE !(partial_sum > ((unsigned char)254)) [L91] COND FALSE !(i == (unsigned char)0) [L92] COND FALSE !(i == (unsigned char)1) [L93] COND FALSE !(i == (unsigned char)2) [L94] COND TRUE i == (unsigned char)3 [L94] r3 = (unsigned char)partial_sum [L96] EXPR i + (unsigned char)1 [L96] i = i + (unsigned char)1 [L72] COND FALSE !((i < na) || (i < nb) || (carry != (unsigned short)0)) [L99] COND FALSE !(i < (unsigned char)4) [L108] r1 << 8U [L108] r2 << 16U [L108] r3 << 24U - UnprovableResult [Line: 52]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 52]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 54]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 54]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 56]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 56]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 62]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 62]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 64]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 64]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 66]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 66]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 76]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 76]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 77]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 77]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 78]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 78]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 79]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 79]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 82]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 82]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 83]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 83]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 84]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 84]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 85]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 85]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 96]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 96]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 105]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 105]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 108]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 108]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 108]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 108]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 108]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 114 locations, 38 error locations. Started 1 CEGAR loops. OverallTime: 24551.3ms, OverallIterations: 29, TraceHistogramMax: 4, EmptinessCheckTime: 54.4ms, AutomataDifference: 9146.8ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 11.1ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 3403 SDtfs, 5945 SDslu, 7781 SDs, 0 SdLazy, 6655 SolverSat, 402 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5371.4ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1026 GetRequests, 828 SyntacticMatches, 18 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 1717.1ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=4262occurred in iteration=27, InterpolantAutomatonStates: 195, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 1295.8ms AutomataMinimizationTime, 28 MinimizatonAttempts, 28440 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 140.1ms SsaConstructionTime, 1347.1ms SatisfiabilityAnalysisTime, 7839.5ms InterpolantComputationTime, 2613 NumberOfCodeBlocks, 2613 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 2483 ConstructedInterpolants, 35 QuantifiedInterpolants, 12817 SizeOfPredicates, 21 NumberOfNonLiveVariables, 1841 ConjunctsInSsa, 74 ConjunctsInUnsatCore, 39 InterpolantComputations, 23 PerfectInterpolantSequences, 2268/2396 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2021-08-27 11:25:52,613 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...