./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 26d01a9c 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-?-26d01a9 [2023-02-18 07:41:07,587 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-18 07:41:07,590 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-18 07:41:07,613 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-18 07:41:07,613 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-18 07:41:07,614 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-18 07:41:07,615 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-18 07:41:07,617 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-18 07:41:07,618 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-18 07:41:07,619 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-18 07:41:07,620 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-18 07:41:07,621 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-18 07:41:07,621 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-18 07:41:07,622 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-18 07:41:07,623 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-18 07:41:07,624 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-18 07:41:07,625 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-18 07:41:07,625 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-18 07:41:07,627 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-18 07:41:07,628 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-18 07:41:07,630 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-18 07:41:07,631 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-18 07:41:07,632 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-18 07:41:07,633 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-18 07:41:07,635 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-18 07:41:07,636 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-18 07:41:07,636 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-18 07:41:07,637 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-18 07:41:07,637 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-18 07:41:07,638 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-18 07:41:07,639 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-18 07:41:07,639 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-18 07:41:07,640 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-18 07:41:07,641 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-18 07:41:07,641 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-18 07:41:07,642 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-18 07:41:07,642 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-18 07:41:07,643 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-18 07:41:07,643 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-18 07:41:07,644 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-18 07:41:07,644 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-18 07:41:07,645 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2023-02-18 07:41:07,663 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-18 07:41:07,664 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-18 07:41:07,664 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-18 07:41:07,664 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-18 07:41:07,665 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-18 07:41:07,665 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-18 07:41:07,666 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-18 07:41:07,666 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-18 07:41:07,666 INFO L138 SettingsManager]: * Use SBE=true [2023-02-18 07:41:07,666 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-18 07:41:07,667 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-18 07:41:07,667 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-18 07:41:07,667 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-18 07:41:07,667 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-18 07:41:07,667 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-18 07:41:07,667 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-18 07:41:07,668 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-18 07:41:07,668 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-18 07:41:07,668 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2023-02-18 07:41:07,668 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-18 07:41:07,668 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-18 07:41:07,669 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-18 07:41:07,669 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-18 07:41:07,669 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-18 07:41:07,669 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-18 07:41:07,669 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-18 07:41:07,670 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 07:41:07,670 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-18 07:41:07,670 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-18 07:41:07,670 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-18 07:41:07,670 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-18 07:41:07,671 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-18 07:41:07,671 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-18 07:41:07,671 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-18 07:41:07,671 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-18 07:41:07,671 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-18 07:41:07,671 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-18 07:41:07,672 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> db53fe9124e215e75c7f288cadf12df33daef67c04c75ea6ca77bc804670a99c [2023-02-18 07:41:07,916 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-18 07:41:07,940 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-18 07:41:07,943 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-18 07:41:07,944 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-18 07:41:07,944 INFO L275 PluginConnector]: CDTParser initialized [2023-02-18 07:41:07,945 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 [2023-02-18 07:41:09,106 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-18 07:41:09,293 INFO L351 CDTParser]: Found 1 translation units. [2023-02-18 07:41:09,294 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add_1-2.i [2023-02-18 07:41:09,302 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/701b28ec5/13ce23381b324c549201e969c37f43a3/FLAG6171cb7cc [2023-02-18 07:41:09,316 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/701b28ec5/13ce23381b324c549201e969c37f43a3 [2023-02-18 07:41:09,318 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-18 07:41:09,319 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-18 07:41:09,321 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-18 07:41:09,321 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-18 07:41:09,324 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-18 07:41:09,324 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 07:41:09" (1/1) ... [2023-02-18 07:41:09,325 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@247d9c53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:41:09, skipping insertion in model container [2023-02-18 07:41:09,325 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 07:41:09" (1/1) ... [2023-02-18 07:41:09,331 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-18 07:41:09,348 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-18 07:41:09,468 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add_1-2.i[1168,1181] [2023-02-18 07:41:09,532 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 07:41:09,548 INFO L203 MainTranslator]: Completed pre-run [2023-02-18 07:41:09,558 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add_1-2.i[1168,1181] [2023-02-18 07:41:09,577 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 07:41:09,588 INFO L208 MainTranslator]: Completed translation [2023-02-18 07:41:09,588 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:41:09 WrapperNode [2023-02-18 07:41:09,589 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-18 07:41:09,590 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-18 07:41:09,590 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-18 07:41:09,590 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-18 07:41:09,595 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:41:09" (1/1) ... [2023-02-18 07:41:09,601 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:41:09" (1/1) ... [2023-02-18 07:41:09,632 INFO L138 Inliner]: procedures = 16, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 182 [2023-02-18 07:41:09,632 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-18 07:41:09,633 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-18 07:41:09,633 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-18 07:41:09,633 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-18 07:41:09,641 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:41:09" (1/1) ... [2023-02-18 07:41:09,642 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:41:09" (1/1) ... [2023-02-18 07:41:09,645 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:41:09" (1/1) ... [2023-02-18 07:41:09,645 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:41:09" (1/1) ... [2023-02-18 07:41:09,654 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:41:09" (1/1) ... [2023-02-18 07:41:09,663 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:41:09" (1/1) ... [2023-02-18 07:41:09,674 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:41:09" (1/1) ... [2023-02-18 07:41:09,676 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:41:09" (1/1) ... [2023-02-18 07:41:09,680 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-18 07:41:09,681 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-18 07:41:09,682 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-18 07:41:09,682 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-18 07:41:09,683 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:41:09" (1/1) ... [2023-02-18 07:41:09,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 07:41:09,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 07:41:09,737 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-18 07:41:09,767 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-18 07:41:09,794 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-18 07:41:09,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-18 07:41:09,796 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-18 07:41:09,797 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-18 07:41:09,861 INFO L235 CfgBuilder]: Building ICFG [2023-02-18 07:41:09,863 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-18 07:41:10,284 INFO L276 CfgBuilder]: Performing block encoding [2023-02-18 07:41:10,300 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-18 07:41:10,300 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2023-02-18 07:41:10,303 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 07:41:10 BoogieIcfgContainer [2023-02-18 07:41:10,303 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-18 07:41:10,309 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-18 07:41:10,309 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-18 07:41:10,312 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-18 07:41:10,313 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.02 07:41:09" (1/3) ... [2023-02-18 07:41:10,313 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19538f04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 07:41:10, skipping insertion in model container [2023-02-18 07:41:10,314 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:41:09" (2/3) ... [2023-02-18 07:41:10,317 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19538f04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 07:41:10, skipping insertion in model container [2023-02-18 07:41:10,317 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 07:41:10" (3/3) ... [2023-02-18 07:41:10,319 INFO L112 eAbstractionObserver]: Analyzing ICFG byte_add_1-2.i [2023-02-18 07:41:10,337 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-18 07:41:10,337 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 41 error locations. [2023-02-18 07:41:10,389 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-18 07:41:10,394 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@19d3ab54, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-18 07:41:10,395 INFO L358 AbstractCegarLoop]: Starting to check reachability of 41 error locations. [2023-02-18 07:41:10,398 INFO L276 IsEmpty]: Start isEmpty. Operand has 126 states, 84 states have (on average 1.8928571428571428) internal successors, (159), 125 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 07:41:10,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-02-18 07:41:10,403 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:41:10,403 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-02-18 07:41:10,404 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-02-18 07:41:10,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:41:10,408 INFO L85 PathProgramCache]: Analyzing trace with hash 925604, now seen corresponding path program 1 times [2023-02-18 07:41:10,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 07:41:10,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516587182] [2023-02-18 07:41:10,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:41:10,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 07:41:10,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:41:10,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 07:41:10,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 07:41:10,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516587182] [2023-02-18 07:41:10,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516587182] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 07:41:10,572 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 07:41:10,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-02-18 07:41:10,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976888415] [2023-02-18 07:41:10,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 07:41:10,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-18 07:41:10,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 07:41:10,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-18 07:41:10,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-18 07:41:10,631 INFO L87 Difference]: Start difference. First operand has 126 states, 84 states have (on average 1.8928571428571428) internal successors, (159), 125 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 1 states have (on average 4.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 07:41:10,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:41:10,662 INFO L93 Difference]: Finished difference Result 153 states and 204 transitions. [2023-02-18 07:41:10,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-18 07:41:10,664 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 4.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2023-02-18 07:41:10,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:41:10,671 INFO L225 Difference]: With dead ends: 153 [2023-02-18 07:41:10,672 INFO L226 Difference]: Without dead ends: 76 [2023-02-18 07:41:10,675 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-18 07:41:10,680 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 07:41:10,681 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 07:41:10,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2023-02-18 07:41:10,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2023-02-18 07:41:10,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 75 states have (on average 1.3866666666666667) internal successors, (104), 75 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 07:41:10,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 104 transitions. [2023-02-18 07:41:10,707 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 104 transitions. Word has length 4 [2023-02-18 07:41:10,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:41:10,708 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 104 transitions. [2023-02-18 07:41:10,708 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 4.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 07:41:10,708 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 104 transitions. [2023-02-18 07:41:10,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-18 07:41:10,709 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:41:10,709 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:41:10,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-18 07:41:10,710 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-02-18 07:41:10,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:41:10,711 INFO L85 PathProgramCache]: Analyzing trace with hash -1140047638, now seen corresponding path program 1 times [2023-02-18 07:41:10,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 07:41:10,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101211934] [2023-02-18 07:41:10,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:41:10,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 07:41:10,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:41:10,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 07:41:10,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 07:41:10,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101211934] [2023-02-18 07:41:10,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101211934] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 07:41:10,874 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 07:41:10,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-18 07:41:10,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418950632] [2023-02-18 07:41:10,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 07:41:10,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-18 07:41:10,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 07:41:10,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-18 07:41:10,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-18 07:41:10,878 INFO L87 Difference]: Start difference. First operand 76 states and 104 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 07:41:11,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:41:11,028 INFO L93 Difference]: Finished difference Result 162 states and 235 transitions. [2023-02-18 07:41:11,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-18 07:41:11,029 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2023-02-18 07:41:11,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:41:11,030 INFO L225 Difference]: With dead ends: 162 [2023-02-18 07:41:11,031 INFO L226 Difference]: Without dead ends: 108 [2023-02-18 07:41:11,031 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-18 07:41:11,032 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 35 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 07:41:11,044 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 135 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 07:41:11,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2023-02-18 07:41:11,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 104. [2023-02-18 07:41:11,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 103 states have (on average 1.3398058252427185) internal successors, (138), 103 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 07:41:11,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 138 transitions. [2023-02-18 07:41:11,055 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 138 transitions. Word has length 17 [2023-02-18 07:41:11,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:41:11,055 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 138 transitions. [2023-02-18 07:41:11,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 07:41:11,056 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 138 transitions. [2023-02-18 07:41:11,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-18 07:41:11,060 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:41:11,060 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:41:11,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-18 07:41:11,061 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-02-18 07:41:11,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:41:11,061 INFO L85 PathProgramCache]: Analyzing trace with hash 1047629272, now seen corresponding path program 1 times [2023-02-18 07:41:11,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 07:41:11,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195771464] [2023-02-18 07:41:11,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:41:11,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 07:41:11,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:41:11,216 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-18 07:41:11,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 07:41:11,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195771464] [2023-02-18 07:41:11,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195771464] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 07:41:11,217 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 07:41:11,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-18 07:41:11,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862869846] [2023-02-18 07:41:11,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 07:41:11,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-18 07:41:11,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 07:41:11,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-18 07:41:11,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-18 07:41:11,220 INFO L87 Difference]: Start difference. First operand 104 states and 138 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 07:41:11,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:41:11,379 INFO L93 Difference]: Finished difference Result 251 states and 338 transitions. [2023-02-18 07:41:11,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-18 07:41:11,380 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2023-02-18 07:41:11,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:41:11,386 INFO L225 Difference]: With dead ends: 251 [2023-02-18 07:41:11,387 INFO L226 Difference]: Without dead ends: 184 [2023-02-18 07:41:11,390 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-18 07:41:11,393 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 136 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 07:41:11,394 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 315 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 07:41:11,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2023-02-18 07:41:11,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 114. [2023-02-18 07:41:11,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 113 states have (on average 1.3185840707964602) internal successors, (149), 113 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 07:41:11,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 149 transitions. [2023-02-18 07:41:11,419 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 149 transitions. Word has length 24 [2023-02-18 07:41:11,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:41:11,419 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 149 transitions. [2023-02-18 07:41:11,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 07:41:11,420 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 149 transitions. [2023-02-18 07:41:11,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-18 07:41:11,422 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:41:11,423 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:41:11,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-18 07:41:11,424 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-02-18 07:41:11,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:41:11,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1448694967, now seen corresponding path program 1 times [2023-02-18 07:41:11,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 07:41:11,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683402314] [2023-02-18 07:41:11,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:41:11,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 07:41:11,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:41:11,526 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-18 07:41:11,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 07:41:11,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683402314] [2023-02-18 07:41:11,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683402314] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 07:41:11,527 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 07:41:11,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-18 07:41:11,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565924756] [2023-02-18 07:41:11,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 07:41:11,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-18 07:41:11,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 07:41:11,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-18 07:41:11,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-18 07:41:11,529 INFO L87 Difference]: Start difference. First operand 114 states and 149 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 07:41:11,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:41:11,689 INFO L93 Difference]: Finished difference Result 289 states and 382 transitions. [2023-02-18 07:41:11,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-18 07:41:11,690 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2023-02-18 07:41:11,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:41:11,691 INFO L225 Difference]: With dead ends: 289 [2023-02-18 07:41:11,691 INFO L226 Difference]: Without dead ends: 214 [2023-02-18 07:41:11,692 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-18 07:41:11,693 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 144 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 07:41:11,693 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 325 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 07:41:11,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2023-02-18 07:41:11,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 130. [2023-02-18 07:41:11,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 129 states have (on average 1.302325581395349) internal successors, (168), 129 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 07:41:11,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 168 transitions. [2023-02-18 07:41:11,704 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 168 transitions. Word has length 27 [2023-02-18 07:41:11,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:41:11,704 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 168 transitions. [2023-02-18 07:41:11,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 07:41:11,704 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 168 transitions. [2023-02-18 07:41:11,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-02-18 07:41:11,706 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:41:11,706 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:41:11,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-18 07:41:11,706 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-02-18 07:41:11,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:41:11,707 INFO L85 PathProgramCache]: Analyzing trace with hash -1833052269, now seen corresponding path program 1 times [2023-02-18 07:41:11,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 07:41:11,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146236539] [2023-02-18 07:41:11,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:41:11,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 07:41:11,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:41:11,874 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-18 07:41:11,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 07:41:11,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146236539] [2023-02-18 07:41:11,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146236539] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 07:41:11,875 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 07:41:11,876 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-18 07:41:11,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320985195] [2023-02-18 07:41:11,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 07:41:11,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-18 07:41:11,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 07:41:11,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-18 07:41:11,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-18 07:41:11,879 INFO L87 Difference]: Start difference. First operand 130 states and 168 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 07:41:11,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:41:11,892 INFO L93 Difference]: Finished difference Result 212 states and 276 transitions. [2023-02-18 07:41:11,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-18 07:41:11,893 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2023-02-18 07:41:11,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:41:11,893 INFO L225 Difference]: With dead ends: 212 [2023-02-18 07:41:11,894 INFO L226 Difference]: Without dead ends: 101 [2023-02-18 07:41:11,895 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-18 07:41:11,898 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 91 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 07:41:11,898 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 91 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 07:41:11,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2023-02-18 07:41:11,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2023-02-18 07:41:11,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 100 states have (on average 1.3) internal successors, (130), 100 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 07:41:11,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 130 transitions. [2023-02-18 07:41:11,917 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 130 transitions. Word has length 30 [2023-02-18 07:41:11,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:41:11,918 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 130 transitions. [2023-02-18 07:41:11,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 07:41:11,919 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 130 transitions. [2023-02-18 07:41:11,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-02-18 07:41:11,921 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:41:11,921 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] [2023-02-18 07:41:11,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-18 07:41:11,924 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-02-18 07:41:11,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:41:11,925 INFO L85 PathProgramCache]: Analyzing trace with hash -884064914, now seen corresponding path program 1 times [2023-02-18 07:41:11,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 07:41:11,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154199892] [2023-02-18 07:41:11,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:41:11,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 07:41:11,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:41:12,014 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 07:41:12,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 07:41:12,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154199892] [2023-02-18 07:41:12,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154199892] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 07:41:12,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [313670270] [2023-02-18 07:41:12,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:41:12,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 07:41:12,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 07:41:12,019 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 07:41:12,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-18 07:41:12,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:41:12,093 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-18 07:41:12,098 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 07:41:12,206 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 07:41:12,207 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 07:41:12,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [313670270] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 07:41:12,207 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-18 07:41:12,207 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2023-02-18 07:41:12,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659354283] [2023-02-18 07:41:12,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 07:41:12,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-18 07:41:12,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 07:41:12,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-18 07:41:12,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-02-18 07:41:12,209 INFO L87 Difference]: Start difference. First operand 101 states and 130 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 07:41:12,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:41:12,409 INFO L93 Difference]: Finished difference Result 210 states and 302 transitions. [2023-02-18 07:41:12,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-18 07:41:12,410 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2023-02-18 07:41:12,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:41:12,411 INFO L225 Difference]: With dead ends: 210 [2023-02-18 07:41:12,411 INFO L226 Difference]: Without dead ends: 156 [2023-02-18 07:41:12,412 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-02-18 07:41:12,415 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 54 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-18 07:41:12,415 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 156 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-18 07:41:12,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2023-02-18 07:41:12,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 132. [2023-02-18 07:41:12,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 131 states have (on average 1.2748091603053435) internal successors, (167), 131 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 07:41:12,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 167 transitions. [2023-02-18 07:41:12,424 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 167 transitions. Word has length 36 [2023-02-18 07:41:12,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:41:12,424 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 167 transitions. [2023-02-18 07:41:12,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 07:41:12,425 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 167 transitions. [2023-02-18 07:41:12,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-18 07:41:12,425 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:41:12,426 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, 1, 1, 1, 1] [2023-02-18 07:41:12,438 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-02-18 07:41:12,638 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 [2023-02-18 07:41:12,639 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-02-18 07:41:12,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:41:12,639 INFO L85 PathProgramCache]: Analyzing trace with hash -71033840, now seen corresponding path program 1 times [2023-02-18 07:41:12,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 07:41:12,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060335781] [2023-02-18 07:41:12,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:41:12,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 07:41:12,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:41:12,785 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 07:41:12,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 07:41:12,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060335781] [2023-02-18 07:41:12,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060335781] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 07:41:12,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [69384554] [2023-02-18 07:41:12,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:41:12,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 07:41:12,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 07:41:12,789 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 07:41:12,791 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-18 07:41:12,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:41:12,846 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-18 07:41:12,847 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 07:41:12,909 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-18 07:41:12,909 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 07:41:12,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [69384554] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 07:41:12,912 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-18 07:41:12,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2023-02-18 07:41:12,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605085260] [2023-02-18 07:41:12,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 07:41:12,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-18 07:41:12,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 07:41:12,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-18 07:41:12,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-02-18 07:41:12,914 INFO L87 Difference]: Start difference. First operand 132 states and 167 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 07:41:13,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:41:13,009 INFO L93 Difference]: Finished difference Result 246 states and 325 transitions. [2023-02-18 07:41:13,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-18 07:41:13,009 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 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 43 [2023-02-18 07:41:13,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:41:13,010 INFO L225 Difference]: With dead ends: 246 [2023-02-18 07:41:13,010 INFO L226 Difference]: Without dead ends: 131 [2023-02-18 07:41:13,011 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 40 SyntacticMatches, 5 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-02-18 07:41:13,012 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 111 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 07:41:13,012 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 126 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 07:41:13,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2023-02-18 07:41:13,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 127. [2023-02-18 07:41:13,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 126 states have (on average 1.2619047619047619) internal successors, (159), 126 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 07:41:13,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 159 transitions. [2023-02-18 07:41:13,017 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 159 transitions. Word has length 43 [2023-02-18 07:41:13,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:41:13,017 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 159 transitions. [2023-02-18 07:41:13,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 07:41:13,018 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 159 transitions. [2023-02-18 07:41:13,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-02-18 07:41:13,018 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:41:13,018 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:41:13,027 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-18 07:41:13,224 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 [2023-02-18 07:41:13,225 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-02-18 07:41:13,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:41:13,225 INFO L85 PathProgramCache]: Analyzing trace with hash -1390557187, now seen corresponding path program 1 times [2023-02-18 07:41:13,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 07:41:13,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052910683] [2023-02-18 07:41:13,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:41:13,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 07:41:13,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:41:13,375 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 07:41:13,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 07:41:13,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052910683] [2023-02-18 07:41:13,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052910683] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 07:41:13,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1576251324] [2023-02-18 07:41:13,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:41:13,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 07:41:13,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 07:41:13,378 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 07:41:13,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-18 07:41:13,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:41:13,467 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-18 07:41:13,469 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 07:41:13,529 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-18 07:41:13,529 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 07:41:13,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1576251324] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 07:41:13,530 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-18 07:41:13,530 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 9 [2023-02-18 07:41:13,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99319106] [2023-02-18 07:41:13,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 07:41:13,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-18 07:41:13,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 07:41:13,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-18 07:41:13,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-02-18 07:41:13,532 INFO L87 Difference]: Start difference. First operand 127 states and 159 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 07:41:13,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:41:13,624 INFO L93 Difference]: Finished difference Result 431 states and 550 transitions. [2023-02-18 07:41:13,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-18 07:41:13,625 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 0 states have call successors, (0), 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 52 [2023-02-18 07:41:13,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:41:13,627 INFO L225 Difference]: With dead ends: 431 [2023-02-18 07:41:13,627 INFO L226 Difference]: Without dead ends: 331 [2023-02-18 07:41:13,627 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-02-18 07:41:13,629 INFO L413 NwaCegarLoop]: 166 mSDtfsCounter, 256 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 07:41:13,629 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 408 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 07:41:13,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2023-02-18 07:41:13,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 220. [2023-02-18 07:41:13,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 219 states have (on average 1.2831050228310503) internal successors, (281), 219 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 07:41:13,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 281 transitions. [2023-02-18 07:41:13,637 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 281 transitions. Word has length 52 [2023-02-18 07:41:13,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:41:13,638 INFO L495 AbstractCegarLoop]: Abstraction has 220 states and 281 transitions. [2023-02-18 07:41:13,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 07:41:13,638 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 281 transitions. [2023-02-18 07:41:13,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-02-18 07:41:13,639 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:41:13,639 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:41:13,648 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-18 07:41:13,845 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 [2023-02-18 07:41:13,846 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-02-18 07:41:13,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:41:13,846 INFO L85 PathProgramCache]: Analyzing trace with hash -159608657, now seen corresponding path program 1 times [2023-02-18 07:41:13,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 07:41:13,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199851130] [2023-02-18 07:41:13,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:41:13,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 07:41:13,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:41:14,019 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 07:41:14,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 07:41:14,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199851130] [2023-02-18 07:41:14,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199851130] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 07:41:14,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1476122255] [2023-02-18 07:41:14,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:41:14,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 07:41:14,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 07:41:14,025 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 07:41:14,049 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-18 07:41:14,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:41:14,104 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-18 07:41:14,105 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 07:41:14,157 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-18 07:41:14,157 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 07:41:14,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1476122255] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 07:41:14,157 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-18 07:41:14,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2023-02-18 07:41:14,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735265074] [2023-02-18 07:41:14,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 07:41:14,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-18 07:41:14,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 07:41:14,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-18 07:41:14,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-02-18 07:41:14,160 INFO L87 Difference]: Start difference. First operand 220 states and 281 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 07:41:14,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:41:14,313 INFO L93 Difference]: Finished difference Result 520 states and 711 transitions. [2023-02-18 07:41:14,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-18 07:41:14,314 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2023-02-18 07:41:14,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:41:14,315 INFO L225 Difference]: With dead ends: 520 [2023-02-18 07:41:14,316 INFO L226 Difference]: Without dead ends: 308 [2023-02-18 07:41:14,316 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-02-18 07:41:14,318 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 42 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 07:41:14,318 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 191 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 07:41:14,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2023-02-18 07:41:14,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 264. [2023-02-18 07:41:14,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 263 states have (on average 1.2661596958174905) internal successors, (333), 263 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 07:41:14,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 333 transitions. [2023-02-18 07:41:14,329 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 333 transitions. Word has length 55 [2023-02-18 07:41:14,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:41:14,330 INFO L495 AbstractCegarLoop]: Abstraction has 264 states and 333 transitions. [2023-02-18 07:41:14,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 07:41:14,330 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 333 transitions. [2023-02-18 07:41:14,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-02-18 07:41:14,331 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:41:14,331 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:41:14,342 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-02-18 07:41:14,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 07:41:14,543 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-02-18 07:41:14,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:41:14,543 INFO L85 PathProgramCache]: Analyzing trace with hash -1369018958, now seen corresponding path program 1 times [2023-02-18 07:41:14,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 07:41:14,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832997947] [2023-02-18 07:41:14,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:41:14,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 07:41:14,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:41:14,698 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 07:41:14,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 07:41:14,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832997947] [2023-02-18 07:41:14,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832997947] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 07:41:14,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [645275965] [2023-02-18 07:41:14,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:41:14,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 07:41:14,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 07:41:14,701 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 07:41:14,703 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-18 07:41:14,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:41:14,795 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-18 07:41:14,796 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 07:41:14,852 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-02-18 07:41:14,852 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 07:41:14,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [645275965] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 07:41:14,852 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-18 07:41:14,853 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2023-02-18 07:41:14,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592350112] [2023-02-18 07:41:14,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 07:41:14,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-18 07:41:14,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 07:41:14,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-18 07:41:14,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-02-18 07:41:14,855 INFO L87 Difference]: Start difference. First operand 264 states and 333 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 07:41:15,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:41:15,030 INFO L93 Difference]: Finished difference Result 608 states and 813 transitions. [2023-02-18 07:41:15,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-18 07:41:15,030 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 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 71 [2023-02-18 07:41:15,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:41:15,034 INFO L225 Difference]: With dead ends: 608 [2023-02-18 07:41:15,034 INFO L226 Difference]: Without dead ends: 348 [2023-02-18 07:41:15,035 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 70 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-02-18 07:41:15,035 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 42 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-18 07:41:15,036 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 193 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-18 07:41:15,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2023-02-18 07:41:15,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 308. [2023-02-18 07:41:15,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 307 states have (on average 1.254071661237785) internal successors, (385), 307 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 07:41:15,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 385 transitions. [2023-02-18 07:41:15,047 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 385 transitions. Word has length 71 [2023-02-18 07:41:15,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:41:15,048 INFO L495 AbstractCegarLoop]: Abstraction has 308 states and 385 transitions. [2023-02-18 07:41:15,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 07:41:15,048 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 385 transitions. [2023-02-18 07:41:15,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2023-02-18 07:41:15,049 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:41:15,049 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:41:15,058 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-02-18 07:41:15,258 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,SelfDestructingSolverStorable9 [2023-02-18 07:41:15,259 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-02-18 07:41:15,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:41:15,259 INFO L85 PathProgramCache]: Analyzing trace with hash -2117430847, now seen corresponding path program 1 times [2023-02-18 07:41:15,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 07:41:15,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363350600] [2023-02-18 07:41:15,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:41:15,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 07:41:15,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:41:15,485 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2023-02-18 07:41:15,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 07:41:15,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363350600] [2023-02-18 07:41:15,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363350600] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 07:41:15,486 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 07:41:15,486 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-18 07:41:15,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774573020] [2023-02-18 07:41:15,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 07:41:15,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-18 07:41:15,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 07:41:15,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-18 07:41:15,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-18 07:41:15,488 INFO L87 Difference]: Start difference. First operand 308 states and 385 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 07:41:15,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:41:15,859 INFO L93 Difference]: Finished difference Result 815 states and 1012 transitions. [2023-02-18 07:41:15,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-18 07:41:15,860 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2023-02-18 07:41:15,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:41:15,862 INFO L225 Difference]: With dead ends: 815 [2023-02-18 07:41:15,862 INFO L226 Difference]: Without dead ends: 671 [2023-02-18 07:41:15,863 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-02-18 07:41:15,863 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 343 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 615 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-18 07:41:15,863 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 615 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-18 07:41:15,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2023-02-18 07:41:15,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 308. [2023-02-18 07:41:15,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 307 states have (on average 1.254071661237785) internal successors, (385), 307 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 07:41:15,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 385 transitions. [2023-02-18 07:41:15,878 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 385 transitions. Word has length 87 [2023-02-18 07:41:15,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:41:15,878 INFO L495 AbstractCegarLoop]: Abstraction has 308 states and 385 transitions. [2023-02-18 07:41:15,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 07:41:15,879 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 385 transitions. [2023-02-18 07:41:15,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2023-02-18 07:41:15,880 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:41:15,880 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:41:15,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-02-18 07:41:15,881 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-02-18 07:41:15,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:41:15,881 INFO L85 PathProgramCache]: Analyzing trace with hash 1885697052, now seen corresponding path program 1 times [2023-02-18 07:41:15,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 07:41:15,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652100218] [2023-02-18 07:41:15,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:41:15,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 07:41:15,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:41:16,054 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 51 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-02-18 07:41:16,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 07:41:16,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652100218] [2023-02-18 07:41:16,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652100218] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 07:41:16,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [954437200] [2023-02-18 07:41:16,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:41:16,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 07:41:16,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 07:41:16,061 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 07:41:16,064 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-02-18 07:41:16,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:41:16,120 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-18 07:41:16,122 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 07:41:16,155 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2023-02-18 07:41:16,155 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 07:41:16,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [954437200] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 07:41:16,155 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-18 07:41:16,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2023-02-18 07:41:16,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329401930] [2023-02-18 07:41:16,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 07:41:16,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-18 07:41:16,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 07:41:16,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-18 07:41:16,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-02-18 07:41:16,158 INFO L87 Difference]: Start difference. First operand 308 states and 385 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 07:41:16,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:41:16,263 INFO L93 Difference]: Finished difference Result 606 states and 757 transitions. [2023-02-18 07:41:16,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-18 07:41:16,263 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2023-02-18 07:41:16,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:41:16,266 INFO L225 Difference]: With dead ends: 606 [2023-02-18 07:41:16,266 INFO L226 Difference]: Without dead ends: 462 [2023-02-18 07:41:16,266 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 86 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-02-18 07:41:16,267 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 68 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 07:41:16,268 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 218 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 07:41:16,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2023-02-18 07:41:16,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 445. [2023-02-18 07:41:16,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 444 states have (on average 1.2567567567567568) internal successors, (558), 444 states have internal predecessors, (558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 07:41:16,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 558 transitions. [2023-02-18 07:41:16,283 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 558 transitions. Word has length 87 [2023-02-18 07:41:16,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:41:16,284 INFO L495 AbstractCegarLoop]: Abstraction has 445 states and 558 transitions. [2023-02-18 07:41:16,284 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 07:41:16,285 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 558 transitions. [2023-02-18 07:41:16,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2023-02-18 07:41:16,290 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:41:16,290 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:41:16,299 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-02-18 07:41:16,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 07:41:16,497 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-02-18 07:41:16,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:41:16,497 INFO L85 PathProgramCache]: Analyzing trace with hash -312709955, now seen corresponding path program 1 times [2023-02-18 07:41:16,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 07:41:16,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115777403] [2023-02-18 07:41:16,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:41:16,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 07:41:16,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:41:16,675 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2023-02-18 07:41:16,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 07:41:16,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115777403] [2023-02-18 07:41:16,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115777403] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 07:41:16,676 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 07:41:16,676 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-18 07:41:16,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092067921] [2023-02-18 07:41:16,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 07:41:16,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-18 07:41:16,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 07:41:16,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-18 07:41:16,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-18 07:41:16,678 INFO L87 Difference]: Start difference. First operand 445 states and 558 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 07:41:17,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:41:17,152 INFO L93 Difference]: Finished difference Result 837 states and 1035 transitions. [2023-02-18 07:41:17,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-18 07:41:17,153 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2023-02-18 07:41:17,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:41:17,155 INFO L225 Difference]: With dead ends: 837 [2023-02-18 07:41:17,155 INFO L226 Difference]: Without dead ends: 693 [2023-02-18 07:41:17,156 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2023-02-18 07:41:17,157 INFO L413 NwaCegarLoop]: 198 mSDtfsCounter, 455 mSDsluCounter, 726 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 455 SdHoareTripleChecker+Valid, 924 SdHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-18 07:41:17,157 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [455 Valid, 924 Invalid, 478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 475 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-18 07:41:17,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2023-02-18 07:41:17,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 441. [2023-02-18 07:41:17,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 441 states, 440 states have (on average 1.259090909090909) internal successors, (554), 440 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) [2023-02-18 07:41:17,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 554 transitions. [2023-02-18 07:41:17,175 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 554 transitions. Word has length 89 [2023-02-18 07:41:17,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:41:17,176 INFO L495 AbstractCegarLoop]: Abstraction has 441 states and 554 transitions. [2023-02-18 07:41:17,176 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 07:41:17,176 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 554 transitions. [2023-02-18 07:41:17,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2023-02-18 07:41:17,185 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:41:17,185 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:41:17,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-02-18 07:41:17,186 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-02-18 07:41:17,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:41:17,186 INFO L85 PathProgramCache]: Analyzing trace with hash 387927389, now seen corresponding path program 1 times [2023-02-18 07:41:17,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 07:41:17,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581047025] [2023-02-18 07:41:17,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:41:17,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 07:41:17,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:41:17,360 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 51 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-02-18 07:41:17,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 07:41:17,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581047025] [2023-02-18 07:41:17,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581047025] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 07:41:17,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [630168373] [2023-02-18 07:41:17,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:41:17,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 07:41:17,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 07:41:17,362 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 07:41:17,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-02-18 07:41:17,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:41:17,442 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 13 conjunts are in the unsatisfiable core [2023-02-18 07:41:17,443 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 07:41:17,528 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 51 proven. 4 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-02-18 07:41:17,528 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 07:41:17,689 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 44 proven. 31 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-02-18 07:41:17,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [630168373] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 07:41:17,690 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 07:41:17,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 9] total 17 [2023-02-18 07:41:17,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044778753] [2023-02-18 07:41:17,690 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 07:41:17,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-02-18 07:41:17,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 07:41:17,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-02-18 07:41:17,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272 [2023-02-18 07:41:17,692 INFO L87 Difference]: Start difference. First operand 441 states and 554 transitions. Second operand has 17 states, 17 states have (on average 9.176470588235293) internal successors, (156), 17 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 07:41:19,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:41:19,129 INFO L93 Difference]: Finished difference Result 1868 states and 2517 transitions. [2023-02-18 07:41:19,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-02-18 07:41:19,130 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 9.176470588235293) internal successors, (156), 17 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2023-02-18 07:41:19,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:41:19,135 INFO L225 Difference]: With dead ends: 1868 [2023-02-18 07:41:19,136 INFO L226 Difference]: Without dead ends: 1435 [2023-02-18 07:41:19,137 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 166 SyntacticMatches, 6 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 479 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=586, Invalid=1220, Unknown=0, NotChecked=0, Total=1806 [2023-02-18 07:41:19,137 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 1522 mSDsluCounter, 834 mSDsCounter, 0 mSdLazyCounter, 1043 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1522 SdHoareTripleChecker+Valid, 960 SdHoareTripleChecker+Invalid, 1180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 1043 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-02-18 07:41:19,138 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1522 Valid, 960 Invalid, 1180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 1043 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-02-18 07:41:19,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1435 states. [2023-02-18 07:41:19,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1435 to 1235. [2023-02-18 07:41:19,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1235 states, 1234 states have (on average 1.372771474878444) internal successors, (1694), 1234 states have internal predecessors, (1694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 07:41:19,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1235 states to 1235 states and 1694 transitions. [2023-02-18 07:41:19,182 INFO L78 Accepts]: Start accepts. Automaton has 1235 states and 1694 transitions. Word has length 90 [2023-02-18 07:41:19,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:41:19,182 INFO L495 AbstractCegarLoop]: Abstraction has 1235 states and 1694 transitions. [2023-02-18 07:41:19,182 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 9.176470588235293) internal successors, (156), 17 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 07:41:19,182 INFO L276 IsEmpty]: Start isEmpty. Operand 1235 states and 1694 transitions. [2023-02-18 07:41:19,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2023-02-18 07:41:19,184 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:41:19,184 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:41:19,193 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-02-18 07:41:19,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 07:41:19,393 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-02-18 07:41:19,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:41:19,394 INFO L85 PathProgramCache]: Analyzing trace with hash -910381429, now seen corresponding path program 1 times [2023-02-18 07:41:19,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 07:41:19,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071209647] [2023-02-18 07:41:19,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:41:19,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 07:41:19,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:41:19,673 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 39 proven. 33 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-02-18 07:41:19,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 07:41:19,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071209647] [2023-02-18 07:41:19,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071209647] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 07:41:19,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1856628989] [2023-02-18 07:41:19,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:41:19,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 07:41:19,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 07:41:19,676 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 07:41:19,678 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-02-18 07:41:19,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:41:19,876 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 25 conjunts are in the unsatisfiable core [2023-02-18 07:41:19,878 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 07:41:19,937 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 44 proven. 28 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-02-18 07:41:19,937 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 07:41:20,014 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-02-18 07:41:20,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1856628989] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 07:41:20,014 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 07:41:20,014 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 16 [2023-02-18 07:41:20,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530775584] [2023-02-18 07:41:20,015 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 07:41:20,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-02-18 07:41:20,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 07:41:20,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-02-18 07:41:20,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2023-02-18 07:41:20,016 INFO L87 Difference]: Start difference. First operand 1235 states and 1694 transitions. Second operand has 17 states, 16 states have (on average 12.375) internal successors, (198), 17 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 07:41:21,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:41:21,291 INFO L93 Difference]: Finished difference Result 10081 states and 12833 transitions. [2023-02-18 07:41:21,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-02-18 07:41:21,292 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 12.375) internal successors, (198), 17 states have internal predecessors, (198), 0 states have call successors, (0), 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 95 [2023-02-18 07:41:21,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:41:21,324 INFO L225 Difference]: With dead ends: 10081 [2023-02-18 07:41:21,324 INFO L226 Difference]: Without dead ends: 8821 [2023-02-18 07:41:21,331 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 175 SyntacticMatches, 5 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 339 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=403, Invalid=1079, Unknown=0, NotChecked=0, Total=1482 [2023-02-18 07:41:21,332 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 1064 mSDsluCounter, 1038 mSDsCounter, 0 mSdLazyCounter, 832 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1064 SdHoareTripleChecker+Valid, 1176 SdHoareTripleChecker+Invalid, 861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 832 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-18 07:41:21,332 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1064 Valid, 1176 Invalid, 861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 832 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-02-18 07:41:21,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8821 states. [2023-02-18 07:41:21,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8821 to 2020. [2023-02-18 07:41:21,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2020 states, 2019 states have (on average 1.408122833085686) internal successors, (2843), 2019 states have internal predecessors, (2843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 07:41:21,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2020 states to 2020 states and 2843 transitions. [2023-02-18 07:41:21,530 INFO L78 Accepts]: Start accepts. Automaton has 2020 states and 2843 transitions. Word has length 95 [2023-02-18 07:41:21,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:41:21,530 INFO L495 AbstractCegarLoop]: Abstraction has 2020 states and 2843 transitions. [2023-02-18 07:41:21,531 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 12.375) internal successors, (198), 17 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 07:41:21,531 INFO L276 IsEmpty]: Start isEmpty. Operand 2020 states and 2843 transitions. [2023-02-18 07:41:21,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2023-02-18 07:41:21,533 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:41:21,533 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:41:21,541 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-02-18 07:41:21,733 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,SelfDestructingSolverStorable14 [2023-02-18 07:41:21,734 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-02-18 07:41:21,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:41:21,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1586105425, now seen corresponding path program 1 times [2023-02-18 07:41:21,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 07:41:21,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468591616] [2023-02-18 07:41:21,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:41:21,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 07:41:21,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:41:21,884 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 72 proven. 9 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-02-18 07:41:21,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 07:41:21,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468591616] [2023-02-18 07:41:21,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468591616] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 07:41:21,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1672010766] [2023-02-18 07:41:21,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:41:21,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 07:41:21,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 07:41:21,887 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 07:41:21,890 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-02-18 07:41:21,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:41:21,945 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-18 07:41:21,946 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 07:41:21,981 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 69 proven. 6 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-02-18 07:41:21,981 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 07:41:24,239 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 68 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-02-18 07:41:24,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1672010766] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 07:41:24,240 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 07:41:24,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2023-02-18 07:41:24,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463739681] [2023-02-18 07:41:24,240 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 07:41:24,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-18 07:41:24,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 07:41:24,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-18 07:41:24,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2023-02-18 07:41:24,242 INFO L87 Difference]: Start difference. First operand 2020 states and 2843 transitions. Second operand has 10 states, 10 states have (on average 12.9) internal successors, (129), 10 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 07:41:25,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:41:25,101 INFO L93 Difference]: Finished difference Result 5796 states and 8046 transitions. [2023-02-18 07:41:25,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-02-18 07:41:25,101 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 12.9) internal successors, (129), 10 states have internal predecessors, (129), 0 states have call successors, (0), 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 101 [2023-02-18 07:41:25,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:41:25,112 INFO L225 Difference]: With dead ends: 5796 [2023-02-18 07:41:25,112 INFO L226 Difference]: Without dead ends: 3433 [2023-02-18 07:41:25,116 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 208 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=147, Invalid=315, Unknown=0, NotChecked=0, Total=462 [2023-02-18 07:41:25,116 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 526 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 470 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 526 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-18 07:41:25,116 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [526 Valid, 423 Invalid, 551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 470 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-02-18 07:41:25,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3433 states. [2023-02-18 07:41:25,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3433 to 2663. [2023-02-18 07:41:25,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2663 states, 2662 states have (on average 1.3268219383921864) internal successors, (3532), 2662 states have internal predecessors, (3532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 07:41:25,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2663 states to 2663 states and 3532 transitions. [2023-02-18 07:41:25,252 INFO L78 Accepts]: Start accepts. Automaton has 2663 states and 3532 transitions. Word has length 101 [2023-02-18 07:41:25,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:41:25,252 INFO L495 AbstractCegarLoop]: Abstraction has 2663 states and 3532 transitions. [2023-02-18 07:41:25,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.9) internal successors, (129), 10 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 07:41:25,252 INFO L276 IsEmpty]: Start isEmpty. Operand 2663 states and 3532 transitions. [2023-02-18 07:41:25,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-02-18 07:41:25,254 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:41:25,255 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, 1, 1, 1, 1] [2023-02-18 07:41:25,262 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-02-18 07:41:25,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-02-18 07:41:25,461 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-02-18 07:41:25,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:41:25,461 INFO L85 PathProgramCache]: Analyzing trace with hash -702020810, now seen corresponding path program 1 times [2023-02-18 07:41:25,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 07:41:25,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474917156] [2023-02-18 07:41:25,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:41:25,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 07:41:25,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-18 07:41:25,515 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-18 07:41:25,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-18 07:41:25,585 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-18 07:41:25,585 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-02-18 07:41:25,586 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 41 remaining) [2023-02-18 07:41:25,588 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 41 remaining) [2023-02-18 07:41:25,588 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 41 remaining) [2023-02-18 07:41:25,588 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 41 remaining) [2023-02-18 07:41:25,589 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 41 remaining) [2023-02-18 07:41:25,589 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 41 remaining) [2023-02-18 07:41:25,589 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 41 remaining) [2023-02-18 07:41:25,589 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 41 remaining) [2023-02-18 07:41:25,589 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 41 remaining) [2023-02-18 07:41:25,590 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 41 remaining) [2023-02-18 07:41:25,591 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 41 remaining) [2023-02-18 07:41:25,591 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 41 remaining) [2023-02-18 07:41:25,591 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 41 remaining) [2023-02-18 07:41:25,591 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 41 remaining) [2023-02-18 07:41:25,592 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 41 remaining) [2023-02-18 07:41:25,592 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 41 remaining) [2023-02-18 07:41:25,592 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 41 remaining) [2023-02-18 07:41:25,592 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 41 remaining) [2023-02-18 07:41:25,592 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 41 remaining) [2023-02-18 07:41:25,593 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 41 remaining) [2023-02-18 07:41:25,593 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 41 remaining) [2023-02-18 07:41:25,593 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 41 remaining) [2023-02-18 07:41:25,593 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 41 remaining) [2023-02-18 07:41:25,593 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 41 remaining) [2023-02-18 07:41:25,593 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 41 remaining) [2023-02-18 07:41:25,594 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 41 remaining) [2023-02-18 07:41:25,594 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 41 remaining) [2023-02-18 07:41:25,594 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 41 remaining) [2023-02-18 07:41:25,594 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 41 remaining) [2023-02-18 07:41:25,594 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 41 remaining) [2023-02-18 07:41:25,594 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 41 remaining) [2023-02-18 07:41:25,594 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 41 remaining) [2023-02-18 07:41:25,595 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 41 remaining) [2023-02-18 07:41:25,595 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 41 remaining) [2023-02-18 07:41:25,595 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 41 remaining) [2023-02-18 07:41:25,595 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 41 remaining) [2023-02-18 07:41:25,595 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 41 remaining) [2023-02-18 07:41:25,595 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 41 remaining) [2023-02-18 07:41:25,596 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 41 remaining) [2023-02-18 07:41:25,596 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 41 remaining) [2023-02-18 07:41:25,596 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 41 remaining) [2023-02-18 07:41:25,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-02-18 07:41:25,600 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:41:25,606 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-18 07:41:25,709 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.02 07:41:25 BoogieIcfgContainer [2023-02-18 07:41:25,709 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-18 07:41:25,710 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-18 07:41:25,710 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-18 07:41:25,710 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-18 07:41:25,711 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 07:41:10" (3/4) ... [2023-02-18 07:41:25,713 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-02-18 07:41:25,795 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-18 07:41:25,796 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-18 07:41:25,796 INFO L158 Benchmark]: Toolchain (without parser) took 16476.90ms. Allocated memory was 98.6MB in the beginning and 291.5MB in the end (delta: 192.9MB). Free memory was 55.7MB in the beginning and 121.7MB in the end (delta: -66.0MB). Peak memory consumption was 127.2MB. Max. memory is 16.1GB. [2023-02-18 07:41:25,797 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 98.6MB. Free memory was 73.0MB in the beginning and 72.9MB in the end (delta: 144.7kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-18 07:41:25,797 INFO L158 Benchmark]: CACSL2BoogieTranslator took 268.22ms. Allocated memory is still 98.6MB. Free memory was 55.7MB in the beginning and 43.4MB in the end (delta: 12.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-18 07:41:25,798 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.80ms. Allocated memory is still 98.6MB. Free memory was 43.4MB in the beginning and 40.0MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-02-18 07:41:25,798 INFO L158 Benchmark]: Boogie Preprocessor took 47.10ms. Allocated memory is still 98.6MB. Free memory was 40.0MB in the beginning and 37.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-18 07:41:25,798 INFO L158 Benchmark]: RCFGBuilder took 622.28ms. Allocated memory was 98.6MB in the beginning and 136.3MB in the end (delta: 37.7MB). Free memory was 37.9MB in the beginning and 89.3MB in the end (delta: -51.5MB). Peak memory consumption was 12.0MB. Max. memory is 16.1GB. [2023-02-18 07:41:25,799 INFO L158 Benchmark]: TraceAbstraction took 15400.22ms. Allocated memory was 136.3MB in the beginning and 291.5MB in the end (delta: 155.2MB). Free memory was 88.7MB in the beginning and 130.1MB in the end (delta: -41.4MB). Peak memory consumption was 113.1MB. Max. memory is 16.1GB. [2023-02-18 07:41:25,799 INFO L158 Benchmark]: Witness Printer took 85.89ms. Allocated memory is still 291.5MB. Free memory was 129.0MB in the beginning and 121.7MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-02-18 07:41:25,805 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.17ms. Allocated memory is still 98.6MB. Free memory was 73.0MB in the beginning and 72.9MB in the end (delta: 144.7kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 268.22ms. Allocated memory is still 98.6MB. Free memory was 55.7MB in the beginning and 43.4MB in the end (delta: 12.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.80ms. Allocated memory is still 98.6MB. Free memory was 43.4MB in the beginning and 40.0MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.10ms. Allocated memory is still 98.6MB. Free memory was 40.0MB in the beginning and 37.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 622.28ms. Allocated memory was 98.6MB in the beginning and 136.3MB in the end (delta: 37.7MB). Free memory was 37.9MB in the beginning and 89.3MB in the end (delta: -51.5MB). Peak memory consumption was 12.0MB. Max. memory is 16.1GB. * TraceAbstraction took 15400.22ms. Allocated memory was 136.3MB in the beginning and 291.5MB in the end (delta: 155.2MB). Free memory was 88.7MB in the beginning and 130.1MB in the end (delta: -41.4MB). Peak memory consumption was 113.1MB. Max. memory is 16.1GB. * Witness Printer took 85.89ms. Allocated memory is still 291.5MB. Free memory was 129.0MB in the beginning and 121.7MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 116]: integer overflow possible integer overflow possible We found a FailurePath: [L124] unsigned int a, b, r; [L126] 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. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 126 locations, 41 error locations. Started 1 CEGAR loops. OverallTime: 15.2s, OverallIterations: 17, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4889 SdHoareTripleChecker+Valid, 4.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4889 mSDsluCounter, 6372 SdHoareTripleChecker+Invalid, 3.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4531 mSDsCounter, 372 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4172 IncrementalHoareTripleChecker+Invalid, 4544 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 372 mSolverCounterUnsat, 1841 mSDtfsCounter, 4172 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1089 GetRequests, 896 SyntacticMatches, 40 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 955 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2663occurred in iteration=16, InterpolantAutomatonStates: 147, 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, 16 MinimizatonAttempts, 8784 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 5.1s InterpolantComputationTime, 1643 NumberOfCodeBlocks, 1643 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 1796 ConstructedInterpolants, 46 QuantifiedInterpolants, 15488 SizeOfPredicates, 32 NumberOfNonLiveVariables, 1478 ConjunctsInSsa, 85 ConjunctsInUnsatCore, 28 InterpolantComputations, 13 PerfectInterpolantSequences, 1036/1319 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-02-18 07:41:25,840 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)