./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/bitvector/byte_add_1-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version f4b24e32 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_1-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 db53fe9124e215e75c7f288cadf12df33daef67c04c75ea6ca77bc804670a99c --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-14 13:55:16,858 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 13:55:16,860 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 13:55:16,893 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 13:55:16,894 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 13:55:16,895 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 13:55:16,896 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 13:55:16,897 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 13:55:16,899 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 13:55:16,899 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 13:55:16,900 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 13:55:16,901 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 13:55:16,902 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 13:55:16,902 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 13:55:16,912 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 13:55:16,914 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 13:55:16,914 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 13:55:16,915 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 13:55:16,916 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 13:55:16,918 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 13:55:16,919 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 13:55:16,920 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 13:55:16,921 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 13:55:16,922 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 13:55:16,922 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 13:55:16,925 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 13:55:16,925 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 13:55:16,925 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 13:55:16,926 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 13:55:16,929 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 13:55:16,930 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 13:55:16,931 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 13:55:16,931 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 13:55:16,932 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 13:55:16,933 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 13:55:16,933 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 13:55:16,933 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 13:55:16,934 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 13:55:16,934 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 13:55:16,934 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 13:55:16,935 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 13:55:16,936 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 13:55:16,937 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2022-07-14 13:55:16,955 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 13:55:16,956 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 13:55:16,956 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 13:55:16,956 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 13:55:16,957 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-14 13:55:16,957 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-14 13:55:16,957 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 13:55:16,958 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 13:55:16,958 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 13:55:16,958 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 13:55:16,958 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-14 13:55:16,958 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-14 13:55:16,959 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 13:55:16,959 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-14 13:55:16,959 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 13:55:16,959 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-14 13:55:16,959 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-14 13:55:16,959 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-14 13:55:16,960 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-07-14 13:55:16,960 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-14 13:55:16,960 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-14 13:55:16,960 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 13:55:16,960 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-14 13:55:16,960 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 13:55:16,961 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 13:55:16,961 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-14 13:55:16,961 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 13:55:16,961 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 13:55:16,961 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-14 13:55:16,962 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-14 13:55:16,962 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-14 13:55:16,962 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-14 13:55:16,962 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-14 13:55:16,962 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> db53fe9124e215e75c7f288cadf12df33daef67c04c75ea6ca77bc804670a99c [2022-07-14 13:55:17,194 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 13:55:17,220 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 13:55:17,222 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 13:55:17,223 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 13:55:17,225 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 13:55:17,226 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/byte_add_1-2.i [2022-07-14 13:55:17,277 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64efc4e75/fbdfa52f3bc74e0780e4ce384842f4a1/FLAG1d77ee6ca [2022-07-14 13:55:17,755 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 13:55:17,755 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add_1-2.i [2022-07-14 13:55:17,764 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64efc4e75/fbdfa52f3bc74e0780e4ce384842f4a1/FLAG1d77ee6ca [2022-07-14 13:55:17,776 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64efc4e75/fbdfa52f3bc74e0780e4ce384842f4a1 [2022-07-14 13:55:17,779 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 13:55:17,780 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 13:55:17,782 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 13:55:17,782 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 13:55:17,785 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 13:55:17,785 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 01:55:17" (1/1) ... [2022-07-14 13:55:17,786 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@486b9b35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 01:55:17, skipping insertion in model container [2022-07-14 13:55:17,787 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 01:55:17" (1/1) ... [2022-07-14 13:55:17,792 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 13:55:17,811 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 13:55:17,938 WARN L230 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_1-2.i[1168,1181] [2022-07-14 13:55:18,005 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 13:55:18,011 INFO L203 MainTranslator]: Completed pre-run [2022-07-14 13:55:18,020 WARN L230 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_1-2.i[1168,1181] [2022-07-14 13:55:18,049 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 13:55:18,058 INFO L208 MainTranslator]: Completed translation [2022-07-14 13:55:18,059 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 01:55:18 WrapperNode [2022-07-14 13:55:18,059 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 13:55:18,060 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-14 13:55:18,060 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-14 13:55:18,061 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-14 13:55:18,066 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 01:55:18" (1/1) ... [2022-07-14 13:55:18,088 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 01:55:18" (1/1) ... [2022-07-14 13:55:18,134 INFO L137 Inliner]: procedures = 16, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 185 [2022-07-14 13:55:18,134 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-14 13:55:18,135 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-14 13:55:18,135 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-14 13:55:18,135 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-14 13:55:18,142 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 01:55:18" (1/1) ... [2022-07-14 13:55:18,143 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 01:55:18" (1/1) ... [2022-07-14 13:55:18,149 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 01:55:18" (1/1) ... [2022-07-14 13:55:18,149 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 01:55:18" (1/1) ... [2022-07-14 13:55:18,168 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 01:55:18" (1/1) ... [2022-07-14 13:55:18,173 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 01:55:18" (1/1) ... [2022-07-14 13:55:18,178 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 01:55:18" (1/1) ... [2022-07-14 13:55:18,188 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-14 13:55:18,190 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-14 13:55:18,190 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-14 13:55:18,190 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-14 13:55:18,191 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 01:55:18" (1/1) ... [2022-07-14 13:55:18,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 13:55:18,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 13:55:18,233 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) [2022-07-14 13:55:18,274 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 [2022-07-14 13:55:18,291 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-14 13:55:18,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-14 13:55:18,291 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-14 13:55:18,292 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-14 13:55:18,354 INFO L234 CfgBuilder]: Building ICFG [2022-07-14 13:55:18,355 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-14 13:55:18,879 INFO L275 CfgBuilder]: Performing block encoding [2022-07-14 13:55:18,885 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-14 13:55:18,888 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-14 13:55:18,891 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 01:55:18 BoogieIcfgContainer [2022-07-14 13:55:18,891 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-14 13:55:18,893 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-14 13:55:18,893 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-14 13:55:18,896 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-14 13:55:18,896 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.07 01:55:17" (1/3) ... [2022-07-14 13:55:18,897 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7675e9f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 01:55:18, skipping insertion in model container [2022-07-14 13:55:18,897 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 01:55:18" (2/3) ... [2022-07-14 13:55:18,898 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7675e9f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 01:55:18, skipping insertion in model container [2022-07-14 13:55:18,898 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 01:55:18" (3/3) ... [2022-07-14 13:55:18,899 INFO L111 eAbstractionObserver]: Analyzing ICFG byte_add_1-2.i [2022-07-14 13:55:18,911 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-14 13:55:18,912 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 40 error locations. [2022-07-14 13:55:18,955 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-14 13:55:18,960 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=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@55042989, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@553a3123 [2022-07-14 13:55:18,961 INFO L358 AbstractCegarLoop]: Starting to check reachability of 40 error locations. [2022-07-14 13:55:18,965 INFO L276 IsEmpty]: Start isEmpty. Operand has 128 states, 87 states have (on average 1.896551724137931) internal successors, (165), 127 states have internal predecessors, (165), 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) [2022-07-14 13:55:18,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-07-14 13:55:18,970 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:55:18,971 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-07-14 13:55:18,971 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2022-07-14 13:55:18,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:55:18,976 INFO L85 PathProgramCache]: Analyzing trace with hash 925604, now seen corresponding path program 1 times [2022-07-14 13:55:18,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:55:18,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008329141] [2022-07-14 13:55:18,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:55:18,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:55:19,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:55:19,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 13:55:19,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:55:19,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008329141] [2022-07-14 13:55:19,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008329141] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 13:55:19,112 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 13:55:19,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-07-14 13:55:19,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386488002] [2022-07-14 13:55:19,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 13:55:19,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-14 13:55:19,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:55:19,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-14 13:55:19,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-14 13:55:19,155 INFO L87 Difference]: Start difference. First operand has 128 states, 87 states have (on average 1.896551724137931) internal successors, (165), 127 states have internal predecessors, (165), 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) [2022-07-14 13:55:19,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:55:19,184 INFO L93 Difference]: Finished difference Result 196 states and 290 transitions. [2022-07-14 13:55:19,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-14 13:55:19,186 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 [2022-07-14 13:55:19,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:55:19,193 INFO L225 Difference]: With dead ends: 196 [2022-07-14 13:55:19,194 INFO L226 Difference]: Without dead ends: 77 [2022-07-14 13:55:19,196 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 [2022-07-14 13:55:19,200 INFO L413 NwaCegarLoop]: 121 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, 121 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 [2022-07-14 13:55:19,201 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 13:55:19,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-07-14 13:55:19,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2022-07-14 13:55:19,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 75 states have (on average 1.3866666666666667) internal successors, (104), 76 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) [2022-07-14 13:55:19,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 104 transitions. [2022-07-14 13:55:19,235 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 104 transitions. Word has length 4 [2022-07-14 13:55:19,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:55:19,236 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 104 transitions. [2022-07-14 13:55:19,236 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) [2022-07-14 13:55:19,236 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 104 transitions. [2022-07-14 13:55:19,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-14 13:55:19,237 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:55:19,238 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 13:55:19,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-14 13:55:19,238 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2022-07-14 13:55:19,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:55:19,239 INFO L85 PathProgramCache]: Analyzing trace with hash -1699660314, now seen corresponding path program 1 times [2022-07-14 13:55:19,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:55:19,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485865297] [2022-07-14 13:55:19,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:55:19,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:55:19,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:55:19,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 13:55:19,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:55:19,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485865297] [2022-07-14 13:55:19,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485865297] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 13:55:19,321 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 13:55:19,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 13:55:19,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176297676] [2022-07-14 13:55:19,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 13:55:19,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 13:55:19,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:55:19,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 13:55:19,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 13:55:19,324 INFO L87 Difference]: Start difference. First operand 77 states and 104 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:55:19,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:55:19,435 INFO L93 Difference]: Finished difference Result 166 states and 236 transitions. [2022-07-14 13:55:19,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 13:55:19,436 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-07-14 13:55:19,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:55:19,438 INFO L225 Difference]: With dead ends: 166 [2022-07-14 13:55:19,438 INFO L226 Difference]: Without dead ends: 111 [2022-07-14 13:55:19,439 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 13:55:19,441 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 36 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 13:55:19,443 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 139 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 13:55:19,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-07-14 13:55:19,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 107. [2022-07-14 13:55:19,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 105 states have (on average 1.3238095238095238) internal successors, (139), 106 states have internal predecessors, (139), 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) [2022-07-14 13:55:19,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 139 transitions. [2022-07-14 13:55:19,453 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 139 transitions. Word has length 13 [2022-07-14 13:55:19,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:55:19,454 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 139 transitions. [2022-07-14 13:55:19,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:55:19,454 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 139 transitions. [2022-07-14 13:55:19,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-14 13:55:19,455 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:55:19,455 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] [2022-07-14 13:55:19,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-14 13:55:19,456 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2022-07-14 13:55:19,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:55:19,457 INFO L85 PathProgramCache]: Analyzing trace with hash 1912649374, now seen corresponding path program 1 times [2022-07-14 13:55:19,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:55:19,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276599809] [2022-07-14 13:55:19,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:55:19,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:55:19,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:55:19,581 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-14 13:55:19,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:55:19,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276599809] [2022-07-14 13:55:19,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276599809] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 13:55:19,582 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 13:55:19,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 13:55:19,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311568794] [2022-07-14 13:55:19,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 13:55:19,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 13:55:19,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:55:19,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 13:55:19,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 13:55:19,584 INFO L87 Difference]: Start difference. First operand 107 states and 139 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:55:19,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:55:19,812 INFO L93 Difference]: Finished difference Result 277 states and 362 transitions. [2022-07-14 13:55:19,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 13:55:19,813 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-07-14 13:55:19,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:55:19,814 INFO L225 Difference]: With dead ends: 277 [2022-07-14 13:55:19,814 INFO L226 Difference]: Without dead ends: 200 [2022-07-14 13:55:19,815 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-14 13:55:19,816 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 148 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 13:55:19,817 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 336 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 13:55:19,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2022-07-14 13:55:19,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 120. [2022-07-14 13:55:19,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 118 states have (on average 1.3135593220338984) internal successors, (155), 119 states have internal predecessors, (155), 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) [2022-07-14 13:55:19,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 155 transitions. [2022-07-14 13:55:19,827 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 155 transitions. Word has length 20 [2022-07-14 13:55:19,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:55:19,828 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 155 transitions. [2022-07-14 13:55:19,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:55:19,828 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 155 transitions. [2022-07-14 13:55:19,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-14 13:55:19,829 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:55:19,829 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] [2022-07-14 13:55:19,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-14 13:55:19,830 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2022-07-14 13:55:19,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:55:19,830 INFO L85 PathProgramCache]: Analyzing trace with hash 1423012674, now seen corresponding path program 1 times [2022-07-14 13:55:19,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:55:19,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338434850] [2022-07-14 13:55:19,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:55:19,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:55:19,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:55:19,912 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-14 13:55:19,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:55:19,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338434850] [2022-07-14 13:55:19,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338434850] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 13:55:19,914 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 13:55:19,914 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 13:55:19,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075661263] [2022-07-14 13:55:19,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 13:55:19,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 13:55:19,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:55:19,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 13:55:19,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 13:55:19,916 INFO L87 Difference]: Start difference. First operand 120 states and 155 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:55:19,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:55:19,923 INFO L93 Difference]: Finished difference Result 198 states and 257 transitions. [2022-07-14 13:55:19,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 13:55:19,923 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-07-14 13:55:19,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:55:19,924 INFO L225 Difference]: With dead ends: 198 [2022-07-14 13:55:19,924 INFO L226 Difference]: Without dead ends: 94 [2022-07-14 13:55:19,925 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 [2022-07-14 13:55:19,926 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 91 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 13:55:19,927 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 92 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 13:55:19,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-07-14 13:55:19,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2022-07-14 13:55:19,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 92 states have (on average 1.315217391304348) internal successors, (121), 93 states have internal predecessors, (121), 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) [2022-07-14 13:55:19,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 121 transitions. [2022-07-14 13:55:19,934 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 121 transitions. Word has length 23 [2022-07-14 13:55:19,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:55:19,934 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 121 transitions. [2022-07-14 13:55:19,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:55:19,935 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 121 transitions. [2022-07-14 13:55:19,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-14 13:55:19,936 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:55:19,936 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] [2022-07-14 13:55:19,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-14 13:55:19,936 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2022-07-14 13:55:19,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:55:19,937 INFO L85 PathProgramCache]: Analyzing trace with hash 566199391, now seen corresponding path program 1 times [2022-07-14 13:55:19,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:55:19,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21112227] [2022-07-14 13:55:19,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:55:19,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:55:19,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:55:20,050 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 13:55:20,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:55:20,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21112227] [2022-07-14 13:55:20,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21112227] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 13:55:20,051 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 13:55:20,052 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 13:55:20,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599174910] [2022-07-14 13:55:20,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 13:55:20,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 13:55:20,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:55:20,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 13:55:20,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 13:55:20,053 INFO L87 Difference]: Start difference. First operand 94 states and 121 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 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) [2022-07-14 13:55:20,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:55:20,222 INFO L93 Difference]: Finished difference Result 242 states and 316 transitions. [2022-07-14 13:55:20,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 13:55:20,223 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 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 29 [2022-07-14 13:55:20,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:55:20,224 INFO L225 Difference]: With dead ends: 242 [2022-07-14 13:55:20,224 INFO L226 Difference]: Without dead ends: 177 [2022-07-14 13:55:20,225 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-14 13:55:20,226 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 127 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 13:55:20,226 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 295 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 13:55:20,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2022-07-14 13:55:20,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 104. [2022-07-14 13:55:20,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 102 states have (on average 1.2843137254901962) internal successors, (131), 103 states have internal predecessors, (131), 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) [2022-07-14 13:55:20,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 131 transitions. [2022-07-14 13:55:20,236 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 131 transitions. Word has length 29 [2022-07-14 13:55:20,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:55:20,237 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 131 transitions. [2022-07-14 13:55:20,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 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) [2022-07-14 13:55:20,237 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 131 transitions. [2022-07-14 13:55:20,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-14 13:55:20,239 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:55:20,239 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, 1, 1] [2022-07-14 13:55:20,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-14 13:55:20,239 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2022-07-14 13:55:20,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:55:20,240 INFO L85 PathProgramCache]: Analyzing trace with hash 1045180640, now seen corresponding path program 1 times [2022-07-14 13:55:20,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:55:20,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518751891] [2022-07-14 13:55:20,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:55:20,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:55:20,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:55:20,311 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 13:55:20,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:55:20,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518751891] [2022-07-14 13:55:20,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518751891] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 13:55:20,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [384091054] [2022-07-14 13:55:20,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:55:20,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 13:55:20,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 13:55:20,327 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) [2022-07-14 13:55:20,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-14 13:55:20,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:55:20,405 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-14 13:55:20,415 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 13:55:20,584 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 13:55:20,585 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 13:55:20,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [384091054] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 13:55:20,585 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-14 13:55:20,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2022-07-14 13:55:20,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221503697] [2022-07-14 13:55:20,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 13:55:20,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 13:55:20,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:55:20,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 13:55:20,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-07-14 13:55:20,588 INFO L87 Difference]: Start difference. First operand 104 states and 131 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:55:20,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:55:20,781 INFO L93 Difference]: Finished difference Result 218 states and 305 transitions. [2022-07-14 13:55:20,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 13:55:20,782 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-07-14 13:55:20,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:55:20,783 INFO L225 Difference]: With dead ends: 218 [2022-07-14 13:55:20,783 INFO L226 Difference]: Without dead ends: 163 [2022-07-14 13:55:20,784 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-07-14 13:55:20,785 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 56 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 13:55:20,785 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 165 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 13:55:20,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2022-07-14 13:55:20,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 137. [2022-07-14 13:55:20,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 135 states have (on average 1.2518518518518518) internal successors, (169), 136 states have internal predecessors, (169), 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) [2022-07-14 13:55:20,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 169 transitions. [2022-07-14 13:55:20,805 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 169 transitions. Word has length 32 [2022-07-14 13:55:20,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:55:20,805 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 169 transitions. [2022-07-14 13:55:20,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:55:20,806 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 169 transitions. [2022-07-14 13:55:20,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-14 13:55:20,807 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:55:20,807 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 13:55:20,830 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-14 13:55:21,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-07-14 13:55:21,024 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2022-07-14 13:55:21,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:55:21,025 INFO L85 PathProgramCache]: Analyzing trace with hash -1592706144, now seen corresponding path program 1 times [2022-07-14 13:55:21,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:55:21,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721884401] [2022-07-14 13:55:21,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:55:21,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:55:21,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:55:21,132 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 13:55:21,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:55:21,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721884401] [2022-07-14 13:55:21,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721884401] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 13:55:21,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [669010614] [2022-07-14 13:55:21,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:55:21,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 13:55:21,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 13:55:21,135 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) [2022-07-14 13:55:21,158 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-14 13:55:21,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:55:21,206 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-14 13:55:21,208 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 13:55:21,269 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-14 13:55:21,270 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 13:55:21,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [669010614] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 13:55:21,270 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-14 13:55:21,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2022-07-14 13:55:21,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494645867] [2022-07-14 13:55:21,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 13:55:21,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 13:55:21,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:55:21,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 13:55:21,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-14 13:55:21,273 INFO L87 Difference]: Start difference. First operand 137 states and 169 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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) [2022-07-14 13:55:21,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:55:21,437 INFO L93 Difference]: Finished difference Result 315 states and 416 transitions. [2022-07-14 13:55:21,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 13:55:21,437 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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 39 [2022-07-14 13:55:21,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:55:21,439 INFO L225 Difference]: With dead ends: 315 [2022-07-14 13:55:21,439 INFO L226 Difference]: Without dead ends: 205 [2022-07-14 13:55:21,439 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-14 13:55:21,440 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 60 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 13:55:21,440 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 216 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 13:55:21,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2022-07-14 13:55:21,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 167. [2022-07-14 13:55:21,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 165 states have (on average 1.2363636363636363) internal successors, (204), 166 states have internal predecessors, (204), 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) [2022-07-14 13:55:21,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 204 transitions. [2022-07-14 13:55:21,455 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 204 transitions. Word has length 39 [2022-07-14 13:55:21,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:55:21,456 INFO L495 AbstractCegarLoop]: Abstraction has 167 states and 204 transitions. [2022-07-14 13:55:21,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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) [2022-07-14 13:55:21,457 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 204 transitions. [2022-07-14 13:55:21,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-14 13:55:21,459 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:55:21,459 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 13:55:21,491 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-14 13:55:21,679 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,SelfDestructingSolverStorable6 [2022-07-14 13:55:21,680 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2022-07-14 13:55:21,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:55:21,680 INFO L85 PathProgramCache]: Analyzing trace with hash 2089098276, now seen corresponding path program 1 times [2022-07-14 13:55:21,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:55:21,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29376987] [2022-07-14 13:55:21,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:55:21,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:55:21,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:55:21,801 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-14 13:55:21,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:55:21,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29376987] [2022-07-14 13:55:21,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29376987] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 13:55:21,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [677372974] [2022-07-14 13:55:21,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:55:21,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 13:55:21,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 13:55:21,808 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) [2022-07-14 13:55:21,841 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-14 13:55:21,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:55:21,880 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-14 13:55:21,896 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 13:55:21,922 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-14 13:55:21,922 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 13:55:21,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [677372974] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 13:55:21,923 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-14 13:55:21,923 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2022-07-14 13:55:21,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495103259] [2022-07-14 13:55:21,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 13:55:21,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 13:55:21,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:55:21,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 13:55:21,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-14 13:55:21,926 INFO L87 Difference]: Start difference. First operand 167 states and 204 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 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) [2022-07-14 13:55:22,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:55:22,048 INFO L93 Difference]: Finished difference Result 375 states and 484 transitions. [2022-07-14 13:55:22,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 13:55:22,049 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 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 46 [2022-07-14 13:55:22,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:55:22,050 INFO L225 Difference]: With dead ends: 375 [2022-07-14 13:55:22,051 INFO L226 Difference]: Without dead ends: 235 [2022-07-14 13:55:22,051 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-14 13:55:22,055 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 59 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 13:55:22,055 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 223 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 13:55:22,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2022-07-14 13:55:22,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 197. [2022-07-14 13:55:22,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 195 states have (on average 1.2256410256410257) internal successors, (239), 196 states have internal predecessors, (239), 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) [2022-07-14 13:55:22,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 239 transitions. [2022-07-14 13:55:22,078 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 239 transitions. Word has length 46 [2022-07-14 13:55:22,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:55:22,078 INFO L495 AbstractCegarLoop]: Abstraction has 197 states and 239 transitions. [2022-07-14 13:55:22,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 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) [2022-07-14 13:55:22,079 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 239 transitions. [2022-07-14 13:55:22,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-14 13:55:22,082 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:55:22,082 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 13:55:22,110 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-14 13:55:22,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 13:55:22,305 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2022-07-14 13:55:22,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:55:22,305 INFO L85 PathProgramCache]: Analyzing trace with hash -1055235236, now seen corresponding path program 1 times [2022-07-14 13:55:22,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:55:22,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84639936] [2022-07-14 13:55:22,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:55:22,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:55:22,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:55:22,366 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-14 13:55:22,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:55:22,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84639936] [2022-07-14 13:55:22,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84639936] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 13:55:22,367 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 13:55:22,367 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 13:55:22,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998442065] [2022-07-14 13:55:22,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 13:55:22,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 13:55:22,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:55:22,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 13:55:22,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 13:55:22,369 INFO L87 Difference]: Start difference. First operand 197 states and 239 transitions. Second operand has 3 states, 2 states have (on average 22.0) internal successors, (44), 3 states have internal predecessors, (44), 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) [2022-07-14 13:55:22,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:55:22,381 INFO L93 Difference]: Finished difference Result 237 states and 283 transitions. [2022-07-14 13:55:22,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 13:55:22,382 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 22.0) internal successors, (44), 3 states have internal predecessors, (44), 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 53 [2022-07-14 13:55:22,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:55:22,384 INFO L225 Difference]: With dead ends: 237 [2022-07-14 13:55:22,384 INFO L226 Difference]: Without dead ends: 173 [2022-07-14 13:55:22,385 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 13:55:22,387 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 10 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 13:55:22,387 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 189 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 13:55:22,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2022-07-14 13:55:22,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2022-07-14 13:55:22,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 171 states have (on average 1.2163742690058479) internal successors, (208), 172 states have internal predecessors, (208), 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) [2022-07-14 13:55:22,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 208 transitions. [2022-07-14 13:55:22,394 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 208 transitions. Word has length 53 [2022-07-14 13:55:22,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:55:22,395 INFO L495 AbstractCegarLoop]: Abstraction has 173 states and 208 transitions. [2022-07-14 13:55:22,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 22.0) internal successors, (44), 3 states have internal predecessors, (44), 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) [2022-07-14 13:55:22,395 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 208 transitions. [2022-07-14 13:55:22,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-14 13:55:22,395 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:55:22,396 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 13:55:22,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-14 13:55:22,396 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2022-07-14 13:55:22,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:55:22,396 INFO L85 PathProgramCache]: Analyzing trace with hash -2041742915, now seen corresponding path program 1 times [2022-07-14 13:55:22,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:55:22,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044849478] [2022-07-14 13:55:22,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:55:22,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:55:22,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:55:22,488 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 36 proven. 2 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-07-14 13:55:22,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:55:22,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044849478] [2022-07-14 13:55:22,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044849478] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 13:55:22,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [69489901] [2022-07-14 13:55:22,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:55:22,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 13:55:22,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 13:55:22,491 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) [2022-07-14 13:55:22,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-14 13:55:22,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:55:22,552 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-14 13:55:22,556 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 13:55:22,648 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 36 proven. 2 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-07-14 13:55:22,648 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 13:55:22,813 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 24 proven. 32 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-14 13:55:22,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [69489901] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 13:55:22,813 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 13:55:22,813 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 6] total 7 [2022-07-14 13:55:22,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148668780] [2022-07-14 13:55:22,813 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 13:55:22,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 13:55:22,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:55:22,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 13:55:22,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-14 13:55:22,815 INFO L87 Difference]: Start difference. First operand 173 states and 208 transitions. Second operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:55:23,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:55:23,028 INFO L93 Difference]: Finished difference Result 527 states and 645 transitions. [2022-07-14 13:55:23,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-14 13:55:23,032 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2022-07-14 13:55:23,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:55:23,034 INFO L225 Difference]: With dead ends: 527 [2022-07-14 13:55:23,034 INFO L226 Difference]: Without dead ends: 381 [2022-07-14 13:55:23,034 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 118 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-07-14 13:55:23,035 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 156 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 13:55:23,035 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 254 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 13:55:23,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2022-07-14 13:55:23,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 213. [2022-07-14 13:55:23,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 211 states have (on average 1.2132701421800949) internal successors, (256), 212 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:55:23,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 256 transitions. [2022-07-14 13:55:23,041 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 256 transitions. Word has length 62 [2022-07-14 13:55:23,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:55:23,042 INFO L495 AbstractCegarLoop]: Abstraction has 213 states and 256 transitions. [2022-07-14 13:55:23,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:55:23,042 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 256 transitions. [2022-07-14 13:55:23,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-07-14 13:55:23,042 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:55:23,043 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] [2022-07-14 13:55:23,071 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-14 13:55:23,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 13:55:23,257 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2022-07-14 13:55:23,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:55:23,257 INFO L85 PathProgramCache]: Analyzing trace with hash -1768710772, now seen corresponding path program 1 times [2022-07-14 13:55:23,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:55:23,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676886465] [2022-07-14 13:55:23,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:55:23,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:55:23,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:55:23,290 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-07-14 13:55:23,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:55:23,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676886465] [2022-07-14 13:55:23,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676886465] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 13:55:23,291 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 13:55:23,291 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 13:55:23,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397833219] [2022-07-14 13:55:23,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 13:55:23,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 13:55:23,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:55:23,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 13:55:23,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 13:55:23,292 INFO L87 Difference]: Start difference. First operand 213 states and 256 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 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) [2022-07-14 13:55:23,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:55:23,354 INFO L93 Difference]: Finished difference Result 500 states and 604 transitions. [2022-07-14 13:55:23,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 13:55:23,355 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 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 68 [2022-07-14 13:55:23,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:55:23,356 INFO L225 Difference]: With dead ends: 500 [2022-07-14 13:55:23,356 INFO L226 Difference]: Without dead ends: 314 [2022-07-14 13:55:23,357 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 [2022-07-14 13:55:23,358 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 58 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 13:55:23,358 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 320 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 13:55:23,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2022-07-14 13:55:23,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 229. [2022-07-14 13:55:23,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 227 states have (on average 1.251101321585903) internal successors, (284), 228 states have internal predecessors, (284), 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) [2022-07-14 13:55:23,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 284 transitions. [2022-07-14 13:55:23,365 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 284 transitions. Word has length 68 [2022-07-14 13:55:23,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:55:23,366 INFO L495 AbstractCegarLoop]: Abstraction has 229 states and 284 transitions. [2022-07-14 13:55:23,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 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) [2022-07-14 13:55:23,366 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 284 transitions. [2022-07-14 13:55:23,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-07-14 13:55:23,367 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:55:23,367 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] [2022-07-14 13:55:23,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-14 13:55:23,367 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2022-07-14 13:55:23,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:55:23,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1005534357, now seen corresponding path program 1 times [2022-07-14 13:55:23,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:55:23,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177339882] [2022-07-14 13:55:23,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:55:23,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:55:23,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:55:23,424 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 46 proven. 4 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-14 13:55:23,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:55:23,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177339882] [2022-07-14 13:55:23,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177339882] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 13:55:23,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1286692101] [2022-07-14 13:55:23,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:55:23,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 13:55:23,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 13:55:23,426 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) [2022-07-14 13:55:23,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-14 13:55:23,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:55:23,497 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-14 13:55:23,499 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 13:55:23,569 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 46 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-14 13:55:23,570 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 13:55:23,682 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 46 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-14 13:55:23,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1286692101] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 13:55:23,682 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 13:55:23,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 5] total 8 [2022-07-14 13:55:23,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581057739] [2022-07-14 13:55:23,685 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 13:55:23,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 13:55:23,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:55:23,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 13:55:23,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-07-14 13:55:23,687 INFO L87 Difference]: Start difference. First operand 229 states and 284 transitions. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 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) [2022-07-14 13:55:24,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:55:24,122 INFO L93 Difference]: Finished difference Result 881 states and 1107 transitions. [2022-07-14 13:55:24,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-14 13:55:24,122 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 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 [2022-07-14 13:55:24,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:55:24,125 INFO L225 Difference]: With dead ends: 881 [2022-07-14 13:55:24,125 INFO L226 Difference]: Without dead ends: 669 [2022-07-14 13:55:24,125 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 145 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2022-07-14 13:55:24,126 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 594 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 594 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 13:55:24,126 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [594 Valid, 334 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-14 13:55:24,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2022-07-14 13:55:24,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 558. [2022-07-14 13:55:24,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 558 states, 556 states have (on average 1.2482014388489209) internal successors, (694), 557 states have internal predecessors, (694), 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) [2022-07-14 13:55:24,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 694 transitions. [2022-07-14 13:55:24,144 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 694 transitions. Word has length 72 [2022-07-14 13:55:24,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:55:24,145 INFO L495 AbstractCegarLoop]: Abstraction has 558 states and 694 transitions. [2022-07-14 13:55:24,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 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) [2022-07-14 13:55:24,146 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 694 transitions. [2022-07-14 13:55:24,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-07-14 13:55:24,147 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:55:24,147 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] [2022-07-14 13:55:24,172 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-07-14 13:55:24,363 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,SelfDestructingSolverStorable11 [2022-07-14 13:55:24,364 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2022-07-14 13:55:24,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:55:24,364 INFO L85 PathProgramCache]: Analyzing trace with hash -396853383, now seen corresponding path program 1 times [2022-07-14 13:55:24,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:55:24,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378792819] [2022-07-14 13:55:24,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:55:24,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:55:24,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:55:24,448 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-14 13:55:24,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:55:24,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378792819] [2022-07-14 13:55:24,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378792819] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 13:55:24,449 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 13:55:24,449 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 13:55:24,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684298946] [2022-07-14 13:55:24,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 13:55:24,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 13:55:24,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:55:24,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 13:55:24,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-14 13:55:24,452 INFO L87 Difference]: Start difference. First operand 558 states and 694 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 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) [2022-07-14 13:55:24,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:55:24,711 INFO L93 Difference]: Finished difference Result 1563 states and 1934 transitions. [2022-07-14 13:55:24,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-14 13:55:24,711 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 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 72 [2022-07-14 13:55:24,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:55:24,714 INFO L225 Difference]: With dead ends: 1563 [2022-07-14 13:55:24,715 INFO L226 Difference]: Without dead ends: 893 [2022-07-14 13:55:24,716 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-07-14 13:55:24,716 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 250 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 13:55:24,717 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 242 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 13:55:24,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 893 states. [2022-07-14 13:55:24,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 893 to 698. [2022-07-14 13:55:24,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 698 states, 696 states have (on average 1.2543103448275863) internal successors, (873), 697 states have internal predecessors, (873), 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) [2022-07-14 13:55:24,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 873 transitions. [2022-07-14 13:55:24,737 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 873 transitions. Word has length 72 [2022-07-14 13:55:24,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:55:24,737 INFO L495 AbstractCegarLoop]: Abstraction has 698 states and 873 transitions. [2022-07-14 13:55:24,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 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) [2022-07-14 13:55:24,738 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 873 transitions. [2022-07-14 13:55:24,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-07-14 13:55:24,739 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:55:24,739 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] [2022-07-14 13:55:24,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-14 13:55:24,739 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2022-07-14 13:55:24,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:55:24,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1539052754, now seen corresponding path program 1 times [2022-07-14 13:55:24,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:55:24,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503814801] [2022-07-14 13:55:24,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:55:24,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:55:24,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:55:24,785 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-07-14 13:55:24,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:55:24,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503814801] [2022-07-14 13:55:24,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503814801] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 13:55:24,785 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 13:55:24,785 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 13:55:24,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579281196] [2022-07-14 13:55:24,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 13:55:24,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 13:55:24,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:55:24,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 13:55:24,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 13:55:24,787 INFO L87 Difference]: Start difference. First operand 698 states and 873 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 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) [2022-07-14 13:55:24,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:55:24,820 INFO L93 Difference]: Finished difference Result 1369 states and 1716 transitions. [2022-07-14 13:55:24,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 13:55:24,820 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 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 76 [2022-07-14 13:55:24,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:55:24,822 INFO L225 Difference]: With dead ends: 1369 [2022-07-14 13:55:24,822 INFO L226 Difference]: Without dead ends: 698 [2022-07-14 13:55:24,823 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 [2022-07-14 13:55:24,824 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 3 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 13:55:24,824 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 154 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 13:55:24,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2022-07-14 13:55:24,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 698. [2022-07-14 13:55:24,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 698 states, 696 states have (on average 1.2227011494252873) internal successors, (851), 697 states have internal predecessors, (851), 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) [2022-07-14 13:55:24,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 851 transitions. [2022-07-14 13:55:24,841 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 851 transitions. Word has length 76 [2022-07-14 13:55:24,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:55:24,841 INFO L495 AbstractCegarLoop]: Abstraction has 698 states and 851 transitions. [2022-07-14 13:55:24,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 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) [2022-07-14 13:55:24,842 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 851 transitions. [2022-07-14 13:55:24,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-07-14 13:55:24,843 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:55:24,843 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] [2022-07-14 13:55:24,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-14 13:55:24,843 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2022-07-14 13:55:24,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:55:24,843 INFO L85 PathProgramCache]: Analyzing trace with hash 874817083, now seen corresponding path program 1 times [2022-07-14 13:55:24,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:55:24,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388749032] [2022-07-14 13:55:24,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:55:24,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:55:24,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:55:24,870 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-07-14 13:55:24,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:55:24,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388749032] [2022-07-14 13:55:24,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388749032] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 13:55:24,870 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 13:55:24,870 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 13:55:24,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659486298] [2022-07-14 13:55:24,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 13:55:24,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 13:55:24,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:55:24,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 13:55:24,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 13:55:24,872 INFO L87 Difference]: Start difference. First operand 698 states and 851 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 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) [2022-07-14 13:55:24,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:55:24,912 INFO L93 Difference]: Finished difference Result 1518 states and 1858 transitions. [2022-07-14 13:55:24,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 13:55:24,913 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 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 79 [2022-07-14 13:55:24,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:55:24,915 INFO L225 Difference]: With dead ends: 1518 [2022-07-14 13:55:24,916 INFO L226 Difference]: Without dead ends: 759 [2022-07-14 13:55:24,917 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 [2022-07-14 13:55:24,917 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 43 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 13:55:24,917 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 158 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 13:55:24,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 759 states. [2022-07-14 13:55:24,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 759 to 577. [2022-07-14 13:55:24,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 577 states, 575 states have (on average 1.24) internal successors, (713), 576 states have internal predecessors, (713), 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) [2022-07-14 13:55:24,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 713 transitions. [2022-07-14 13:55:24,952 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 713 transitions. Word has length 79 [2022-07-14 13:55:24,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:55:24,952 INFO L495 AbstractCegarLoop]: Abstraction has 577 states and 713 transitions. [2022-07-14 13:55:24,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 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) [2022-07-14 13:55:24,953 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 713 transitions. [2022-07-14 13:55:24,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-07-14 13:55:24,954 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:55:24,954 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] [2022-07-14 13:55:24,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-14 13:55:24,954 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2022-07-14 13:55:24,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:55:24,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1068642915, now seen corresponding path program 1 times [2022-07-14 13:55:24,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:55:24,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055574326] [2022-07-14 13:55:24,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:55:24,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:55:24,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:55:25,022 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-07-14 13:55:25,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:55:25,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055574326] [2022-07-14 13:55:25,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055574326] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 13:55:25,023 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 13:55:25,023 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 13:55:25,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629531700] [2022-07-14 13:55:25,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 13:55:25,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 13:55:25,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:55:25,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 13:55:25,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 13:55:25,025 INFO L87 Difference]: Start difference. First operand 577 states and 713 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) [2022-07-14 13:55:25,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:55:25,313 INFO L93 Difference]: Finished difference Result 1838 states and 2262 transitions. [2022-07-14 13:55:25,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 13:55:25,314 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 80 [2022-07-14 13:55:25,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:55:25,319 INFO L225 Difference]: With dead ends: 1838 [2022-07-14 13:55:25,319 INFO L226 Difference]: Without dead ends: 1713 [2022-07-14 13:55:25,320 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-14 13:55:25,321 INFO L413 NwaCegarLoop]: 167 mSDtfsCounter, 215 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 13:55:25,321 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 481 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 13:55:25,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1713 states. [2022-07-14 13:55:25,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1713 to 577. [2022-07-14 13:55:25,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 577 states, 575 states have (on average 1.24) internal successors, (713), 576 states have internal predecessors, (713), 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) [2022-07-14 13:55:25,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 713 transitions. [2022-07-14 13:55:25,348 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 713 transitions. Word has length 80 [2022-07-14 13:55:25,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:55:25,348 INFO L495 AbstractCegarLoop]: Abstraction has 577 states and 713 transitions. [2022-07-14 13:55:25,348 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) [2022-07-14 13:55:25,348 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 713 transitions. [2022-07-14 13:55:25,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-07-14 13:55:25,349 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:55:25,349 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] [2022-07-14 13:55:25,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-14 13:55:25,350 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2022-07-14 13:55:25,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:55:25,350 INFO L85 PathProgramCache]: Analyzing trace with hash 337763349, now seen corresponding path program 1 times [2022-07-14 13:55:25,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:55:25,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582010252] [2022-07-14 13:55:25,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:55:25,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:55:25,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:55:25,447 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-07-14 13:55:25,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:55:25,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582010252] [2022-07-14 13:55:25,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582010252] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 13:55:25,448 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 13:55:25,448 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 13:55:25,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481662201] [2022-07-14 13:55:25,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 13:55:25,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 13:55:25,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:55:25,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 13:55:25,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 13:55:25,450 INFO L87 Difference]: Start difference. First operand 577 states and 713 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) [2022-07-14 13:55:25,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:55:25,837 INFO L93 Difference]: Finished difference Result 2411 states and 2968 transitions. [2022-07-14 13:55:25,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-14 13:55:25,838 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 83 [2022-07-14 13:55:25,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:55:25,845 INFO L225 Difference]: With dead ends: 2411 [2022-07-14 13:55:25,846 INFO L226 Difference]: Without dead ends: 2286 [2022-07-14 13:55:25,847 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-07-14 13:55:25,847 INFO L413 NwaCegarLoop]: 176 mSDtfsCounter, 322 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 683 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 13:55:25,848 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 683 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-14 13:55:25,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2286 states. [2022-07-14 13:55:25,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2286 to 577. [2022-07-14 13:55:25,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 577 states, 575 states have (on average 1.24) internal successors, (713), 576 states have internal predecessors, (713), 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) [2022-07-14 13:55:25,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 713 transitions. [2022-07-14 13:55:25,879 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 713 transitions. Word has length 83 [2022-07-14 13:55:25,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:55:25,880 INFO L495 AbstractCegarLoop]: Abstraction has 577 states and 713 transitions. [2022-07-14 13:55:25,880 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) [2022-07-14 13:55:25,880 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 713 transitions. [2022-07-14 13:55:25,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-07-14 13:55:25,881 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:55:25,881 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] [2022-07-14 13:55:25,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-14 13:55:25,882 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2022-07-14 13:55:25,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:55:25,882 INFO L85 PathProgramCache]: Analyzing trace with hash -465341916, now seen corresponding path program 1 times [2022-07-14 13:55:25,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:55:25,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798364872] [2022-07-14 13:55:25,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:55:25,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:55:25,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:55:25,974 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 49 proven. 5 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-07-14 13:55:25,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:55:25,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798364872] [2022-07-14 13:55:25,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798364872] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 13:55:25,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [957755782] [2022-07-14 13:55:25,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:55:25,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 13:55:25,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 13:55:25,976 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) [2022-07-14 13:55:25,978 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-14 13:55:26,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:55:26,083 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-14 13:55:26,085 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 13:55:26,200 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 49 proven. 3 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-07-14 13:55:26,200 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 13:55:26,322 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 51 proven. 3 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-07-14 13:55:26,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [957755782] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 13:55:26,322 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 13:55:26,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 11 [2022-07-14 13:55:26,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130537406] [2022-07-14 13:55:26,323 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 13:55:26,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-14 13:55:26,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:55:26,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-14 13:55:26,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-07-14 13:55:26,324 INFO L87 Difference]: Start difference. First operand 577 states and 713 transitions. Second operand has 11 states, 11 states have (on average 11.0) internal successors, (121), 11 states have internal predecessors, (121), 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) [2022-07-14 13:55:26,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:55:26,557 INFO L93 Difference]: Finished difference Result 1230 states and 1572 transitions. [2022-07-14 13:55:26,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-14 13:55:26,558 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 11.0) internal successors, (121), 11 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2022-07-14 13:55:26,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:55:26,560 INFO L225 Difference]: With dead ends: 1230 [2022-07-14 13:55:26,560 INFO L226 Difference]: Without dead ends: 623 [2022-07-14 13:55:26,562 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 159 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2022-07-14 13:55:26,563 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 325 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 13:55:26,563 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [325 Valid, 220 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 13:55:26,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2022-07-14 13:55:26,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 547. [2022-07-14 13:55:26,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 545 states have (on average 1.2513761467889908) internal successors, (682), 546 states have internal predecessors, (682), 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) [2022-07-14 13:55:26,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 682 transitions. [2022-07-14 13:55:26,582 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 682 transitions. Word has length 83 [2022-07-14 13:55:26,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:55:26,583 INFO L495 AbstractCegarLoop]: Abstraction has 547 states and 682 transitions. [2022-07-14 13:55:26,583 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.0) internal successors, (121), 11 states have internal predecessors, (121), 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) [2022-07-14 13:55:26,583 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 682 transitions. [2022-07-14 13:55:26,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-07-14 13:55:26,584 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:55:26,584 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] [2022-07-14 13:55:26,607 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-14 13:55:26,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-07-14 13:55:26,804 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2022-07-14 13:55:26,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:55:26,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1378493424, now seen corresponding path program 1 times [2022-07-14 13:55:26,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:55:26,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684566256] [2022-07-14 13:55:26,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:55:26,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:55:26,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:55:26,913 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 51 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-07-14 13:55:26,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:55:26,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684566256] [2022-07-14 13:55:26,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684566256] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 13:55:26,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2142926988] [2022-07-14 13:55:26,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:55:26,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 13:55:26,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 13:55:26,916 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) [2022-07-14 13:55:26,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-14 13:55:27,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:55:27,050 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-14 13:55:27,052 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 13:55:27,167 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-07-14 13:55:27,168 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 13:55:27,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2142926988] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 13:55:27,168 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-14 13:55:27,168 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2022-07-14 13:55:27,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052493696] [2022-07-14 13:55:27,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 13:55:27,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 13:55:27,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:55:27,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 13:55:27,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-14 13:55:27,170 INFO L87 Difference]: Start difference. First operand 547 states and 682 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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) [2022-07-14 13:55:27,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:55:27,304 INFO L93 Difference]: Finished difference Result 1262 states and 1567 transitions. [2022-07-14 13:55:27,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 13:55:27,305 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2022-07-14 13:55:27,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:55:27,308 INFO L225 Difference]: With dead ends: 1262 [2022-07-14 13:55:27,309 INFO L226 Difference]: Without dead ends: 948 [2022-07-14 13:55:27,310 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 82 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-14 13:55:27,310 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 64 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 13:55:27,311 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 217 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 13:55:27,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 948 states. [2022-07-14 13:55:27,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 948 to 928. [2022-07-14 13:55:27,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 928 states, 926 states have (on average 1.2505399568034556) internal successors, (1158), 927 states have internal predecessors, (1158), 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) [2022-07-14 13:55:27,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 928 states to 928 states and 1158 transitions. [2022-07-14 13:55:27,349 INFO L78 Accepts]: Start accepts. Automaton has 928 states and 1158 transitions. Word has length 83 [2022-07-14 13:55:27,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:55:27,349 INFO L495 AbstractCegarLoop]: Abstraction has 928 states and 1158 transitions. [2022-07-14 13:55:27,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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) [2022-07-14 13:55:27,349 INFO L276 IsEmpty]: Start isEmpty. Operand 928 states and 1158 transitions. [2022-07-14 13:55:27,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-07-14 13:55:27,350 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:55:27,351 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] [2022-07-14 13:55:27,377 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-14 13:55:27,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 13:55:27,567 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2022-07-14 13:55:27,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:55:27,568 INFO L85 PathProgramCache]: Analyzing trace with hash -403663599, now seen corresponding path program 1 times [2022-07-14 13:55:27,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:55:27,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389270626] [2022-07-14 13:55:27,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:55:27,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:55:27,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:55:27,645 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-07-14 13:55:27,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:55:27,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389270626] [2022-07-14 13:55:27,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389270626] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 13:55:27,646 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 13:55:27,646 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-14 13:55:27,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153705836] [2022-07-14 13:55:27,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 13:55:27,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 13:55:27,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:55:27,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 13:55:27,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-14 13:55:27,648 INFO L87 Difference]: Start difference. First operand 928 states and 1158 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) [2022-07-14 13:55:28,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:55:28,119 INFO L93 Difference]: Finished difference Result 2195 states and 2718 transitions. [2022-07-14 13:55:28,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-14 13:55:28,120 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 85 [2022-07-14 13:55:28,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:55:28,127 INFO L225 Difference]: With dead ends: 2195 [2022-07-14 13:55:28,127 INFO L226 Difference]: Without dead ends: 2052 [2022-07-14 13:55:28,128 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-07-14 13:55:28,129 INFO L413 NwaCegarLoop]: 201 mSDtfsCounter, 399 mSDsluCounter, 738 mSDsCounter, 0 mSdLazyCounter, 440 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 939 SdHoareTripleChecker+Invalid, 447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-14 13:55:28,129 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [399 Valid, 939 Invalid, 447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 440 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-14 13:55:28,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2052 states. [2022-07-14 13:55:28,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2052 to 924. [2022-07-14 13:55:28,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 924 states, 922 states have (on average 1.2516268980477223) internal successors, (1154), 923 states have internal predecessors, (1154), 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) [2022-07-14 13:55:28,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 924 states to 924 states and 1154 transitions. [2022-07-14 13:55:28,196 INFO L78 Accepts]: Start accepts. Automaton has 924 states and 1154 transitions. Word has length 85 [2022-07-14 13:55:28,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:55:28,196 INFO L495 AbstractCegarLoop]: Abstraction has 924 states and 1154 transitions. [2022-07-14 13:55:28,196 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) [2022-07-14 13:55:28,196 INFO L276 IsEmpty]: Start isEmpty. Operand 924 states and 1154 transitions. [2022-07-14 13:55:28,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-07-14 13:55:28,197 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:55:28,198 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] [2022-07-14 13:55:28,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-14 13:55:28,200 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2022-07-14 13:55:28,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:55:28,201 INFO L85 PathProgramCache]: Analyzing trace with hash -1971534415, now seen corresponding path program 1 times [2022-07-14 13:55:28,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:55:28,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476888656] [2022-07-14 13:55:28,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:55:28,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:55:28,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:55:28,310 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 51 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-07-14 13:55:28,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:55:28,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476888656] [2022-07-14 13:55:28,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476888656] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 13:55:28,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1762242692] [2022-07-14 13:55:28,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:55:28,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 13:55:28,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 13:55:28,313 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) [2022-07-14 13:55:28,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-14 13:55:28,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:55:28,542 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-14 13:55:28,543 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 13:55:28,802 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-07-14 13:55:28,802 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 13:55:28,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1762242692] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 13:55:28,803 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-14 13:55:28,803 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2022-07-14 13:55:28,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334978692] [2022-07-14 13:55:28,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 13:55:28,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 13:55:28,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:55:28,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 13:55:28,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-07-14 13:55:28,804 INFO L87 Difference]: Start difference. First operand 924 states and 1154 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 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) [2022-07-14 13:55:28,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:55:28,929 INFO L93 Difference]: Finished difference Result 1647 states and 2046 transitions. [2022-07-14 13:55:28,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 13:55:28,930 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2022-07-14 13:55:28,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:55:28,933 INFO L225 Difference]: With dead ends: 1647 [2022-07-14 13:55:28,933 INFO L226 Difference]: Without dead ends: 1331 [2022-07-14 13:55:28,934 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 84 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-07-14 13:55:28,935 INFO L413 NwaCegarLoop]: 161 mSDtfsCounter, 126 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 13:55:28,935 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 378 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 13:55:28,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1331 states. [2022-07-14 13:55:28,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1331 to 924. [2022-07-14 13:55:28,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 924 states, 922 states have (on average 1.2516268980477223) internal successors, (1154), 923 states have internal predecessors, (1154), 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) [2022-07-14 13:55:28,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 924 states to 924 states and 1154 transitions. [2022-07-14 13:55:28,984 INFO L78 Accepts]: Start accepts. Automaton has 924 states and 1154 transitions. Word has length 86 [2022-07-14 13:55:28,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:55:28,984 INFO L495 AbstractCegarLoop]: Abstraction has 924 states and 1154 transitions. [2022-07-14 13:55:28,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 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) [2022-07-14 13:55:28,984 INFO L276 IsEmpty]: Start isEmpty. Operand 924 states and 1154 transitions. [2022-07-14 13:55:28,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-07-14 13:55:28,985 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:55:28,985 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] [2022-07-14 13:55:29,012 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-14 13:55:29,199 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,SelfDestructingSolverStorable20 [2022-07-14 13:55:29,199 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2022-07-14 13:55:29,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:55:29,200 INFO L85 PathProgramCache]: Analyzing trace with hash -723590685, now seen corresponding path program 1 times [2022-07-14 13:55:29,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:55:29,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080376341] [2022-07-14 13:55:29,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:55:29,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:55:29,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:55:29,313 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 51 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-07-14 13:55:29,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:55:29,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080376341] [2022-07-14 13:55:29,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080376341] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 13:55:29,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2084252216] [2022-07-14 13:55:29,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:55:29,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 13:55:29,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 13:55:29,320 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) [2022-07-14 13:55:29,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-14 13:55:29,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:55:29,486 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-14 13:55:29,488 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 13:55:29,707 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 44 proven. 28 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-14 13:55:29,708 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 13:55:29,975 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-14 13:55:29,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2084252216] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 13:55:29,975 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 13:55:29,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 20 [2022-07-14 13:55:29,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356664314] [2022-07-14 13:55:29,975 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 13:55:29,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-14 13:55:29,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:55:29,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-14 13:55:29,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2022-07-14 13:55:29,977 INFO L87 Difference]: Start difference. First operand 924 states and 1154 transitions. Second operand has 20 states, 20 states have (on average 11.55) internal successors, (231), 20 states have internal predecessors, (231), 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) [2022-07-14 13:55:33,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:55:33,868 INFO L93 Difference]: Finished difference Result 3645 states and 4349 transitions. [2022-07-14 13:55:33,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2022-07-14 13:55:33,869 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 11.55) internal successors, (231), 20 states have internal predecessors, (231), 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 [2022-07-14 13:55:33,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:55:33,872 INFO L225 Difference]: With dead ends: 3645 [2022-07-14 13:55:33,872 INFO L226 Difference]: Without dead ends: 1333 [2022-07-14 13:55:33,882 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 166 SyntacticMatches, 2 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3162 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1735, Invalid=8567, Unknown=0, NotChecked=0, Total=10302 [2022-07-14 13:55:33,883 INFO L413 NwaCegarLoop]: 283 mSDtfsCounter, 1988 mSDsluCounter, 1761 mSDsCounter, 0 mSdLazyCounter, 3168 mSolverCounterSat, 273 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1988 SdHoareTripleChecker+Valid, 2044 SdHoareTripleChecker+Invalid, 3441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 273 IncrementalHoareTripleChecker+Valid, 3168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-07-14 13:55:33,883 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1988 Valid, 2044 Invalid, 3441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [273 Valid, 3168 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-07-14 13:55:33,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1333 states. [2022-07-14 13:55:33,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1333 to 453. [2022-07-14 13:55:33,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 452 states have (on average 1.2256637168141593) internal successors, (554), 452 states have internal predecessors, (554), 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) [2022-07-14 13:55:33,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 554 transitions. [2022-07-14 13:55:33,918 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 554 transitions. Word has length 89 [2022-07-14 13:55:33,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:55:33,918 INFO L495 AbstractCegarLoop]: Abstraction has 453 states and 554 transitions. [2022-07-14 13:55:33,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 11.55) internal successors, (231), 20 states have internal predecessors, (231), 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) [2022-07-14 13:55:33,919 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 554 transitions. [2022-07-14 13:55:33,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-07-14 13:55:33,920 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:55:33,920 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 13:55:33,939 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-14 13:55:34,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 13:55:34,127 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2022-07-14 13:55:34,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:55:34,128 INFO L85 PathProgramCache]: Analyzing trace with hash 808824074, now seen corresponding path program 1 times [2022-07-14 13:55:34,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:55:34,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287108461] [2022-07-14 13:55:34,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:55:34,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:55:34,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 13:55:34,163 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 13:55:34,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 13:55:34,215 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 13:55:34,216 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-14 13:55:34,216 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 40 remaining) [2022-07-14 13:55:34,218 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 40 remaining) [2022-07-14 13:55:34,218 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 40 remaining) [2022-07-14 13:55:34,218 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 40 remaining) [2022-07-14 13:55:34,219 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 40 remaining) [2022-07-14 13:55:34,219 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 40 remaining) [2022-07-14 13:55:34,219 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 40 remaining) [2022-07-14 13:55:34,219 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 40 remaining) [2022-07-14 13:55:34,219 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 40 remaining) [2022-07-14 13:55:34,219 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 40 remaining) [2022-07-14 13:55:34,220 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 40 remaining) [2022-07-14 13:55:34,220 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 40 remaining) [2022-07-14 13:55:34,220 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 40 remaining) [2022-07-14 13:55:34,220 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 40 remaining) [2022-07-14 13:55:34,220 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 40 remaining) [2022-07-14 13:55:34,221 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 40 remaining) [2022-07-14 13:55:34,221 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 40 remaining) [2022-07-14 13:55:34,221 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 40 remaining) [2022-07-14 13:55:34,221 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 40 remaining) [2022-07-14 13:55:34,221 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 40 remaining) [2022-07-14 13:55:34,221 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 40 remaining) [2022-07-14 13:55:34,222 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 40 remaining) [2022-07-14 13:55:34,222 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 40 remaining) [2022-07-14 13:55:34,222 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 40 remaining) [2022-07-14 13:55:34,222 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 40 remaining) [2022-07-14 13:55:34,222 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 40 remaining) [2022-07-14 13:55:34,223 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 40 remaining) [2022-07-14 13:55:34,223 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 40 remaining) [2022-07-14 13:55:34,223 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 40 remaining) [2022-07-14 13:55:34,223 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 40 remaining) [2022-07-14 13:55:34,223 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 40 remaining) [2022-07-14 13:55:34,223 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 40 remaining) [2022-07-14 13:55:34,224 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 40 remaining) [2022-07-14 13:55:34,224 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 40 remaining) [2022-07-14 13:55:34,224 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 40 remaining) [2022-07-14 13:55:34,224 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 40 remaining) [2022-07-14 13:55:34,224 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 40 remaining) [2022-07-14 13:55:34,224 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 40 remaining) [2022-07-14 13:55:34,225 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 40 remaining) [2022-07-14 13:55:34,225 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 40 remaining) [2022-07-14 13:55:34,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-14 13:55:34,229 INFO L356 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] [2022-07-14 13:55:34,233 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-14 13:55:34,313 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.07 01:55:34 BoogieIcfgContainer [2022-07-14 13:55:34,314 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-14 13:55:34,314 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-14 13:55:34,314 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-14 13:55:34,314 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-14 13:55:34,315 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 01:55:18" (3/4) ... [2022-07-14 13:55:34,316 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-14 13:55:34,415 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-14 13:55:34,415 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-14 13:55:34,416 INFO L158 Benchmark]: Toolchain (without parser) took 16636.15ms. Allocated memory was 100.7MB in the beginning and 226.5MB in the end (delta: 125.8MB). Free memory was 74.2MB in the beginning and 194.5MB in the end (delta: -120.3MB). Peak memory consumption was 74.4MB. Max. memory is 16.1GB. [2022-07-14 13:55:34,416 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 81.8MB. Free memory was 52.2MB in the beginning and 52.1MB in the end (delta: 44.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-14 13:55:34,420 INFO L158 Benchmark]: CACSL2BoogieTranslator took 277.53ms. Allocated memory is still 100.7MB. Free memory was 74.0MB in the beginning and 62.1MB in the end (delta: 11.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-14 13:55:34,420 INFO L158 Benchmark]: Boogie Procedure Inliner took 74.15ms. Allocated memory is still 100.7MB. Free memory was 62.0MB in the beginning and 53.6MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-14 13:55:34,420 INFO L158 Benchmark]: Boogie Preprocessor took 53.79ms. Allocated memory is still 100.7MB. Free memory was 53.6MB in the beginning and 49.0MB in the end (delta: 4.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-14 13:55:34,420 INFO L158 Benchmark]: RCFGBuilder took 701.79ms. Allocated memory is still 100.7MB. Free memory was 49.0MB in the beginning and 55.5MB in the end (delta: -6.5MB). Peak memory consumption was 23.3MB. Max. memory is 16.1GB. [2022-07-14 13:55:34,421 INFO L158 Benchmark]: TraceAbstraction took 15420.77ms. Allocated memory was 100.7MB in the beginning and 226.5MB in the end (delta: 125.8MB). Free memory was 55.1MB in the beginning and 138.2MB in the end (delta: -83.2MB). Peak memory consumption was 44.3MB. Max. memory is 16.1GB. [2022-07-14 13:55:34,421 INFO L158 Benchmark]: Witness Printer took 101.34ms. Allocated memory is still 226.5MB. Free memory was 138.2MB in the beginning and 194.5MB in the end (delta: -56.2MB). Peak memory consumption was 8.8MB. Max. memory is 16.1GB. [2022-07-14 13:55:34,423 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.24ms. Allocated memory is still 81.8MB. Free memory was 52.2MB in the beginning and 52.1MB in the end (delta: 44.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 277.53ms. Allocated memory is still 100.7MB. Free memory was 74.0MB in the beginning and 62.1MB in the end (delta: 11.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 74.15ms. Allocated memory is still 100.7MB. Free memory was 62.0MB in the beginning and 53.6MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 53.79ms. Allocated memory is still 100.7MB. Free memory was 53.6MB in the beginning and 49.0MB in the end (delta: 4.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 701.79ms. Allocated memory is still 100.7MB. Free memory was 49.0MB in the beginning and 55.5MB in the end (delta: -6.5MB). Peak memory consumption was 23.3MB. Max. memory is 16.1GB. * TraceAbstraction took 15420.77ms. Allocated memory was 100.7MB in the beginning and 226.5MB in the end (delta: 125.8MB). Free memory was 55.1MB in the beginning and 138.2MB in the end (delta: -83.2MB). Peak memory consumption was 44.3MB. Max. memory is 16.1GB. * Witness Printer took 101.34ms. Allocated memory is still 226.5MB. Free memory was 138.2MB in the beginning and 194.5MB in the end (delta: -56.2MB). Peak memory consumption was 8.8MB. 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] b = __VERIFIER_nondet_uint() [L128] a = 234770789 [L130] 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)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, na=4] [L59] COND FALSE !(a3 == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, na=4] [L68] nb = (unsigned char)4 VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, na=4, nb=4] [L69] COND FALSE !(b3 == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, na=4, nb=4] [L78] carry = (unsigned short)0 [L79] i = (unsigned char)0 VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=0, na=4, 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)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=0, na=4, nb=4, partial_sum=0] [L83] COND TRUE i < na VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=0, na=4, nb=4, partial_sum=0] [L84] COND TRUE i == (unsigned char)0 VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=0, na=4, nb=4, partial_sum=0] [L84] EXPR partial_sum + a0 [L84] partial_sum = partial_sum + a0 VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=0, na=4, nb=4, partial_sum=101] [L85] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=0, na=4, nb=4, partial_sum=101] [L86] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=0, na=4, nb=4, partial_sum=101] [L87] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=0, na=4, nb=4, partial_sum=101] [L89] COND TRUE i < nb VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=0, na=4, nb=4, partial_sum=101] [L90] COND TRUE i == (unsigned char)0 VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=0, na=4, nb=4, partial_sum=101] [L90] EXPR partial_sum + b0 [L90] partial_sum = partial_sum + b0 VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=0, na=4, nb=4, partial_sum=101] [L91] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=0, na=4, nb=4, partial_sum=101] [L92] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=0, na=4, nb=4, partial_sum=101] [L93] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=0, na=4, nb=4, partial_sum=101] [L95] COND FALSE !(partial_sum > ((unsigned char)255)) VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=0, na=4, nb=4, partial_sum=101] [L99] COND TRUE i == (unsigned char)0 [L99] r0 = (unsigned char)partial_sum VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=0, na=4, nb=4, partial_sum=101, r0=101] [L100] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=0, na=4, nb=4, partial_sum=101, r0=101] [L101] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=0, na=4, nb=4, partial_sum=101, r0=101] [L102] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=0, na=4, nb=4, partial_sum=101, r0=101] [L104] EXPR i + (unsigned char)1 [L104] i = i + (unsigned char)1 VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=1, na=4, nb=4, partial_sum=101, r0=101] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=1, na=4, nb=4, partial_sum=0, r0=101] [L83] COND TRUE i < na VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=1, na=4, nb=4, partial_sum=0, r0=101] [L84] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=1, na=4, nb=4, partial_sum=0, r0=101] [L85] COND TRUE i == (unsigned char)1 VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=1, na=4, nb=4, partial_sum=0, r0=101] [L85] EXPR partial_sum + a1 [L85] partial_sum = partial_sum + a1 VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=1, na=4, nb=4, partial_sum=81, r0=101] [L86] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=1, na=4, nb=4, partial_sum=81, r0=101] [L87] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=1, na=4, nb=4, partial_sum=81, r0=101] [L89] COND TRUE i < nb VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=1, na=4, nb=4, partial_sum=81, r0=101] [L90] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=1, na=4, nb=4, partial_sum=81, r0=101] [L91] COND TRUE i == (unsigned char)1 VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=1, na=4, nb=4, partial_sum=81, r0=101] [L91] EXPR partial_sum + b1 [L91] partial_sum = partial_sum + b1 VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=1, na=4, nb=4, partial_sum=81, r0=101] [L92] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=1, na=4, nb=4, partial_sum=81, r0=101] [L93] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=1, na=4, nb=4, partial_sum=81, r0=101] [L95] COND FALSE !(partial_sum > ((unsigned char)255)) VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=1, na=4, nb=4, partial_sum=81, r0=101] [L99] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=1, na=4, nb=4, partial_sum=81, r0=101] [L100] COND TRUE i == (unsigned char)1 [L100] r1 = (unsigned char)partial_sum VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=1, na=4, nb=4, partial_sum=81, r0=101, r1=81] [L101] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=1, na=4, nb=4, partial_sum=81, r0=101, r1=81] [L102] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=1, na=4, nb=4, partial_sum=81, r0=101, r1=81] [L104] EXPR i + (unsigned char)1 [L104] i = i + (unsigned char)1 VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=2, na=4, nb=4, partial_sum=81, r0=101, r1=81] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=2, na=4, nb=4, partial_sum=0, r0=101, r1=81] [L83] COND TRUE i < na VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=2, na=4, nb=4, partial_sum=0, r0=101, r1=81] [L84] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=2, na=4, nb=4, partial_sum=0, r0=101, r1=81] [L85] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=2, na=4, nb=4, partial_sum=0, r0=101, r1=81] [L86] COND TRUE i == (unsigned char)2 VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=2, na=4, nb=4, partial_sum=0, r0=101, r1=81] [L86] EXPR partial_sum + a2 [L86] partial_sum = partial_sum + a2 VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=2, na=4, nb=4, partial_sum=254, r0=101, r1=81] [L87] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=2, na=4, nb=4, partial_sum=254, r0=101, r1=81] [L89] COND TRUE i < nb VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=2, na=4, nb=4, partial_sum=254, r0=101, r1=81] [L90] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=2, na=4, nb=4, partial_sum=254, r0=101, r1=81] [L91] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=2, na=4, nb=4, partial_sum=254, r0=101, r1=81] [L92] COND TRUE i == (unsigned char)2 VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=2, na=4, nb=4, partial_sum=254, r0=101, r1=81] [L92] EXPR partial_sum + b2 [L92] partial_sum = partial_sum + b2 VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=2, na=4, nb=4, partial_sum=254, r0=101, r1=81] [L93] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=2, na=4, nb=4, partial_sum=254, r0=101, r1=81] [L95] COND FALSE !(partial_sum > ((unsigned char)255)) VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=2, na=4, nb=4, partial_sum=254, r0=101, r1=81] [L99] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=2, na=4, nb=4, partial_sum=254, r0=101, r1=81] [L100] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=2, na=4, nb=4, partial_sum=254, r0=101, r1=81] [L101] COND TRUE i == (unsigned char)2 [L101] r2 = (unsigned char)partial_sum VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=2, na=4, nb=4, partial_sum=254, r0=101, r1=81, r2=254] [L102] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=2, na=4, nb=4, partial_sum=254, r0=101, r1=81, r2=254] [L104] EXPR i + (unsigned char)1 [L104] i = i + (unsigned char)1 VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=3, na=4, nb=4, partial_sum=254, r0=101, r1=81, r2=254] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=3, na=4, nb=4, partial_sum=0, r0=101, r1=81, r2=254] [L83] COND TRUE i < na VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=3, na=4, nb=4, partial_sum=0, r0=101, r1=81, r2=254] [L84] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=3, na=4, nb=4, partial_sum=0, r0=101, r1=81, r2=254] [L85] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=3, na=4, nb=4, partial_sum=0, r0=101, r1=81, r2=254] [L86] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=3, na=4, nb=4, partial_sum=0, r0=101, r1=81, r2=254] [L87] COND TRUE i == (unsigned char)3 VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=3, na=4, nb=4, partial_sum=0, r0=101, r1=81, r2=254] [L87] EXPR partial_sum + a3 [L87] partial_sum = partial_sum + a3 VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=3, na=4, nb=4, partial_sum=13, r0=101, r1=81, r2=254] [L89] COND TRUE i < nb VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=3, na=4, nb=4, partial_sum=13, r0=101, r1=81, r2=254] [L90] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=3, na=4, nb=4, partial_sum=13, r0=101, r1=81, r2=254] [L91] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=3, na=4, nb=4, partial_sum=13, r0=101, r1=81, r2=254] [L92] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=3, na=4, nb=4, partial_sum=13, r0=101, r1=81, r2=254] [L93] COND TRUE i == (unsigned char)3 VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=3, na=4, nb=4, partial_sum=13, r0=101, r1=81, r2=254] [L93] EXPR partial_sum + b3 [L93] partial_sum = partial_sum + b3 VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=3, na=4, nb=4, partial_sum=128, r0=101, r1=81, r2=254] [L95] COND FALSE !(partial_sum > ((unsigned char)255)) VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=3, na=4, nb=4, partial_sum=128, r0=101, r1=81, r2=254] [L99] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=3, na=4, nb=4, partial_sum=128, r0=101, r1=81, r2=254] [L100] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=3, na=4, nb=4, partial_sum=128, r0=101, r1=81, r2=254] [L101] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=3, na=4, nb=4, partial_sum=128, r0=101, r1=81, r2=254] [L102] COND TRUE i == (unsigned char)3 [L102] r3 = (unsigned char)partial_sum VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=3, na=4, nb=4, partial_sum=128, r0=101, r1=81, r2=254, r3=128] [L104] EXPR i + (unsigned char)1 [L104] i = i + (unsigned char)1 VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=4, na=4, nb=4, partial_sum=128, r0=101, r1=81, r2=254, r3=128] [L80] COND FALSE !((i < na) || (i < nb) || (carry != (unsigned short)0)) VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=4, na=4, nb=4, partial_sum=128, r0=101, r1=81, r2=254, r3=128] [L107] COND FALSE !(i < (unsigned char)4) VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=4, na=4, nb=4, partial_sum=128, r0=101, r1=81, r2=254, r3=128] [L116] r1 << 8U VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=4, na=4, nb=4, partial_sum=128, r0=101, r1=81, r2=254, r3=128] [L116] r2 << 16U VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=4, na=4, nb=4, partial_sum=128, r0=101, r1=81, r2=254, r3=128] [L116] r3 << 24U VAL [\old(a)=234770789, \old(b)=1929379840, a=234770789, a0=234770789, a1=917073, a2=3582, a3=13, b=1929379840, b0=-2365587456, b1=-9240576, b2=-36096, b3=-141, carry=0, i=4, na=4, nb=4, partial_sum=128, r0=101, r1=81, r2=254, 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. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 128 locations, 40 error locations. Started 1 CEGAR loops. OverallTime: 15.3s, OverallIterations: 23, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5130 SdHoareTripleChecker+Valid, 5.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5130 mSDsluCounter, 8200 SdHoareTripleChecker+Invalid, 4.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5566 mSDsCounter, 540 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6136 IncrementalHoareTripleChecker+Invalid, 6676 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 540 mSolverCounterUnsat, 2634 mSDtfsCounter, 6136 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1141 GetRequests, 913 SyntacticMatches, 22 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3270 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=928occurred in iteration=19, InterpolantAutomatonStates: 202, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 22 MinimizatonAttempts, 6356 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 1970 NumberOfCodeBlocks, 1970 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 2140 ConstructedInterpolants, 0 QuantifiedInterpolants, 9448 SizeOfPredicates, 32 NumberOfNonLiveVariables, 1382 ConjunctsInSsa, 70 ConjunctsInUnsatCore, 35 InterpolantComputations, 18 PerfectInterpolantSequences, 1701/1880 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! [2022-07-14 13:55:34,501 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)