./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/bitvector/s3_srvr_1a.BV.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 35987657 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/s3_srvr_1a.BV.c.cil.c -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 a3777e2ab1819fd82e3658352e2b99c7da6626d046ae65288a9623558224827f --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-22 00:46:12,564 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 00:46:12,567 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 00:46:12,606 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 00:46:12,606 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 00:46:12,608 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 00:46:12,611 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 00:46:12,614 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 00:46:12,616 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 00:46:12,620 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 00:46:12,621 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 00:46:12,625 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 00:46:12,626 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 00:46:12,628 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 00:46:12,629 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 00:46:12,631 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 00:46:12,632 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 00:46:12,633 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 00:46:12,635 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 00:46:12,641 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 00:46:12,642 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 00:46:12,643 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 00:46:12,644 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 00:46:12,645 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 00:46:12,647 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 00:46:12,653 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 00:46:12,653 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 00:46:12,653 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 00:46:12,654 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 00:46:12,655 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 00:46:12,655 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 00:46:12,656 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 00:46:12,657 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 00:46:12,658 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 00:46:12,659 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 00:46:12,660 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 00:46:12,660 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 00:46:12,661 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 00:46:12,661 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 00:46:12,661 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 00:46:12,662 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 00:46:12,663 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 00:46:12,668 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2022-07-22 00:46:12,695 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 00:46:12,695 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 00:46:12,695 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 00:46:12,696 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 00:46:12,696 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-22 00:46:12,696 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-22 00:46:12,697 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 00:46:12,697 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 00:46:12,697 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 00:46:12,698 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 00:46:12,698 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 00:46:12,699 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-22 00:46:12,699 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 00:46:12,704 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 00:46:12,704 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 00:46:12,705 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-22 00:46:12,705 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-22 00:46:12,705 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-22 00:46:12,705 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-07-22 00:46:12,705 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 00:46:12,706 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 00:46:12,706 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 00:46:12,706 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-22 00:46:12,706 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 00:46:12,706 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 00:46:12,706 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-22 00:46:12,707 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 00:46:12,707 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 00:46:12,707 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-22 00:46:12,707 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-22 00:46:12,708 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 00:46:12,708 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-22 00:46:12,708 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-22 00:46:12,708 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a3777e2ab1819fd82e3658352e2b99c7da6626d046ae65288a9623558224827f [2022-07-22 00:46:12,986 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 00:46:13,011 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 00:46:13,013 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 00:46:13,014 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 00:46:13,015 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 00:46:13,016 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/s3_srvr_1a.BV.c.cil.c [2022-07-22 00:46:13,081 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5e171244/8a64e991fdc641e08ab4eac29d3ddc7b/FLAG6aa9befb4 [2022-07-22 00:46:13,588 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 00:46:13,588 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/s3_srvr_1a.BV.c.cil.c [2022-07-22 00:46:13,597 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5e171244/8a64e991fdc641e08ab4eac29d3ddc7b/FLAG6aa9befb4 [2022-07-22 00:46:14,097 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5e171244/8a64e991fdc641e08ab4eac29d3ddc7b [2022-07-22 00:46:14,099 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 00:46:14,100 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 00:46:14,101 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 00:46:14,101 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 00:46:14,108 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 00:46:14,109 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 12:46:14" (1/1) ... [2022-07-22 00:46:14,110 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64295349 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:46:14, skipping insertion in model container [2022-07-22 00:46:14,110 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 12:46:14" (1/1) ... [2022-07-22 00:46:14,121 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 00:46:14,169 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 00:46:14,410 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/s3_srvr_1a.BV.c.cil.c[44949,44962] [2022-07-22 00:46:14,426 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 00:46:14,433 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 00:46:14,510 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/s3_srvr_1a.BV.c.cil.c[44949,44962] [2022-07-22 00:46:14,522 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 00:46:14,532 INFO L208 MainTranslator]: Completed translation [2022-07-22 00:46:14,535 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:46:14 WrapperNode [2022-07-22 00:46:14,535 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 00:46:14,536 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 00:46:14,536 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 00:46:14,536 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 00:46:14,542 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:46:14" (1/1) ... [2022-07-22 00:46:14,567 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:46:14" (1/1) ... [2022-07-22 00:46:14,607 INFO L137 Inliner]: procedures = 16, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 525 [2022-07-22 00:46:14,611 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 00:46:14,612 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 00:46:14,612 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 00:46:14,613 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 00:46:14,620 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:46:14" (1/1) ... [2022-07-22 00:46:14,620 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:46:14" (1/1) ... [2022-07-22 00:46:14,628 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:46:14" (1/1) ... [2022-07-22 00:46:14,628 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:46:14" (1/1) ... [2022-07-22 00:46:14,642 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:46:14" (1/1) ... [2022-07-22 00:46:14,652 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:46:14" (1/1) ... [2022-07-22 00:46:14,661 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:46:14" (1/1) ... [2022-07-22 00:46:14,664 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 00:46:14,666 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 00:46:14,667 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 00:46:14,667 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 00:46:14,668 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:46:14" (1/1) ... [2022-07-22 00:46:14,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 00:46:14,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 00:46:14,704 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-22 00:46:14,734 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-22 00:46:14,749 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 00:46:14,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 00:46:14,750 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 00:46:14,750 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 00:46:14,878 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 00:46:14,887 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 00:46:14,903 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-22 00:46:15,393 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2022-07-22 00:46:15,393 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2022-07-22 00:46:15,393 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 00:46:15,400 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 00:46:15,400 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-22 00:46:15,402 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 12:46:15 BoogieIcfgContainer [2022-07-22 00:46:15,402 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 00:46:15,404 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-22 00:46:15,404 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-22 00:46:15,407 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-22 00:46:15,407 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 12:46:14" (1/3) ... [2022-07-22 00:46:15,407 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@384f12a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 12:46:15, skipping insertion in model container [2022-07-22 00:46:15,408 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:46:14" (2/3) ... [2022-07-22 00:46:15,408 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@384f12a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 12:46:15, skipping insertion in model container [2022-07-22 00:46:15,408 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 12:46:15" (3/3) ... [2022-07-22 00:46:15,409 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr_1a.BV.c.cil.c [2022-07-22 00:46:15,429 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-22 00:46:15,429 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2022-07-22 00:46:15,473 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-22 00:46:15,479 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@79ffe680, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@114660f1 [2022-07-22 00:46:15,479 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-07-22 00:46:15,484 INFO L276 IsEmpty]: Start isEmpty. Operand has 147 states, 142 states have (on average 1.732394366197183) internal successors, (246), 146 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 00:46:15,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-22 00:46:15,490 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 00:46:15,491 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 00:46:15,491 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-07-22 00:46:15,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 00:46:15,496 INFO L85 PathProgramCache]: Analyzing trace with hash -580333898, now seen corresponding path program 1 times [2022-07-22 00:46:15,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 00:46:15,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388919219] [2022-07-22 00:46:15,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:46:15,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 00:46:15,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:15,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 00:46:15,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 00:46:15,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388919219] [2022-07-22 00:46:15,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388919219] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 00:46:15,674 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 00:46:15,674 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 00:46:15,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119610300] [2022-07-22 00:46:15,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 00:46:15,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 00:46:15,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 00:46:15,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 00:46:15,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 00:46:15,702 INFO L87 Difference]: Start difference. First operand has 147 states, 142 states have (on average 1.732394366197183) internal successors, (246), 146 states have internal predecessors, (246), 0 states have call successors, (0), 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 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 00:46:15,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 00:46:15,844 INFO L93 Difference]: Finished difference Result 312 states and 520 transitions. [2022-07-22 00:46:15,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 00:46:15,846 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 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 18 [2022-07-22 00:46:15,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 00:46:15,854 INFO L225 Difference]: With dead ends: 312 [2022-07-22 00:46:15,855 INFO L226 Difference]: Without dead ends: 150 [2022-07-22 00:46:15,857 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 00:46:15,860 INFO L413 NwaCegarLoop]: 170 mSDtfsCounter, 205 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 00:46:15,861 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 207 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 00:46:15,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-07-22 00:46:15,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2022-07-22 00:46:15,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 146 states have (on average 1.5410958904109588) internal successors, (225), 149 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 00:46:15,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 225 transitions. [2022-07-22 00:46:15,898 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 225 transitions. Word has length 18 [2022-07-22 00:46:15,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 00:46:15,899 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 225 transitions. [2022-07-22 00:46:15,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 00:46:15,899 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 225 transitions. [2022-07-22 00:46:15,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-22 00:46:15,900 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 00:46:15,900 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 00:46:15,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-22 00:46:15,900 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-07-22 00:46:15,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 00:46:15,901 INFO L85 PathProgramCache]: Analyzing trace with hash -1061870123, now seen corresponding path program 1 times [2022-07-22 00:46:15,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 00:46:15,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281110118] [2022-07-22 00:46:15,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:46:15,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 00:46:15,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:15,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 00:46:15,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 00:46:15,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281110118] [2022-07-22 00:46:15,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281110118] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 00:46:15,943 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 00:46:15,943 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 00:46:15,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992907360] [2022-07-22 00:46:15,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 00:46:15,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 00:46:15,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 00:46:15,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 00:46:15,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 00:46:15,946 INFO L87 Difference]: Start difference. First operand 150 states and 225 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 00:46:16,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 00:46:16,062 INFO L93 Difference]: Finished difference Result 302 states and 451 transitions. [2022-07-22 00:46:16,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 00:46:16,063 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2022-07-22 00:46:16,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 00:46:16,064 INFO L225 Difference]: With dead ends: 302 [2022-07-22 00:46:16,064 INFO L226 Difference]: Without dead ends: 160 [2022-07-22 00:46:16,065 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 00:46:16,066 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 165 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 00:46:16,067 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 151 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 00:46:16,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2022-07-22 00:46:16,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 151. [2022-07-22 00:46:16,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 147 states have (on average 1.5374149659863945) internal successors, (226), 150 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 00:46:16,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 226 transitions. [2022-07-22 00:46:16,077 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 226 transitions. Word has length 19 [2022-07-22 00:46:16,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 00:46:16,078 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 226 transitions. [2022-07-22 00:46:16,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 00:46:16,078 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 226 transitions. [2022-07-22 00:46:16,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-22 00:46:16,079 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 00:46:16,079 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 00:46:16,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-22 00:46:16,079 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-07-22 00:46:16,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 00:46:16,080 INFO L85 PathProgramCache]: Analyzing trace with hash 323589326, now seen corresponding path program 1 times [2022-07-22 00:46:16,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 00:46:16,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492442986] [2022-07-22 00:46:16,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:46:16,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 00:46:16,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:16,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 00:46:16,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 00:46:16,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492442986] [2022-07-22 00:46:16,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492442986] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 00:46:16,141 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 00:46:16,141 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 00:46:16,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135976327] [2022-07-22 00:46:16,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 00:46:16,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 00:46:16,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 00:46:16,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 00:46:16,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 00:46:16,144 INFO L87 Difference]: Start difference. First operand 151 states and 226 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 00:46:16,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 00:46:16,263 INFO L93 Difference]: Finished difference Result 304 states and 453 transitions. [2022-07-22 00:46:16,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 00:46:16,263 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-07-22 00:46:16,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 00:46:16,265 INFO L225 Difference]: With dead ends: 304 [2022-07-22 00:46:16,266 INFO L226 Difference]: Without dead ends: 161 [2022-07-22 00:46:16,269 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 00:46:16,275 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 163 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 00:46:16,277 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 152 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 00:46:16,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2022-07-22 00:46:16,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 152. [2022-07-22 00:46:16,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 148 states have (on average 1.5337837837837838) internal successors, (227), 151 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 00:46:16,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 227 transitions. [2022-07-22 00:46:16,286 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 227 transitions. Word has length 20 [2022-07-22 00:46:16,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 00:46:16,287 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 227 transitions. [2022-07-22 00:46:16,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 00:46:16,287 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 227 transitions. [2022-07-22 00:46:16,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-22 00:46:16,288 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 00:46:16,288 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] [2022-07-22 00:46:16,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-22 00:46:16,288 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-07-22 00:46:16,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 00:46:16,289 INFO L85 PathProgramCache]: Analyzing trace with hash -659408240, now seen corresponding path program 1 times [2022-07-22 00:46:16,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 00:46:16,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980097662] [2022-07-22 00:46:16,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:46:16,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 00:46:16,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:16,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 00:46:16,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 00:46:16,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980097662] [2022-07-22 00:46:16,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980097662] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 00:46:16,332 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 00:46:16,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 00:46:16,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124836777] [2022-07-22 00:46:16,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 00:46:16,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 00:46:16,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 00:46:16,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 00:46:16,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 00:46:16,334 INFO L87 Difference]: Start difference. First operand 152 states and 227 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 00:46:16,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 00:46:16,451 INFO L93 Difference]: Finished difference Result 306 states and 455 transitions. [2022-07-22 00:46:16,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 00:46:16,451 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2022-07-22 00:46:16,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 00:46:16,452 INFO L225 Difference]: With dead ends: 306 [2022-07-22 00:46:16,452 INFO L226 Difference]: Without dead ends: 162 [2022-07-22 00:46:16,453 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 00:46:16,454 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 161 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 00:46:16,454 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 153 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 00:46:16,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2022-07-22 00:46:16,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 153. [2022-07-22 00:46:16,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 149 states have (on average 1.5302013422818792) internal successors, (228), 152 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 00:46:16,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 228 transitions. [2022-07-22 00:46:16,463 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 228 transitions. Word has length 21 [2022-07-22 00:46:16,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 00:46:16,463 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 228 transitions. [2022-07-22 00:46:16,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 00:46:16,464 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 228 transitions. [2022-07-22 00:46:16,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-22 00:46:16,464 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 00:46:16,465 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] [2022-07-22 00:46:16,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-22 00:46:16,465 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-07-22 00:46:16,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 00:46:16,466 INFO L85 PathProgramCache]: Analyzing trace with hash -2050129239, now seen corresponding path program 1 times [2022-07-22 00:46:16,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 00:46:16,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804214464] [2022-07-22 00:46:16,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:46:16,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 00:46:16,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:16,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 00:46:16,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 00:46:16,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804214464] [2022-07-22 00:46:16,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804214464] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 00:46:16,496 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 00:46:16,496 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 00:46:16,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927591368] [2022-07-22 00:46:16,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 00:46:16,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 00:46:16,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 00:46:16,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 00:46:16,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 00:46:16,497 INFO L87 Difference]: Start difference. First operand 153 states and 228 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 00:46:16,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 00:46:16,656 INFO L93 Difference]: Finished difference Result 308 states and 457 transitions. [2022-07-22 00:46:16,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 00:46:16,656 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2022-07-22 00:46:16,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 00:46:16,657 INFO L225 Difference]: With dead ends: 308 [2022-07-22 00:46:16,657 INFO L226 Difference]: Without dead ends: 163 [2022-07-22 00:46:16,658 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 00:46:16,659 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 159 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 00:46:16,659 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 154 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 00:46:16,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2022-07-22 00:46:16,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 154. [2022-07-22 00:46:16,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 150 states have (on average 1.5266666666666666) internal successors, (229), 153 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 00:46:16,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 229 transitions. [2022-07-22 00:46:16,679 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 229 transitions. Word has length 22 [2022-07-22 00:46:16,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 00:46:16,679 INFO L495 AbstractCegarLoop]: Abstraction has 154 states and 229 transitions. [2022-07-22 00:46:16,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 00:46:16,679 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 229 transitions. [2022-07-22 00:46:16,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-07-22 00:46:16,681 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 00:46:16,681 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 00:46:16,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-22 00:46:16,681 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-07-22 00:46:16,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 00:46:16,682 INFO L85 PathProgramCache]: Analyzing trace with hash 1990190120, now seen corresponding path program 1 times [2022-07-22 00:46:16,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 00:46:16,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384171338] [2022-07-22 00:46:16,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:46:16,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 00:46:16,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:16,741 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 00:46:16,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 00:46:16,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384171338] [2022-07-22 00:46:16,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384171338] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 00:46:16,742 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 00:46:16,742 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 00:46:16,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350951521] [2022-07-22 00:46:16,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 00:46:16,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 00:46:16,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 00:46:16,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 00:46:16,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 00:46:16,744 INFO L87 Difference]: Start difference. First operand 154 states and 229 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 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) [2022-07-22 00:46:16,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 00:46:16,910 INFO L93 Difference]: Finished difference Result 331 states and 499 transitions. [2022-07-22 00:46:16,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 00:46:16,911 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 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 47 [2022-07-22 00:46:16,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 00:46:16,914 INFO L225 Difference]: With dead ends: 331 [2022-07-22 00:46:16,914 INFO L226 Difference]: Without dead ends: 185 [2022-07-22 00:46:16,916 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 00:46:16,921 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 134 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 00:46:16,922 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 165 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 00:46:16,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-07-22 00:46:16,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2022-07-22 00:46:16,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 181 states have (on average 1.5524861878453038) internal successors, (281), 184 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) [2022-07-22 00:46:16,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 281 transitions. [2022-07-22 00:46:16,947 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 281 transitions. Word has length 47 [2022-07-22 00:46:16,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 00:46:16,948 INFO L495 AbstractCegarLoop]: Abstraction has 185 states and 281 transitions. [2022-07-22 00:46:16,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 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) [2022-07-22 00:46:16,948 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 281 transitions. [2022-07-22 00:46:16,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-22 00:46:16,952 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 00:46:16,952 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1] [2022-07-22 00:46:16,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-22 00:46:16,953 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-07-22 00:46:16,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 00:46:16,954 INFO L85 PathProgramCache]: Analyzing trace with hash -1367947310, now seen corresponding path program 1 times [2022-07-22 00:46:16,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 00:46:16,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220920506] [2022-07-22 00:46:16,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:46:16,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 00:46:16,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:16,999 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-22 00:46:17,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 00:46:17,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220920506] [2022-07-22 00:46:17,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220920506] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 00:46:17,000 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 00:46:17,001 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 00:46:17,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067596811] [2022-07-22 00:46:17,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 00:46:17,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 00:46:17,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 00:46:17,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 00:46:17,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 00:46:17,002 INFO L87 Difference]: Start difference. First operand 185 states and 281 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 00:46:17,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 00:46:17,118 INFO L93 Difference]: Finished difference Result 380 states and 575 transitions. [2022-07-22 00:46:17,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 00:46:17,119 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2022-07-22 00:46:17,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 00:46:17,120 INFO L225 Difference]: With dead ends: 380 [2022-07-22 00:46:17,120 INFO L226 Difference]: Without dead ends: 203 [2022-07-22 00:46:17,120 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 00:46:17,121 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 157 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 00:46:17,121 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 147 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 00:46:17,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2022-07-22 00:46:17,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 201. [2022-07-22 00:46:17,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 197 states have (on average 1.532994923857868) internal successors, (302), 200 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 00:46:17,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 302 transitions. [2022-07-22 00:46:17,140 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 302 transitions. Word has length 59 [2022-07-22 00:46:17,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 00:46:17,142 INFO L495 AbstractCegarLoop]: Abstraction has 201 states and 302 transitions. [2022-07-22 00:46:17,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 00:46:17,142 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 302 transitions. [2022-07-22 00:46:17,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-07-22 00:46:17,148 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 00:46:17,149 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 00:46:17,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-22 00:46:17,149 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-07-22 00:46:17,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 00:46:17,150 INFO L85 PathProgramCache]: Analyzing trace with hash -2136164213, now seen corresponding path program 1 times [2022-07-22 00:46:17,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 00:46:17,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183607565] [2022-07-22 00:46:17,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:46:17,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 00:46:17,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:17,193 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-22 00:46:17,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 00:46:17,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183607565] [2022-07-22 00:46:17,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183607565] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 00:46:17,194 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 00:46:17,194 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 00:46:17,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474936482] [2022-07-22 00:46:17,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 00:46:17,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 00:46:17,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 00:46:17,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 00:46:17,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 00:46:17,196 INFO L87 Difference]: Start difference. First operand 201 states and 302 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 00:46:17,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 00:46:17,288 INFO L93 Difference]: Finished difference Result 397 states and 596 transitions. [2022-07-22 00:46:17,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 00:46:17,288 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2022-07-22 00:46:17,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 00:46:17,289 INFO L225 Difference]: With dead ends: 397 [2022-07-22 00:46:17,290 INFO L226 Difference]: Without dead ends: 204 [2022-07-22 00:46:17,290 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 00:46:17,291 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 155 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 00:46:17,291 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 148 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 00:46:17,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2022-07-22 00:46:17,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 202. [2022-07-22 00:46:17,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 198 states have (on average 1.5252525252525253) internal successors, (302), 201 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 00:46:17,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 302 transitions. [2022-07-22 00:46:17,299 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 302 transitions. Word has length 60 [2022-07-22 00:46:17,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 00:46:17,299 INFO L495 AbstractCegarLoop]: Abstraction has 202 states and 302 transitions. [2022-07-22 00:46:17,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 00:46:17,300 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 302 transitions. [2022-07-22 00:46:17,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-07-22 00:46:17,301 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 00:46:17,301 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-07-22 00:46:17,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-22 00:46:17,301 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-07-22 00:46:17,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 00:46:17,302 INFO L85 PathProgramCache]: Analyzing trace with hash -956503025, now seen corresponding path program 1 times [2022-07-22 00:46:17,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 00:46:17,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075332273] [2022-07-22 00:46:17,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:46:17,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 00:46:17,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:17,341 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-22 00:46:17,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 00:46:17,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075332273] [2022-07-22 00:46:17,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075332273] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 00:46:17,341 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 00:46:17,341 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 00:46:17,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089140091] [2022-07-22 00:46:17,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 00:46:17,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 00:46:17,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 00:46:17,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 00:46:17,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 00:46:17,343 INFO L87 Difference]: Start difference. First operand 202 states and 302 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 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) [2022-07-22 00:46:17,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 00:46:17,457 INFO L93 Difference]: Finished difference Result 440 states and 667 transitions. [2022-07-22 00:46:17,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 00:46:17,458 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 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 73 [2022-07-22 00:46:17,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 00:46:17,459 INFO L225 Difference]: With dead ends: 440 [2022-07-22 00:46:17,459 INFO L226 Difference]: Without dead ends: 246 [2022-07-22 00:46:17,460 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 00:46:17,461 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 141 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 00:46:17,461 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 149 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 00:46:17,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2022-07-22 00:46:17,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 244. [2022-07-22 00:46:17,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 240 states have (on average 1.5541666666666667) internal successors, (373), 243 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 00:46:17,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 373 transitions. [2022-07-22 00:46:17,470 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 373 transitions. Word has length 73 [2022-07-22 00:46:17,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 00:46:17,470 INFO L495 AbstractCegarLoop]: Abstraction has 244 states and 373 transitions. [2022-07-22 00:46:17,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 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) [2022-07-22 00:46:17,470 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 373 transitions. [2022-07-22 00:46:17,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-07-22 00:46:17,471 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 00:46:17,472 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-07-22 00:46:17,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-22 00:46:17,472 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-07-22 00:46:17,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 00:46:17,473 INFO L85 PathProgramCache]: Analyzing trace with hash 603125704, now seen corresponding path program 1 times [2022-07-22 00:46:17,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 00:46:17,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181776314] [2022-07-22 00:46:17,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:46:17,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 00:46:17,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:17,511 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-22 00:46:17,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 00:46:17,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181776314] [2022-07-22 00:46:17,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181776314] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 00:46:17,512 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 00:46:17,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 00:46:17,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739107588] [2022-07-22 00:46:17,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 00:46:17,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 00:46:17,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 00:46:17,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 00:46:17,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 00:46:17,514 INFO L87 Difference]: Start difference. First operand 244 states and 373 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 00:46:17,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 00:46:17,640 INFO L93 Difference]: Finished difference Result 514 states and 789 transitions. [2022-07-22 00:46:17,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 00:46:17,641 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2022-07-22 00:46:17,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 00:46:17,643 INFO L225 Difference]: With dead ends: 514 [2022-07-22 00:46:17,643 INFO L226 Difference]: Without dead ends: 278 [2022-07-22 00:46:17,643 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 00:46:17,644 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 143 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 00:46:17,644 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 156 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 00:46:17,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2022-07-22 00:46:17,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 271. [2022-07-22 00:46:17,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 267 states have (on average 1.546816479400749) internal successors, (413), 270 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 00:46:17,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 413 transitions. [2022-07-22 00:46:17,654 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 413 transitions. Word has length 74 [2022-07-22 00:46:17,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 00:46:17,655 INFO L495 AbstractCegarLoop]: Abstraction has 271 states and 413 transitions. [2022-07-22 00:46:17,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 00:46:17,655 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 413 transitions. [2022-07-22 00:46:17,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-07-22 00:46:17,656 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 00:46:17,656 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-07-22 00:46:17,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-22 00:46:17,657 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-07-22 00:46:17,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 00:46:17,657 INFO L85 PathProgramCache]: Analyzing trace with hash -1649015640, now seen corresponding path program 1 times [2022-07-22 00:46:17,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 00:46:17,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766542061] [2022-07-22 00:46:17,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:46:17,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 00:46:17,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:17,703 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-22 00:46:17,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 00:46:17,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766542061] [2022-07-22 00:46:17,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766542061] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 00:46:17,704 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 00:46:17,704 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 00:46:17,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590326664] [2022-07-22 00:46:17,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 00:46:17,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 00:46:17,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 00:46:17,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 00:46:17,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 00:46:17,706 INFO L87 Difference]: Start difference. First operand 271 states and 413 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 00:46:17,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 00:46:17,820 INFO L93 Difference]: Finished difference Result 537 states and 818 transitions. [2022-07-22 00:46:17,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 00:46:17,820 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2022-07-22 00:46:17,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 00:46:17,822 INFO L225 Difference]: With dead ends: 537 [2022-07-22 00:46:17,822 INFO L226 Difference]: Without dead ends: 274 [2022-07-22 00:46:17,823 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 00:46:17,823 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 140 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 00:46:17,824 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 149 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 00:46:17,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2022-07-22 00:46:17,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 272. [2022-07-22 00:46:17,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 268 states have (on average 1.541044776119403) internal successors, (413), 271 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 00:46:17,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 413 transitions. [2022-07-22 00:46:17,832 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 413 transitions. Word has length 74 [2022-07-22 00:46:17,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 00:46:17,832 INFO L495 AbstractCegarLoop]: Abstraction has 272 states and 413 transitions. [2022-07-22 00:46:17,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 00:46:17,832 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 413 transitions. [2022-07-22 00:46:17,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-07-22 00:46:17,833 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 00:46:17,833 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-07-22 00:46:17,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-22 00:46:17,834 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-07-22 00:46:17,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 00:46:17,834 INFO L85 PathProgramCache]: Analyzing trace with hash -1207629393, now seen corresponding path program 1 times [2022-07-22 00:46:17,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 00:46:17,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023132071] [2022-07-22 00:46:17,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:46:17,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 00:46:17,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:17,864 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-22 00:46:17,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 00:46:17,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023132071] [2022-07-22 00:46:17,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023132071] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 00:46:17,864 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 00:46:17,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 00:46:17,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835333816] [2022-07-22 00:46:17,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 00:46:17,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 00:46:17,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 00:46:17,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 00:46:17,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 00:46:17,866 INFO L87 Difference]: Start difference. First operand 272 states and 413 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 00:46:17,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 00:46:17,977 INFO L93 Difference]: Finished difference Result 543 states and 826 transitions. [2022-07-22 00:46:17,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 00:46:17,977 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2022-07-22 00:46:17,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 00:46:17,979 INFO L225 Difference]: With dead ends: 543 [2022-07-22 00:46:17,979 INFO L226 Difference]: Without dead ends: 279 [2022-07-22 00:46:17,980 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 00:46:17,980 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 142 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 00:46:17,981 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 156 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 00:46:17,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2022-07-22 00:46:17,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 272. [2022-07-22 00:46:17,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 268 states have (on average 1.5298507462686568) internal successors, (410), 271 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 00:46:17,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 410 transitions. [2022-07-22 00:46:17,990 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 410 transitions. Word has length 75 [2022-07-22 00:46:17,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 00:46:17,991 INFO L495 AbstractCegarLoop]: Abstraction has 272 states and 410 transitions. [2022-07-22 00:46:17,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 00:46:17,991 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 410 transitions. [2022-07-22 00:46:17,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-07-22 00:46:17,992 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 00:46:17,992 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1] [2022-07-22 00:46:17,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-22 00:46:17,993 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-07-22 00:46:17,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 00:46:17,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1576887455, now seen corresponding path program 1 times [2022-07-22 00:46:17,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 00:46:17,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680408061] [2022-07-22 00:46:17,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:46:17,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 00:46:18,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:18,078 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-22 00:46:18,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 00:46:18,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680408061] [2022-07-22 00:46:18,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680408061] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 00:46:18,079 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 00:46:18,079 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 00:46:18,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242694682] [2022-07-22 00:46:18,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 00:46:18,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 00:46:18,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 00:46:18,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 00:46:18,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 00:46:18,081 INFO L87 Difference]: Start difference. First operand 272 states and 410 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 00:46:18,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 00:46:18,206 INFO L93 Difference]: Finished difference Result 583 states and 882 transitions. [2022-07-22 00:46:18,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 00:46:18,206 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 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 [2022-07-22 00:46:18,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 00:46:18,208 INFO L225 Difference]: With dead ends: 583 [2022-07-22 00:46:18,209 INFO L226 Difference]: Without dead ends: 319 [2022-07-22 00:46:18,209 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 00:46:18,210 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 125 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 00:46:18,211 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 154 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 00:46:18,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2022-07-22 00:46:18,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 315. [2022-07-22 00:46:18,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 311 states have (on average 1.540192926045016) internal successors, (479), 314 states have internal predecessors, (479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 00:46:18,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 479 transitions. [2022-07-22 00:46:18,222 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 479 transitions. Word has length 90 [2022-07-22 00:46:18,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 00:46:18,223 INFO L495 AbstractCegarLoop]: Abstraction has 315 states and 479 transitions. [2022-07-22 00:46:18,223 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 00:46:18,223 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 479 transitions. [2022-07-22 00:46:18,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-07-22 00:46:18,224 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 00:46:18,224 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1] [2022-07-22 00:46:18,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-22 00:46:18,225 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-07-22 00:46:18,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 00:46:18,225 INFO L85 PathProgramCache]: Analyzing trace with hash -1659002301, now seen corresponding path program 1 times [2022-07-22 00:46:18,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 00:46:18,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745375726] [2022-07-22 00:46:18,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:46:18,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 00:46:18,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:18,283 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-22 00:46:18,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 00:46:18,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745375726] [2022-07-22 00:46:18,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745375726] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 00:46:18,284 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 00:46:18,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 00:46:18,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245337236] [2022-07-22 00:46:18,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 00:46:18,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 00:46:18,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 00:46:18,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 00:46:18,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 00:46:18,286 INFO L87 Difference]: Start difference. First operand 315 states and 479 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 00:46:18,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 00:46:18,404 INFO L93 Difference]: Finished difference Result 638 states and 973 transitions. [2022-07-22 00:46:18,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 00:46:18,405 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 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 91 [2022-07-22 00:46:18,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 00:46:18,407 INFO L225 Difference]: With dead ends: 638 [2022-07-22 00:46:18,407 INFO L226 Difference]: Without dead ends: 329 [2022-07-22 00:46:18,407 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 00:46:18,408 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 125 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 00:46:18,408 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 153 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 00:46:18,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2022-07-22 00:46:18,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 325. [2022-07-22 00:46:18,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 321 states have (on average 1.5514018691588785) internal successors, (498), 324 states have internal predecessors, (498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 00:46:18,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 498 transitions. [2022-07-22 00:46:18,419 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 498 transitions. Word has length 91 [2022-07-22 00:46:18,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 00:46:18,419 INFO L495 AbstractCegarLoop]: Abstraction has 325 states and 498 transitions. [2022-07-22 00:46:18,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 00:46:18,419 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 498 transitions. [2022-07-22 00:46:18,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-07-22 00:46:18,420 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 00:46:18,429 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 00:46:18,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-22 00:46:18,429 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-07-22 00:46:18,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 00:46:18,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1994556924, now seen corresponding path program 1 times [2022-07-22 00:46:18,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 00:46:18,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361894031] [2022-07-22 00:46:18,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:46:18,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 00:46:18,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:18,466 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-07-22 00:46:18,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 00:46:18,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361894031] [2022-07-22 00:46:18,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361894031] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 00:46:18,467 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 00:46:18,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 00:46:18,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465155541] [2022-07-22 00:46:18,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 00:46:18,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 00:46:18,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 00:46:18,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 00:46:18,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 00:46:18,469 INFO L87 Difference]: Start difference. First operand 325 states and 498 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 00:46:18,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 00:46:18,564 INFO L93 Difference]: Finished difference Result 679 states and 1043 transitions. [2022-07-22 00:46:18,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 00:46:18,565 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 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 100 [2022-07-22 00:46:18,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 00:46:18,567 INFO L225 Difference]: With dead ends: 679 [2022-07-22 00:46:18,567 INFO L226 Difference]: Without dead ends: 362 [2022-07-22 00:46:18,568 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 00:46:18,569 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 145 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 00:46:18,570 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 167 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 00:46:18,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2022-07-22 00:46:18,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 350. [2022-07-22 00:46:18,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 346 states have (on average 1.5375722543352601) internal successors, (532), 349 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 00:46:18,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 532 transitions. [2022-07-22 00:46:18,581 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 532 transitions. Word has length 100 [2022-07-22 00:46:18,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 00:46:18,581 INFO L495 AbstractCegarLoop]: Abstraction has 350 states and 532 transitions. [2022-07-22 00:46:18,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 00:46:18,581 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 532 transitions. [2022-07-22 00:46:18,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-07-22 00:46:18,582 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 00:46:18,582 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-07-22 00:46:18,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-22 00:46:18,583 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-07-22 00:46:18,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 00:46:18,583 INFO L85 PathProgramCache]: Analyzing trace with hash 98352259, now seen corresponding path program 1 times [2022-07-22 00:46:18,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 00:46:18,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480442609] [2022-07-22 00:46:18,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:46:18,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 00:46:18,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:18,629 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-07-22 00:46:18,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 00:46:18,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480442609] [2022-07-22 00:46:18,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480442609] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 00:46:18,631 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 00:46:18,631 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 00:46:18,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448040348] [2022-07-22 00:46:18,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 00:46:18,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 00:46:18,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 00:46:18,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 00:46:18,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 00:46:18,632 INFO L87 Difference]: Start difference. First operand 350 states and 532 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 00:46:18,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 00:46:18,732 INFO L93 Difference]: Finished difference Result 704 states and 1072 transitions. [2022-07-22 00:46:18,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 00:46:18,732 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2022-07-22 00:46:18,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 00:46:18,734 INFO L225 Difference]: With dead ends: 704 [2022-07-22 00:46:18,734 INFO L226 Difference]: Without dead ends: 362 [2022-07-22 00:46:18,735 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 00:46:18,735 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 144 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 00:46:18,736 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 167 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 00:46:18,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2022-07-22 00:46:18,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 350. [2022-07-22 00:46:18,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 346 states have (on average 1.523121387283237) internal successors, (527), 349 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 00:46:18,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 527 transitions. [2022-07-22 00:46:18,749 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 527 transitions. Word has length 101 [2022-07-22 00:46:18,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 00:46:18,750 INFO L495 AbstractCegarLoop]: Abstraction has 350 states and 527 transitions. [2022-07-22 00:46:18,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 00:46:18,750 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 527 transitions. [2022-07-22 00:46:18,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-07-22 00:46:18,751 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 00:46:18,751 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 00:46:18,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-22 00:46:18,752 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-07-22 00:46:18,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 00:46:18,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1920296106, now seen corresponding path program 1 times [2022-07-22 00:46:18,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 00:46:18,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313623113] [2022-07-22 00:46:18,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:46:18,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 00:46:18,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:18,800 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2022-07-22 00:46:18,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 00:46:18,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313623113] [2022-07-22 00:46:18,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313623113] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 00:46:18,801 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 00:46:18,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 00:46:18,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623145193] [2022-07-22 00:46:18,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 00:46:18,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 00:46:18,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 00:46:18,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 00:46:18,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 00:46:18,803 INFO L87 Difference]: Start difference. First operand 350 states and 527 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 00:46:18,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 00:46:18,897 INFO L93 Difference]: Finished difference Result 719 states and 1082 transitions. [2022-07-22 00:46:18,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 00:46:18,897 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 120 [2022-07-22 00:46:18,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 00:46:18,899 INFO L225 Difference]: With dead ends: 719 [2022-07-22 00:46:18,899 INFO L226 Difference]: Without dead ends: 377 [2022-07-22 00:46:18,899 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 00:46:18,900 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 147 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 00:46:18,901 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 152 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 00:46:18,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2022-07-22 00:46:18,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 374. [2022-07-22 00:46:18,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 370 states have (on average 1.5054054054054054) internal successors, (557), 373 states have internal predecessors, (557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 00:46:18,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 557 transitions. [2022-07-22 00:46:18,914 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 557 transitions. Word has length 120 [2022-07-22 00:46:18,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 00:46:18,914 INFO L495 AbstractCegarLoop]: Abstraction has 374 states and 557 transitions. [2022-07-22 00:46:18,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 00:46:18,914 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 557 transitions. [2022-07-22 00:46:18,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-07-22 00:46:18,916 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 00:46:18,916 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 00:46:18,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-22 00:46:18,916 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-07-22 00:46:18,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 00:46:18,917 INFO L85 PathProgramCache]: Analyzing trace with hash -698248943, now seen corresponding path program 1 times [2022-07-22 00:46:18,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 00:46:18,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182781826] [2022-07-22 00:46:18,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:46:18,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 00:46:18,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:18,950 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2022-07-22 00:46:18,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 00:46:18,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182781826] [2022-07-22 00:46:18,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182781826] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 00:46:18,951 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 00:46:18,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 00:46:18,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416473565] [2022-07-22 00:46:18,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 00:46:18,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 00:46:18,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 00:46:18,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 00:46:18,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 00:46:18,952 INFO L87 Difference]: Start difference. First operand 374 states and 557 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 00:46:19,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 00:46:19,048 INFO L93 Difference]: Finished difference Result 743 states and 1106 transitions. [2022-07-22 00:46:19,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 00:46:19,048 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 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 121 [2022-07-22 00:46:19,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 00:46:19,050 INFO L225 Difference]: With dead ends: 743 [2022-07-22 00:46:19,050 INFO L226 Difference]: Without dead ends: 377 [2022-07-22 00:46:19,051 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 00:46:19,051 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 146 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 00:46:19,052 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 151 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 00:46:19,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2022-07-22 00:46:19,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 374. [2022-07-22 00:46:19,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 370 states have (on average 1.4891891891891893) internal successors, (551), 373 states have internal predecessors, (551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 00:46:19,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 551 transitions. [2022-07-22 00:46:19,064 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 551 transitions. Word has length 121 [2022-07-22 00:46:19,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 00:46:19,064 INFO L495 AbstractCegarLoop]: Abstraction has 374 states and 551 transitions. [2022-07-22 00:46:19,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 00:46:19,065 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 551 transitions. [2022-07-22 00:46:19,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-07-22 00:46:19,066 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 00:46:19,066 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-07-22 00:46:19,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-22 00:46:19,067 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-07-22 00:46:19,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 00:46:19,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1095545664, now seen corresponding path program 1 times [2022-07-22 00:46:19,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 00:46:19,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67292813] [2022-07-22 00:46:19,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:46:19,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 00:46:19,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:19,112 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-07-22 00:46:19,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 00:46:19,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67292813] [2022-07-22 00:46:19,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67292813] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 00:46:19,113 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 00:46:19,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 00:46:19,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790799590] [2022-07-22 00:46:19,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 00:46:19,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 00:46:19,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 00:46:19,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 00:46:19,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 00:46:19,115 INFO L87 Difference]: Start difference. First operand 374 states and 551 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 00:46:19,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 00:46:19,247 INFO L93 Difference]: Finished difference Result 785 states and 1156 transitions. [2022-07-22 00:46:19,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 00:46:19,247 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 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 130 [2022-07-22 00:46:19,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 00:46:19,249 INFO L225 Difference]: With dead ends: 785 [2022-07-22 00:46:19,249 INFO L226 Difference]: Without dead ends: 419 [2022-07-22 00:46:19,250 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 00:46:19,250 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 126 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 00:46:19,251 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 159 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 00:46:19,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2022-07-22 00:46:19,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 415. [2022-07-22 00:46:19,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 411 states have (on average 1.4841849148418491) internal successors, (610), 414 states have internal predecessors, (610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 00:46:19,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 610 transitions. [2022-07-22 00:46:19,263 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 610 transitions. Word has length 130 [2022-07-22 00:46:19,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 00:46:19,264 INFO L495 AbstractCegarLoop]: Abstraction has 415 states and 610 transitions. [2022-07-22 00:46:19,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 00:46:19,264 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 610 transitions. [2022-07-22 00:46:19,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-07-22 00:46:19,266 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 00:46:19,266 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-07-22 00:46:19,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-22 00:46:19,266 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-07-22 00:46:19,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 00:46:19,267 INFO L85 PathProgramCache]: Analyzing trace with hash 850220610, now seen corresponding path program 1 times [2022-07-22 00:46:19,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 00:46:19,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752136304] [2022-07-22 00:46:19,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:46:19,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 00:46:19,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:19,292 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-07-22 00:46:19,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 00:46:19,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752136304] [2022-07-22 00:46:19,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752136304] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 00:46:19,293 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 00:46:19,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 00:46:19,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504459640] [2022-07-22 00:46:19,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 00:46:19,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 00:46:19,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 00:46:19,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 00:46:19,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 00:46:19,294 INFO L87 Difference]: Start difference. First operand 415 states and 610 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 00:46:19,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 00:46:19,417 INFO L93 Difference]: Finished difference Result 826 states and 1213 transitions. [2022-07-22 00:46:19,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 00:46:19,418 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 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 131 [2022-07-22 00:46:19,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 00:46:19,420 INFO L225 Difference]: With dead ends: 826 [2022-07-22 00:46:19,420 INFO L226 Difference]: Without dead ends: 417 [2022-07-22 00:46:19,420 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 00:46:19,421 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 125 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 00:46:19,421 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 156 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 00:46:19,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2022-07-22 00:46:19,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 413. [2022-07-22 00:46:19,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 409 states have (on average 1.4792176039119804) internal successors, (605), 412 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 00:46:19,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 605 transitions. [2022-07-22 00:46:19,433 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 605 transitions. Word has length 131 [2022-07-22 00:46:19,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 00:46:19,433 INFO L495 AbstractCegarLoop]: Abstraction has 413 states and 605 transitions. [2022-07-22 00:46:19,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 00:46:19,433 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 605 transitions. [2022-07-22 00:46:19,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2022-07-22 00:46:19,435 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 00:46:19,435 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 00:46:19,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-22 00:46:19,435 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-07-22 00:46:19,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 00:46:19,436 INFO L85 PathProgramCache]: Analyzing trace with hash -1977670215, now seen corresponding path program 1 times [2022-07-22 00:46:19,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 00:46:19,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056185265] [2022-07-22 00:46:19,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:46:19,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 00:46:19,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:19,464 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-07-22 00:46:19,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 00:46:19,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056185265] [2022-07-22 00:46:19,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056185265] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 00:46:19,465 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 00:46:19,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 00:46:19,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868732766] [2022-07-22 00:46:19,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 00:46:19,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 00:46:19,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 00:46:19,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 00:46:19,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 00:46:19,466 INFO L87 Difference]: Start difference. First operand 413 states and 605 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 00:46:19,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 00:46:19,571 INFO L93 Difference]: Finished difference Result 843 states and 1235 transitions. [2022-07-22 00:46:19,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 00:46:19,572 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 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 141 [2022-07-22 00:46:19,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 00:46:19,574 INFO L225 Difference]: With dead ends: 843 [2022-07-22 00:46:19,574 INFO L226 Difference]: Without dead ends: 438 [2022-07-22 00:46:19,575 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 00:46:19,576 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 149 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 00:46:19,577 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 152 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 00:46:19,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2022-07-22 00:46:19,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 434. [2022-07-22 00:46:19,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 430 states have (on average 1.4604651162790698) internal successors, (628), 433 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 00:46:19,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 628 transitions. [2022-07-22 00:46:19,593 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 628 transitions. Word has length 141 [2022-07-22 00:46:19,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 00:46:19,593 INFO L495 AbstractCegarLoop]: Abstraction has 434 states and 628 transitions. [2022-07-22 00:46:19,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 00:46:19,594 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 628 transitions. [2022-07-22 00:46:19,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2022-07-22 00:46:19,595 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 00:46:19,595 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 00:46:19,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-22 00:46:19,596 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-07-22 00:46:19,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 00:46:19,596 INFO L85 PathProgramCache]: Analyzing trace with hash -2018786222, now seen corresponding path program 1 times [2022-07-22 00:46:19,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 00:46:19,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537422668] [2022-07-22 00:46:19,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:46:19,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 00:46:19,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:19,626 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-07-22 00:46:19,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 00:46:19,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537422668] [2022-07-22 00:46:19,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537422668] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 00:46:19,627 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 00:46:19,627 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 00:46:19,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831453825] [2022-07-22 00:46:19,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 00:46:19,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 00:46:19,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 00:46:19,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 00:46:19,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 00:46:19,629 INFO L87 Difference]: Start difference. First operand 434 states and 628 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 00:46:19,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 00:46:19,729 INFO L93 Difference]: Finished difference Result 864 states and 1250 transitions. [2022-07-22 00:46:19,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 00:46:19,729 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 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 142 [2022-07-22 00:46:19,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 00:46:19,731 INFO L225 Difference]: With dead ends: 864 [2022-07-22 00:46:19,732 INFO L226 Difference]: Without dead ends: 438 [2022-07-22 00:46:19,733 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 00:46:19,735 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 148 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 00:46:19,735 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 152 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 00:46:19,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2022-07-22 00:46:19,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 434. [2022-07-22 00:46:19,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 430 states have (on average 1.441860465116279) internal successors, (620), 433 states have internal predecessors, (620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 00:46:19,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 620 transitions. [2022-07-22 00:46:19,749 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 620 transitions. Word has length 142 [2022-07-22 00:46:19,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 00:46:19,749 INFO L495 AbstractCegarLoop]: Abstraction has 434 states and 620 transitions. [2022-07-22 00:46:19,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 00:46:19,750 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 620 transitions. [2022-07-22 00:46:19,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-07-22 00:46:19,751 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 00:46:19,752 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 00:46:19,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-22 00:46:19,752 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-07-22 00:46:19,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 00:46:19,752 INFO L85 PathProgramCache]: Analyzing trace with hash -136164042, now seen corresponding path program 1 times [2022-07-22 00:46:19,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 00:46:19,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520584242] [2022-07-22 00:46:19,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:46:19,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 00:46:19,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:19,792 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2022-07-22 00:46:19,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 00:46:19,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520584242] [2022-07-22 00:46:19,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520584242] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 00:46:19,793 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 00:46:19,793 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 00:46:19,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772452695] [2022-07-22 00:46:19,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 00:46:19,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 00:46:19,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 00:46:19,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 00:46:19,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 00:46:19,795 INFO L87 Difference]: Start difference. First operand 434 states and 620 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 00:46:19,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 00:46:19,833 INFO L93 Difference]: Finished difference Result 1280 states and 1824 transitions. [2022-07-22 00:46:19,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 00:46:19,834 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 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 157 [2022-07-22 00:46:19,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 00:46:19,837 INFO L225 Difference]: With dead ends: 1280 [2022-07-22 00:46:19,837 INFO L226 Difference]: Without dead ends: 854 [2022-07-22 00:46:19,838 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 00:46:19,838 INFO L413 NwaCegarLoop]: 310 mSDtfsCounter, 173 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 00:46:19,839 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 505 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 00:46:19,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 854 states. [2022-07-22 00:46:19,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 854 to 435. [2022-07-22 00:46:19,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 435 states, 431 states have (on average 1.4408352668213458) internal successors, (621), 434 states have internal predecessors, (621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 00:46:19,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 621 transitions. [2022-07-22 00:46:19,856 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 621 transitions. Word has length 157 [2022-07-22 00:46:19,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 00:46:19,857 INFO L495 AbstractCegarLoop]: Abstraction has 435 states and 621 transitions. [2022-07-22 00:46:19,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 00:46:19,857 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 621 transitions. [2022-07-22 00:46:19,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-07-22 00:46:19,858 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 00:46:19,859 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 00:46:19,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-22 00:46:19,859 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-07-22 00:46:19,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 00:46:19,859 INFO L85 PathProgramCache]: Analyzing trace with hash -877621738, now seen corresponding path program 1 times [2022-07-22 00:46:19,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 00:46:19,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163369768] [2022-07-22 00:46:19,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:46:19,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 00:46:19,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:19,900 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 110 proven. 5 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-07-22 00:46:19,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 00:46:19,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163369768] [2022-07-22 00:46:19,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163369768] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 00:46:19,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1186211912] [2022-07-22 00:46:19,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:46:19,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 00:46:19,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 00:46:19,903 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 00:46:19,932 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-22 00:46:20,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:20,005 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-22 00:46:20,011 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 00:46:20,101 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 110 proven. 5 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-07-22 00:46:20,102 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 00:46:20,178 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 110 proven. 5 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-07-22 00:46:20,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1186211912] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 00:46:20,178 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 00:46:20,178 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-07-22 00:46:20,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099640418] [2022-07-22 00:46:20,179 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 00:46:20,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-22 00:46:20,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 00:46:20,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 00:46:20,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-22 00:46:20,180 INFO L87 Difference]: Start difference. First operand 435 states and 621 transitions. Second operand has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 00:46:20,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 00:46:20,599 INFO L93 Difference]: Finished difference Result 1667 states and 2372 transitions. [2022-07-22 00:46:20,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-22 00:46:20,602 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 157 [2022-07-22 00:46:20,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 00:46:20,606 INFO L225 Difference]: With dead ends: 1667 [2022-07-22 00:46:20,607 INFO L226 Difference]: Without dead ends: 1208 [2022-07-22 00:46:20,608 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 316 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2022-07-22 00:46:20,609 INFO L413 NwaCegarLoop]: 220 mSDtfsCounter, 575 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 575 SdHoareTripleChecker+Valid, 585 SdHoareTripleChecker+Invalid, 491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-22 00:46:20,609 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [575 Valid, 585 Invalid, 491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-22 00:46:20,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1208 states. [2022-07-22 00:46:20,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1208 to 505. [2022-07-22 00:46:20,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 503 states have (on average 1.4353876739562623) internal successors, (722), 504 states have internal predecessors, (722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 00:46:20,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 722 transitions. [2022-07-22 00:46:20,633 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 722 transitions. Word has length 157 [2022-07-22 00:46:20,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 00:46:20,634 INFO L495 AbstractCegarLoop]: Abstraction has 505 states and 722 transitions. [2022-07-22 00:46:20,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 00:46:20,634 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 722 transitions. [2022-07-22 00:46:20,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2022-07-22 00:46:20,636 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 00:46:20,636 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 00:46:20,672 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-22 00:46:20,859 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,SelfDestructingSolverStorable23 [2022-07-22 00:46:20,860 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-07-22 00:46:20,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 00:46:20,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1902183378, now seen corresponding path program 1 times [2022-07-22 00:46:20,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 00:46:20,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774863070] [2022-07-22 00:46:20,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:46:20,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 00:46:20,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:20,903 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 120 proven. 7 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-07-22 00:46:20,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 00:46:20,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774863070] [2022-07-22 00:46:20,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774863070] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 00:46:20,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1848989817] [2022-07-22 00:46:20,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:46:20,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 00:46:20,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 00:46:20,905 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 00:46:20,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-22 00:46:20,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:20,997 INFO L263 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-22 00:46:21,001 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 00:46:21,089 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 120 proven. 7 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-07-22 00:46:21,089 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 00:46:21,146 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 120 proven. 7 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-07-22 00:46:21,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1848989817] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 00:46:21,146 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 00:46:21,146 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-07-22 00:46:21,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614675087] [2022-07-22 00:46:21,147 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 00:46:21,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-22 00:46:21,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 00:46:21,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 00:46:21,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-22 00:46:21,148 INFO L87 Difference]: Start difference. First operand 505 states and 722 transitions. Second operand has 6 states, 6 states have (on average 22.5) internal successors, (135), 6 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 00:46:21,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 00:46:21,670 INFO L93 Difference]: Finished difference Result 1929 states and 2722 transitions. [2022-07-22 00:46:21,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-22 00:46:21,671 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 6 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 159 [2022-07-22 00:46:21,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 00:46:21,676 INFO L225 Difference]: With dead ends: 1929 [2022-07-22 00:46:21,676 INFO L226 Difference]: Without dead ends: 1432 [2022-07-22 00:46:21,677 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 320 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2022-07-22 00:46:21,678 INFO L413 NwaCegarLoop]: 297 mSDtfsCounter, 478 mSDsluCounter, 648 mSDsCounter, 0 mSdLazyCounter, 631 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 478 SdHoareTripleChecker+Valid, 945 SdHoareTripleChecker+Invalid, 698 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-22 00:46:21,678 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [478 Valid, 945 Invalid, 698 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 631 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-22 00:46:21,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1432 states. [2022-07-22 00:46:21,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1432 to 625. [2022-07-22 00:46:21,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 625 states, 623 states have (on average 1.3804173354735152) internal successors, (860), 624 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 00:46:21,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 625 states and 860 transitions. [2022-07-22 00:46:21,727 INFO L78 Accepts]: Start accepts. Automaton has 625 states and 860 transitions. Word has length 159 [2022-07-22 00:46:21,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 00:46:21,728 INFO L495 AbstractCegarLoop]: Abstraction has 625 states and 860 transitions. [2022-07-22 00:46:21,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 6 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 00:46:21,729 INFO L276 IsEmpty]: Start isEmpty. Operand 625 states and 860 transitions. [2022-07-22 00:46:21,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2022-07-22 00:46:21,731 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 00:46:21,731 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 00:46:21,758 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-22 00:46:21,953 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,SelfDestructingSolverStorable24 [2022-07-22 00:46:21,953 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-07-22 00:46:21,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 00:46:21,954 INFO L85 PathProgramCache]: Analyzing trace with hash 2140887848, now seen corresponding path program 1 times [2022-07-22 00:46:21,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 00:46:21,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008206029] [2022-07-22 00:46:21,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:46:21,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 00:46:21,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:22,003 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2022-07-22 00:46:22,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 00:46:22,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008206029] [2022-07-22 00:46:22,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008206029] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 00:46:22,004 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 00:46:22,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 00:46:22,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348404219] [2022-07-22 00:46:22,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 00:46:22,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 00:46:22,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 00:46:22,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 00:46:22,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 00:46:22,006 INFO L87 Difference]: Start difference. First operand 625 states and 860 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 00:46:22,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 00:46:22,048 INFO L93 Difference]: Finished difference Result 1446 states and 1977 transitions. [2022-07-22 00:46:22,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 00:46:22,049 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 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 169 [2022-07-22 00:46:22,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 00:46:22,051 INFO L225 Difference]: With dead ends: 1446 [2022-07-22 00:46:22,051 INFO L226 Difference]: Without dead ends: 544 [2022-07-22 00:46:22,052 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 00:46:22,053 INFO L413 NwaCegarLoop]: 274 mSDtfsCounter, 58 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 00:46:22,054 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 455 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 00:46:22,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2022-07-22 00:46:22,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 544. [2022-07-22 00:46:22,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 544 states, 542 states have (on average 1.381918819188192) internal successors, (749), 543 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 00:46:22,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 749 transitions. [2022-07-22 00:46:22,077 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 749 transitions. Word has length 169 [2022-07-22 00:46:22,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 00:46:22,077 INFO L495 AbstractCegarLoop]: Abstraction has 544 states and 749 transitions. [2022-07-22 00:46:22,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 00:46:22,077 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 749 transitions. [2022-07-22 00:46:22,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2022-07-22 00:46:22,080 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 00:46:22,080 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 00:46:22,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-07-22 00:46:22,081 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-07-22 00:46:22,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 00:46:22,081 INFO L85 PathProgramCache]: Analyzing trace with hash -873338986, now seen corresponding path program 1 times [2022-07-22 00:46:22,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 00:46:22,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2715552] [2022-07-22 00:46:22,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:46:22,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 00:46:22,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:22,110 INFO L134 CoverageAnalysis]: Checked inductivity of 311 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2022-07-22 00:46:22,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 00:46:22,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2715552] [2022-07-22 00:46:22,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2715552] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 00:46:22,111 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 00:46:22,111 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 00:46:22,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288065938] [2022-07-22 00:46:22,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 00:46:22,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 00:46:22,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 00:46:22,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 00:46:22,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 00:46:22,113 INFO L87 Difference]: Start difference. First operand 544 states and 749 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 00:46:22,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 00:46:22,224 INFO L93 Difference]: Finished difference Result 1098 states and 1507 transitions. [2022-07-22 00:46:22,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 00:46:22,225 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 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) Word has length 201 [2022-07-22 00:46:22,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 00:46:22,227 INFO L225 Difference]: With dead ends: 1098 [2022-07-22 00:46:22,228 INFO L226 Difference]: Without dead ends: 550 [2022-07-22 00:46:22,229 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 00:46:22,229 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 124 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 00:46:22,230 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 150 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 00:46:22,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2022-07-22 00:46:22,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 546. [2022-07-22 00:46:22,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 546 states, 544 states have (on average 1.3621323529411764) internal successors, (741), 545 states have internal predecessors, (741), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 00:46:22,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 741 transitions. [2022-07-22 00:46:22,264 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 741 transitions. Word has length 201 [2022-07-22 00:46:22,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 00:46:22,265 INFO L495 AbstractCegarLoop]: Abstraction has 546 states and 741 transitions. [2022-07-22 00:46:22,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 00:46:22,265 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 741 transitions. [2022-07-22 00:46:22,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2022-07-22 00:46:22,269 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 00:46:22,269 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 9, 9, 8, 8, 7, 7, 6, 6, 6, 6, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 00:46:22,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-07-22 00:46:22,270 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-07-22 00:46:22,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 00:46:22,270 INFO L85 PathProgramCache]: Analyzing trace with hash 840195126, now seen corresponding path program 1 times [2022-07-22 00:46:22,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 00:46:22,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135390717] [2022-07-22 00:46:22,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:46:22,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 00:46:22,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:22,337 INFO L134 CoverageAnalysis]: Checked inductivity of 1164 backedges. 700 proven. 0 refuted. 0 times theorem prover too weak. 464 trivial. 0 not checked. [2022-07-22 00:46:22,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 00:46:22,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135390717] [2022-07-22 00:46:22,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135390717] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 00:46:22,338 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 00:46:22,338 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 00:46:22,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456325652] [2022-07-22 00:46:22,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 00:46:22,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 00:46:22,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 00:46:22,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 00:46:22,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 00:46:22,340 INFO L87 Difference]: Start difference. First operand 546 states and 741 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 00:46:22,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 00:46:22,457 INFO L93 Difference]: Finished difference Result 1120 states and 1513 transitions. [2022-07-22 00:46:22,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 00:46:22,458 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 340 [2022-07-22 00:46:22,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 00:46:22,460 INFO L225 Difference]: With dead ends: 1120 [2022-07-22 00:46:22,460 INFO L226 Difference]: Without dead ends: 582 [2022-07-22 00:46:22,461 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 00:46:22,462 INFO L413 NwaCegarLoop]: 193 mSDtfsCounter, 11 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 00:46:22,462 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 292 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 00:46:22,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2022-07-22 00:46:22,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 580. [2022-07-22 00:46:22,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 580 states, 578 states have (on average 1.3494809688581315) internal successors, (780), 579 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 00:46:22,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 780 transitions. [2022-07-22 00:46:22,488 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 780 transitions. Word has length 340 [2022-07-22 00:46:22,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 00:46:22,489 INFO L495 AbstractCegarLoop]: Abstraction has 580 states and 780 transitions. [2022-07-22 00:46:22,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 00:46:22,489 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 780 transitions. [2022-07-22 00:46:22,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2022-07-22 00:46:22,493 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 00:46:22,494 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 5, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 00:46:22,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-07-22 00:46:22,494 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-07-22 00:46:22,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 00:46:22,496 INFO L85 PathProgramCache]: Analyzing trace with hash 299615116, now seen corresponding path program 1 times [2022-07-22 00:46:22,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 00:46:22,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980469047] [2022-07-22 00:46:22,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:46:22,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 00:46:22,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:22,560 INFO L134 CoverageAnalysis]: Checked inductivity of 1424 backedges. 824 proven. 0 refuted. 0 times theorem prover too weak. 600 trivial. 0 not checked. [2022-07-22 00:46:22,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 00:46:22,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980469047] [2022-07-22 00:46:22,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980469047] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 00:46:22,560 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 00:46:22,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 00:46:22,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814616512] [2022-07-22 00:46:22,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 00:46:22,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 00:46:22,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 00:46:22,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 00:46:22,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 00:46:22,562 INFO L87 Difference]: Start difference. First operand 580 states and 780 transitions. Second operand has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 00:46:22,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 00:46:22,688 INFO L93 Difference]: Finished difference Result 1190 states and 1595 transitions. [2022-07-22 00:46:22,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 00:46:22,689 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 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 371 [2022-07-22 00:46:22,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 00:46:22,691 INFO L225 Difference]: With dead ends: 1190 [2022-07-22 00:46:22,691 INFO L226 Difference]: Without dead ends: 618 [2022-07-22 00:46:22,692 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 00:46:22,693 INFO L413 NwaCegarLoop]: 193 mSDtfsCounter, 11 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 00:46:22,693 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 292 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 00:46:22,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2022-07-22 00:46:22,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 616. [2022-07-22 00:46:22,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 616 states, 614 states have (on average 1.3371335504885993) internal successors, (821), 615 states have internal predecessors, (821), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 00:46:22,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 821 transitions. [2022-07-22 00:46:22,720 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 821 transitions. Word has length 371 [2022-07-22 00:46:22,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 00:46:22,721 INFO L495 AbstractCegarLoop]: Abstraction has 616 states and 821 transitions. [2022-07-22 00:46:22,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 00:46:22,721 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 821 transitions. [2022-07-22 00:46:22,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 405 [2022-07-22 00:46:22,727 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 00:46:22,727 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 11, 11, 10, 10, 9, 9, 8, 8, 8, 8, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 00:46:22,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-07-22 00:46:22,727 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-07-22 00:46:22,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 00:46:22,728 INFO L85 PathProgramCache]: Analyzing trace with hash 521510171, now seen corresponding path program 1 times [2022-07-22 00:46:22,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 00:46:22,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231250628] [2022-07-22 00:46:22,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:46:22,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 00:46:22,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:22,801 INFO L134 CoverageAnalysis]: Checked inductivity of 1719 backedges. 970 proven. 0 refuted. 0 times theorem prover too weak. 749 trivial. 0 not checked. [2022-07-22 00:46:22,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 00:46:22,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231250628] [2022-07-22 00:46:22,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231250628] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 00:46:22,801 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 00:46:22,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 00:46:22,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719588641] [2022-07-22 00:46:22,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 00:46:22,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 00:46:22,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 00:46:22,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 00:46:22,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 00:46:22,803 INFO L87 Difference]: Start difference. First operand 616 states and 821 transitions. Second operand has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 00:46:22,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 00:46:22,849 INFO L93 Difference]: Finished difference Result 1635 states and 2161 transitions. [2022-07-22 00:46:22,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 00:46:22,850 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 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 404 [2022-07-22 00:46:22,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 00:46:22,854 INFO L225 Difference]: With dead ends: 1635 [2022-07-22 00:46:22,854 INFO L226 Difference]: Without dead ends: 1027 [2022-07-22 00:46:22,855 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 00:46:22,855 INFO L413 NwaCegarLoop]: 217 mSDtfsCounter, 63 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 00:46:22,856 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 391 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 00:46:22,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1027 states. [2022-07-22 00:46:22,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1027 to 1027. [2022-07-22 00:46:22,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1027 states, 1025 states have (on average 1.3151219512195123) internal successors, (1348), 1026 states have internal predecessors, (1348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 00:46:22,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1027 states to 1027 states and 1348 transitions. [2022-07-22 00:46:22,906 INFO L78 Accepts]: Start accepts. Automaton has 1027 states and 1348 transitions. Word has length 404 [2022-07-22 00:46:22,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 00:46:22,907 INFO L495 AbstractCegarLoop]: Abstraction has 1027 states and 1348 transitions. [2022-07-22 00:46:22,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 00:46:22,907 INFO L276 IsEmpty]: Start isEmpty. Operand 1027 states and 1348 transitions. [2022-07-22 00:46:22,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 405 [2022-07-22 00:46:22,913 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 00:46:22,914 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 11, 11, 10, 10, 9, 9, 8, 8, 8, 8, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 00:46:22,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-07-22 00:46:22,914 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-07-22 00:46:22,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 00:46:22,915 INFO L85 PathProgramCache]: Analyzing trace with hash 810329561, now seen corresponding path program 1 times [2022-07-22 00:46:22,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 00:46:22,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683090919] [2022-07-22 00:46:22,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:46:22,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 00:46:22,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:22,989 INFO L134 CoverageAnalysis]: Checked inductivity of 1719 backedges. 354 proven. 7 refuted. 0 times theorem prover too weak. 1358 trivial. 0 not checked. [2022-07-22 00:46:22,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 00:46:22,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683090919] [2022-07-22 00:46:22,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683090919] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 00:46:22,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1572803029] [2022-07-22 00:46:22,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:46:22,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 00:46:22,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 00:46:22,991 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 00:46:23,010 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-22 00:46:23,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:23,133 INFO L263 TraceCheckSpWp]: Trace formula consists of 663 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-22 00:46:23,143 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 00:46:23,214 INFO L134 CoverageAnalysis]: Checked inductivity of 1719 backedges. 354 proven. 7 refuted. 0 times theorem prover too weak. 1358 trivial. 0 not checked. [2022-07-22 00:46:23,214 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 00:46:23,270 INFO L134 CoverageAnalysis]: Checked inductivity of 1719 backedges. 354 proven. 7 refuted. 0 times theorem prover too weak. 1358 trivial. 0 not checked. [2022-07-22 00:46:23,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1572803029] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 00:46:23,271 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 00:46:23,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2022-07-22 00:46:23,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357708043] [2022-07-22 00:46:23,271 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 00:46:23,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-22 00:46:23,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 00:46:23,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-22 00:46:23,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-07-22 00:46:23,294 INFO L87 Difference]: Start difference. First operand 1027 states and 1348 transitions. Second operand has 8 states, 8 states have (on average 27.875) internal successors, (223), 8 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 00:46:23,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 00:46:23,561 INFO L93 Difference]: Finished difference Result 2364 states and 3119 transitions. [2022-07-22 00:46:23,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 00:46:23,562 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 27.875) internal successors, (223), 8 states have internal predecessors, (223), 0 states have call successors, (0), 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 404 [2022-07-22 00:46:23,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 00:46:23,563 INFO L225 Difference]: With dead ends: 2364 [2022-07-22 00:46:23,563 INFO L226 Difference]: Without dead ends: 0 [2022-07-22 00:46:23,565 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 812 GetRequests, 805 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-22 00:46:23,566 INFO L413 NwaCegarLoop]: 267 mSDtfsCounter, 99 mSDsluCounter, 721 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 988 SdHoareTripleChecker+Invalid, 446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-22 00:46:23,566 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 988 Invalid, 446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-22 00:46:23,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-22 00:46:23,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-22 00:46:23,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 00:46:23,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-22 00:46:23,567 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 404 [2022-07-22 00:46:23,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 00:46:23,568 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-22 00:46:23,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 27.875) internal successors, (223), 8 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 00:46:23,580 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-22 00:46:23,580 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-22 00:46:23,582 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2022-07-22 00:46:23,583 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2022-07-22 00:46:23,583 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2022-07-22 00:46:23,583 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2022-07-22 00:46:23,611 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-22 00:46:23,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 00:46:23,805 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-22 00:46:32,262 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 270) no Hoare annotation was computed. [2022-07-22 00:46:32,263 INFO L899 garLoopResultBuilder]: For program point L465(lines 465 469) no Hoare annotation was computed. [2022-07-22 00:46:32,263 INFO L899 garLoopResultBuilder]: For program point L268(line 268) no Hoare annotation was computed. [2022-07-22 00:46:32,263 INFO L899 garLoopResultBuilder]: For program point L268-1(line 268) no Hoare annotation was computed. [2022-07-22 00:46:32,263 INFO L899 garLoopResultBuilder]: For program point L202(lines 202 608) no Hoare annotation was computed. [2022-07-22 00:46:32,263 INFO L899 garLoopResultBuilder]: For program point L169(lines 169 619) no Hoare annotation was computed. [2022-07-22 00:46:32,264 INFO L899 garLoopResultBuilder]: For program point L136(lines 136 630) no Hoare annotation was computed. [2022-07-22 00:46:32,264 INFO L902 garLoopResultBuilder]: At program point L698(lines 689 700) the Hoare annotation is: true [2022-07-22 00:46:32,264 INFO L899 garLoopResultBuilder]: For program point L335(lines 335 339) no Hoare annotation was computed. [2022-07-22 00:46:32,264 INFO L899 garLoopResultBuilder]: For program point L270(line 270) no Hoare annotation was computed. [2022-07-22 00:46:32,264 INFO L899 garLoopResultBuilder]: For program point L270-1(line 270) no Hoare annotation was computed. [2022-07-22 00:46:32,264 INFO L895 garLoopResultBuilder]: At program point L601(lines 109 669) the Hoare annotation is: (let ((.cse6 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse7 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse11 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8528))) (.cse13 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8512))) (.cse14 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse4 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse5 (not (= 8192 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse8 (not (= 8513 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse9 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse10 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8195))) (.cse12 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8529))) (.cse15 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) (.cse0 (not (= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse19 (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse20 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse16 (<= 8576 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|)) (.cse17 (< |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 12292)) (.cse21 (not (<= 12292 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse18 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (.cse22 (<= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= 3 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse16 .cse17 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse18 .cse14 .cse15) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse16 .cse8 .cse9 .cse10 .cse11 .cse12 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576) .cse13 .cse14 .cse15) (and (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse8 .cse9 .cse10 .cse12 .cse15) (and .cse19 .cse0 .cse20 .cse21 .cse22) (and .cse19 .cse20 .cse21 .cse18 .cse22) (and .cse16 .cse17 .cse21 .cse18 .cse22))) [2022-07-22 00:46:32,265 INFO L899 garLoopResultBuilder]: For program point L568(lines 568 572) no Hoare annotation was computed. [2022-07-22 00:46:32,265 INFO L899 garLoopResultBuilder]: For program point L436(lines 436 440) no Hoare annotation was computed. [2022-07-22 00:46:32,265 INFO L895 garLoopResultBuilder]: At program point L370(lines 352 388) the Hoare annotation is: (and (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481)) (not (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8192)) (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= 8513 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8195)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8512)) (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) [2022-07-22 00:46:32,265 INFO L899 garLoopResultBuilder]: For program point L205(lines 205 607) no Hoare annotation was computed. [2022-07-22 00:46:32,265 INFO L899 garLoopResultBuilder]: For program point L172(lines 172 618) no Hoare annotation was computed. [2022-07-22 00:46:32,266 INFO L899 garLoopResultBuilder]: For program point L139(lines 139 629) no Hoare annotation was computed. [2022-07-22 00:46:32,266 INFO L899 garLoopResultBuilder]: For program point L536(lines 536 540) no Hoare annotation was computed. [2022-07-22 00:46:32,266 INFO L899 garLoopResultBuilder]: For program point L470(lines 470 481) no Hoare annotation was computed. [2022-07-22 00:46:32,266 INFO L899 garLoopResultBuilder]: For program point L536-2(lines 219 600) no Hoare annotation was computed. [2022-07-22 00:46:32,266 INFO L895 garLoopResultBuilder]: At program point L404(lines 395 426) the Hoare annotation is: (and (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481)) (not (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8192)) (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= 8513 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8195)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8528)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8529)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8512)) (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) [2022-07-22 00:46:32,266 INFO L899 garLoopResultBuilder]: For program point L239(lines 239 250) no Hoare annotation was computed. [2022-07-22 00:46:32,266 INFO L895 garLoopResultBuilder]: At program point L206(lines 202 608) the Hoare annotation is: (let ((.cse0 (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse2 (not (<= 12292 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse3 (<= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (or (and .cse0 (not (= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|)) .cse3))) [2022-07-22 00:46:32,266 INFO L895 garLoopResultBuilder]: At program point L173(lines 169 619) the Hoare annotation is: (and (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481)) (not (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8192)) (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= 8513 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8195)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8528)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8529)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8512)) (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) [2022-07-22 00:46:32,266 INFO L899 garLoopResultBuilder]: For program point L239-2(lines 239 250) no Hoare annotation was computed. [2022-07-22 00:46:32,267 INFO L899 garLoopResultBuilder]: For program point L372(lines 372 376) no Hoare annotation was computed. [2022-07-22 00:46:32,267 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 270) no Hoare annotation was computed. [2022-07-22 00:46:32,267 INFO L902 garLoopResultBuilder]: At program point L670(lines 108 671) the Hoare annotation is: true [2022-07-22 00:46:32,267 INFO L899 garLoopResultBuilder]: For program point L406(lines 406 412) no Hoare annotation was computed. [2022-07-22 00:46:32,267 INFO L899 garLoopResultBuilder]: For program point L241(lines 241 246) no Hoare annotation was computed. [2022-07-22 00:46:32,267 INFO L899 garLoopResultBuilder]: For program point L208(lines 208 606) no Hoare annotation was computed. [2022-07-22 00:46:32,268 INFO L899 garLoopResultBuilder]: For program point L175(lines 175 617) no Hoare annotation was computed. [2022-07-22 00:46:32,268 INFO L899 garLoopResultBuilder]: For program point L142(lines 142 628) no Hoare annotation was computed. [2022-07-22 00:46:32,268 INFO L895 garLoopResultBuilder]: At program point L109-2(lines 109 669) the Hoare annotation is: (let ((.cse6 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse7 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse11 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8528))) (.cse13 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8512))) (.cse14 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse4 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse5 (not (= 8192 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse8 (not (= 8513 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse9 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse10 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8195))) (.cse12 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8529))) (.cse15 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) (.cse0 (not (= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse19 (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse20 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse16 (<= 8576 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|)) (.cse17 (< |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 12292)) (.cse21 (not (<= 12292 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse18 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (.cse22 (<= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= 3 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse16 .cse17 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse18 .cse14 .cse15) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse16 .cse8 .cse9 .cse10 .cse11 .cse12 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576) .cse13 .cse14 .cse15) (and (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse8 .cse9 .cse10 .cse12 .cse15) (and .cse19 .cse0 .cse20 .cse21 .cse22) (and .cse19 .cse20 .cse21 .cse18 .cse22) (and .cse16 .cse17 .cse21 .cse18 .cse22))) [2022-07-22 00:46:32,268 INFO L895 garLoopResultBuilder]: At program point L176(lines 175 617) the Hoare annotation is: (let ((.cse0 (not (= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse4 (not (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8192))) (.cse5 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse6 (not (= 8192 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse7 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse8 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse9 (<= 8576 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|)) (.cse10 (not (= 8513 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse11 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse12 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8195))) (.cse13 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8528))) (.cse14 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8529))) (.cse15 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8512))) (.cse16 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse17 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576) .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 (< 8192 |ULTIMATE.start_ssl3_accept_~s__state~0#1|) (= 3 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (< |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 12292) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|)) .cse16 .cse17))) [2022-07-22 00:46:32,269 INFO L895 garLoopResultBuilder]: At program point L143(lines 136 630) the Hoare annotation is: (let ((.cse0 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse4 (not (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8192))) (.cse5 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse6 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse7 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse8 (not (= 8513 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse9 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse10 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8195))) (.cse11 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8528))) (.cse12 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8529))) (.cse13 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8512))) (.cse14 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse15 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|)) .cse14 .cse15) (and .cse0 (not (= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2022-07-22 00:46:32,269 INFO L899 garLoopResultBuilder]: For program point L110(line 110) no Hoare annotation was computed. [2022-07-22 00:46:32,269 INFO L899 garLoopResultBuilder]: For program point L639(lines 639 667) no Hoare annotation was computed. [2022-07-22 00:46:32,269 INFO L899 garLoopResultBuilder]: For program point L474(lines 474 478) no Hoare annotation was computed. [2022-07-22 00:46:32,269 INFO L899 garLoopResultBuilder]: For program point L640(lines 640 664) no Hoare annotation was computed. [2022-07-22 00:46:32,269 INFO L899 garLoopResultBuilder]: For program point L574(lines 574 578) no Hoare annotation was computed. [2022-07-22 00:46:32,269 INFO L899 garLoopResultBuilder]: For program point L508(lines 508 512) no Hoare annotation was computed. [2022-07-22 00:46:32,269 INFO L899 garLoopResultBuilder]: For program point L574-2(lines 574 578) no Hoare annotation was computed. [2022-07-22 00:46:32,270 INFO L899 garLoopResultBuilder]: For program point L508-2(lines 219 600) no Hoare annotation was computed. [2022-07-22 00:46:32,270 INFO L899 garLoopResultBuilder]: For program point L211(lines 211 605) no Hoare annotation was computed. [2022-07-22 00:46:32,270 INFO L899 garLoopResultBuilder]: For program point L178(lines 178 616) no Hoare annotation was computed. [2022-07-22 00:46:32,270 INFO L899 garLoopResultBuilder]: For program point L145(lines 145 627) no Hoare annotation was computed. [2022-07-22 00:46:32,270 INFO L899 garLoopResultBuilder]: For program point L112(lines 112 638) no Hoare annotation was computed. [2022-07-22 00:46:32,270 INFO L899 garLoopResultBuilder]: For program point L674(lines 674 678) no Hoare annotation was computed. [2022-07-22 00:46:32,270 INFO L899 garLoopResultBuilder]: For program point L641(lines 641 650) no Hoare annotation was computed. [2022-07-22 00:46:32,271 INFO L899 garLoopResultBuilder]: For program point L674-2(lines 674 678) no Hoare annotation was computed. [2022-07-22 00:46:32,271 INFO L899 garLoopResultBuilder]: For program point L641-2(lines 640 662) no Hoare annotation was computed. [2022-07-22 00:46:32,271 INFO L899 garLoopResultBuilder]: For program point L278(lines 278 282) no Hoare annotation was computed. [2022-07-22 00:46:32,271 INFO L895 garLoopResultBuilder]: At program point L212(lines 208 606) the Hoare annotation is: (let ((.cse0 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse1 (not (<= 12292 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656))) (.cse3 (<= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (or (and .cse0 .cse1 .cse2 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|)) .cse3) (and (not (= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) .cse0 .cse1 .cse2 .cse3))) [2022-07-22 00:46:32,271 INFO L895 garLoopResultBuilder]: At program point L113(lines 112 638) the Hoare annotation is: false [2022-07-22 00:46:32,271 INFO L899 garLoopResultBuilder]: For program point L312(lines 312 316) no Hoare annotation was computed. [2022-07-22 00:46:32,272 INFO L899 garLoopResultBuilder]: For program point L312-2(lines 219 600) no Hoare annotation was computed. [2022-07-22 00:46:32,272 INFO L899 garLoopResultBuilder]: For program point L643(lines 643 647) no Hoare annotation was computed. [2022-07-22 00:46:32,272 INFO L899 garLoopResultBuilder]: For program point L214(lines 214 604) no Hoare annotation was computed. [2022-07-22 00:46:32,272 INFO L899 garLoopResultBuilder]: For program point L181(lines 181 615) no Hoare annotation was computed. [2022-07-22 00:46:32,272 INFO L899 garLoopResultBuilder]: For program point L148(lines 148 626) no Hoare annotation was computed. [2022-07-22 00:46:32,272 INFO L899 garLoopResultBuilder]: For program point L115(lines 115 637) no Hoare annotation was computed. [2022-07-22 00:46:32,272 INFO L899 garLoopResultBuilder]: For program point L347(lines 347 351) no Hoare annotation was computed. [2022-07-22 00:46:32,273 INFO L899 garLoopResultBuilder]: For program point L347-2(lines 219 600) no Hoare annotation was computed. [2022-07-22 00:46:32,273 INFO L895 garLoopResultBuilder]: At program point L215(lines 214 604) the Hoare annotation is: (not (= 12292 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) [2022-07-22 00:46:32,273 INFO L895 garLoopResultBuilder]: At program point L182(lines 178 616) the Hoare annotation is: (and (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) (not (<= 12292 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656)) (<= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) [2022-07-22 00:46:32,273 INFO L895 garLoopResultBuilder]: At program point L149(lines 145 627) the Hoare annotation is: (let ((.cse0 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse4 (not (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8192))) (.cse5 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse6 (not (= 8513 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse7 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse8 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8195))) (.cse9 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8528))) (.cse10 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8529))) (.cse11 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8512))) (.cse12 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse13 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|)) .cse12 .cse13) (and .cse0 (not (= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))) [2022-07-22 00:46:32,273 INFO L899 garLoopResultBuilder]: For program point L83(lines 83 91) no Hoare annotation was computed. [2022-07-22 00:46:32,273 INFO L899 garLoopResultBuilder]: For program point L447(lines 447 459) no Hoare annotation was computed. [2022-07-22 00:46:32,274 INFO L895 garLoopResultBuilder]: At program point L414(lines 405 425) the Hoare annotation is: (and (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481)) (not (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8192)) (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= 8513 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8195)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8528)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8529)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8512)) (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) [2022-07-22 00:46:32,274 INFO L899 garLoopResultBuilder]: For program point L447-2(lines 447 459) no Hoare annotation was computed. [2022-07-22 00:46:32,274 INFO L899 garLoopResultBuilder]: For program point L184(lines 184 614) no Hoare annotation was computed. [2022-07-22 00:46:32,274 INFO L899 garLoopResultBuilder]: For program point L151(lines 151 625) no Hoare annotation was computed. [2022-07-22 00:46:32,274 INFO L899 garLoopResultBuilder]: For program point L118(lines 118 636) no Hoare annotation was computed. [2022-07-22 00:46:32,274 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-22 00:46:32,275 INFO L895 garLoopResultBuilder]: At program point L218(lines 217 603) the Hoare annotation is: (not (= 12292 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) [2022-07-22 00:46:32,275 INFO L899 garLoopResultBuilder]: For program point L86(lines 86 90) no Hoare annotation was computed. [2022-07-22 00:46:32,275 INFO L899 garLoopResultBuilder]: For program point L86-2(lines 83 91) no Hoare annotation was computed. [2022-07-22 00:46:32,275 INFO L899 garLoopResultBuilder]: For program point L549(lines 549 554) no Hoare annotation was computed. [2022-07-22 00:46:32,275 INFO L899 garLoopResultBuilder]: For program point L450(lines 450 455) no Hoare annotation was computed. [2022-07-22 00:46:32,275 INFO L899 garLoopResultBuilder]: For program point L417(lines 417 421) no Hoare annotation was computed. [2022-07-22 00:46:32,275 INFO L899 garLoopResultBuilder]: For program point L252(lines 252 257) no Hoare annotation was computed. [2022-07-22 00:46:32,275 INFO L899 garLoopResultBuilder]: For program point L187(lines 187 613) no Hoare annotation was computed. [2022-07-22 00:46:32,276 INFO L899 garLoopResultBuilder]: For program point L154(lines 154 624) no Hoare annotation was computed. [2022-07-22 00:46:32,276 INFO L899 garLoopResultBuilder]: For program point L121(lines 121 635) no Hoare annotation was computed. [2022-07-22 00:46:32,276 INFO L899 garLoopResultBuilder]: For program point L584(lines 584 594) no Hoare annotation was computed. [2022-07-22 00:46:32,276 INFO L899 garLoopResultBuilder]: For program point L584-1(lines 584 594) no Hoare annotation was computed. [2022-07-22 00:46:32,276 INFO L899 garLoopResultBuilder]: For program point L518(lines 518 522) no Hoare annotation was computed. [2022-07-22 00:46:32,276 INFO L899 garLoopResultBuilder]: For program point L518-2(lines 518 522) no Hoare annotation was computed. [2022-07-22 00:46:32,277 INFO L895 garLoopResultBuilder]: At program point L188(lines 184 614) the Hoare annotation is: (let ((.cse0 (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse3 (not (<= 12292 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656))) (.cse5 (<= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (or (and .cse0 (not (= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse4 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|)) .cse5))) [2022-07-22 00:46:32,277 INFO L895 garLoopResultBuilder]: At program point L155(lines 151 625) the Hoare annotation is: (and (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481)) (not (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8192)) (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8195)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8528)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8529)) (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) [2022-07-22 00:46:32,277 INFO L899 garLoopResultBuilder]: For program point L486(lines 486 490) no Hoare annotation was computed. [2022-07-22 00:46:32,277 INFO L895 garLoopResultBuilder]: At program point L222(lines 115 637) the Hoare annotation is: false [2022-07-22 00:46:32,277 INFO L902 garLoopResultBuilder]: At program point L685(lines 75 687) the Hoare annotation is: true [2022-07-22 00:46:32,277 INFO L899 garLoopResultBuilder]: For program point L652(lines 652 658) no Hoare annotation was computed. [2022-07-22 00:46:32,277 INFO L899 garLoopResultBuilder]: For program point L355(lines 355 387) no Hoare annotation was computed. [2022-07-22 00:46:32,278 INFO L899 garLoopResultBuilder]: For program point L322(lines 322 326) no Hoare annotation was computed. [2022-07-22 00:46:32,278 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-22 00:46:32,278 INFO L899 garLoopResultBuilder]: For program point L322-2(lines 322 326) no Hoare annotation was computed. [2022-07-22 00:46:32,278 INFO L899 garLoopResultBuilder]: For program point L190(lines 190 612) no Hoare annotation was computed. [2022-07-22 00:46:32,278 INFO L899 garLoopResultBuilder]: For program point L157(lines 157 623) no Hoare annotation was computed. [2022-07-22 00:46:32,278 INFO L899 garLoopResultBuilder]: For program point L124(lines 124 634) no Hoare annotation was computed. [2022-07-22 00:46:32,278 INFO L902 garLoopResultBuilder]: At program point L686(lines 20 688) the Hoare annotation is: true [2022-07-22 00:46:32,279 INFO L899 garLoopResultBuilder]: For program point L587(lines 587 591) no Hoare annotation was computed. [2022-07-22 00:46:32,279 INFO L899 garLoopResultBuilder]: For program point L93(lines 93 101) no Hoare annotation was computed. [2022-07-22 00:46:32,279 INFO L899 garLoopResultBuilder]: For program point L93-1(lines 75 687) no Hoare annotation was computed. [2022-07-22 00:46:32,279 INFO L899 garLoopResultBuilder]: For program point L358(lines 358 386) no Hoare annotation was computed. [2022-07-22 00:46:32,279 INFO L899 garLoopResultBuilder]: For program point L358-1(lines 358 386) no Hoare annotation was computed. [2022-07-22 00:46:32,279 INFO L899 garLoopResultBuilder]: For program point L259(lines 259 272) no Hoare annotation was computed. [2022-07-22 00:46:32,279 INFO L899 garLoopResultBuilder]: For program point L193(lines 193 611) no Hoare annotation was computed. [2022-07-22 00:46:32,280 INFO L899 garLoopResultBuilder]: For program point L160(lines 160 622) no Hoare annotation was computed. [2022-07-22 00:46:32,280 INFO L899 garLoopResultBuilder]: For program point L127(lines 127 633) no Hoare annotation was computed. [2022-07-22 00:46:32,280 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 268) no Hoare annotation was computed. [2022-07-22 00:46:32,280 INFO L899 garLoopResultBuilder]: For program point L94(lines 94 98) no Hoare annotation was computed. [2022-07-22 00:46:32,280 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-22 00:46:32,280 INFO L899 garLoopResultBuilder]: For program point L359(lines 359 383) no Hoare annotation was computed. [2022-07-22 00:46:32,281 INFO L899 garLoopResultBuilder]: For program point L227(lines 227 231) no Hoare annotation was computed. [2022-07-22 00:46:32,281 INFO L895 garLoopResultBuilder]: At program point L194(lines 190 612) the Hoare annotation is: (let ((.cse0 (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse3 (not (<= 12292 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656))) (.cse5 (<= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (or (and .cse0 (not (= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse4 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|)) .cse5))) [2022-07-22 00:46:32,281 INFO L895 garLoopResultBuilder]: At program point L161(lines 157 623) the Hoare annotation is: (and (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481)) (not (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8192)) (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= 8513 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8195)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8512)) (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) [2022-07-22 00:46:32,281 INFO L899 garLoopResultBuilder]: For program point L227-2(lines 219 600) no Hoare annotation was computed. [2022-07-22 00:46:32,281 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 268) no Hoare annotation was computed. [2022-07-22 00:46:32,281 INFO L899 garLoopResultBuilder]: For program point L261(lines 261 266) no Hoare annotation was computed. [2022-07-22 00:46:32,282 INFO L899 garLoopResultBuilder]: For program point L559(lines 559 567) no Hoare annotation was computed. [2022-07-22 00:46:32,282 INFO L899 garLoopResultBuilder]: For program point L295(lines 295 299) no Hoare annotation was computed. [2022-07-22 00:46:32,282 INFO L899 garLoopResultBuilder]: For program point L295-2(lines 219 600) no Hoare annotation was computed. [2022-07-22 00:46:32,282 INFO L899 garLoopResultBuilder]: For program point L196(lines 196 610) no Hoare annotation was computed. [2022-07-22 00:46:32,282 INFO L899 garLoopResultBuilder]: For program point L163(lines 163 621) no Hoare annotation was computed. [2022-07-22 00:46:32,282 INFO L899 garLoopResultBuilder]: For program point L130(lines 130 632) no Hoare annotation was computed. [2022-07-22 00:46:32,282 INFO L899 garLoopResultBuilder]: For program point L395(lines 395 426) no Hoare annotation was computed. [2022-07-22 00:46:32,283 INFO L899 garLoopResultBuilder]: For program point L362(lines 362 382) no Hoare annotation was computed. [2022-07-22 00:46:32,283 INFO L895 garLoopResultBuilder]: At program point L131(lines 127 633) the Hoare annotation is: false [2022-07-22 00:46:32,283 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-22 00:46:32,283 INFO L899 garLoopResultBuilder]: For program point L396(lines 396 402) no Hoare annotation was computed. [2022-07-22 00:46:32,283 INFO L899 garLoopResultBuilder]: For program point L562(lines 562 566) no Hoare annotation was computed. [2022-07-22 00:46:32,283 INFO L899 garLoopResultBuilder]: For program point L529(lines 529 534) no Hoare annotation was computed. [2022-07-22 00:46:32,283 INFO L899 garLoopResultBuilder]: For program point L364(lines 364 368) no Hoare annotation was computed. [2022-07-22 00:46:32,284 INFO L899 garLoopResultBuilder]: For program point L331-1(lines 331 340) no Hoare annotation was computed. [2022-07-22 00:46:32,284 INFO L899 garLoopResultBuilder]: For program point L364-2(lines 362 380) no Hoare annotation was computed. [2022-07-22 00:46:32,284 INFO L899 garLoopResultBuilder]: For program point L199(lines 199 609) no Hoare annotation was computed. [2022-07-22 00:46:32,284 INFO L899 garLoopResultBuilder]: For program point L166(lines 166 620) no Hoare annotation was computed. [2022-07-22 00:46:32,284 INFO L899 garLoopResultBuilder]: For program point L133(lines 133 631) no Hoare annotation was computed. [2022-07-22 00:46:32,284 INFO L895 garLoopResultBuilder]: At program point L563(lines 75 687) the Hoare annotation is: (not (= 12292 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) [2022-07-22 00:46:32,284 INFO L899 garLoopResultBuilder]: For program point L497(lines 497 501) no Hoare annotation was computed. [2022-07-22 00:46:32,285 INFO L895 garLoopResultBuilder]: At program point L200(lines 196 610) the Hoare annotation is: (let ((.cse0 (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse3 (not (<= 12292 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656))) (.cse5 (<= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (or (and .cse0 (not (= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse4 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|)) .cse5))) [2022-07-22 00:46:32,285 INFO L895 garLoopResultBuilder]: At program point L167(lines 163 621) the Hoare annotation is: (and (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481)) (not (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8192)) (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= 8513 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8195)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8528)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8529)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8512)) (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) [2022-07-22 00:46:32,285 INFO L895 garLoopResultBuilder]: At program point L134(lines 133 631) the Hoare annotation is: (let ((.cse0 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse4 (not (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8192))) (.cse5 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse6 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse7 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse8 (not (= 8513 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse9 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse10 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8195))) (.cse11 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8528))) (.cse12 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8529))) (.cse13 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8512))) (.cse14 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse15 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|)) .cse14 .cse15) (and .cse0 (not (= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2022-07-22 00:46:32,288 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 00:46:32,290 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-22 00:46:32,318 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.07 12:46:32 BoogieIcfgContainer [2022-07-22 00:46:32,318 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-22 00:46:32,319 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-22 00:46:32,319 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-22 00:46:32,319 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-22 00:46:32,320 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 12:46:15" (3/4) ... [2022-07-22 00:46:32,322 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-22 00:46:32,336 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2022-07-22 00:46:32,337 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-07-22 00:46:32,338 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-07-22 00:46:32,339 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-22 00:46:32,400 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-22 00:46:32,400 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-22 00:46:32,400 INFO L158 Benchmark]: Toolchain (without parser) took 18300.17ms. Allocated memory was 54.5MB in the beginning and 211.8MB in the end (delta: 157.3MB). Free memory was 34.9MB in the beginning and 74.9MB in the end (delta: -40.0MB). Peak memory consumption was 117.2MB. Max. memory is 16.1GB. [2022-07-22 00:46:32,401 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 44.0MB. Free memory was 26.3MB in the beginning and 26.3MB in the end (delta: 41.7kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 00:46:32,401 INFO L158 Benchmark]: CACSL2BoogieTranslator took 434.46ms. Allocated memory is still 54.5MB. Free memory was 34.7MB in the beginning and 33.4MB in the end (delta: 1.2MB). Peak memory consumption was 9.1MB. Max. memory is 16.1GB. [2022-07-22 00:46:32,401 INFO L158 Benchmark]: Boogie Procedure Inliner took 75.16ms. Allocated memory is still 54.5MB. Free memory was 33.4MB in the beginning and 30.6MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-22 00:46:32,401 INFO L158 Benchmark]: Boogie Preprocessor took 53.39ms. Allocated memory is still 54.5MB. Free memory was 30.6MB in the beginning and 28.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-22 00:46:32,402 INFO L158 Benchmark]: RCFGBuilder took 736.53ms. Allocated memory was 54.5MB in the beginning and 67.1MB in the end (delta: 12.6MB). Free memory was 28.4MB in the beginning and 33.4MB in the end (delta: -5.0MB). Peak memory consumption was 9.4MB. Max. memory is 16.1GB. [2022-07-22 00:46:32,402 INFO L158 Benchmark]: TraceAbstraction took 16914.46ms. Allocated memory was 67.1MB in the beginning and 211.8MB in the end (delta: 144.7MB). Free memory was 32.8MB in the beginning and 82.2MB in the end (delta: -49.4MB). Peak memory consumption was 115.6MB. Max. memory is 16.1GB. [2022-07-22 00:46:32,402 INFO L158 Benchmark]: Witness Printer took 81.05ms. Allocated memory is still 211.8MB. Free memory was 82.2MB in the beginning and 74.9MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-22 00:46:32,403 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.20ms. Allocated memory is still 44.0MB. Free memory was 26.3MB in the beginning and 26.3MB in the end (delta: 41.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 434.46ms. Allocated memory is still 54.5MB. Free memory was 34.7MB in the beginning and 33.4MB in the end (delta: 1.2MB). Peak memory consumption was 9.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 75.16ms. Allocated memory is still 54.5MB. Free memory was 33.4MB in the beginning and 30.6MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 53.39ms. Allocated memory is still 54.5MB. Free memory was 30.6MB in the beginning and 28.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 736.53ms. Allocated memory was 54.5MB in the beginning and 67.1MB in the end (delta: 12.6MB). Free memory was 28.4MB in the beginning and 33.4MB in the end (delta: -5.0MB). Peak memory consumption was 9.4MB. Max. memory is 16.1GB. * TraceAbstraction took 16914.46ms. Allocated memory was 67.1MB in the beginning and 211.8MB in the end (delta: 144.7MB). Free memory was 32.8MB in the beginning and 82.2MB in the end (delta: -49.4MB). Peak memory consumption was 115.6MB. Max. memory is 16.1GB. * Witness Printer took 81.05ms. Allocated memory is still 211.8MB. Free memory was 82.2MB in the beginning and 74.9MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. 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 - PositiveResult [Line: 268]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 268]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 270]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 270]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 147 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 16.8s, OverallIterations: 31, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 4.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 8.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4837 SdHoareTripleChecker+Valid, 3.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4837 mSDsluCounter, 8053 SdHoareTripleChecker+Invalid, 2.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2919 mSDsCounter, 1081 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3704 IncrementalHoareTripleChecker+Invalid, 4785 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1081 mSolverCounterUnsat, 5134 mSDtfsCounter, 3704 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1548 GetRequests, 1497 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1027occurred in iteration=30, InterpolantAutomatonStates: 107, 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, 31 MinimizatonAttempts, 2049 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 29 LocationsWithAnnotation, 29 PreInvPairs, 200 NumberOfFragments, 1950 HoareAnnotationTreeSize, 29 FomulaSimplifications, 128 FormulaSimplificationTreeSizeReduction, 3.1s HoareSimplificationTime, 29 FomulaSimplificationsInter, 396884 FormulaSimplificationTreeSizeReductionInter, 5.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 4811 NumberOfCodeBlocks, 4811 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 5494 ConstructedInterpolants, 0 QuantifiedInterpolants, 8634 SizeOfPredicates, 3 NumberOfNonLiveVariables, 1321 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 37 InterpolantComputations, 28 PerfectInterpolantSequences, 13015/13072 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 - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold - InvariantResult [Line: 196]: Loop Invariant Derived loop invariant: ((((((!(8673 == s__state) && !(8576 == s__state)) && !(s__state == 8657)) && !(s__state == 8672)) && !(12292 <= s__state)) && !(s__state == 8656)) && 8576 <= s__state) || ((((((!(8673 == s__state) && !(s__state == 8657)) && !(s__state == 8672)) && !(12292 <= s__state)) && !(s__state == 8656)) && !(0 == s__hit)) && 8576 <= s__state) - InvariantResult [Line: 208]: Loop Invariant Derived loop invariant: ((((!(s__state == 8657) && !(12292 <= s__state)) && !(s__state == 8656)) && !(0 == s__hit)) && 8576 <= s__state) || ((((!(8576 == s__state) && !(s__state == 8657)) && !(12292 <= s__state)) && !(s__state == 8656)) && 8576 <= s__state) - InvariantResult [Line: 352]: Loop Invariant Derived loop invariant: (((((((((((((!(8448 == s__state) && !(8576 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state <= 8192)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(s__state == 8480)) && !(s__state == 8195)) && !(s__state == 8512)) && !(8560 == s__state)) && s__state <= 8576 - InvariantResult [Line: 217]: Loop Invariant Derived loop invariant: !(12292 == s__state) - InvariantResult [Line: 127]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 112]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 175]: Loop Invariant Derived loop invariant: (((((((((((((((((((!(8576 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state <= 8192)) && !(8497 == s__state)) && !(8192 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && 8576 <= s__s3__tmp__next_state___0) && !(8513 == s__state)) && !(s__state == 8480)) && !(s__state == 8195)) && !(s__state == 8528)) && !(s__state == 8529)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8512)) && !(8560 == s__state)) && s__state <= 8576) || (((((((((((((((((!(8576 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(8497 == s__state)) && !(8192 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && 8192 < s__state) && 3 == s__s3__tmp__next_state___0) && !(8513 == s__state)) && !(s__state == 8480)) && !(s__state == 8195)) && !(s__state == 8528)) && !(s__state == 8529)) && !(s__state == 8512)) && !(8560 == s__state)) && s__state <= 8576)) || ((((((((((((((((((!(s__state == 8561) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state <= 8192)) && !(8497 == s__state)) && !(8192 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && 8576 <= s__s3__tmp__next_state___0) && s__s3__tmp__next_state___0 < 12292) && !(8513 == s__state)) && !(s__state == 8480)) && !(s__state == 8195)) && !(s__state == 8528)) && !(s__state == 8529)) && !(s__state == 8512)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8576) - InvariantResult [Line: 157]: Loop Invariant Derived loop invariant: (((((((((((((!(8448 == s__state) && !(8576 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state <= 8192)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(s__state == 8480)) && !(s__state == 8195)) && !(s__state == 8512)) && !(8560 == s__state)) && s__state <= 8576 - InvariantResult [Line: 151]: Loop Invariant Derived loop invariant: (((((((((((((!(8448 == s__state) && !(8576 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state <= 8192)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8195)) && !(s__state == 8528)) && !(s__state == 8529)) && !(8560 == s__state)) && s__state <= 8576 - InvariantResult [Line: 395]: Loop Invariant Derived loop invariant: (((((((((((((!(8448 == s__state) && !(8576 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state <= 8192)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8513 == s__state)) && !(s__state == 8480)) && !(s__state == 8195)) && !(s__state == 8528)) && !(s__state == 8529)) && !(s__state == 8512)) && !(8560 == s__state)) && s__state <= 8576 - InvariantResult [Line: 108]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 75]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 184]: Loop Invariant Derived loop invariant: ((((((!(8673 == s__state) && !(8576 == s__state)) && !(s__state == 8657)) && !(s__state == 8672)) && !(12292 <= s__state)) && !(s__state == 8656)) && 8576 <= s__state) || ((((((!(8673 == s__state) && !(s__state == 8657)) && !(s__state == 8672)) && !(12292 <= s__state)) && !(s__state == 8656)) && !(0 == s__hit)) && 8576 <= s__state) - InvariantResult [Line: 115]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 133]: Loop Invariant Derived loop invariant: ((((((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state <= 8192)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(s__state == 8480)) && !(s__state == 8195)) && !(s__state == 8528)) && !(s__state == 8529)) && !(s__state == 8512)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8576) || ((((((((((((((((!(8448 == s__state) && !(8576 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state <= 8192)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(s__state == 8480)) && !(s__state == 8195)) && !(s__state == 8528)) && !(s__state == 8529)) && !(s__state == 8512)) && !(8560 == s__state)) && s__state <= 8576) - InvariantResult [Line: 163]: Loop Invariant Derived loop invariant: (((((((((((((!(8448 == s__state) && !(8576 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state <= 8192)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8513 == s__state)) && !(s__state == 8480)) && !(s__state == 8195)) && !(s__state == 8528)) && !(s__state == 8529)) && !(s__state == 8512)) && !(8560 == s__state)) && s__state <= 8576 - InvariantResult [Line: 405]: Loop Invariant Derived loop invariant: (((((((((((((!(8448 == s__state) && !(8576 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state <= 8192)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8513 == s__state)) && !(s__state == 8480)) && !(s__state == 8195)) && !(s__state == 8528)) && !(s__state == 8529)) && !(s__state == 8512)) && !(8560 == s__state)) && s__state <= 8576 - InvariantResult [Line: 169]: Loop Invariant Derived loop invariant: (((((((((((((!(8448 == s__state) && !(8576 == s__state)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state <= 8192)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(s__state == 8480)) && !(s__state == 8195)) && !(s__state == 8528)) && !(s__state == 8529)) && !(s__state == 8512)) && s__state <= 8576 - InvariantResult [Line: 109]: Loop Invariant Derived loop invariant: (((((((((((((((((((((!(8576 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(8497 == s__state)) && !(8192 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && 3 == s__s3__tmp__next_state___0) && !(8513 == s__state)) && !(s__state == 8480)) && !(s__state == 8195)) && !(s__state == 8528)) && !(s__state == 8529)) && !(s__state == 8512)) && !(8560 == s__state)) && s__state <= 8576) || (((((((((((((((((!(s__state == 8561) && !(s__state == 8545)) && !(s__state == 8481)) && !(8497 == s__state)) && !(8192 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && 8576 <= s__s3__tmp__next_state___0) && s__s3__tmp__next_state___0 < 12292) && !(8513 == s__state)) && !(s__state == 8480)) && !(s__state == 8195)) && !(s__state == 8528)) && !(s__state == 8529)) && !(s__state == 8512)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8576)) || ((((((((((((((((!(s__state == 8561) && !(s__state == 8545)) && !(s__state == 8481)) && !(8497 == s__state)) && !(8192 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && 8576 <= s__s3__tmp__next_state___0) && !(8513 == s__state)) && !(s__state == 8480)) && !(s__state == 8195)) && !(s__state == 8528)) && !(s__state == 8529)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8512)) && !(8560 == s__state)) && s__state <= 8576)) || (((((((((((!(8448 == s__state) && !(8576 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(8497 == s__state)) && !(8192 == s__state)) && !(8513 == s__state)) && !(s__state == 8480)) && !(s__state == 8195)) && !(s__state == 8529)) && s__state <= 8576)) || ((((!(8673 == s__state) && !(8576 == s__state)) && !(s__state == 8657)) && !(12292 <= s__state)) && 8576 <= s__state)) || ((((!(8673 == s__state) && !(s__state == 8657)) && !(12292 <= s__state)) && !(0 == s__hit)) && 8576 <= s__state)) || ((((8576 <= s__s3__tmp__next_state___0 && s__s3__tmp__next_state___0 < 12292) && !(12292 <= s__state)) && !(0 == s__hit)) && 8576 <= s__state) - InvariantResult [Line: 145]: Loop Invariant Derived loop invariant: ((((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state <= 8192)) && !(8544 == s__state)) && !(8513 == s__state)) && !(s__state == 8480)) && !(s__state == 8195)) && !(s__state == 8528)) && !(s__state == 8529)) && !(s__state == 8512)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8576) || ((((((((((((((!(8448 == s__state) && !(8576 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state <= 8192)) && !(8544 == s__state)) && !(8513 == s__state)) && !(s__state == 8480)) && !(s__state == 8195)) && !(s__state == 8528)) && !(s__state == 8529)) && !(s__state == 8512)) && !(8560 == s__state)) && s__state <= 8576) - InvariantResult [Line: 109]: Loop Invariant Derived loop invariant: (((((((((((((((((((((!(8576 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(8497 == s__state)) && !(8192 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && 3 == s__s3__tmp__next_state___0) && !(8513 == s__state)) && !(s__state == 8480)) && !(s__state == 8195)) && !(s__state == 8528)) && !(s__state == 8529)) && !(s__state == 8512)) && !(8560 == s__state)) && s__state <= 8576) || (((((((((((((((((!(s__state == 8561) && !(s__state == 8545)) && !(s__state == 8481)) && !(8497 == s__state)) && !(8192 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && 8576 <= s__s3__tmp__next_state___0) && s__s3__tmp__next_state___0 < 12292) && !(8513 == s__state)) && !(s__state == 8480)) && !(s__state == 8195)) && !(s__state == 8528)) && !(s__state == 8529)) && !(s__state == 8512)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8576)) || ((((((((((((((((!(s__state == 8561) && !(s__state == 8545)) && !(s__state == 8481)) && !(8497 == s__state)) && !(8192 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && 8576 <= s__s3__tmp__next_state___0) && !(8513 == s__state)) && !(s__state == 8480)) && !(s__state == 8195)) && !(s__state == 8528)) && !(s__state == 8529)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8512)) && !(8560 == s__state)) && s__state <= 8576)) || (((((((((((!(8448 == s__state) && !(8576 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(8497 == s__state)) && !(8192 == s__state)) && !(8513 == s__state)) && !(s__state == 8480)) && !(s__state == 8195)) && !(s__state == 8529)) && s__state <= 8576)) || ((((!(8673 == s__state) && !(8576 == s__state)) && !(s__state == 8657)) && !(12292 <= s__state)) && 8576 <= s__state)) || ((((!(8673 == s__state) && !(s__state == 8657)) && !(12292 <= s__state)) && !(0 == s__hit)) && 8576 <= s__state)) || ((((8576 <= s__s3__tmp__next_state___0 && s__s3__tmp__next_state___0 < 12292) && !(12292 <= s__state)) && !(0 == s__hit)) && 8576 <= s__state) - InvariantResult [Line: 689]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 190]: Loop Invariant Derived loop invariant: ((((((!(8673 == s__state) && !(8576 == s__state)) && !(s__state == 8657)) && !(s__state == 8672)) && !(12292 <= s__state)) && !(s__state == 8656)) && 8576 <= s__state) || ((((((!(8673 == s__state) && !(s__state == 8657)) && !(s__state == 8672)) && !(12292 <= s__state)) && !(s__state == 8656)) && !(0 == s__hit)) && 8576 <= s__state) - InvariantResult [Line: 75]: Loop Invariant Derived loop invariant: !(12292 == s__state) - InvariantResult [Line: 136]: Loop Invariant Derived loop invariant: ((((((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state <= 8192)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(s__state == 8480)) && !(s__state == 8195)) && !(s__state == 8528)) && !(s__state == 8529)) && !(s__state == 8512)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8576) || ((((((((((((((((!(8448 == s__state) && !(8576 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state <= 8192)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(8513 == s__state)) && !(s__state == 8480)) && !(s__state == 8195)) && !(s__state == 8528)) && !(s__state == 8529)) && !(s__state == 8512)) && !(8560 == s__state)) && s__state <= 8576) - InvariantResult [Line: 214]: Loop Invariant Derived loop invariant: !(12292 == s__state) - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 178]: Loop Invariant Derived loop invariant: ((((!(8673 == s__state) && !(s__state == 8657)) && !(s__state == 8672)) && !(12292 <= s__state)) && !(s__state == 8656)) && 8576 <= s__state - InvariantResult [Line: 202]: Loop Invariant Derived loop invariant: ((((!(8673 == s__state) && !(8576 == s__state)) && !(s__state == 8672)) && !(12292 <= s__state)) && 8576 <= s__state) || ((((!(8673 == s__state) && !(s__state == 8672)) && !(12292 <= s__state)) && !(0 == s__hit)) && 8576 <= s__state) RESULT: Ultimate proved your program to be correct! [2022-07-22 00:46:32,435 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE