./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 574ddb4e 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 ac64f5b077f8251002b0bb05f1aba070a52d8bbef53fa94e35704949c96b0f7c --- Real Ultimate output --- This is Ultimate 0.2.2-?-574ddb4 [2023-02-17 09:10:45,971 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-17 09:10:45,973 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-17 09:10:46,011 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-17 09:10:46,012 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-17 09:10:46,015 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-17 09:10:46,017 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-17 09:10:46,020 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-17 09:10:46,022 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-17 09:10:46,026 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-17 09:10:46,027 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-17 09:10:46,029 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-17 09:10:46,029 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-17 09:10:46,031 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-17 09:10:46,033 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-17 09:10:46,034 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-17 09:10:46,035 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-17 09:10:46,036 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-17 09:10:46,037 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-17 09:10:46,042 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-17 09:10:46,043 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-17 09:10:46,044 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-17 09:10:46,046 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-17 09:10:46,047 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-17 09:10:46,054 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-17 09:10:46,054 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-17 09:10:46,054 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-17 09:10:46,056 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-17 09:10:46,056 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-17 09:10:46,057 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-17 09:10:46,057 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-17 09:10:46,058 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-17 09:10:46,059 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-17 09:10:46,060 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-17 09:10:46,062 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-17 09:10:46,062 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-17 09:10:46,062 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-17 09:10:46,063 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-17 09:10:46,063 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-17 09:10:46,064 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-17 09:10:46,065 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-17 09:10:46,067 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2023-02-17 09:10:46,093 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-17 09:10:46,094 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-17 09:10:46,094 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-17 09:10:46,094 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-17 09:10:46,095 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-17 09:10:46,095 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-17 09:10:46,096 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-17 09:10:46,097 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-17 09:10:46,097 INFO L138 SettingsManager]: * Use SBE=true [2023-02-17 09:10:46,097 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-17 09:10:46,097 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-17 09:10:46,098 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-17 09:10:46,098 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-17 09:10:46,098 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-17 09:10:46,098 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-17 09:10:46,098 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-17 09:10:46,099 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-17 09:10:46,099 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-17 09:10:46,099 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2023-02-17 09:10:46,099 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-17 09:10:46,099 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-17 09:10:46,100 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-17 09:10:46,100 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-17 09:10:46,100 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-17 09:10:46,100 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-17 09:10:46,101 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-17 09:10:46,101 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 09:10:46,101 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-17 09:10:46,102 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-17 09:10:46,102 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-17 09:10:46,102 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-17 09:10:46,102 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-17 09:10:46,102 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-17 09:10:46,103 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-17 09:10:46,103 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-17 09:10:46,103 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-17 09:10:46,103 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-17 09:10:46,103 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> ac64f5b077f8251002b0bb05f1aba070a52d8bbef53fa94e35704949c96b0f7c [2023-02-17 09:10:46,335 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-17 09:10:46,353 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-17 09:10:46,357 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-17 09:10:46,358 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-17 09:10:46,358 INFO L275 PluginConnector]: CDTParser initialized [2023-02-17 09:10:46,359 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/byte_add-2.i [2023-02-17 09:10:47,501 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-17 09:10:47,705 INFO L351 CDTParser]: Found 1 translation units. [2023-02-17 09:10:47,706 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add-2.i [2023-02-17 09:10:47,714 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b82e77f8c/114c2fa7ec2e4e7782efaac2d504b08b/FLAG9fc2c4bec [2023-02-17 09:10:47,732 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b82e77f8c/114c2fa7ec2e4e7782efaac2d504b08b [2023-02-17 09:10:47,735 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-17 09:10:47,736 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-17 09:10:47,739 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-17 09:10:47,739 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-17 09:10:47,742 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-17 09:10:47,743 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 09:10:47" (1/1) ... [2023-02-17 09:10:47,744 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17292ec8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 09:10:47, skipping insertion in model container [2023-02-17 09:10:47,744 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 09:10:47" (1/1) ... [2023-02-17 09:10:47,754 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-17 09:10:47,776 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-17 09:10:47,906 WARN L237 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[1166,1179] [2023-02-17 09:10:47,939 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 09:10:47,946 INFO L203 MainTranslator]: Completed pre-run [2023-02-17 09:10:47,956 WARN L237 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[1166,1179] [2023-02-17 09:10:47,976 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 09:10:47,989 INFO L208 MainTranslator]: Completed translation [2023-02-17 09:10:47,989 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 09:10:47 WrapperNode [2023-02-17 09:10:47,989 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-17 09:10:47,990 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-17 09:10:47,990 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-17 09:10:47,990 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-17 09:10:47,995 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 09:10:47" (1/1) ... [2023-02-17 09:10:48,000 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 09:10:47" (1/1) ... [2023-02-17 09:10:48,037 INFO L138 Inliner]: procedures = 16, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 183 [2023-02-17 09:10:48,037 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-17 09:10:48,038 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-17 09:10:48,038 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-17 09:10:48,038 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-17 09:10:48,052 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 09:10:47" (1/1) ... [2023-02-17 09:10:48,052 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 09:10:47" (1/1) ... [2023-02-17 09:10:48,059 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 09:10:47" (1/1) ... [2023-02-17 09:10:48,059 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 09:10:47" (1/1) ... [2023-02-17 09:10:48,068 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 09:10:47" (1/1) ... [2023-02-17 09:10:48,072 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 09:10:47" (1/1) ... [2023-02-17 09:10:48,078 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 09:10:47" (1/1) ... [2023-02-17 09:10:48,084 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 09:10:47" (1/1) ... [2023-02-17 09:10:48,092 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-17 09:10:48,096 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-17 09:10:48,096 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-17 09:10:48,097 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-17 09:10:48,097 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 09:10:47" (1/1) ... [2023-02-17 09:10:48,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 09:10:48,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:10:48,134 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) [2023-02-17 09:10:48,156 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 [2023-02-17 09:10:48,172 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-17 09:10:48,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-17 09:10:48,173 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-17 09:10:48,174 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-17 09:10:48,235 INFO L235 CfgBuilder]: Building ICFG [2023-02-17 09:10:48,236 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-17 09:10:48,619 INFO L276 CfgBuilder]: Performing block encoding [2023-02-17 09:10:48,626 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-17 09:10:48,626 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2023-02-17 09:10:48,628 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 09:10:48 BoogieIcfgContainer [2023-02-17 09:10:48,628 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-17 09:10:48,630 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-17 09:10:48,630 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-17 09:10:48,632 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-17 09:10:48,633 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.02 09:10:47" (1/3) ... [2023-02-17 09:10:48,633 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bce5985 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 09:10:48, skipping insertion in model container [2023-02-17 09:10:48,633 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 09:10:47" (2/3) ... [2023-02-17 09:10:48,634 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bce5985 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 09:10:48, skipping insertion in model container [2023-02-17 09:10:48,634 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 09:10:48" (3/3) ... [2023-02-17 09:10:48,635 INFO L112 eAbstractionObserver]: Analyzing ICFG byte_add-2.i [2023-02-17 09:10:48,653 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-17 09:10:48,664 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 41 error locations. [2023-02-17 09:10:48,711 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-17 09:10:48,716 INFO L357 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, mAutomataTypeConcurrency=PETRI_NET, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@340348d8, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-17 09:10:48,716 INFO L358 AbstractCegarLoop]: Starting to check reachability of 41 error locations. [2023-02-17 09:10:48,720 INFO L276 IsEmpty]: Start isEmpty. Operand has 126 states, 84 states have (on average 1.8928571428571428) internal successors, (159), 125 states have internal predecessors, (159), 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) [2023-02-17 09:10:48,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-02-17 09:10:48,724 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 09:10:48,725 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-02-17 09:10:48,725 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-02-17 09:10:48,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:10:48,729 INFO L85 PathProgramCache]: Analyzing trace with hash 925604, now seen corresponding path program 1 times [2023-02-17 09:10:48,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:10:48,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205285670] [2023-02-17 09:10:48,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:10:48,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:10:48,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:10:48,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 09:10:48,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 09:10:48,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205285670] [2023-02-17 09:10:48,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205285670] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 09:10:48,867 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 09:10:48,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-02-17 09:10:48,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132467047] [2023-02-17 09:10:48,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 09:10:48,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-17 09:10:48,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 09:10:48,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-17 09:10:48,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-17 09:10:48,907 INFO L87 Difference]: Start difference. First operand has 126 states, 84 states have (on average 1.8928571428571428) internal successors, (159), 125 states have internal predecessors, (159), 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) [2023-02-17 09:10:48,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 09:10:48,926 INFO L93 Difference]: Finished difference Result 153 states and 204 transitions. [2023-02-17 09:10:48,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-17 09:10:48,927 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 [2023-02-17 09:10:48,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 09:10:48,934 INFO L225 Difference]: With dead ends: 153 [2023-02-17 09:10:48,934 INFO L226 Difference]: Without dead ends: 76 [2023-02-17 09:10:48,937 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-17 09:10:48,939 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 09:10:48,940 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 09:10:48,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2023-02-17 09:10:48,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2023-02-17 09:10:48,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 75 states have (on average 1.3866666666666667) internal successors, (104), 75 states have internal predecessors, (104), 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) [2023-02-17 09:10:48,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 104 transitions. [2023-02-17 09:10:48,976 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 104 transitions. Word has length 4 [2023-02-17 09:10:48,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 09:10:48,977 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 104 transitions. [2023-02-17 09:10:48,977 INFO L496 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) [2023-02-17 09:10:48,977 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 104 transitions. [2023-02-17 09:10:48,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-17 09:10:48,979 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 09:10:48,979 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 09:10:48,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-17 09:10:48,979 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-02-17 09:10:48,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:10:48,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1140047638, now seen corresponding path program 1 times [2023-02-17 09:10:48,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:10:48,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190252525] [2023-02-17 09:10:48,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:10:48,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:10:49,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:10:49,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 09:10:49,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 09:10:49,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190252525] [2023-02-17 09:10:49,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190252525] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 09:10:49,125 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 09:10:49,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 09:10:49,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678826141] [2023-02-17 09:10:49,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 09:10:49,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 09:10:49,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 09:10:49,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 09:10:49,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 09:10:49,128 INFO L87 Difference]: Start difference. First operand 76 states and 104 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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) [2023-02-17 09:10:49,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 09:10:49,270 INFO L93 Difference]: Finished difference Result 162 states and 235 transitions. [2023-02-17 09:10:49,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 09:10:49,271 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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 17 [2023-02-17 09:10:49,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 09:10:49,272 INFO L225 Difference]: With dead ends: 162 [2023-02-17 09:10:49,273 INFO L226 Difference]: Without dead ends: 108 [2023-02-17 09:10:49,273 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 09:10:49,274 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 35 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 09:10:49,275 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 135 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 09:10:49,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2023-02-17 09:10:49,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 104. [2023-02-17 09:10:49,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 103 states have (on average 1.3398058252427185) internal successors, (138), 103 states have internal predecessors, (138), 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) [2023-02-17 09:10:49,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 138 transitions. [2023-02-17 09:10:49,287 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 138 transitions. Word has length 17 [2023-02-17 09:10:49,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 09:10:49,287 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 138 transitions. [2023-02-17 09:10:49,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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) [2023-02-17 09:10:49,287 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 138 transitions. [2023-02-17 09:10:49,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-17 09:10:49,289 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 09:10:49,289 INFO L195 NwaCegarLoop]: 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] [2023-02-17 09:10:49,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-17 09:10:49,289 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-02-17 09:10:49,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:10:49,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1047629272, now seen corresponding path program 1 times [2023-02-17 09:10:49,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:10:49,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731167774] [2023-02-17 09:10:49,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:10:49,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:10:49,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:10:49,465 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-17 09:10:49,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 09:10:49,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731167774] [2023-02-17 09:10:49,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731167774] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 09:10:49,466 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 09:10:49,466 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-17 09:10:49,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263806250] [2023-02-17 09:10:49,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 09:10:49,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-17 09:10:49,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 09:10:49,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-17 09:10:49,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-17 09:10:49,468 INFO L87 Difference]: Start difference. First operand 104 states and 138 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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) [2023-02-17 09:10:49,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 09:10:49,649 INFO L93 Difference]: Finished difference Result 268 states and 359 transitions. [2023-02-17 09:10:49,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-17 09:10:49,650 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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 24 [2023-02-17 09:10:49,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 09:10:49,651 INFO L225 Difference]: With dead ends: 268 [2023-02-17 09:10:49,651 INFO L226 Difference]: Without dead ends: 194 [2023-02-17 09:10:49,652 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-17 09:10:49,653 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 147 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 09:10:49,654 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 325 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 09:10:49,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2023-02-17 09:10:49,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 117. [2023-02-17 09:10:49,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 116 states have (on average 1.3275862068965518) internal successors, (154), 116 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) [2023-02-17 09:10:49,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 154 transitions. [2023-02-17 09:10:49,668 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 154 transitions. Word has length 24 [2023-02-17 09:10:49,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 09:10:49,668 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 154 transitions. [2023-02-17 09:10:49,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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) [2023-02-17 09:10:49,668 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 154 transitions. [2023-02-17 09:10:49,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-17 09:10:49,670 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 09:10:49,670 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 09:10:49,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-17 09:10:49,670 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-02-17 09:10:49,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:10:49,671 INFO L85 PathProgramCache]: Analyzing trace with hash -1685366660, now seen corresponding path program 1 times [2023-02-17 09:10:49,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:10:49,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420262897] [2023-02-17 09:10:49,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:10:49,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:10:49,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:10:49,798 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-17 09:10:49,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 09:10:49,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420262897] [2023-02-17 09:10:49,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420262897] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 09:10:49,799 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 09:10:49,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-17 09:10:49,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003649935] [2023-02-17 09:10:49,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 09:10:49,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-17 09:10:49,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 09:10:49,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-17 09:10:49,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-17 09:10:49,801 INFO L87 Difference]: Start difference. First operand 117 states and 154 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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) [2023-02-17 09:10:49,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 09:10:49,962 INFO L93 Difference]: Finished difference Result 267 states and 357 transitions. [2023-02-17 09:10:49,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-17 09:10:49,963 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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 27 [2023-02-17 09:10:49,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 09:10:49,964 INFO L225 Difference]: With dead ends: 267 [2023-02-17 09:10:49,964 INFO L226 Difference]: Without dead ends: 200 [2023-02-17 09:10:49,965 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-17 09:10:49,966 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 136 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 09:10:49,967 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 315 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 09:10:49,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2023-02-17 09:10:49,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 130. [2023-02-17 09:10:49,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 129 states have (on average 1.302325581395349) internal successors, (168), 129 states have internal predecessors, (168), 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) [2023-02-17 09:10:49,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 168 transitions. [2023-02-17 09:10:49,976 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 168 transitions. Word has length 27 [2023-02-17 09:10:49,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 09:10:49,976 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 168 transitions. [2023-02-17 09:10:49,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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) [2023-02-17 09:10:49,977 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 168 transitions. [2023-02-17 09:10:49,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-02-17 09:10:49,978 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 09:10:49,978 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 09:10:49,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-17 09:10:49,979 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-02-17 09:10:49,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:10:49,979 INFO L85 PathProgramCache]: Analyzing trace with hash -1833052269, now seen corresponding path program 1 times [2023-02-17 09:10:49,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:10:49,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871420105] [2023-02-17 09:10:49,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:10:49,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:10:49,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:10:50,088 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 09:10:50,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 09:10:50,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871420105] [2023-02-17 09:10:50,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871420105] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 09:10:50,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1588555746] [2023-02-17 09:10:50,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:10:50,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 09:10:50,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:10:50,101 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) [2023-02-17 09:10:50,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-17 09:10:50,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:10:50,152 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-17 09:10:50,156 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 09:10:50,244 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 09:10:50,245 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 09:10:50,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1588555746] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 09:10:50,245 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-17 09:10:50,245 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2023-02-17 09:10:50,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531582330] [2023-02-17 09:10:50,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 09:10:50,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-17 09:10:50,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 09:10:50,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-17 09:10:50,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-02-17 09:10:50,247 INFO L87 Difference]: Start difference. First operand 130 states and 168 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 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) [2023-02-17 09:10:50,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 09:10:50,410 INFO L93 Difference]: Finished difference Result 239 states and 340 transitions. [2023-02-17 09:10:50,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-17 09:10:50,411 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 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 30 [2023-02-17 09:10:50,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 09:10:50,412 INFO L225 Difference]: With dead ends: 239 [2023-02-17 09:10:50,412 INFO L226 Difference]: Without dead ends: 185 [2023-02-17 09:10:50,412 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-02-17 09:10:50,414 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 67 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 09:10:50,414 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 188 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 09:10:50,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2023-02-17 09:10:50,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 158. [2023-02-17 09:10:50,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 157 states have (on average 1.286624203821656) internal successors, (202), 157 states have internal predecessors, (202), 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) [2023-02-17 09:10:50,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 202 transitions. [2023-02-17 09:10:50,422 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 202 transitions. Word has length 30 [2023-02-17 09:10:50,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 09:10:50,423 INFO L495 AbstractCegarLoop]: Abstraction has 158 states and 202 transitions. [2023-02-17 09:10:50,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 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) [2023-02-17 09:10:50,423 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 202 transitions. [2023-02-17 09:10:50,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-02-17 09:10:50,424 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 09:10:50,425 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1] [2023-02-17 09:10:50,436 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-02-17 09:10:50,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 09:10:50,630 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-02-17 09:10:50,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:10:50,631 INFO L85 PathProgramCache]: Analyzing trace with hash 1107213899, now seen corresponding path program 1 times [2023-02-17 09:10:50,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:10:50,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921739857] [2023-02-17 09:10:50,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:10:50,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:10:50,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:10:50,732 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 09:10:50,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 09:10:50,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921739857] [2023-02-17 09:10:50,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921739857] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 09:10:50,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1062293350] [2023-02-17 09:10:50,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:10:50,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 09:10:50,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:10:50,735 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) [2023-02-17 09:10:50,739 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-17 09:10:50,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:10:50,797 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-17 09:10:50,799 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 09:10:50,858 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-17 09:10:50,859 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 09:10:50,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1062293350] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 09:10:50,859 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-17 09:10:50,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2023-02-17 09:10:50,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834354636] [2023-02-17 09:10:50,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 09:10:50,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-17 09:10:50,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 09:10:50,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-17 09:10:50,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-02-17 09:10:50,861 INFO L87 Difference]: Start difference. First operand 158 states and 202 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 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) [2023-02-17 09:10:51,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 09:10:51,070 INFO L93 Difference]: Finished difference Result 325 states and 444 transitions. [2023-02-17 09:10:51,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-17 09:10:51,071 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 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 37 [2023-02-17 09:10:51,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 09:10:51,072 INFO L225 Difference]: With dead ends: 325 [2023-02-17 09:10:51,072 INFO L226 Difference]: Without dead ends: 220 [2023-02-17 09:10:51,073 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-02-17 09:10:51,073 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 58 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 09:10:51,074 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 240 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 09:10:51,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2023-02-17 09:10:51,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 186. [2023-02-17 09:10:51,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 185 states have (on average 1.2756756756756757) internal successors, (236), 185 states have internal predecessors, (236), 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) [2023-02-17 09:10:51,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 236 transitions. [2023-02-17 09:10:51,090 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 236 transitions. Word has length 37 [2023-02-17 09:10:51,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 09:10:51,091 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 236 transitions. [2023-02-17 09:10:51,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 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) [2023-02-17 09:10:51,091 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 236 transitions. [2023-02-17 09:10:51,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-02-17 09:10:51,093 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 09:10:51,093 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1] [2023-02-17 09:10:51,101 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-17 09:10:51,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-02-17 09:10:51,300 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-02-17 09:10:51,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:10:51,300 INFO L85 PathProgramCache]: Analyzing trace with hash -756901417, now seen corresponding path program 1 times [2023-02-17 09:10:51,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:10:51,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109450027] [2023-02-17 09:10:51,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:10:51,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:10:51,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:10:51,423 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 09:10:51,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 09:10:51,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109450027] [2023-02-17 09:10:51,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109450027] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 09:10:51,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1680437075] [2023-02-17 09:10:51,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:10:51,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 09:10:51,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:10:51,430 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) [2023-02-17 09:10:51,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-17 09:10:51,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:10:51,485 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-17 09:10:51,486 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 09:10:51,523 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-02-17 09:10:51,523 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 09:10:51,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1680437075] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 09:10:51,523 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-17 09:10:51,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2023-02-17 09:10:51,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125674284] [2023-02-17 09:10:51,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 09:10:51,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-17 09:10:51,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 09:10:51,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-17 09:10:51,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-02-17 09:10:51,526 INFO L87 Difference]: Start difference. First operand 186 states and 236 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 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) [2023-02-17 09:10:51,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 09:10:51,711 INFO L93 Difference]: Finished difference Result 381 states and 510 transitions. [2023-02-17 09:10:51,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-17 09:10:51,711 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 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 44 [2023-02-17 09:10:51,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 09:10:51,713 INFO L225 Difference]: With dead ends: 381 [2023-02-17 09:10:51,713 INFO L226 Difference]: Without dead ends: 248 [2023-02-17 09:10:51,713 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-02-17 09:10:51,714 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 57 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 09:10:51,714 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 240 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 09:10:51,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2023-02-17 09:10:51,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 214. [2023-02-17 09:10:51,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 213 states have (on average 1.267605633802817) internal successors, (270), 213 states have internal predecessors, (270), 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) [2023-02-17 09:10:51,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 270 transitions. [2023-02-17 09:10:51,722 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 270 transitions. Word has length 44 [2023-02-17 09:10:51,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 09:10:51,722 INFO L495 AbstractCegarLoop]: Abstraction has 214 states and 270 transitions. [2023-02-17 09:10:51,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 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) [2023-02-17 09:10:51,723 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 270 transitions. [2023-02-17 09:10:51,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-02-17 09:10:51,724 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 09:10:51,724 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1] [2023-02-17 09:10:51,732 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-02-17 09:10:51,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 09:10:51,930 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-02-17 09:10:51,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:10:51,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1675390727, now seen corresponding path program 1 times [2023-02-17 09:10:51,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:10:51,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536249705] [2023-02-17 09:10:51,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:10:51,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:10:51,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:10:52,044 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-02-17 09:10:52,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 09:10:52,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536249705] [2023-02-17 09:10:52,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536249705] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 09:10:52,046 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 09:10:52,046 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-17 09:10:52,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058791778] [2023-02-17 09:10:52,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 09:10:52,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 09:10:52,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 09:10:52,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 09:10:52,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 09:10:52,048 INFO L87 Difference]: Start difference. First operand 214 states and 270 transitions. Second operand has 3 states, 2 states have (on average 18.0) internal successors, (36), 3 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) [2023-02-17 09:10:52,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 09:10:52,062 INFO L93 Difference]: Finished difference Result 255 states and 315 transitions. [2023-02-17 09:10:52,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 09:10:52,063 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 18.0) internal successors, (36), 3 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 51 [2023-02-17 09:10:52,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 09:10:52,064 INFO L225 Difference]: With dead ends: 255 [2023-02-17 09:10:52,064 INFO L226 Difference]: Without dead ends: 188 [2023-02-17 09:10:52,065 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 09:10:52,067 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 8 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 09:10:52,068 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 211 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 09:10:52,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2023-02-17 09:10:52,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2023-02-17 09:10:52,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 187 states have (on average 1.2620320855614973) internal successors, (236), 187 states have internal predecessors, (236), 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) [2023-02-17 09:10:52,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 236 transitions. [2023-02-17 09:10:52,075 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 236 transitions. Word has length 51 [2023-02-17 09:10:52,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 09:10:52,076 INFO L495 AbstractCegarLoop]: Abstraction has 188 states and 236 transitions. [2023-02-17 09:10:52,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 18.0) internal successors, (36), 3 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) [2023-02-17 09:10:52,076 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 236 transitions. [2023-02-17 09:10:52,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-02-17 09:10:52,079 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 09:10:52,079 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1] [2023-02-17 09:10:52,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-02-17 09:10:52,080 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-02-17 09:10:52,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:10:52,080 INFO L85 PathProgramCache]: Analyzing trace with hash 174943707, now seen corresponding path program 1 times [2023-02-17 09:10:52,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:10:52,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387728121] [2023-02-17 09:10:52,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:10:52,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:10:52,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:10:52,254 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2023-02-17 09:10:52,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 09:10:52,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387728121] [2023-02-17 09:10:52,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387728121] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 09:10:52,254 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 09:10:52,255 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-17 09:10:52,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996372765] [2023-02-17 09:10:52,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 09:10:52,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-17 09:10:52,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 09:10:52,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 09:10:52,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-02-17 09:10:52,260 INFO L87 Difference]: Start difference. First operand 188 states and 236 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 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) [2023-02-17 09:10:52,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 09:10:52,387 INFO L93 Difference]: Finished difference Result 534 states and 680 transitions. [2023-02-17 09:10:52,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-17 09:10:52,387 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 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 63 [2023-02-17 09:10:52,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 09:10:52,389 INFO L225 Difference]: With dead ends: 534 [2023-02-17 09:10:52,389 INFO L226 Difference]: Without dead ends: 397 [2023-02-17 09:10:52,390 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-02-17 09:10:52,392 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 227 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 09:10:52,392 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 163 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 09:10:52,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2023-02-17 09:10:52,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 228. [2023-02-17 09:10:52,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 227 states have (on average 1.2555066079295154) internal successors, (285), 227 states have internal predecessors, (285), 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) [2023-02-17 09:10:52,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 285 transitions. [2023-02-17 09:10:52,400 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 285 transitions. Word has length 63 [2023-02-17 09:10:52,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 09:10:52,400 INFO L495 AbstractCegarLoop]: Abstraction has 228 states and 285 transitions. [2023-02-17 09:10:52,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 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) [2023-02-17 09:10:52,401 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 285 transitions. [2023-02-17 09:10:52,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-02-17 09:10:52,402 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 09:10:52,402 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 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] [2023-02-17 09:10:52,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-02-17 09:10:52,402 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-02-17 09:10:52,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:10:52,403 INFO L85 PathProgramCache]: Analyzing trace with hash -340799825, now seen corresponding path program 1 times [2023-02-17 09:10:52,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:10:52,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012499138] [2023-02-17 09:10:52,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:10:52,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:10:52,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:10:52,490 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-02-17 09:10:52,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 09:10:52,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012499138] [2023-02-17 09:10:52,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012499138] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 09:10:52,491 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 09:10:52,491 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-17 09:10:52,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118923978] [2023-02-17 09:10:52,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 09:10:52,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-17 09:10:52,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 09:10:52,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-17 09:10:52,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-17 09:10:52,493 INFO L87 Difference]: Start difference. First operand 228 states and 285 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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) [2023-02-17 09:10:52,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 09:10:52,569 INFO L93 Difference]: Finished difference Result 507 states and 631 transitions. [2023-02-17 09:10:52,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-17 09:10:52,569 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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 72 [2023-02-17 09:10:52,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 09:10:52,571 INFO L225 Difference]: With dead ends: 507 [2023-02-17 09:10:52,571 INFO L226 Difference]: Without dead ends: 330 [2023-02-17 09:10:52,572 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-17 09:10:52,572 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 59 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 09:10:52,573 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 327 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 09:10:52,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2023-02-17 09:10:52,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 244. [2023-02-17 09:10:52,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 243 states have (on average 1.2839506172839505) internal successors, (312), 243 states have internal predecessors, (312), 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) [2023-02-17 09:10:52,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 312 transitions. [2023-02-17 09:10:52,581 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 312 transitions. Word has length 72 [2023-02-17 09:10:52,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 09:10:52,581 INFO L495 AbstractCegarLoop]: Abstraction has 244 states and 312 transitions. [2023-02-17 09:10:52,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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) [2023-02-17 09:10:52,582 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 312 transitions. [2023-02-17 09:10:52,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2023-02-17 09:10:52,583 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 09:10:52,583 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 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, 1, 1, 1, 1] [2023-02-17 09:10:52,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-02-17 09:10:52,583 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-02-17 09:10:52,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:10:52,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1227237688, now seen corresponding path program 1 times [2023-02-17 09:10:52,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:10:52,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168203068] [2023-02-17 09:10:52,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:10:52,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:10:52,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:10:52,704 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-02-17 09:10:52,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 09:10:52,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168203068] [2023-02-17 09:10:52,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168203068] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 09:10:52,705 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 09:10:52,705 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-17 09:10:52,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840179610] [2023-02-17 09:10:52,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 09:10:52,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-17 09:10:52,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 09:10:52,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-17 09:10:52,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-17 09:10:52,708 INFO L87 Difference]: Start difference. First operand 244 states and 312 transitions. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 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) [2023-02-17 09:10:52,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 09:10:52,953 INFO L93 Difference]: Finished difference Result 695 states and 896 transitions. [2023-02-17 09:10:52,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-17 09:10:52,954 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 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 76 [2023-02-17 09:10:52,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 09:10:52,956 INFO L225 Difference]: With dead ends: 695 [2023-02-17 09:10:52,956 INFO L226 Difference]: Without dead ends: 497 [2023-02-17 09:10:52,956 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2023-02-17 09:10:52,957 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 195 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 09:10:52,957 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 337 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 09:10:52,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2023-02-17 09:10:52,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 398. [2023-02-17 09:10:52,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 397 states have (on average 1.2896725440806045) internal successors, (512), 397 states have internal predecessors, (512), 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) [2023-02-17 09:10:52,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 512 transitions. [2023-02-17 09:10:52,968 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 512 transitions. Word has length 76 [2023-02-17 09:10:52,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 09:10:52,968 INFO L495 AbstractCegarLoop]: Abstraction has 398 states and 512 transitions. [2023-02-17 09:10:52,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 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) [2023-02-17 09:10:52,969 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 512 transitions. [2023-02-17 09:10:52,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2023-02-17 09:10:52,969 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 09:10:52,970 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 09:10:52,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-02-17 09:10:52,970 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-02-17 09:10:52,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:10:52,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1202412060, now seen corresponding path program 1 times [2023-02-17 09:10:52,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:10:52,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445700441] [2023-02-17 09:10:52,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:10:52,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:10:52,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:10:53,043 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 48 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-02-17 09:10:53,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 09:10:53,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445700441] [2023-02-17 09:10:53,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445700441] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 09:10:53,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [513572396] [2023-02-17 09:10:53,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:10:53,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 09:10:53,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:10:53,053 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) [2023-02-17 09:10:53,056 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-17 09:10:53,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:10:53,115 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-17 09:10:53,118 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 09:10:53,155 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-17 09:10:53,156 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 09:10:53,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [513572396] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 09:10:53,156 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-17 09:10:53,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2023-02-17 09:10:53,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495331930] [2023-02-17 09:10:53,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 09:10:53,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-17 09:10:53,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 09:10:53,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-17 09:10:53,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-17 09:10:53,159 INFO L87 Difference]: Start difference. First operand 398 states and 512 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) [2023-02-17 09:10:53,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 09:10:53,252 INFO L93 Difference]: Finished difference Result 1072 states and 1374 transitions. [2023-02-17 09:10:53,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-17 09:10:53,252 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 76 [2023-02-17 09:10:53,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 09:10:53,255 INFO L225 Difference]: With dead ends: 1072 [2023-02-17 09:10:53,255 INFO L226 Difference]: Without dead ends: 688 [2023-02-17 09:10:53,256 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 75 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-17 09:10:53,256 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 95 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 09:10:53,257 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 184 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 09:10:53,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2023-02-17 09:10:53,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 551. [2023-02-17 09:10:53,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 551 states, 550 states have (on average 1.2945454545454544) internal successors, (712), 550 states have internal predecessors, (712), 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) [2023-02-17 09:10:53,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 712 transitions. [2023-02-17 09:10:53,273 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 712 transitions. Word has length 76 [2023-02-17 09:10:53,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 09:10:53,274 INFO L495 AbstractCegarLoop]: Abstraction has 551 states and 712 transitions. [2023-02-17 09:10:53,274 INFO L496 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) [2023-02-17 09:10:53,274 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 712 transitions. [2023-02-17 09:10:53,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2023-02-17 09:10:53,279 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 09:10:53,279 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 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, 1, 1, 1, 1] [2023-02-17 09:10:53,285 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-02-17 09:10:53,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 09:10:53,485 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-02-17 09:10:53,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:10:53,486 INFO L85 PathProgramCache]: Analyzing trace with hash -426464219, now seen corresponding path program 1 times [2023-02-17 09:10:53,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:10:53,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672571121] [2023-02-17 09:10:53,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:10:53,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:10:53,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:10:53,628 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-02-17 09:10:53,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 09:10:53,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672571121] [2023-02-17 09:10:53,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672571121] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 09:10:53,629 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 09:10:53,629 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-17 09:10:53,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32797533] [2023-02-17 09:10:53,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 09:10:53,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-17 09:10:53,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 09:10:53,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-17 09:10:53,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-17 09:10:53,630 INFO L87 Difference]: Start difference. First operand 551 states and 712 transitions. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 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) [2023-02-17 09:10:53,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 09:10:53,855 INFO L93 Difference]: Finished difference Result 1336 states and 1716 transitions. [2023-02-17 09:10:53,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-17 09:10:53,855 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 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 76 [2023-02-17 09:10:53,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 09:10:53,858 INFO L225 Difference]: With dead ends: 1336 [2023-02-17 09:10:53,858 INFO L226 Difference]: Without dead ends: 801 [2023-02-17 09:10:53,859 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2023-02-17 09:10:53,859 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 342 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 09:10:53,859 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [342 Valid, 217 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 09:10:53,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2023-02-17 09:10:53,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 673. [2023-02-17 09:10:53,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 673 states, 672 states have (on average 1.2946428571428572) internal successors, (870), 672 states have internal predecessors, (870), 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) [2023-02-17 09:10:53,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 870 transitions. [2023-02-17 09:10:53,877 INFO L78 Accepts]: Start accepts. Automaton has 673 states and 870 transitions. Word has length 76 [2023-02-17 09:10:53,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 09:10:53,878 INFO L495 AbstractCegarLoop]: Abstraction has 673 states and 870 transitions. [2023-02-17 09:10:53,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 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) [2023-02-17 09:10:53,878 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 870 transitions. [2023-02-17 09:10:53,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2023-02-17 09:10:53,879 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 09:10:53,879 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1] [2023-02-17 09:10:53,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-02-17 09:10:53,880 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-02-17 09:10:53,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:10:53,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1084235769, now seen corresponding path program 1 times [2023-02-17 09:10:53,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:10:53,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587916139] [2023-02-17 09:10:53,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:10:53,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:10:53,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:10:53,941 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2023-02-17 09:10:53,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 09:10:53,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587916139] [2023-02-17 09:10:53,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587916139] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 09:10:53,942 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 09:10:53,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 09:10:53,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510957495] [2023-02-17 09:10:53,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 09:10:53,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 09:10:53,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 09:10:53,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 09:10:53,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 09:10:53,944 INFO L87 Difference]: Start difference. First operand 673 states and 870 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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) [2023-02-17 09:10:53,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 09:10:53,985 INFO L93 Difference]: Finished difference Result 1293 states and 1676 transitions. [2023-02-17 09:10:53,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 09:10:53,986 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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 [2023-02-17 09:10:53,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 09:10:53,988 INFO L225 Difference]: With dead ends: 1293 [2023-02-17 09:10:53,989 INFO L226 Difference]: Without dead ends: 673 [2023-02-17 09:10:53,989 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 09:10:53,990 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 3 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 09:10:53,990 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 167 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 09:10:53,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2023-02-17 09:10:54,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 673. [2023-02-17 09:10:54,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 673 states, 672 states have (on average 1.2619047619047619) internal successors, (848), 672 states have internal predecessors, (848), 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) [2023-02-17 09:10:54,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 848 transitions. [2023-02-17 09:10:54,006 INFO L78 Accepts]: Start accepts. Automaton has 673 states and 848 transitions. Word has length 80 [2023-02-17 09:10:54,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 09:10:54,007 INFO L495 AbstractCegarLoop]: Abstraction has 673 states and 848 transitions. [2023-02-17 09:10:54,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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) [2023-02-17 09:10:54,007 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 848 transitions. [2023-02-17 09:10:54,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2023-02-17 09:10:54,008 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 09:10:54,009 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 09:10:54,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-02-17 09:10:54,009 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-02-17 09:10:54,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:10:54,009 INFO L85 PathProgramCache]: Analyzing trace with hash 564827417, now seen corresponding path program 1 times [2023-02-17 09:10:54,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:10:54,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489753642] [2023-02-17 09:10:54,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:10:54,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:10:54,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:10:54,135 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 39 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-02-17 09:10:54,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 09:10:54,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489753642] [2023-02-17 09:10:54,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489753642] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 09:10:54,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1979361987] [2023-02-17 09:10:54,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:10:54,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 09:10:54,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:10:54,141 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) [2023-02-17 09:10:54,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-17 09:10:54,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:10:54,206 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-17 09:10:54,214 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 09:10:54,261 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 26 proven. 43 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-17 09:10:54,261 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 09:10:54,288 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 39 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-02-17 09:10:54,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1979361987] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 09:10:54,289 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 09:10:54,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 4] total 9 [2023-02-17 09:10:54,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176074917] [2023-02-17 09:10:54,289 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 09:10:54,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-17 09:10:54,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 09:10:54,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-17 09:10:54,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-02-17 09:10:54,291 INFO L87 Difference]: Start difference. First operand 673 states and 848 transitions. Second operand has 10 states, 9 states have (on average 12.333333333333334) internal successors, (111), 10 states have internal predecessors, (111), 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) [2023-02-17 09:10:55,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 09:10:55,527 INFO L93 Difference]: Finished difference Result 4048 states and 4946 transitions. [2023-02-17 09:10:55,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-02-17 09:10:55,528 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 12.333333333333334) internal successors, (111), 10 states have internal predecessors, (111), 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 81 [2023-02-17 09:10:55,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 09:10:55,538 INFO L225 Difference]: With dead ends: 4048 [2023-02-17 09:10:55,538 INFO L226 Difference]: Without dead ends: 3332 [2023-02-17 09:10:55,540 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 188 SyntacticMatches, 3 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 505 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=378, Invalid=1514, Unknown=0, NotChecked=0, Total=1892 [2023-02-17 09:10:55,541 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 771 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 1355 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 771 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 1368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-02-17 09:10:55,541 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [771 Valid, 690 Invalid, 1368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1355 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-02-17 09:10:55,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3332 states. [2023-02-17 09:10:55,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3332 to 962. [2023-02-17 09:10:55,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 962 states, 961 states have (on average 1.3621227887617064) internal successors, (1309), 961 states have internal predecessors, (1309), 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) [2023-02-17 09:10:55,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 962 states to 962 states and 1309 transitions. [2023-02-17 09:10:55,580 INFO L78 Accepts]: Start accepts. Automaton has 962 states and 1309 transitions. Word has length 81 [2023-02-17 09:10:55,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 09:10:55,581 INFO L495 AbstractCegarLoop]: Abstraction has 962 states and 1309 transitions. [2023-02-17 09:10:55,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 12.333333333333334) internal successors, (111), 10 states have internal predecessors, (111), 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) [2023-02-17 09:10:55,581 INFO L276 IsEmpty]: Start isEmpty. Operand 962 states and 1309 transitions. [2023-02-17 09:10:55,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2023-02-17 09:10:55,583 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 09:10:55,583 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 09:10:55,591 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-02-17 09:10:55,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-02-17 09:10:55,791 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-02-17 09:10:55,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:10:55,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1642726455, now seen corresponding path program 1 times [2023-02-17 09:10:55,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:10:55,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332403020] [2023-02-17 09:10:55,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:10:55,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:10:55,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:10:55,935 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-02-17 09:10:55,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 09:10:55,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332403020] [2023-02-17 09:10:55,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332403020] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 09:10:55,936 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 09:10:55,936 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-17 09:10:55,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202585911] [2023-02-17 09:10:55,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 09:10:55,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-17 09:10:55,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 09:10:55,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-17 09:10:55,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-02-17 09:10:55,937 INFO L87 Difference]: Start difference. First operand 962 states and 1309 transitions. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 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) [2023-02-17 09:10:56,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 09:10:56,276 INFO L93 Difference]: Finished difference Result 2317 states and 3129 transitions. [2023-02-17 09:10:56,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-17 09:10:56,277 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 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 81 [2023-02-17 09:10:56,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 09:10:56,281 INFO L225 Difference]: With dead ends: 2317 [2023-02-17 09:10:56,282 INFO L226 Difference]: Without dead ends: 1287 [2023-02-17 09:10:56,283 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2023-02-17 09:10:56,283 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 277 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-17 09:10:56,284 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 323 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-17 09:10:56,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1287 states. [2023-02-17 09:10:56,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1287 to 1153. [2023-02-17 09:10:56,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1153 states, 1152 states have (on average 1.3628472222222223) internal successors, (1570), 1152 states have internal predecessors, (1570), 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) [2023-02-17 09:10:56,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1153 states to 1153 states and 1570 transitions. [2023-02-17 09:10:56,316 INFO L78 Accepts]: Start accepts. Automaton has 1153 states and 1570 transitions. Word has length 81 [2023-02-17 09:10:56,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 09:10:56,316 INFO L495 AbstractCegarLoop]: Abstraction has 1153 states and 1570 transitions. [2023-02-17 09:10:56,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 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) [2023-02-17 09:10:56,316 INFO L276 IsEmpty]: Start isEmpty. Operand 1153 states and 1570 transitions. [2023-02-17 09:10:56,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2023-02-17 09:10:56,318 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 09:10:56,318 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 09:10:56,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-02-17 09:10:56,318 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-02-17 09:10:56,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:10:56,319 INFO L85 PathProgramCache]: Analyzing trace with hash -927103410, now seen corresponding path program 1 times [2023-02-17 09:10:56,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:10:56,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724440206] [2023-02-17 09:10:56,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:10:56,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:10:56,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:10:56,440 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-17 09:10:56,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 09:10:56,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724440206] [2023-02-17 09:10:56,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724440206] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 09:10:56,441 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 09:10:56,441 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-17 09:10:56,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321453100] [2023-02-17 09:10:56,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 09:10:56,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-17 09:10:56,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 09:10:56,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-17 09:10:56,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-02-17 09:10:56,442 INFO L87 Difference]: Start difference. First operand 1153 states and 1570 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 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) [2023-02-17 09:10:56,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 09:10:56,789 INFO L93 Difference]: Finished difference Result 2633 states and 3566 transitions. [2023-02-17 09:10:56,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-17 09:10:56,790 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 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 81 [2023-02-17 09:10:56,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 09:10:56,794 INFO L225 Difference]: With dead ends: 2633 [2023-02-17 09:10:56,795 INFO L226 Difference]: Without dead ends: 1459 [2023-02-17 09:10:56,796 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2023-02-17 09:10:56,796 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 308 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-17 09:10:56,797 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 330 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-17 09:10:56,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1459 states. [2023-02-17 09:10:56,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1459 to 1325. [2023-02-17 09:10:56,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1325 states, 1324 states have (on average 1.365558912386707) internal successors, (1808), 1324 states have internal predecessors, (1808), 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) [2023-02-17 09:10:56,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1325 states to 1325 states and 1808 transitions. [2023-02-17 09:10:56,832 INFO L78 Accepts]: Start accepts. Automaton has 1325 states and 1808 transitions. Word has length 81 [2023-02-17 09:10:56,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 09:10:56,832 INFO L495 AbstractCegarLoop]: Abstraction has 1325 states and 1808 transitions. [2023-02-17 09:10:56,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 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) [2023-02-17 09:10:56,832 INFO L276 IsEmpty]: Start isEmpty. Operand 1325 states and 1808 transitions. [2023-02-17 09:10:56,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2023-02-17 09:10:56,834 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 09:10:56,834 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 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] [2023-02-17 09:10:56,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-02-17 09:10:56,835 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-02-17 09:10:56,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:10:56,835 INFO L85 PathProgramCache]: Analyzing trace with hash -1991578566, now seen corresponding path program 1 times [2023-02-17 09:10:56,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:10:56,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460266087] [2023-02-17 09:10:56,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:10:56,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:10:56,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:10:56,966 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2023-02-17 09:10:56,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 09:10:56,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460266087] [2023-02-17 09:10:56,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460266087] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 09:10:56,967 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 09:10:56,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-17 09:10:56,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871502832] [2023-02-17 09:10:56,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 09:10:56,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-17 09:10:56,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 09:10:56,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 09:10:56,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-17 09:10:56,969 INFO L87 Difference]: Start difference. First operand 1325 states and 1808 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 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) [2023-02-17 09:10:57,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 09:10:57,241 INFO L93 Difference]: Finished difference Result 4160 states and 5660 transitions. [2023-02-17 09:10:57,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-17 09:10:57,242 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 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 84 [2023-02-17 09:10:57,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 09:10:57,255 INFO L225 Difference]: With dead ends: 4160 [2023-02-17 09:10:57,255 INFO L226 Difference]: Without dead ends: 3965 [2023-02-17 09:10:57,256 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-02-17 09:10:57,257 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 279 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 09:10:57,257 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 476 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 09:10:57,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3965 states. [2023-02-17 09:10:57,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3965 to 1325. [2023-02-17 09:10:57,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1325 states, 1324 states have (on average 1.365558912386707) internal successors, (1808), 1324 states have internal predecessors, (1808), 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) [2023-02-17 09:10:57,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1325 states to 1325 states and 1808 transitions. [2023-02-17 09:10:57,352 INFO L78 Accepts]: Start accepts. Automaton has 1325 states and 1808 transitions. Word has length 84 [2023-02-17 09:10:57,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 09:10:57,352 INFO L495 AbstractCegarLoop]: Abstraction has 1325 states and 1808 transitions. [2023-02-17 09:10:57,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 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) [2023-02-17 09:10:57,352 INFO L276 IsEmpty]: Start isEmpty. Operand 1325 states and 1808 transitions. [2023-02-17 09:10:57,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2023-02-17 09:10:57,354 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 09:10:57,354 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 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] [2023-02-17 09:10:57,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-02-17 09:10:57,355 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-02-17 09:10:57,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:10:57,355 INFO L85 PathProgramCache]: Analyzing trace with hash 629870863, now seen corresponding path program 1 times [2023-02-17 09:10:57,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:10:57,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245934064] [2023-02-17 09:10:57,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:10:57,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:10:57,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:10:57,501 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2023-02-17 09:10:57,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 09:10:57,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245934064] [2023-02-17 09:10:57,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245934064] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 09:10:57,503 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 09:10:57,503 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-17 09:10:57,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048704425] [2023-02-17 09:10:57,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 09:10:57,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-17 09:10:57,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 09:10:57,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 09:10:57,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-17 09:10:57,505 INFO L87 Difference]: Start difference. First operand 1325 states and 1808 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 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) [2023-02-17 09:10:57,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 09:10:57,799 INFO L93 Difference]: Finished difference Result 4152 states and 5648 transitions. [2023-02-17 09:10:57,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-17 09:10:57,800 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 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 84 [2023-02-17 09:10:57,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 09:10:57,813 INFO L225 Difference]: With dead ends: 4152 [2023-02-17 09:10:57,814 INFO L226 Difference]: Without dead ends: 3948 [2023-02-17 09:10:57,816 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-02-17 09:10:57,816 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 241 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 09:10:57,816 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 426 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 09:10:57,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3948 states. [2023-02-17 09:10:57,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3948 to 1325. [2023-02-17 09:10:57,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1325 states, 1324 states have (on average 1.365558912386707) internal successors, (1808), 1324 states have internal predecessors, (1808), 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) [2023-02-17 09:10:57,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1325 states to 1325 states and 1808 transitions. [2023-02-17 09:10:57,883 INFO L78 Accepts]: Start accepts. Automaton has 1325 states and 1808 transitions. Word has length 84 [2023-02-17 09:10:57,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 09:10:57,883 INFO L495 AbstractCegarLoop]: Abstraction has 1325 states and 1808 transitions. [2023-02-17 09:10:57,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 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) [2023-02-17 09:10:57,883 INFO L276 IsEmpty]: Start isEmpty. Operand 1325 states and 1808 transitions. [2023-02-17 09:10:57,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2023-02-17 09:10:57,885 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 09:10:57,885 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 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] [2023-02-17 09:10:57,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-02-17 09:10:57,886 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-02-17 09:10:57,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:10:57,886 INFO L85 PathProgramCache]: Analyzing trace with hash 1230056049, now seen corresponding path program 1 times [2023-02-17 09:10:57,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:10:57,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817279106] [2023-02-17 09:10:57,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:10:57,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:10:57,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:10:58,059 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2023-02-17 09:10:58,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 09:10:58,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817279106] [2023-02-17 09:10:58,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817279106] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 09:10:58,060 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 09:10:58,060 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-17 09:10:58,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13081105] [2023-02-17 09:10:58,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 09:10:58,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-17 09:10:58,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 09:10:58,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-17 09:10:58,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-17 09:10:58,061 INFO L87 Difference]: Start difference. First operand 1325 states and 1808 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 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) [2023-02-17 09:10:58,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 09:10:58,504 INFO L93 Difference]: Finished difference Result 5488 states and 7468 transitions. [2023-02-17 09:10:58,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-17 09:10:58,505 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 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 87 [2023-02-17 09:10:58,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 09:10:58,522 INFO L225 Difference]: With dead ends: 5488 [2023-02-17 09:10:58,522 INFO L226 Difference]: Without dead ends: 5293 [2023-02-17 09:10:58,524 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-02-17 09:10:58,525 INFO L413 NwaCegarLoop]: 204 mSDtfsCounter, 419 mSDsluCounter, 604 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 419 SdHoareTripleChecker+Valid, 808 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-17 09:10:58,525 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [419 Valid, 808 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-17 09:10:58,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5293 states. [2023-02-17 09:10:58,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5293 to 1325. [2023-02-17 09:10:58,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1325 states, 1324 states have (on average 1.365558912386707) internal successors, (1808), 1324 states have internal predecessors, (1808), 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) [2023-02-17 09:10:58,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1325 states to 1325 states and 1808 transitions. [2023-02-17 09:10:58,621 INFO L78 Accepts]: Start accepts. Automaton has 1325 states and 1808 transitions. Word has length 87 [2023-02-17 09:10:58,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 09:10:58,621 INFO L495 AbstractCegarLoop]: Abstraction has 1325 states and 1808 transitions. [2023-02-17 09:10:58,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 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) [2023-02-17 09:10:58,621 INFO L276 IsEmpty]: Start isEmpty. Operand 1325 states and 1808 transitions. [2023-02-17 09:10:58,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2023-02-17 09:10:58,623 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 09:10:58,623 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 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] [2023-02-17 09:10:58,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-02-17 09:10:58,623 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-02-17 09:10:58,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:10:58,624 INFO L85 PathProgramCache]: Analyzing trace with hash -2117430847, now seen corresponding path program 1 times [2023-02-17 09:10:58,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:10:58,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772687509] [2023-02-17 09:10:58,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:10:58,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:10:58,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:10:58,761 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2023-02-17 09:10:58,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 09:10:58,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772687509] [2023-02-17 09:10:58,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772687509] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 09:10:58,761 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 09:10:58,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-17 09:10:58,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483947722] [2023-02-17 09:10:58,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 09:10:58,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-17 09:10:58,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 09:10:58,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-17 09:10:58,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-17 09:10:58,763 INFO L87 Difference]: Start difference. First operand 1325 states and 1808 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 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) [2023-02-17 09:10:59,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 09:10:59,221 INFO L93 Difference]: Finished difference Result 5470 states and 7443 transitions. [2023-02-17 09:10:59,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-17 09:10:59,222 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 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 87 [2023-02-17 09:10:59,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 09:10:59,237 INFO L225 Difference]: With dead ends: 5470 [2023-02-17 09:10:59,238 INFO L226 Difference]: Without dead ends: 5266 [2023-02-17 09:10:59,240 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-02-17 09:10:59,241 INFO L413 NwaCegarLoop]: 178 mSDtfsCounter, 361 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 706 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-17 09:10:59,241 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [361 Valid, 706 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-17 09:10:59,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5266 states. [2023-02-17 09:10:59,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5266 to 1325. [2023-02-17 09:10:59,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1325 states, 1324 states have (on average 1.365558912386707) internal successors, (1808), 1324 states have internal predecessors, (1808), 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) [2023-02-17 09:10:59,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1325 states to 1325 states and 1808 transitions. [2023-02-17 09:10:59,331 INFO L78 Accepts]: Start accepts. Automaton has 1325 states and 1808 transitions. Word has length 87 [2023-02-17 09:10:59,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 09:10:59,331 INFO L495 AbstractCegarLoop]: Abstraction has 1325 states and 1808 transitions. [2023-02-17 09:10:59,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 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) [2023-02-17 09:10:59,331 INFO L276 IsEmpty]: Start isEmpty. Operand 1325 states and 1808 transitions. [2023-02-17 09:10:59,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2023-02-17 09:10:59,333 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 09:10:59,333 INFO L195 NwaCegarLoop]: 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, 1, 1] [2023-02-17 09:10:59,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-02-17 09:10:59,333 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-02-17 09:10:59,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:10:59,334 INFO L85 PathProgramCache]: Analyzing trace with hash -1677424560, now seen corresponding path program 1 times [2023-02-17 09:10:59,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:10:59,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46366399] [2023-02-17 09:10:59,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:10:59,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:10:59,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:10:59,461 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 49 proven. 5 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2023-02-17 09:10:59,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 09:10:59,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46366399] [2023-02-17 09:10:59,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46366399] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 09:10:59,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1566918362] [2023-02-17 09:10:59,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:10:59,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 09:10:59,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:10:59,465 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) [2023-02-17 09:10:59,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-02-17 09:10:59,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:10:59,532 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-17 09:10:59,533 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 09:10:59,554 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 49 proven. 3 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-02-17 09:10:59,554 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 09:10:59,601 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 40 proven. 28 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-02-17 09:10:59,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1566918362] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 09:10:59,601 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 09:10:59,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 6] total 10 [2023-02-17 09:10:59,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879080240] [2023-02-17 09:10:59,602 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 09:10:59,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-17 09:10:59,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 09:10:59,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-17 09:10:59,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2023-02-17 09:10:59,603 INFO L87 Difference]: Start difference. First operand 1325 states and 1808 transitions. Second operand has 10 states, 10 states have (on average 13.6) internal successors, (136), 10 states have internal predecessors, (136), 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) [2023-02-17 09:11:00,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 09:11:00,398 INFO L93 Difference]: Finished difference Result 5228 states and 7442 transitions. [2023-02-17 09:11:00,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-02-17 09:11:00,399 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 13.6) internal successors, (136), 10 states have internal predecessors, (136), 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 87 [2023-02-17 09:11:00,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 09:11:00,409 INFO L225 Difference]: With dead ends: 5228 [2023-02-17 09:11:00,410 INFO L226 Difference]: Without dead ends: 3920 [2023-02-17 09:11:00,412 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 166 SyntacticMatches, 6 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=166, Invalid=484, Unknown=0, NotChecked=0, Total=650 [2023-02-17 09:11:00,414 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 635 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 672 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 635 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 782 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 672 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-17 09:11:00,414 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [635 Valid, 463 Invalid, 782 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 672 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-02-17 09:11:00,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3920 states. [2023-02-17 09:11:00,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3920 to 2957. [2023-02-17 09:11:00,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2957 states, 2956 states have (on average 1.3031123139377536) internal successors, (3852), 2956 states have internal predecessors, (3852), 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) [2023-02-17 09:11:00,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2957 states to 2957 states and 3852 transitions. [2023-02-17 09:11:00,524 INFO L78 Accepts]: Start accepts. Automaton has 2957 states and 3852 transitions. Word has length 87 [2023-02-17 09:11:00,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 09:11:00,524 INFO L495 AbstractCegarLoop]: Abstraction has 2957 states and 3852 transitions. [2023-02-17 09:11:00,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.6) internal successors, (136), 10 states have internal predecessors, (136), 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) [2023-02-17 09:11:00,525 INFO L276 IsEmpty]: Start isEmpty. Operand 2957 states and 3852 transitions. [2023-02-17 09:11:00,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2023-02-17 09:11:00,527 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 09:11:00,527 INFO L195 NwaCegarLoop]: 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, 1, 1] [2023-02-17 09:11:00,536 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-02-17 09:11:00,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 09:11:00,734 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-02-17 09:11:00,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:11:00,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1885697052, now seen corresponding path program 1 times [2023-02-17 09:11:00,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:11:00,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960672017] [2023-02-17 09:11:00,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:11:00,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:11:00,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:11:00,864 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 51 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-02-17 09:11:00,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 09:11:00,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960672017] [2023-02-17 09:11:00,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960672017] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 09:11:00,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [75989825] [2023-02-17 09:11:00,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:11:00,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 09:11:00,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:11:00,869 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) [2023-02-17 09:11:00,872 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-02-17 09:11:00,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:11:00,926 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-17 09:11:00,928 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 09:11:00,977 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2023-02-17 09:11:00,978 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 09:11:00,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [75989825] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 09:11:00,978 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-17 09:11:00,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2023-02-17 09:11:00,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850684072] [2023-02-17 09:11:00,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 09:11:00,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-17 09:11:00,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 09:11:00,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-17 09:11:00,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-02-17 09:11:00,980 INFO L87 Difference]: Start difference. First operand 2957 states and 3852 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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) [2023-02-17 09:11:01,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 09:11:01,172 INFO L93 Difference]: Finished difference Result 6268 states and 8145 transitions. [2023-02-17 09:11:01,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-17 09:11:01,173 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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 87 [2023-02-17 09:11:01,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 09:11:01,182 INFO L225 Difference]: With dead ends: 6268 [2023-02-17 09:11:01,182 INFO L226 Difference]: Without dead ends: 5776 [2023-02-17 09:11:01,185 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 86 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-02-17 09:11:01,185 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 78 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 09:11:01,186 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 178 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 09:11:01,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5776 states. [2023-02-17 09:11:01,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5776 to 4767. [2023-02-17 09:11:01,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4767 states, 4766 states have (on average 1.3054972723457827) internal successors, (6222), 4766 states have internal predecessors, (6222), 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) [2023-02-17 09:11:01,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4767 states to 4767 states and 6222 transitions. [2023-02-17 09:11:01,371 INFO L78 Accepts]: Start accepts. Automaton has 4767 states and 6222 transitions. Word has length 87 [2023-02-17 09:11:01,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 09:11:01,372 INFO L495 AbstractCegarLoop]: Abstraction has 4767 states and 6222 transitions. [2023-02-17 09:11:01,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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) [2023-02-17 09:11:01,372 INFO L276 IsEmpty]: Start isEmpty. Operand 4767 states and 6222 transitions. [2023-02-17 09:11:01,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2023-02-17 09:11:01,375 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 09:11:01,375 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 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] [2023-02-17 09:11:01,385 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-02-17 09:11:01,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 09:11:01,582 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-02-17 09:11:01,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:11:01,583 INFO L85 PathProgramCache]: Analyzing trace with hash 1511267789, now seen corresponding path program 1 times [2023-02-17 09:11:01,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:11:01,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177606418] [2023-02-17 09:11:01,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:11:01,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:11:01,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:11:01,720 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2023-02-17 09:11:01,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 09:11:01,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177606418] [2023-02-17 09:11:01,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177606418] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 09:11:01,721 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 09:11:01,721 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-17 09:11:01,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626819348] [2023-02-17 09:11:01,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 09:11:01,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-17 09:11:01,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 09:11:01,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-17 09:11:01,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-17 09:11:01,722 INFO L87 Difference]: Start difference. First operand 4767 states and 6222 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 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) [2023-02-17 09:11:02,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 09:11:02,422 INFO L93 Difference]: Finished difference Result 10852 states and 14189 transitions. [2023-02-17 09:11:02,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-17 09:11:02,423 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 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 [2023-02-17 09:11:02,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 09:11:02,440 INFO L225 Difference]: With dead ends: 10852 [2023-02-17 09:11:02,441 INFO L226 Difference]: Without dead ends: 10596 [2023-02-17 09:11:02,443 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2023-02-17 09:11:02,444 INFO L413 NwaCegarLoop]: 240 mSDtfsCounter, 529 mSDsluCounter, 901 mSDsCounter, 0 mSdLazyCounter, 486 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 529 SdHoareTripleChecker+Valid, 1141 SdHoareTripleChecker+Invalid, 489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-17 09:11:02,445 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [529 Valid, 1141 Invalid, 489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 486 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-17 09:11:02,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10596 states. [2023-02-17 09:11:02,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10596 to 4746. [2023-02-17 09:11:02,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4746 states, 4745 states have (on average 1.3055848261327714) internal successors, (6195), 4745 states have internal predecessors, (6195), 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) [2023-02-17 09:11:02,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4746 states to 4746 states and 6195 transitions. [2023-02-17 09:11:02,685 INFO L78 Accepts]: Start accepts. Automaton has 4746 states and 6195 transitions. Word has length 89 [2023-02-17 09:11:02,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 09:11:02,685 INFO L495 AbstractCegarLoop]: Abstraction has 4746 states and 6195 transitions. [2023-02-17 09:11:02,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 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) [2023-02-17 09:11:02,686 INFO L276 IsEmpty]: Start isEmpty. Operand 4746 states and 6195 transitions. [2023-02-17 09:11:02,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2023-02-17 09:11:02,689 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 09:11:02,689 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 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] [2023-02-17 09:11:02,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-02-17 09:11:02,690 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-02-17 09:11:02,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:11:02,690 INFO L85 PathProgramCache]: Analyzing trace with hash -312709955, now seen corresponding path program 1 times [2023-02-17 09:11:02,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:11:02,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448202538] [2023-02-17 09:11:02,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:11:02,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:11:02,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:11:02,867 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2023-02-17 09:11:02,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 09:11:02,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448202538] [2023-02-17 09:11:02,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448202538] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 09:11:02,868 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 09:11:02,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-17 09:11:02,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956286909] [2023-02-17 09:11:02,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 09:11:02,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-17 09:11:02,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 09:11:02,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-17 09:11:02,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-17 09:11:02,870 INFO L87 Difference]: Start difference. First operand 4746 states and 6195 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 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) [2023-02-17 09:11:03,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 09:11:03,606 INFO L93 Difference]: Finished difference Result 12133 states and 15737 transitions. [2023-02-17 09:11:03,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-17 09:11:03,607 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 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 [2023-02-17 09:11:03,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 09:11:03,625 INFO L225 Difference]: With dead ends: 12133 [2023-02-17 09:11:03,626 INFO L226 Difference]: Without dead ends: 11703 [2023-02-17 09:11:03,629 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2023-02-17 09:11:03,629 INFO L413 NwaCegarLoop]: 205 mSDtfsCounter, 443 mSDsluCounter, 765 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 970 SdHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-17 09:11:03,629 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [443 Valid, 970 Invalid, 478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 475 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-17 09:11:03,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11703 states. [2023-02-17 09:11:03,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11703 to 4734. [2023-02-17 09:11:03,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4734 states, 4733 states have (on average 1.3063596027889288) internal successors, (6183), 4733 states have internal predecessors, (6183), 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) [2023-02-17 09:11:03,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4734 states to 4734 states and 6183 transitions. [2023-02-17 09:11:03,874 INFO L78 Accepts]: Start accepts. Automaton has 4734 states and 6183 transitions. Word has length 89 [2023-02-17 09:11:03,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 09:11:03,875 INFO L495 AbstractCegarLoop]: Abstraction has 4734 states and 6183 transitions. [2023-02-17 09:11:03,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 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) [2023-02-17 09:11:03,879 INFO L276 IsEmpty]: Start isEmpty. Operand 4734 states and 6183 transitions. [2023-02-17 09:11:03,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2023-02-17 09:11:03,883 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 09:11:03,883 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1] [2023-02-17 09:11:03,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-02-17 09:11:03,884 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-02-17 09:11:03,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:11:03,884 INFO L85 PathProgramCache]: Analyzing trace with hash 387927389, now seen corresponding path program 1 times [2023-02-17 09:11:03,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:11:03,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859347128] [2023-02-17 09:11:03,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:11:03,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:11:03,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:11:04,041 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 51 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-02-17 09:11:04,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 09:11:04,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859347128] [2023-02-17 09:11:04,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859347128] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 09:11:04,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [623144295] [2023-02-17 09:11:04,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:11:04,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 09:11:04,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:11:04,044 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) [2023-02-17 09:11:04,047 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-02-17 09:11:04,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:11:04,125 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-17 09:11:04,127 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 09:11:04,204 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 51 proven. 4 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-02-17 09:11:04,204 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 09:11:04,305 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 55 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-02-17 09:11:04,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [623144295] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 09:11:04,305 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 09:11:04,305 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 15 [2023-02-17 09:11:04,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986087598] [2023-02-17 09:11:04,306 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 09:11:04,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-02-17 09:11:04,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 09:11:04,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-02-17 09:11:04,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=130, Unknown=0, NotChecked=0, Total=210 [2023-02-17 09:11:04,308 INFO L87 Difference]: Start difference. First operand 4734 states and 6183 transitions. Second operand has 15 states, 15 states have (on average 9.533333333333333) internal successors, (143), 15 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) [2023-02-17 09:11:05,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 09:11:05,269 INFO L93 Difference]: Finished difference Result 13569 states and 17570 transitions. [2023-02-17 09:11:05,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-02-17 09:11:05,270 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 9.533333333333333) internal successors, (143), 15 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) Word has length 90 [2023-02-17 09:11:05,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 09:11:05,283 INFO L225 Difference]: With dead ends: 13569 [2023-02-17 09:11:05,283 INFO L226 Difference]: Without dead ends: 7813 [2023-02-17 09:11:05,290 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 168 SyntacticMatches, 6 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=189, Invalid=317, Unknown=0, NotChecked=0, Total=506 [2023-02-17 09:11:05,290 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 840 mSDsluCounter, 576 mSDsCounter, 0 mSdLazyCounter, 618 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 840 SdHoareTripleChecker+Valid, 668 SdHoareTripleChecker+Invalid, 695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 618 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-17 09:11:05,291 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [840 Valid, 668 Invalid, 695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 618 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-02-17 09:11:05,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7813 states. [2023-02-17 09:11:05,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7813 to 6296. [2023-02-17 09:11:05,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6296 states, 6295 states have (on average 1.270373312152502) internal successors, (7997), 6295 states have internal predecessors, (7997), 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) [2023-02-17 09:11:05,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6296 states to 6296 states and 7997 transitions. [2023-02-17 09:11:05,604 INFO L78 Accepts]: Start accepts. Automaton has 6296 states and 7997 transitions. Word has length 90 [2023-02-17 09:11:05,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 09:11:05,604 INFO L495 AbstractCegarLoop]: Abstraction has 6296 states and 7997 transitions. [2023-02-17 09:11:05,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 9.533333333333333) internal successors, (143), 15 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) [2023-02-17 09:11:05,605 INFO L276 IsEmpty]: Start isEmpty. Operand 6296 states and 7997 transitions. [2023-02-17 09:11:05,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2023-02-17 09:11:05,608 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 09:11:05,608 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 09:11:05,617 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-02-17 09:11:05,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2023-02-17 09:11:05,815 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-02-17 09:11:05,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:11:05,816 INFO L85 PathProgramCache]: Analyzing trace with hash -967413213, now seen corresponding path program 1 times [2023-02-17 09:11:05,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:11:05,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196244096] [2023-02-17 09:11:05,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:11:05,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:11:05,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:11:05,993 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 49 proven. 5 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2023-02-17 09:11:05,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 09:11:05,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196244096] [2023-02-17 09:11:05,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196244096] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 09:11:05,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [284856363] [2023-02-17 09:11:05,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:11:05,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 09:11:05,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 09:11:05,996 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) [2023-02-17 09:11:05,999 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-02-17 09:11:06,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 09:11:06,187 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 14 conjunts are in the unsatisfiable core [2023-02-17 09:11:06,188 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 09:11:06,328 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 49 proven. 3 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-02-17 09:11:06,328 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 09:11:06,426 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 42 proven. 28 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-17 09:11:06,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [284856363] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 09:11:06,427 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 09:11:06,427 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 9] total 15 [2023-02-17 09:11:06,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562712064] [2023-02-17 09:11:06,427 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 09:11:06,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-02-17 09:11:06,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 09:11:06,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-02-17 09:11:06,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2023-02-17 09:11:06,428 INFO L87 Difference]: Start difference. First operand 6296 states and 7997 transitions. Second operand has 15 states, 15 states have (on average 10.066666666666666) internal successors, (151), 15 states have internal predecessors, (151), 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) [2023-02-17 09:11:08,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 09:11:08,655 INFO L93 Difference]: Finished difference Result 14010 states and 17913 transitions. [2023-02-17 09:11:08,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-02-17 09:11:08,655 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 10.066666666666666) internal successors, (151), 15 states have internal predecessors, (151), 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 93 [2023-02-17 09:11:08,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 09:11:08,671 INFO L225 Difference]: With dead ends: 14010 [2023-02-17 09:11:08,671 INFO L226 Difference]: Without dead ends: 8932 [2023-02-17 09:11:08,679 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 172 SyntacticMatches, 9 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 506 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=401, Invalid=1579, Unknown=0, NotChecked=0, Total=1980 [2023-02-17 09:11:08,680 INFO L413 NwaCegarLoop]: 176 mSDtfsCounter, 1719 mSDsluCounter, 1045 mSDsCounter, 0 mSdLazyCounter, 1225 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1719 SdHoareTripleChecker+Valid, 1221 SdHoareTripleChecker+Invalid, 1358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 1225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-02-17 09:11:08,680 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1719 Valid, 1221 Invalid, 1358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 1225 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-02-17 09:11:08,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8932 states. [2023-02-17 09:11:08,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8932 to 7278. [2023-02-17 09:11:09,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7278 states, 7277 states have (on average 1.2675553112546378) internal successors, (9224), 7277 states have internal predecessors, (9224), 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) [2023-02-17 09:11:09,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7278 states to 7278 states and 9224 transitions. [2023-02-17 09:11:09,014 INFO L78 Accepts]: Start accepts. Automaton has 7278 states and 9224 transitions. Word has length 93 [2023-02-17 09:11:09,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 09:11:09,015 INFO L495 AbstractCegarLoop]: Abstraction has 7278 states and 9224 transitions. [2023-02-17 09:11:09,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 10.066666666666666) internal successors, (151), 15 states have internal predecessors, (151), 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) [2023-02-17 09:11:09,015 INFO L276 IsEmpty]: Start isEmpty. Operand 7278 states and 9224 transitions. [2023-02-17 09:11:09,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2023-02-17 09:11:09,019 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 09:11:09,019 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 09:11:09,027 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-02-17 09:11:09,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2023-02-17 09:11:09,225 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-02-17 09:11:09,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 09:11:09,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1251242111, now seen corresponding path program 1 times [2023-02-17 09:11:09,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 09:11:09,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20070307] [2023-02-17 09:11:09,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 09:11:09,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 09:11:09,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:11:09,252 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-17 09:11:09,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 09:11:09,300 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-17 09:11:09,300 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-02-17 09:11:09,301 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 41 remaining) [2023-02-17 09:11:09,302 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 41 remaining) [2023-02-17 09:11:09,303 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 41 remaining) [2023-02-17 09:11:09,303 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 41 remaining) [2023-02-17 09:11:09,303 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 41 remaining) [2023-02-17 09:11:09,303 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 41 remaining) [2023-02-17 09:11:09,304 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 41 remaining) [2023-02-17 09:11:09,304 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 41 remaining) [2023-02-17 09:11:09,304 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 41 remaining) [2023-02-17 09:11:09,305 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 41 remaining) [2023-02-17 09:11:09,305 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 41 remaining) [2023-02-17 09:11:09,305 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 41 remaining) [2023-02-17 09:11:09,305 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 41 remaining) [2023-02-17 09:11:09,305 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 41 remaining) [2023-02-17 09:11:09,305 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 41 remaining) [2023-02-17 09:11:09,305 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 41 remaining) [2023-02-17 09:11:09,306 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 41 remaining) [2023-02-17 09:11:09,306 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 41 remaining) [2023-02-17 09:11:09,306 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 41 remaining) [2023-02-17 09:11:09,306 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 41 remaining) [2023-02-17 09:11:09,306 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 41 remaining) [2023-02-17 09:11:09,306 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 41 remaining) [2023-02-17 09:11:09,307 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 41 remaining) [2023-02-17 09:11:09,307 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 41 remaining) [2023-02-17 09:11:09,307 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 41 remaining) [2023-02-17 09:11:09,307 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 41 remaining) [2023-02-17 09:11:09,308 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 41 remaining) [2023-02-17 09:11:09,308 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 41 remaining) [2023-02-17 09:11:09,308 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 41 remaining) [2023-02-17 09:11:09,308 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 41 remaining) [2023-02-17 09:11:09,308 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 41 remaining) [2023-02-17 09:11:09,308 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 41 remaining) [2023-02-17 09:11:09,308 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 41 remaining) [2023-02-17 09:11:09,309 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 41 remaining) [2023-02-17 09:11:09,309 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 41 remaining) [2023-02-17 09:11:09,309 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 41 remaining) [2023-02-17 09:11:09,309 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 41 remaining) [2023-02-17 09:11:09,309 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 41 remaining) [2023-02-17 09:11:09,309 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 41 remaining) [2023-02-17 09:11:09,309 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 41 remaining) [2023-02-17 09:11:09,310 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 41 remaining) [2023-02-17 09:11:09,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-02-17 09:11:09,314 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 09:11:09,317 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-17 09:11:09,407 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.02 09:11:09 BoogieIcfgContainer [2023-02-17 09:11:09,407 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-17 09:11:09,408 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-17 09:11:09,408 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-17 09:11:09,408 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-17 09:11:09,409 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 09:10:48" (3/4) ... [2023-02-17 09:11:09,410 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-02-17 09:11:09,491 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-17 09:11:09,492 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-17 09:11:09,492 INFO L158 Benchmark]: Toolchain (without parser) took 21755.83ms. Allocated memory was 151.0MB in the beginning and 484.4MB in the end (delta: 333.4MB). Free memory was 106.2MB in the beginning and 219.3MB in the end (delta: -113.1MB). Peak memory consumption was 221.8MB. Max. memory is 16.1GB. [2023-02-17 09:11:09,492 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 121.6MB. Free memory is still 62.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-17 09:11:09,493 INFO L158 Benchmark]: CACSL2BoogieTranslator took 250.51ms. Allocated memory is still 151.0MB. Free memory was 105.7MB in the beginning and 93.6MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-02-17 09:11:09,493 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.28ms. Allocated memory is still 151.0MB. Free memory was 93.6MB in the beginning and 90.4MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-02-17 09:11:09,493 INFO L158 Benchmark]: Boogie Preprocessor took 57.44ms. Allocated memory is still 151.0MB. Free memory was 90.4MB in the beginning and 88.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-17 09:11:09,495 INFO L158 Benchmark]: RCFGBuilder took 531.83ms. Allocated memory is still 151.0MB. Free memory was 88.3MB in the beginning and 109.0MB in the end (delta: -20.7MB). Peak memory consumption was 16.7MB. Max. memory is 16.1GB. [2023-02-17 09:11:09,496 INFO L158 Benchmark]: TraceAbstraction took 20777.59ms. Allocated memory was 151.0MB in the beginning and 484.4MB in the end (delta: 333.4MB). Free memory was 108.2MB in the beginning and 226.7MB in the end (delta: -118.5MB). Peak memory consumption was 215.6MB. Max. memory is 16.1GB. [2023-02-17 09:11:09,496 INFO L158 Benchmark]: Witness Printer took 83.95ms. Allocated memory is still 484.4MB. Free memory was 226.7MB in the beginning and 219.3MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-02-17 09:11:09,502 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.11ms. Allocated memory is still 121.6MB. Free memory is still 62.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 250.51ms. Allocated memory is still 151.0MB. Free memory was 105.7MB in the beginning and 93.6MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.28ms. Allocated memory is still 151.0MB. Free memory was 93.6MB in the beginning and 90.4MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 57.44ms. Allocated memory is still 151.0MB. Free memory was 90.4MB in the beginning and 88.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 531.83ms. Allocated memory is still 151.0MB. Free memory was 88.3MB in the beginning and 109.0MB in the end (delta: -20.7MB). Peak memory consumption was 16.7MB. Max. memory is 16.1GB. * TraceAbstraction took 20777.59ms. Allocated memory was 151.0MB in the beginning and 484.4MB in the end (delta: 333.4MB). Free memory was 108.2MB in the beginning and 226.7MB in the end (delta: -118.5MB). Peak memory consumption was 215.6MB. Max. memory is 16.1GB. * Witness Printer took 83.95ms. Allocated memory is still 484.4MB. Free memory was 226.7MB in the beginning and 219.3MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 116]: integer overflow possible integer overflow possible We found a FailurePath: [L124] unsigned int a, b, r; [L126] a = __VERIFIER_nondet_uint() [L127] b = __VERIFIER_nondet_uint() [L129] CALL mp_add(a, b) [L42] unsigned char a0, a1, a2, a3; [L43] unsigned char b0, b1, b2, b3; [L44] unsigned char r0, r1, r2, r3; [L45] unsigned short carry; [L46] unsigned short partial_sum; [L47] unsigned int r; [L48] unsigned char i; [L49] unsigned char na, nb; [L50] a0 = a [L51] a1 = a >> 8 [L52] a2 = a >> 16U [L53] a3 = a >> 24U [L54] b0 = b [L55] b1 = b >> 8U [L56] b2 = b >> 16U [L57] b3 = b >> 24U [L58] na = (unsigned char)4 VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, na=4] [L59] COND TRUE a3 == (unsigned char)0 VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, na=4] [L60] EXPR na - 1 [L60] na = na - 1 VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, na=3] [L61] COND TRUE a2 == (unsigned char)0 VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, na=3] [L62] EXPR na - 1 [L62] na = na - 1 VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, na=2] [L63] COND TRUE a1 == (unsigned char)0 VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, na=2] [L64] EXPR na - 1 [L64] na = na - 1 VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, na=1] [L68] nb = (unsigned char)4 VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, na=1, nb=4] [L69] COND FALSE !(b3 == (unsigned char)0) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, na=1, nb=4] [L78] carry = (unsigned short)0 [L79] i = (unsigned char)0 VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=0, na=1, nb=4] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=0, na=1, nb=4, partial_sum=0] [L83] COND TRUE i < na VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=0, na=1, nb=4, partial_sum=0] [L84] COND TRUE i == (unsigned char)0 VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=0, na=1, nb=4, partial_sum=0] [L84] EXPR partial_sum + a0 [L84] partial_sum = partial_sum + a0 VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=0, na=1, nb=4, partial_sum=0] [L85] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=0, na=1, nb=4, partial_sum=0] [L86] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=0, na=1, nb=4, partial_sum=0] [L87] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=0, na=1, nb=4, partial_sum=0] [L89] COND TRUE i < nb VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=0, na=1, nb=4, partial_sum=0] [L90] COND TRUE i == (unsigned char)0 VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=0, na=1, nb=4, partial_sum=0] [L90] EXPR partial_sum + b0 [L90] partial_sum = partial_sum + b0 VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=0, na=1, nb=4, partial_sum=0] [L91] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=0, na=1, nb=4, partial_sum=0] [L92] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=0, na=1, nb=4, partial_sum=0] [L93] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=0, na=1, nb=4, partial_sum=0] [L95] COND FALSE !(partial_sum > ((unsigned char)254)) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=0, na=1, nb=4, partial_sum=0] [L99] COND TRUE i == (unsigned char)0 [L99] r0 = (unsigned char)partial_sum VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=0, na=1, nb=4, partial_sum=0, r0=0] [L100] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=0, na=1, nb=4, partial_sum=0, r0=0] [L101] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=0, na=1, nb=4, partial_sum=0, r0=0] [L102] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=0, na=1, nb=4, partial_sum=0, r0=0] [L104] EXPR i + (unsigned char)1 [L104] i = i + (unsigned char)1 VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=1, na=1, nb=4, partial_sum=0, r0=0] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=1, na=1, nb=4, partial_sum=0, r0=0] [L83] COND FALSE !(i < na) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=1, na=1, nb=4, partial_sum=0, r0=0] [L89] COND TRUE i < nb VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=1, na=1, nb=4, partial_sum=0, r0=0] [L90] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=1, na=1, nb=4, partial_sum=0, r0=0] [L91] COND TRUE i == (unsigned char)1 VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=1, na=1, nb=4, partial_sum=0, r0=0] [L91] EXPR partial_sum + b1 [L91] partial_sum = partial_sum + b1 VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=1, na=1, nb=4, partial_sum=0, r0=0] [L92] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=1, na=1, nb=4, partial_sum=0, r0=0] [L93] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=1, na=1, nb=4, partial_sum=0, r0=0] [L95] COND FALSE !(partial_sum > ((unsigned char)254)) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=1, na=1, nb=4, partial_sum=0, r0=0] [L99] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=1, na=1, nb=4, partial_sum=0, r0=0] [L100] COND TRUE i == (unsigned char)1 [L100] r1 = (unsigned char)partial_sum VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=1, na=1, nb=4, partial_sum=0, r0=0, r1=0] [L101] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=1, na=1, nb=4, partial_sum=0, r0=0, r1=0] [L102] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=1, na=1, nb=4, partial_sum=0, r0=0, r1=0] [L104] EXPR i + (unsigned char)1 [L104] i = i + (unsigned char)1 VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=2, na=1, nb=4, partial_sum=0, r0=0, r1=0] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=2, na=1, nb=4, partial_sum=0, r0=0, r1=0] [L83] COND FALSE !(i < na) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=2, na=1, nb=4, partial_sum=0, r0=0, r1=0] [L89] COND TRUE i < nb VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=2, na=1, nb=4, partial_sum=0, r0=0, r1=0] [L90] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=2, na=1, nb=4, partial_sum=0, r0=0, r1=0] [L91] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=2, na=1, nb=4, partial_sum=0, r0=0, r1=0] [L92] COND TRUE i == (unsigned char)2 VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=2, na=1, nb=4, partial_sum=0, r0=0, r1=0] [L92] EXPR partial_sum + b2 [L92] partial_sum = partial_sum + b2 VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=2, na=1, nb=4, partial_sum=0, r0=0, r1=0] [L93] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=2, na=1, nb=4, partial_sum=0, r0=0, r1=0] [L95] COND FALSE !(partial_sum > ((unsigned char)254)) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=2, na=1, nb=4, partial_sum=0, r0=0, r1=0] [L99] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=2, na=1, nb=4, partial_sum=0, r0=0, r1=0] [L100] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=2, na=1, nb=4, partial_sum=0, r0=0, r1=0] [L101] COND TRUE i == (unsigned char)2 [L101] r2 = (unsigned char)partial_sum VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=2, na=1, nb=4, partial_sum=0, r0=0, r1=0, r2=0] [L102] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=2, na=1, nb=4, partial_sum=0, r0=0, r1=0, r2=0] [L104] EXPR i + (unsigned char)1 [L104] i = i + (unsigned char)1 VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=3, na=1, nb=4, partial_sum=0, r0=0, r1=0, r2=0] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=3, na=1, nb=4, partial_sum=0, r0=0, r1=0, r2=0] [L83] COND FALSE !(i < na) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=3, na=1, nb=4, partial_sum=0, r0=0, r1=0, r2=0] [L89] COND TRUE i < nb VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=3, na=1, nb=4, partial_sum=0, r0=0, r1=0, r2=0] [L90] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=3, na=1, nb=4, partial_sum=0, r0=0, r1=0, r2=0] [L91] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=3, na=1, nb=4, partial_sum=0, r0=0, r1=0, r2=0] [L92] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=3, na=1, nb=4, partial_sum=0, r0=0, r1=0, r2=0] [L93] COND TRUE i == (unsigned char)3 VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=3, na=1, nb=4, partial_sum=0, r0=0, r1=0, r2=0] [L93] EXPR partial_sum + b3 [L93] partial_sum = partial_sum + b3 VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=3, na=1, nb=4, partial_sum=128, r0=0, r1=0, r2=0] [L95] COND FALSE !(partial_sum > ((unsigned char)254)) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=3, na=1, nb=4, partial_sum=128, r0=0, r1=0, r2=0] [L99] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=3, na=1, nb=4, partial_sum=128, r0=0, r1=0, r2=0] [L100] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=3, na=1, nb=4, partial_sum=128, r0=0, r1=0, r2=0] [L101] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=3, na=1, nb=4, partial_sum=128, r0=0, r1=0, r2=0] [L102] COND TRUE i == (unsigned char)3 [L102] r3 = (unsigned char)partial_sum VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=3, na=1, nb=4, partial_sum=128, r0=0, r1=0, r2=0, r3=128] [L104] EXPR i + (unsigned char)1 [L104] i = i + (unsigned char)1 VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=4, na=1, nb=4, partial_sum=128, r0=0, r1=0, r2=0, r3=128] [L80] COND FALSE !((i < na) || (i < nb) || (carry != (unsigned short)0)) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=4, na=1, nb=4, partial_sum=128, r0=0, r1=0, r2=0, r3=128] [L107] COND FALSE !(i < (unsigned char)4) VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=4, na=1, nb=4, partial_sum=128, r0=0, r1=0, r2=0, r3=128] [L116] r1 << 8U VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=4, na=1, nb=4, partial_sum=128, r0=0, r1=0, r2=0, r3=128] [L116] r2 << 16U VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=4, na=1, nb=4, partial_sum=128, r0=0, r1=0, r2=0, r3=128] [L116] r3 << 24U VAL [\old(a)=0, \old(b)=2147483648, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483648, b0=-2147483648, b1=-8388608, b2=-32768, b3=-128, carry=0, i=4, na=1, nb=4, partial_sum=128, r0=0, r1=0, r2=0, r3=128] - UnprovableResult [Line: 60]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 60]: 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: 70]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 72]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 72]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 74]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 74]: 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: 86]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 86]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 87]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 87]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 90]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 90]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 91]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 91]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 92]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 92]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 93]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 93]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 104]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 104]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 113]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 113]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: 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, 126 locations, 41 error locations. Started 1 CEGAR loops. OverallTime: 20.6s, OverallIterations: 28, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 11.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 8329 SdHoareTripleChecker+Valid, 7.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8329 mSDsluCounter, 11565 SdHoareTripleChecker+Invalid, 6.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8255 mSDsCounter, 579 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8301 IncrementalHoareTripleChecker+Invalid, 8880 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 579 mSolverCounterUnsat, 3310 mSDtfsCounter, 8301 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1319 GetRequests, 1013 SyntacticMatches, 64 SemanticMatches, 242 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1304 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7278occurred in iteration=27, InterpolantAutomatonStates: 252, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.0s AutomataMinimizationTime, 27 MinimizatonAttempts, 34637 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 2517 NumberOfCodeBlocks, 2517 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 2733 ConstructedInterpolants, 38 QuantifiedInterpolants, 15160 SizeOfPredicates, 25 NumberOfNonLiveVariables, 1465 ConjunctsInSsa, 73 ConjunctsInUnsatCore, 40 InterpolantComputations, 23 PerfectInterpolantSequences, 2289/2474 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 proved your program to be incorrect! [2023-02-17 09:11:09,528 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... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(OVERFLOW)