./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/bitvector/s3_srvr_2a.BV.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a31fd051 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_2a.BV.c.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-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 ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b8cfead7c1f307a9ba2676fad86c005fa434c5b4bc168c34fe90a644ea9973b2 --- Real Ultimate output --- This is Ultimate 0.2.2-?-a31fd05 [2023-02-15 10:22:28,453 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 10:22:28,455 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 10:22:28,484 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 10:22:28,485 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 10:22:28,487 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 10:22:28,489 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 10:22:28,491 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 10:22:28,492 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 10:22:28,496 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 10:22:28,497 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 10:22:28,498 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 10:22:28,499 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 10:22:28,500 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 10:22:28,501 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 10:22:28,502 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 10:22:28,503 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 10:22:28,504 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 10:22:28,505 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 10:22:28,508 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 10:22:28,509 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 10:22:28,510 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 10:22:28,511 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 10:22:28,511 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 10:22:28,517 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 10:22:28,517 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 10:22:28,518 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 10:22:28,519 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 10:22:28,519 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 10:22:28,520 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 10:22:28,520 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 10:22:28,520 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 10:22:28,521 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 10:22:28,522 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 10:22:28,524 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 10:22:28,524 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 10:22:28,524 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 10:22:28,524 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 10:22:28,525 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 10:22:28,525 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 10:22:28,526 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 10:22:28,527 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-15 10:22:28,549 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 10:22:28,549 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 10:22:28,550 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 10:22:28,550 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 10:22:28,550 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 10:22:28,551 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 10:22:28,551 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 10:22:28,551 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 10:22:28,552 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 10:22:28,552 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 10:22:28,552 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 10:22:28,553 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 10:22:28,553 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 10:22:28,553 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 10:22:28,553 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-15 10:22:28,553 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 10:22:28,553 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-15 10:22:28,553 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 10:22:28,554 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-15 10:22:28,554 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 10:22:28,555 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-15 10:22:28,558 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 10:22:28,558 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 10:22:28,558 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 10:22:28,558 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 10:22:28,558 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 10:22:28,559 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 10:22:28,559 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-15 10:22:28,559 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 10:22:28,559 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 10:22:28,560 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 10:22:28,560 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-15 10:22:28,560 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 10:22:28,560 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 10:22:28,560 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 10:22:28,560 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) 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 -> b8cfead7c1f307a9ba2676fad86c005fa434c5b4bc168c34fe90a644ea9973b2 [2023-02-15 10:22:28,766 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 10:22:28,779 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 10:22:28,780 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 10:22:28,781 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 10:22:28,781 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 10:22:28,782 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/s3_srvr_2a.BV.c.cil.c [2023-02-15 10:22:29,695 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 10:22:29,871 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 10:22:29,871 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/s3_srvr_2a.BV.c.cil.c [2023-02-15 10:22:29,879 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bba7c2754/bfaace8f237b4beb993057fdaecae7fa/FLAG4070862ec [2023-02-15 10:22:29,888 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bba7c2754/bfaace8f237b4beb993057fdaecae7fa [2023-02-15 10:22:29,890 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 10:22:29,891 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 10:22:29,892 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 10:22:29,892 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 10:22:29,895 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 10:22:29,895 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 10:22:29" (1/1) ... [2023-02-15 10:22:29,896 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58771076 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:22:29, skipping insertion in model container [2023-02-15 10:22:29,896 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 10:22:29" (1/1) ... [2023-02-15 10:22:29,901 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 10:22:29,933 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 10:22:30,058 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/s3_srvr_2a.BV.c.cil.c[44872,44885] [2023-02-15 10:22:30,063 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 10:22:30,069 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 10:22:30,101 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/s3_srvr_2a.BV.c.cil.c[44872,44885] [2023-02-15 10:22:30,103 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 10:22:30,112 INFO L208 MainTranslator]: Completed translation [2023-02-15 10:22:30,112 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:22:30 WrapperNode [2023-02-15 10:22:30,113 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 10:22:30,113 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 10:22:30,114 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 10:22:30,114 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 10:22:30,118 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:22:30" (1/1) ... [2023-02-15 10:22:30,125 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:22:30" (1/1) ... [2023-02-15 10:22:30,147 INFO L138 Inliner]: procedures = 15, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 528 [2023-02-15 10:22:30,147 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 10:22:30,148 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 10:22:30,148 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 10:22:30,148 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 10:22:30,154 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:22:30" (1/1) ... [2023-02-15 10:22:30,155 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:22:30" (1/1) ... [2023-02-15 10:22:30,165 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:22:30" (1/1) ... [2023-02-15 10:22:30,165 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:22:30" (1/1) ... [2023-02-15 10:22:30,170 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:22:30" (1/1) ... [2023-02-15 10:22:30,175 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:22:30" (1/1) ... [2023-02-15 10:22:30,176 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:22:30" (1/1) ... [2023-02-15 10:22:30,178 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:22:30" (1/1) ... [2023-02-15 10:22:30,180 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 10:22:30,181 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 10:22:30,181 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 10:22:30,181 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 10:22:30,182 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:22:30" (1/1) ... [2023-02-15 10:22:30,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 10:22:30,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:22:30,217 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-15 10:22:30,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-15 10:22:30,253 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 10:22:30,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-15 10:22:30,254 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 10:22:30,255 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 10:22:30,315 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 10:22:30,317 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 10:22:30,329 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-02-15 10:22:30,681 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2023-02-15 10:22:30,681 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2023-02-15 10:22:30,681 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 10:22:30,686 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 10:22:30,686 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2023-02-15 10:22:30,688 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:22:30 BoogieIcfgContainer [2023-02-15 10:22:30,688 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 10:22:30,689 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 10:22:30,690 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 10:22:30,692 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 10:22:30,692 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 10:22:29" (1/3) ... [2023-02-15 10:22:30,692 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10ee28f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 10:22:30, skipping insertion in model container [2023-02-15 10:22:30,692 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:22:30" (2/3) ... [2023-02-15 10:22:30,693 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10ee28f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 10:22:30, skipping insertion in model container [2023-02-15 10:22:30,693 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:22:30" (3/3) ... [2023-02-15 10:22:30,694 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr_2a.BV.c.cil.c [2023-02-15 10:22:30,705 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 10:22:30,705 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-15 10:22:30,755 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 10:22:30,759 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@547e001f, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 10:22:30,759 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-15 10:22:30,763 INFO L276 IsEmpty]: Start isEmpty. Operand has 138 states, 136 states have (on average 1.7426470588235294) internal successors, (237), 137 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:22:30,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-02-15 10:22:30,784 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:22:30,785 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:22:30,785 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:22:30,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:22:30,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1632002022, now seen corresponding path program 1 times [2023-02-15 10:22:30,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:22:30,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921585619] [2023-02-15 10:22:30,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:22:30,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:22:30,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:22:31,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:22:31,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:22:31,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921585619] [2023-02-15 10:22:31,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921585619] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:22:31,062 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:22:31,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 10:22:31,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044114960] [2023-02-15 10:22:31,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:22:31,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 10:22:31,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:22:31,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 10:22:31,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 10:22:31,090 INFO L87 Difference]: Start difference. First operand has 138 states, 136 states have (on average 1.7426470588235294) internal successors, (237), 137 states have internal predecessors, (237), 0 states have call successors, (0), 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 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:22:31,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:22:31,237 INFO L93 Difference]: Finished difference Result 317 states and 547 transitions. [2023-02-15 10:22:31,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 10:22:31,239 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2023-02-15 10:22:31,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:22:31,246 INFO L225 Difference]: With dead ends: 317 [2023-02-15 10:22:31,246 INFO L226 Difference]: Without dead ends: 161 [2023-02-15 10:22:31,249 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 10:22:31,251 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 156 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 10:22:31,252 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 177 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 10:22:31,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2023-02-15 10:22:31,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 156. [2023-02-15 10:22:31,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 155 states have (on average 1.6) internal successors, (248), 155 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:22:31,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 248 transitions. [2023-02-15 10:22:31,295 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 248 transitions. Word has length 44 [2023-02-15 10:22:31,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:22:31,296 INFO L495 AbstractCegarLoop]: Abstraction has 156 states and 248 transitions. [2023-02-15 10:22:31,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:22:31,296 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 248 transitions. [2023-02-15 10:22:31,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-02-15 10:22:31,301 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:22:31,302 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:22:31,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-15 10:22:31,302 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:22:31,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:22:31,304 INFO L85 PathProgramCache]: Analyzing trace with hash -954580408, now seen corresponding path program 1 times [2023-02-15 10:22:31,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:22:31,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001639081] [2023-02-15 10:22:31,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:22:31,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:22:31,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:22:31,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:22:31,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:22:31,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001639081] [2023-02-15 10:22:31,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001639081] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:22:31,454 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:22:31,454 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 10:22:31,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111197462] [2023-02-15 10:22:31,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:22:31,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 10:22:31,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:22:31,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 10:22:31,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 10:22:31,457 INFO L87 Difference]: Start difference. First operand 156 states and 248 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:22:31,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:22:31,588 INFO L93 Difference]: Finished difference Result 352 states and 565 transitions. [2023-02-15 10:22:31,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 10:22:31,589 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 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 45 [2023-02-15 10:22:31,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:22:31,593 INFO L225 Difference]: With dead ends: 352 [2023-02-15 10:22:31,593 INFO L226 Difference]: Without dead ends: 202 [2023-02-15 10:22:31,598 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 10:22:31,600 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 110 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 10:22:31,601 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 126 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 10:22:31,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2023-02-15 10:22:31,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 197. [2023-02-15 10:22:31,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 196 states have (on average 1.6326530612244898) internal successors, (320), 196 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:22:31,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 320 transitions. [2023-02-15 10:22:31,611 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 320 transitions. Word has length 45 [2023-02-15 10:22:31,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:22:31,611 INFO L495 AbstractCegarLoop]: Abstraction has 197 states and 320 transitions. [2023-02-15 10:22:31,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:22:31,612 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 320 transitions. [2023-02-15 10:22:31,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-02-15 10:22:31,613 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:22:31,613 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:22:31,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-15 10:22:31,613 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:22:31,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:22:31,614 INFO L85 PathProgramCache]: Analyzing trace with hash 2033157093, now seen corresponding path program 1 times [2023-02-15 10:22:31,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:22:31,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254307665] [2023-02-15 10:22:31,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:22:31,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:22:31,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:22:31,678 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:22:31,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:22:31,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254307665] [2023-02-15 10:22:31,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254307665] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:22:31,679 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:22:31,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 10:22:31,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829432659] [2023-02-15 10:22:31,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:22:31,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 10:22:31,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:22:31,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 10:22:31,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 10:22:31,681 INFO L87 Difference]: Start difference. First operand 197 states and 320 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:22:31,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:22:31,705 INFO L93 Difference]: Finished difference Result 569 states and 929 transitions. [2023-02-15 10:22:31,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 10:22:31,706 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2023-02-15 10:22:31,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:22:31,707 INFO L225 Difference]: With dead ends: 569 [2023-02-15 10:22:31,708 INFO L226 Difference]: Without dead ends: 380 [2023-02-15 10:22:31,708 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 10:22:31,709 INFO L413 NwaCegarLoop]: 312 mSDtfsCounter, 111 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 10:22:31,709 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 475 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 10:22:31,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2023-02-15 10:22:31,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 380. [2023-02-15 10:22:31,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 379 states have (on average 1.6279683377308707) internal successors, (617), 379 states have internal predecessors, (617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:22:31,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 617 transitions. [2023-02-15 10:22:31,737 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 617 transitions. Word has length 60 [2023-02-15 10:22:31,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:22:31,737 INFO L495 AbstractCegarLoop]: Abstraction has 380 states and 617 transitions. [2023-02-15 10:22:31,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:22:31,738 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 617 transitions. [2023-02-15 10:22:31,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-02-15 10:22:31,741 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:22:31,741 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:22:31,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-15 10:22:31,741 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:22:31,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:22:31,742 INFO L85 PathProgramCache]: Analyzing trace with hash -2013663709, now seen corresponding path program 1 times [2023-02-15 10:22:31,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:22:31,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637043238] [2023-02-15 10:22:31,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:22:31,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:22:31,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:22:31,790 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:22:31,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:22:31,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637043238] [2023-02-15 10:22:31,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637043238] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:22:31,791 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:22:31,791 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 10:22:31,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618380918] [2023-02-15 10:22:31,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:22:31,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 10:22:31,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:22:31,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 10:22:31,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 10:22:31,792 INFO L87 Difference]: Start difference. First operand 380 states and 617 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:22:31,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:22:31,814 INFO L93 Difference]: Finished difference Result 938 states and 1528 transitions. [2023-02-15 10:22:31,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 10:22:31,815 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2023-02-15 10:22:31,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:22:31,817 INFO L225 Difference]: With dead ends: 938 [2023-02-15 10:22:31,817 INFO L226 Difference]: Without dead ends: 566 [2023-02-15 10:22:31,817 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 10:22:31,818 INFO L413 NwaCegarLoop]: 177 mSDtfsCounter, 148 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 10:22:31,818 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 330 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 10:22:31,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2023-02-15 10:22:31,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 566. [2023-02-15 10:22:31,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 565 states have (on average 1.6247787610619469) internal successors, (918), 565 states have internal predecessors, (918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:22:31,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 918 transitions. [2023-02-15 10:22:31,834 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 918 transitions. Word has length 60 [2023-02-15 10:22:31,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:22:31,834 INFO L495 AbstractCegarLoop]: Abstraction has 566 states and 918 transitions. [2023-02-15 10:22:31,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:22:31,835 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 918 transitions. [2023-02-15 10:22:31,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2023-02-15 10:22:31,836 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:22:31,837 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 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] [2023-02-15 10:22:31,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-15 10:22:31,837 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:22:31,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:22:31,838 INFO L85 PathProgramCache]: Analyzing trace with hash -1930486570, now seen corresponding path program 1 times [2023-02-15 10:22:31,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:22:31,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318096008] [2023-02-15 10:22:31,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:22:31,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:22:31,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:22:31,904 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-02-15 10:22:31,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:22:31,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318096008] [2023-02-15 10:22:31,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318096008] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:22:31,905 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:22:31,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 10:22:31,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293427655] [2023-02-15 10:22:31,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:22:31,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 10:22:31,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:22:31,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 10:22:31,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 10:22:31,907 INFO L87 Difference]: Start difference. First operand 566 states and 918 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) [2023-02-15 10:22:32,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:22:32,021 INFO L93 Difference]: Finished difference Result 1336 states and 2193 transitions. [2023-02-15 10:22:32,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 10:22:32,021 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 97 [2023-02-15 10:22:32,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:22:32,026 INFO L225 Difference]: With dead ends: 1336 [2023-02-15 10:22:32,026 INFO L226 Difference]: Without dead ends: 778 [2023-02-15 10:22:32,027 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 10:22:32,029 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 43 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 10:22:32,030 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 263 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 10:22:32,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 778 states. [2023-02-15 10:22:32,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 778 to 766. [2023-02-15 10:22:32,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 766 states, 765 states have (on average 1.461437908496732) internal successors, (1118), 765 states have internal predecessors, (1118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:22:32,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 766 states to 766 states and 1118 transitions. [2023-02-15 10:22:32,048 INFO L78 Accepts]: Start accepts. Automaton has 766 states and 1118 transitions. Word has length 97 [2023-02-15 10:22:32,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:22:32,049 INFO L495 AbstractCegarLoop]: Abstraction has 766 states and 1118 transitions. [2023-02-15 10:22:32,049 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) [2023-02-15 10:22:32,049 INFO L276 IsEmpty]: Start isEmpty. Operand 766 states and 1118 transitions. [2023-02-15 10:22:32,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2023-02-15 10:22:32,053 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:22:32,053 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 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] [2023-02-15 10:22:32,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-15 10:22:32,057 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:22:32,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:22:32,057 INFO L85 PathProgramCache]: Analyzing trace with hash -1496757484, now seen corresponding path program 1 times [2023-02-15 10:22:32,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:22:32,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443072141] [2023-02-15 10:22:32,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:22:32,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:22:32,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:22:32,131 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-02-15 10:22:32,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:22:32,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443072141] [2023-02-15 10:22:32,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443072141] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:22:32,133 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:22:32,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 10:22:32,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782591624] [2023-02-15 10:22:32,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:22:32,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 10:22:32,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:22:32,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 10:22:32,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 10:22:32,136 INFO L87 Difference]: Start difference. First operand 766 states and 1118 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) [2023-02-15 10:22:32,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:22:32,260 INFO L93 Difference]: Finished difference Result 1653 states and 2450 transitions. [2023-02-15 10:22:32,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 10:22:32,261 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 97 [2023-02-15 10:22:32,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:22:32,266 INFO L225 Difference]: With dead ends: 1653 [2023-02-15 10:22:32,266 INFO L226 Difference]: Without dead ends: 895 [2023-02-15 10:22:32,267 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 10:22:32,270 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 81 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 10:22:32,272 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 224 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 10:22:32,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 895 states. [2023-02-15 10:22:32,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 895 to 859. [2023-02-15 10:22:32,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 859 states, 858 states have (on average 1.456876456876457) internal successors, (1250), 858 states have internal predecessors, (1250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:22:32,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 859 states to 859 states and 1250 transitions. [2023-02-15 10:22:32,289 INFO L78 Accepts]: Start accepts. Automaton has 859 states and 1250 transitions. Word has length 97 [2023-02-15 10:22:32,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:22:32,289 INFO L495 AbstractCegarLoop]: Abstraction has 859 states and 1250 transitions. [2023-02-15 10:22:32,290 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) [2023-02-15 10:22:32,290 INFO L276 IsEmpty]: Start isEmpty. Operand 859 states and 1250 transitions. [2023-02-15 10:22:32,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-02-15 10:22:32,291 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:22:32,292 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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] [2023-02-15 10:22:32,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-02-15 10:22:32,292 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:22:32,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:22:32,293 INFO L85 PathProgramCache]: Analyzing trace with hash -1340556462, now seen corresponding path program 1 times [2023-02-15 10:22:32,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:22:32,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315165735] [2023-02-15 10:22:32,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:22:32,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:22:32,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:22:32,388 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2023-02-15 10:22:32,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:22:32,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315165735] [2023-02-15 10:22:32,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315165735] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:22:32,389 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:22:32,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 10:22:32,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253418888] [2023-02-15 10:22:32,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:22:32,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 10:22:32,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:22:32,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 10:22:32,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 10:22:32,390 INFO L87 Difference]: Start difference. First operand 859 states and 1250 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:22:32,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:22:32,421 INFO L93 Difference]: Finished difference Result 1746 states and 2558 transitions. [2023-02-15 10:22:32,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 10:22:32,421 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 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 [2023-02-15 10:22:32,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:22:32,424 INFO L225 Difference]: With dead ends: 1746 [2023-02-15 10:22:32,425 INFO L226 Difference]: Without dead ends: 1153 [2023-02-15 10:22:32,425 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 10:22:32,426 INFO L413 NwaCegarLoop]: 321 mSDtfsCounter, 111 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 10:22:32,426 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 484 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 10:22:32,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1153 states. [2023-02-15 10:22:32,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1153 to 1153. [2023-02-15 10:22:32,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1153 states, 1152 states have (on average 1.4592013888888888) internal successors, (1681), 1152 states have internal predecessors, (1681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:22:32,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1153 states to 1153 states and 1681 transitions. [2023-02-15 10:22:32,453 INFO L78 Accepts]: Start accepts. Automaton has 1153 states and 1681 transitions. Word has length 121 [2023-02-15 10:22:32,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:22:32,453 INFO L495 AbstractCegarLoop]: Abstraction has 1153 states and 1681 transitions. [2023-02-15 10:22:32,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:22:32,454 INFO L276 IsEmpty]: Start isEmpty. Operand 1153 states and 1681 transitions. [2023-02-15 10:22:32,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-02-15 10:22:32,455 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:22:32,456 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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] [2023-02-15 10:22:32,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-02-15 10:22:32,456 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:22:32,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:22:32,456 INFO L85 PathProgramCache]: Analyzing trace with hash 2057017556, now seen corresponding path program 1 times [2023-02-15 10:22:32,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:22:32,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128420286] [2023-02-15 10:22:32,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:22:32,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:22:32,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:22:32,514 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-02-15 10:22:32,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:22:32,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128420286] [2023-02-15 10:22:32,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128420286] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:22:32,515 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:22:32,515 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 10:22:32,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392002903] [2023-02-15 10:22:32,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:22:32,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 10:22:32,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:22:32,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 10:22:32,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 10:22:32,517 INFO L87 Difference]: Start difference. First operand 1153 states and 1681 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:22:32,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:22:32,553 INFO L93 Difference]: Finished difference Result 2297 states and 3379 transitions. [2023-02-15 10:22:32,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 10:22:32,553 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 121 [2023-02-15 10:22:32,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:22:32,557 INFO L225 Difference]: With dead ends: 2297 [2023-02-15 10:22:32,557 INFO L226 Difference]: Without dead ends: 1410 [2023-02-15 10:22:32,559 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 10:22:32,562 INFO L413 NwaCegarLoop]: 322 mSDtfsCounter, 113 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 10:22:32,563 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 485 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 10:22:32,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1410 states. [2023-02-15 10:22:32,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1410 to 1410. [2023-02-15 10:22:32,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1410 states, 1409 states have (on average 1.4698367636621719) internal successors, (2071), 1409 states have internal predecessors, (2071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:22:32,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1410 states to 1410 states and 2071 transitions. [2023-02-15 10:22:32,588 INFO L78 Accepts]: Start accepts. Automaton has 1410 states and 2071 transitions. Word has length 121 [2023-02-15 10:22:32,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:22:32,588 INFO L495 AbstractCegarLoop]: Abstraction has 1410 states and 2071 transitions. [2023-02-15 10:22:32,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:22:32,589 INFO L276 IsEmpty]: Start isEmpty. Operand 1410 states and 2071 transitions. [2023-02-15 10:22:32,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2023-02-15 10:22:32,591 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:22:32,591 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2023-02-15 10:22:32,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-02-15 10:22:32,592 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:22:32,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:22:32,592 INFO L85 PathProgramCache]: Analyzing trace with hash -860101462, now seen corresponding path program 1 times [2023-02-15 10:22:32,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:22:32,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828651921] [2023-02-15 10:22:32,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:22:32,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:22:32,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:22:32,651 INFO L134 CoverageAnalysis]: Checked inductivity of 434 backedges. 299 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2023-02-15 10:22:32,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:22:32,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828651921] [2023-02-15 10:22:32,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828651921] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:22:32,652 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:22:32,652 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 10:22:32,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002530712] [2023-02-15 10:22:32,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:22:32,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 10:22:32,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:22:32,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 10:22:32,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 10:22:32,654 INFO L87 Difference]: Start difference. First operand 1410 states and 2071 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:22:32,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:22:32,767 INFO L93 Difference]: Finished difference Result 3017 states and 4490 transitions. [2023-02-15 10:22:32,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 10:22:32,767 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 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 225 [2023-02-15 10:22:32,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:22:32,772 INFO L225 Difference]: With dead ends: 3017 [2023-02-15 10:22:32,772 INFO L226 Difference]: Without dead ends: 1565 [2023-02-15 10:22:32,775 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 10:22:32,776 INFO L413 NwaCegarLoop]: 174 mSDtfsCounter, 34 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 10:22:32,776 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 255 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 10:22:32,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1565 states. [2023-02-15 10:22:32,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1565 to 1565. [2023-02-15 10:22:32,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1565 states, 1564 states have (on average 1.4392583120204603) internal successors, (2251), 1564 states have internal predecessors, (2251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:22:32,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1565 states to 1565 states and 2251 transitions. [2023-02-15 10:22:32,826 INFO L78 Accepts]: Start accepts. Automaton has 1565 states and 2251 transitions. Word has length 225 [2023-02-15 10:22:32,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:22:32,826 INFO L495 AbstractCegarLoop]: Abstraction has 1565 states and 2251 transitions. [2023-02-15 10:22:32,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:22:32,827 INFO L276 IsEmpty]: Start isEmpty. Operand 1565 states and 2251 transitions. [2023-02-15 10:22:32,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2023-02-15 10:22:32,830 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:22:32,830 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2023-02-15 10:22:32,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-02-15 10:22:32,830 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:22:32,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:22:32,831 INFO L85 PathProgramCache]: Analyzing trace with hash -482554043, now seen corresponding path program 1 times [2023-02-15 10:22:32,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:22:32,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728055832] [2023-02-15 10:22:32,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:22:32,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:22:32,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:22:32,902 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 430 proven. 16 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2023-02-15 10:22:32,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:22:32,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728055832] [2023-02-15 10:22:32,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728055832] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:22:32,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [272050068] [2023-02-15 10:22:32,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:22:32,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:22:32,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:22:32,918 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 10:22:32,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-15 10:22:33,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:22:33,014 INFO L263 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-15 10:22:33,023 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:22:33,156 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 430 proven. 16 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2023-02-15 10:22:33,157 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:22:33,230 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 430 proven. 16 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2023-02-15 10:22:33,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [272050068] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 10:22:33,233 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 10:22:33,233 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2023-02-15 10:22:33,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212825377] [2023-02-15 10:22:33,233 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 10:22:33,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 10:22:33,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:22:33,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 10:22:33,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-15 10:22:33,234 INFO L87 Difference]: Start difference. First operand 1565 states and 2251 transitions. Second operand has 6 states, 6 states have (on average 34.333333333333336) internal successors, (206), 6 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:22:33,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:22:33,787 INFO L93 Difference]: Finished difference Result 6075 states and 8721 transitions. [2023-02-15 10:22:33,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 10:22:33,787 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 34.333333333333336) internal successors, (206), 6 states have internal predecessors, (206), 0 states have call successors, (0), 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 253 [2023-02-15 10:22:33,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:22:33,827 INFO L225 Difference]: With dead ends: 6075 [2023-02-15 10:22:33,840 INFO L226 Difference]: Without dead ends: 4518 [2023-02-15 10:22:33,843 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 514 GetRequests, 507 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2023-02-15 10:22:33,843 INFO L413 NwaCegarLoop]: 421 mSDtfsCounter, 336 mSDsluCounter, 806 mSDsCounter, 0 mSdLazyCounter, 914 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 1227 SdHoareTripleChecker+Invalid, 973 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 914 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-15 10:22:33,844 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 1227 Invalid, 973 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 914 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-15 10:22:33,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4518 states. [2023-02-15 10:22:33,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4518 to 3398. [2023-02-15 10:22:33,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3398 states, 3397 states have (on average 1.40270827200471) internal successors, (4765), 3397 states have internal predecessors, (4765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:22:33,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3398 states to 3398 states and 4765 transitions. [2023-02-15 10:22:33,993 INFO L78 Accepts]: Start accepts. Automaton has 3398 states and 4765 transitions. Word has length 253 [2023-02-15 10:22:33,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:22:33,994 INFO L495 AbstractCegarLoop]: Abstraction has 3398 states and 4765 transitions. [2023-02-15 10:22:33,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 34.333333333333336) internal successors, (206), 6 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:22:33,994 INFO L276 IsEmpty]: Start isEmpty. Operand 3398 states and 4765 transitions. [2023-02-15 10:22:33,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2023-02-15 10:22:33,999 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:22:34,000 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2023-02-15 10:22:34,007 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-02-15 10:22:34,204 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,SelfDestructingSolverStorable9 [2023-02-15 10:22:34,205 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:22:34,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:22:34,206 INFO L85 PathProgramCache]: Analyzing trace with hash -193734653, now seen corresponding path program 1 times [2023-02-15 10:22:34,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:22:34,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878729741] [2023-02-15 10:22:34,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:22:34,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:22:34,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:22:34,263 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 400 proven. 0 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2023-02-15 10:22:34,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:22:34,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878729741] [2023-02-15 10:22:34,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878729741] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:22:34,264 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:22:34,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 10:22:34,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232363382] [2023-02-15 10:22:34,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:22:34,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 10:22:34,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:22:34,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 10:22:34,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 10:22:34,266 INFO L87 Difference]: Start difference. First operand 3398 states and 4765 transitions. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 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) [2023-02-15 10:22:34,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:22:34,351 INFO L93 Difference]: Finished difference Result 9681 states and 13694 transitions. [2023-02-15 10:22:34,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 10:22:34,351 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 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 253 [2023-02-15 10:22:34,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:22:34,362 INFO L225 Difference]: With dead ends: 9681 [2023-02-15 10:22:34,362 INFO L226 Difference]: Without dead ends: 4220 [2023-02-15 10:22:34,367 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 10:22:34,368 INFO L413 NwaCegarLoop]: 325 mSDtfsCounter, 109 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 492 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 [2023-02-15 10:22:34,368 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 492 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 10:22:34,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4220 states. [2023-02-15 10:22:34,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4220 to 3918. [2023-02-15 10:22:34,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3918 states, 3917 states have (on average 1.4237937196834312) internal successors, (5577), 3917 states have internal predecessors, (5577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:22:34,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3918 states to 3918 states and 5577 transitions. [2023-02-15 10:22:34,462 INFO L78 Accepts]: Start accepts. Automaton has 3918 states and 5577 transitions. Word has length 253 [2023-02-15 10:22:34,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:22:34,462 INFO L495 AbstractCegarLoop]: Abstraction has 3918 states and 5577 transitions. [2023-02-15 10:22:34,462 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 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) [2023-02-15 10:22:34,462 INFO L276 IsEmpty]: Start isEmpty. Operand 3918 states and 5577 transitions. [2023-02-15 10:22:34,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2023-02-15 10:22:34,467 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:22:34,467 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2023-02-15 10:22:34,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-02-15 10:22:34,468 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:22:34,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:22:34,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1163625151, now seen corresponding path program 1 times [2023-02-15 10:22:34,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:22:34,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617306971] [2023-02-15 10:22:34,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:22:34,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:22:34,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:22:34,506 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 255 proven. 0 refuted. 0 times theorem prover too weak. 326 trivial. 0 not checked. [2023-02-15 10:22:34,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:22:34,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617306971] [2023-02-15 10:22:34,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617306971] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:22:34,507 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:22:34,507 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 10:22:34,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454823435] [2023-02-15 10:22:34,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:22:34,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 10:22:34,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:22:34,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 10:22:34,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 10:22:34,508 INFO L87 Difference]: Start difference. First operand 3918 states and 5577 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:22:34,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:22:34,625 INFO L93 Difference]: Finished difference Result 8008 states and 11372 transitions. [2023-02-15 10:22:34,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 10:22:34,626 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 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 253 [2023-02-15 10:22:34,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:22:34,636 INFO L225 Difference]: With dead ends: 8008 [2023-02-15 10:22:34,636 INFO L226 Difference]: Without dead ends: 4098 [2023-02-15 10:22:34,640 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 10:22:34,641 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 12 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 10:22:34,641 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 272 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 10:22:34,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4098 states. [2023-02-15 10:22:34,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4098 to 4056. [2023-02-15 10:22:34,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4056 states, 4055 states have (on average 1.4167694204685573) internal successors, (5745), 4055 states have internal predecessors, (5745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:22:34,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4056 states to 4056 states and 5745 transitions. [2023-02-15 10:22:34,719 INFO L78 Accepts]: Start accepts. Automaton has 4056 states and 5745 transitions. Word has length 253 [2023-02-15 10:22:34,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:22:34,719 INFO L495 AbstractCegarLoop]: Abstraction has 4056 states and 5745 transitions. [2023-02-15 10:22:34,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:22:34,719 INFO L276 IsEmpty]: Start isEmpty. Operand 4056 states and 5745 transitions. [2023-02-15 10:22:34,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2023-02-15 10:22:34,742 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:22:34,742 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2023-02-15 10:22:34,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-02-15 10:22:34,743 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:22:34,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:22:34,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1335839441, now seen corresponding path program 1 times [2023-02-15 10:22:34,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:22:34,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934598623] [2023-02-15 10:22:34,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:22:34,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:22:34,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:22:34,793 INFO L134 CoverageAnalysis]: Checked inductivity of 714 backedges. 369 proven. 0 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2023-02-15 10:22:34,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:22:34,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934598623] [2023-02-15 10:22:34,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934598623] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:22:34,793 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:22:34,794 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 10:22:34,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12660389] [2023-02-15 10:22:34,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:22:34,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 10:22:34,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:22:34,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 10:22:34,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 10:22:34,795 INFO L87 Difference]: Start difference. First operand 4056 states and 5745 transitions. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:22:34,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:22:34,931 INFO L93 Difference]: Finished difference Result 8622 states and 12220 transitions. [2023-02-15 10:22:34,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 10:22:34,932 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 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 273 [2023-02-15 10:22:34,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:22:34,944 INFO L225 Difference]: With dead ends: 8622 [2023-02-15 10:22:34,944 INFO L226 Difference]: Without dead ends: 4574 [2023-02-15 10:22:34,949 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 10:22:34,949 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 28 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 10:22:34,949 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 272 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 10:22:34,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4574 states. [2023-02-15 10:22:35,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4574 to 4406. [2023-02-15 10:22:35,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4406 states, 4405 states have (on average 1.3995459704880817) internal successors, (6165), 4405 states have internal predecessors, (6165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:22:35,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4406 states to 4406 states and 6165 transitions. [2023-02-15 10:22:35,044 INFO L78 Accepts]: Start accepts. Automaton has 4406 states and 6165 transitions. Word has length 273 [2023-02-15 10:22:35,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:22:35,044 INFO L495 AbstractCegarLoop]: Abstraction has 4406 states and 6165 transitions. [2023-02-15 10:22:35,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:22:35,044 INFO L276 IsEmpty]: Start isEmpty. Operand 4406 states and 6165 transitions. [2023-02-15 10:22:35,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2023-02-15 10:22:35,050 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:22:35,050 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 7, 7, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2023-02-15 10:22:35,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-02-15 10:22:35,050 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:22:35,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:22:35,051 INFO L85 PathProgramCache]: Analyzing trace with hash -257796221, now seen corresponding path program 1 times [2023-02-15 10:22:35,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:22:35,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165849484] [2023-02-15 10:22:35,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:22:35,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:22:35,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:22:35,103 INFO L134 CoverageAnalysis]: Checked inductivity of 875 backedges. 493 proven. 0 refuted. 0 times theorem prover too weak. 382 trivial. 0 not checked. [2023-02-15 10:22:35,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:22:35,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165849484] [2023-02-15 10:22:35,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165849484] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:22:35,103 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:22:35,103 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 10:22:35,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173083373] [2023-02-15 10:22:35,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:22:35,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 10:22:35,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:22:35,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 10:22:35,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 10:22:35,105 INFO L87 Difference]: Start difference. First operand 4406 states and 6165 transitions. Second operand has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:22:35,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:22:35,234 INFO L93 Difference]: Finished difference Result 9266 states and 12990 transitions. [2023-02-15 10:22:35,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 10:22:35,235 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 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 299 [2023-02-15 10:22:35,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:22:35,255 INFO L225 Difference]: With dead ends: 9266 [2023-02-15 10:22:35,256 INFO L226 Difference]: Without dead ends: 4868 [2023-02-15 10:22:35,261 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 10:22:35,261 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 17 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 10:22:35,262 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 272 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 10:22:35,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4868 states. [2023-02-15 10:22:35,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4868 to 4784. [2023-02-15 10:22:35,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4784 states, 4783 states have (on average 1.382605059586034) internal successors, (6613), 4783 states have internal predecessors, (6613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:22:35,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4784 states to 4784 states and 6613 transitions. [2023-02-15 10:22:35,386 INFO L78 Accepts]: Start accepts. Automaton has 4784 states and 6613 transitions. Word has length 299 [2023-02-15 10:22:35,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:22:35,387 INFO L495 AbstractCegarLoop]: Abstraction has 4784 states and 6613 transitions. [2023-02-15 10:22:35,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:22:35,387 INFO L276 IsEmpty]: Start isEmpty. Operand 4784 states and 6613 transitions. [2023-02-15 10:22:35,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2023-02-15 10:22:35,394 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:22:35,394 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 8, 8, 7, 7, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2023-02-15 10:22:35,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-02-15 10:22:35,394 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:22:35,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:22:35,395 INFO L85 PathProgramCache]: Analyzing trace with hash 212293102, now seen corresponding path program 1 times [2023-02-15 10:22:35,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:22:35,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365350455] [2023-02-15 10:22:35,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:22:35,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:22:35,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:22:35,459 INFO L134 CoverageAnalysis]: Checked inductivity of 1066 backedges. 627 proven. 0 refuted. 0 times theorem prover too weak. 439 trivial. 0 not checked. [2023-02-15 10:22:35,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:22:35,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365350455] [2023-02-15 10:22:35,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365350455] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:22:35,459 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:22:35,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 10:22:35,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476277543] [2023-02-15 10:22:35,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:22:35,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 10:22:35,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:22:35,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 10:22:35,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 10:22:35,462 INFO L87 Difference]: Start difference. First operand 4784 states and 6613 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:22:35,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:22:35,591 INFO L93 Difference]: Finished difference Result 9980 states and 13802 transitions. [2023-02-15 10:22:35,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 10:22:35,592 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 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 322 [2023-02-15 10:22:35,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:22:35,599 INFO L225 Difference]: With dead ends: 9980 [2023-02-15 10:22:35,599 INFO L226 Difference]: Without dead ends: 5204 [2023-02-15 10:22:35,604 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 10:22:35,605 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 10 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 10:22:35,605 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 272 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 10:22:35,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5204 states. [2023-02-15 10:22:35,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5204 to 4391. [2023-02-15 10:22:35,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4391 states, 4390 states have (on average 1.3824601366742597) internal successors, (6069), 4390 states have internal predecessors, (6069), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:22:35,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4391 states to 4391 states and 6069 transitions. [2023-02-15 10:22:35,672 INFO L78 Accepts]: Start accepts. Automaton has 4391 states and 6069 transitions. Word has length 322 [2023-02-15 10:22:35,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:22:35,672 INFO L495 AbstractCegarLoop]: Abstraction has 4391 states and 6069 transitions. [2023-02-15 10:22:35,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:22:35,673 INFO L276 IsEmpty]: Start isEmpty. Operand 4391 states and 6069 transitions. [2023-02-15 10:22:35,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2023-02-15 10:22:35,678 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:22:35,678 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 9, 9, 8, 8, 7, 7, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2023-02-15 10:22:35,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-02-15 10:22:35,678 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:22:35,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:22:35,679 INFO L85 PathProgramCache]: Analyzing trace with hash -812160295, now seen corresponding path program 1 times [2023-02-15 10:22:35,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:22:35,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700984536] [2023-02-15 10:22:35,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:22:35,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:22:35,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:22:35,765 INFO L134 CoverageAnalysis]: Checked inductivity of 1301 backedges. 692 proven. 0 refuted. 0 times theorem prover too weak. 609 trivial. 0 not checked. [2023-02-15 10:22:35,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:22:35,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700984536] [2023-02-15 10:22:35,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700984536] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:22:35,765 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:22:35,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 10:22:35,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291583549] [2023-02-15 10:22:35,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:22:35,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 10:22:35,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:22:35,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 10:22:35,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 10:22:35,767 INFO L87 Difference]: Start difference. First operand 4391 states and 6069 transitions. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 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) [2023-02-15 10:22:35,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:22:35,906 INFO L93 Difference]: Finished difference Result 13143 states and 18162 transitions. [2023-02-15 10:22:35,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 10:22:35,907 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 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 354 [2023-02-15 10:22:35,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:22:35,919 INFO L225 Difference]: With dead ends: 13143 [2023-02-15 10:22:35,920 INFO L226 Difference]: Without dead ends: 8760 [2023-02-15 10:22:35,926 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 10:22:35,926 INFO L413 NwaCegarLoop]: 320 mSDtfsCounter, 125 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 10:22:35,927 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 486 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 10:22:35,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8760 states. [2023-02-15 10:22:36,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8760 to 8575. [2023-02-15 10:22:36,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8575 states, 8574 states have (on average 1.385117797993935) internal successors, (11876), 8574 states have internal predecessors, (11876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:22:36,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8575 states to 8575 states and 11876 transitions. [2023-02-15 10:22:36,131 INFO L78 Accepts]: Start accepts. Automaton has 8575 states and 11876 transitions. Word has length 354 [2023-02-15 10:22:36,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:22:36,131 INFO L495 AbstractCegarLoop]: Abstraction has 8575 states and 11876 transitions. [2023-02-15 10:22:36,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 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) [2023-02-15 10:22:36,131 INFO L276 IsEmpty]: Start isEmpty. Operand 8575 states and 11876 transitions. [2023-02-15 10:22:36,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2023-02-15 10:22:36,141 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:22:36,141 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 9, 9, 8, 8, 7, 7, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1] [2023-02-15 10:22:36,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-02-15 10:22:36,141 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:22:36,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:22:36,142 INFO L85 PathProgramCache]: Analyzing trace with hash 209922624, now seen corresponding path program 1 times [2023-02-15 10:22:36,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:22:36,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951984037] [2023-02-15 10:22:36,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:22:36,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:22:36,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:22:36,234 INFO L134 CoverageAnalysis]: Checked inductivity of 1301 backedges. 871 proven. 26 refuted. 0 times theorem prover too weak. 404 trivial. 0 not checked. [2023-02-15 10:22:36,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:22:36,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951984037] [2023-02-15 10:22:36,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951984037] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:22:36,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [749495366] [2023-02-15 10:22:36,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:22:36,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:22:36,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:22:36,236 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 10:22:36,238 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-15 10:22:36,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:22:36,345 INFO L263 TraceCheckSpWp]: Trace formula consists of 582 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-15 10:22:36,357 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:22:36,581 INFO L134 CoverageAnalysis]: Checked inductivity of 1301 backedges. 680 proven. 0 refuted. 0 times theorem prover too weak. 621 trivial. 0 not checked. [2023-02-15 10:22:36,582 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 10:22:36,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [749495366] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:22:36,582 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 10:22:36,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2023-02-15 10:22:36,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497831015] [2023-02-15 10:22:36,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:22:36,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 10:22:36,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:22:36,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 10:22:36,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 10:22:36,584 INFO L87 Difference]: Start difference. First operand 8575 states and 11876 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:22:36,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:22:36,751 INFO L93 Difference]: Finished difference Result 10751 states and 14913 transitions. [2023-02-15 10:22:36,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 10:22:36,752 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 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 355 [2023-02-15 10:22:36,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:22:36,764 INFO L225 Difference]: With dead ends: 10751 [2023-02-15 10:22:36,764 INFO L226 Difference]: Without dead ends: 8530 [2023-02-15 10:22:36,768 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 355 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 10:22:36,769 INFO L413 NwaCegarLoop]: 320 mSDtfsCounter, 83 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 10:22:36,769 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 480 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 10:22:36,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8530 states. [2023-02-15 10:22:36,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8530 to 6140. [2023-02-15 10:22:36,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6140 states, 6139 states have (on average 1.3924091871640332) internal successors, (8548), 6139 states have internal predecessors, (8548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:22:36,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6140 states to 6140 states and 8548 transitions. [2023-02-15 10:22:36,934 INFO L78 Accepts]: Start accepts. Automaton has 6140 states and 8548 transitions. Word has length 355 [2023-02-15 10:22:36,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:22:36,935 INFO L495 AbstractCegarLoop]: Abstraction has 6140 states and 8548 transitions. [2023-02-15 10:22:36,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:22:36,935 INFO L276 IsEmpty]: Start isEmpty. Operand 6140 states and 8548 transitions. [2023-02-15 10:22:36,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 418 [2023-02-15 10:22:36,945 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:22:36,946 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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] [2023-02-15 10:22:36,965 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-02-15 10:22:37,152 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,SelfDestructingSolverStorable16 [2023-02-15 10:22:37,153 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:22:37,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:22:37,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1965226690, now seen corresponding path program 1 times [2023-02-15 10:22:37,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:22:37,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256887628] [2023-02-15 10:22:37,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:22:37,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:22:37,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:22:37,254 INFO L134 CoverageAnalysis]: Checked inductivity of 2004 backedges. 1251 proven. 26 refuted. 0 times theorem prover too weak. 727 trivial. 0 not checked. [2023-02-15 10:22:37,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:22:37,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256887628] [2023-02-15 10:22:37,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256887628] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:22:37,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [837574845] [2023-02-15 10:22:37,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:22:37,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:22:37,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:22:37,263 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 10:22:37,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-15 10:22:37,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:22:37,392 INFO L263 TraceCheckSpWp]: Trace formula consists of 672 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-15 10:22:37,395 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:22:37,453 INFO L134 CoverageAnalysis]: Checked inductivity of 2004 backedges. 1251 proven. 26 refuted. 0 times theorem prover too weak. 727 trivial. 0 not checked. [2023-02-15 10:22:37,453 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:22:37,523 INFO L134 CoverageAnalysis]: Checked inductivity of 2004 backedges. 1251 proven. 26 refuted. 0 times theorem prover too weak. 727 trivial. 0 not checked. [2023-02-15 10:22:37,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [837574845] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 10:22:37,523 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 10:22:37,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2023-02-15 10:22:37,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599193812] [2023-02-15 10:22:37,523 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 10:22:37,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 10:22:37,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:22:37,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 10:22:37,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-15 10:22:37,525 INFO L87 Difference]: Start difference. First operand 6140 states and 8548 transitions. Second operand has 6 states, 6 states have (on average 42.833333333333336) internal successors, (257), 6 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:22:37,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:22:37,970 INFO L93 Difference]: Finished difference Result 13848 states and 19249 transitions. [2023-02-15 10:22:37,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 10:22:37,970 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 42.833333333333336) internal successors, (257), 6 states have internal predecessors, (257), 0 states have call successors, (0), 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 417 [2023-02-15 10:22:37,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:22:37,981 INFO L225 Difference]: With dead ends: 13848 [2023-02-15 10:22:37,982 INFO L226 Difference]: Without dead ends: 7414 [2023-02-15 10:22:37,988 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 840 GetRequests, 834 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2023-02-15 10:22:37,989 INFO L413 NwaCegarLoop]: 207 mSDtfsCounter, 385 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 385 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 10:22:37,989 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [385 Valid, 499 Invalid, 522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 10:22:37,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7414 states. [2023-02-15 10:22:38,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7414 to 6032. [2023-02-15 10:22:38,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6032 states, 6031 states have (on average 1.3669374896368762) internal successors, (8244), 6031 states have internal predecessors, (8244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:22:38,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6032 states to 6032 states and 8244 transitions. [2023-02-15 10:22:38,103 INFO L78 Accepts]: Start accepts. Automaton has 6032 states and 8244 transitions. Word has length 417 [2023-02-15 10:22:38,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:22:38,103 INFO L495 AbstractCegarLoop]: Abstraction has 6032 states and 8244 transitions. [2023-02-15 10:22:38,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 42.833333333333336) internal successors, (257), 6 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:22:38,103 INFO L276 IsEmpty]: Start isEmpty. Operand 6032 states and 8244 transitions. [2023-02-15 10:22:38,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 510 [2023-02-15 10:22:38,114 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:22:38,114 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 16, 16, 16, 14, 14, 12, 12, 10, 10, 8, 8, 8, 8, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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] [2023-02-15 10:22:38,121 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-02-15 10:22:38,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-02-15 10:22:38,320 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:22:38,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:22:38,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1529804208, now seen corresponding path program 1 times [2023-02-15 10:22:38,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:22:38,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57225254] [2023-02-15 10:22:38,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:22:38,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:22:38,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:22:38,575 INFO L134 CoverageAnalysis]: Checked inductivity of 3138 backedges. 1660 proven. 77 refuted. 0 times theorem prover too weak. 1401 trivial. 0 not checked. [2023-02-15 10:22:38,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:22:38,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57225254] [2023-02-15 10:22:38,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57225254] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:22:38,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1618531127] [2023-02-15 10:22:38,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:22:38,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:22:38,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:22:38,595 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 10:22:38,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-15 10:22:38,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:22:38,718 INFO L263 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-15 10:22:38,721 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:22:38,747 INFO L134 CoverageAnalysis]: Checked inductivity of 3138 backedges. 1671 proven. 0 refuted. 0 times theorem prover too weak. 1467 trivial. 0 not checked. [2023-02-15 10:22:38,748 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 10:22:38,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1618531127] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:22:38,748 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 10:22:38,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2023-02-15 10:22:38,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673588338] [2023-02-15 10:22:38,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:22:38,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 10:22:38,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:22:38,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 10:22:38,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-02-15 10:22:38,751 INFO L87 Difference]: Start difference. First operand 6032 states and 8244 transitions. Second operand has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:22:38,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:22:38,922 INFO L93 Difference]: Finished difference Result 12486 states and 17159 transitions. [2023-02-15 10:22:38,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 10:22:38,923 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 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 509 [2023-02-15 10:22:38,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:22:38,932 INFO L225 Difference]: With dead ends: 12486 [2023-02-15 10:22:38,933 INFO L226 Difference]: Without dead ends: 6462 [2023-02-15 10:22:38,939 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 513 GetRequests, 510 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-02-15 10:22:38,940 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 92 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 10:22:38,940 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 216 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 10:22:38,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6462 states. [2023-02-15 10:22:39,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6462 to 6266. [2023-02-15 10:22:39,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6266 states, 6265 states have (on average 1.3661612130885874) internal successors, (8559), 6265 states have internal predecessors, (8559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:22:39,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6266 states to 6266 states and 8559 transitions. [2023-02-15 10:22:39,099 INFO L78 Accepts]: Start accepts. Automaton has 6266 states and 8559 transitions. Word has length 509 [2023-02-15 10:22:39,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:22:39,099 INFO L495 AbstractCegarLoop]: Abstraction has 6266 states and 8559 transitions. [2023-02-15 10:22:39,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:22:39,099 INFO L276 IsEmpty]: Start isEmpty. Operand 6266 states and 8559 transitions. [2023-02-15 10:22:39,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 514 [2023-02-15 10:22:39,110 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:22:39,111 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 18, 16, 14, 14, 12, 12, 10, 10, 8, 8, 8, 8, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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] [2023-02-15 10:22:39,129 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-02-15 10:22:39,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:22:39,317 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:22:39,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:22:39,317 INFO L85 PathProgramCache]: Analyzing trace with hash -1911316890, now seen corresponding path program 1 times [2023-02-15 10:22:39,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:22:39,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763415227] [2023-02-15 10:22:39,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:22:39,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:22:39,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:22:39,572 INFO L134 CoverageAnalysis]: Checked inductivity of 3204 backedges. 1744 proven. 206 refuted. 0 times theorem prover too weak. 1254 trivial. 0 not checked. [2023-02-15 10:22:39,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:22:39,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763415227] [2023-02-15 10:22:39,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763415227] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:22:39,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1609205768] [2023-02-15 10:22:39,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:22:39,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:22:39,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:22:39,589 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 10:22:39,601 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-15 10:22:39,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:22:39,726 INFO L263 TraceCheckSpWp]: Trace formula consists of 814 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-15 10:22:39,730 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:22:40,366 INFO L134 CoverageAnalysis]: Checked inductivity of 3204 backedges. 1792 proven. 239 refuted. 0 times theorem prover too weak. 1173 trivial. 0 not checked. [2023-02-15 10:22:40,366 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:22:40,872 INFO L134 CoverageAnalysis]: Checked inductivity of 3204 backedges. 1887 proven. 144 refuted. 0 times theorem prover too weak. 1173 trivial. 0 not checked. [2023-02-15 10:22:40,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1609205768] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 10:22:40,873 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 10:22:40,873 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2023-02-15 10:22:40,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123914567] [2023-02-15 10:22:40,875 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 10:22:40,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-15 10:22:40,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:22:40,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-15 10:22:40,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2023-02-15 10:22:40,877 INFO L87 Difference]: Start difference. First operand 6266 states and 8559 transitions. Second operand has 11 states, 11 states have (on average 38.0) internal successors, (418), 11 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:22:42,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:22:42,889 INFO L93 Difference]: Finished difference Result 26866 states and 36740 transitions. [2023-02-15 10:22:42,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-02-15 10:22:42,889 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 38.0) internal successors, (418), 11 states have internal predecessors, (418), 0 states have call successors, (0), 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 513 [2023-02-15 10:22:42,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:22:42,919 INFO L225 Difference]: With dead ends: 26866 [2023-02-15 10:22:42,919 INFO L226 Difference]: Without dead ends: 19739 [2023-02-15 10:22:42,930 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1057 GetRequests, 1033 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=196, Invalid=454, Unknown=0, NotChecked=0, Total=650 [2023-02-15 10:22:42,931 INFO L413 NwaCegarLoop]: 377 mSDtfsCounter, 1210 mSDsluCounter, 1154 mSDsCounter, 0 mSdLazyCounter, 1859 mSolverCounterSat, 209 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1210 SdHoareTripleChecker+Valid, 1531 SdHoareTripleChecker+Invalid, 2068 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 209 IncrementalHoareTripleChecker+Valid, 1859 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-02-15 10:22:42,931 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1210 Valid, 1531 Invalid, 2068 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [209 Valid, 1859 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-02-15 10:22:42,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19739 states. [2023-02-15 10:22:43,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19739 to 18645. [2023-02-15 10:22:43,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18645 states, 18644 states have (on average 1.3174747908174211) internal successors, (24563), 18644 states have internal predecessors, (24563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:22:43,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18645 states to 18645 states and 24563 transitions. [2023-02-15 10:22:43,692 INFO L78 Accepts]: Start accepts. Automaton has 18645 states and 24563 transitions. Word has length 513 [2023-02-15 10:22:43,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:22:43,693 INFO L495 AbstractCegarLoop]: Abstraction has 18645 states and 24563 transitions. [2023-02-15 10:22:43,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 38.0) internal successors, (418), 11 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:22:43,693 INFO L276 IsEmpty]: Start isEmpty. Operand 18645 states and 24563 transitions. [2023-02-15 10:22:43,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 584 [2023-02-15 10:22:43,723 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:22:43,724 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 20, 20, 20, 20, 18, 16, 16, 14, 14, 12, 12, 10, 10, 10, 10, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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, 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] [2023-02-15 10:22:43,729 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-02-15 10:22:43,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:22:43,930 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:22:43,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:22:43,930 INFO L85 PathProgramCache]: Analyzing trace with hash 944376353, now seen corresponding path program 2 times [2023-02-15 10:22:43,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:22:43,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738653308] [2023-02-15 10:22:43,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:22:43,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:22:43,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:22:44,075 INFO L134 CoverageAnalysis]: Checked inductivity of 4078 backedges. 1321 proven. 16 refuted. 0 times theorem prover too weak. 2741 trivial. 0 not checked. [2023-02-15 10:22:44,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:22:44,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738653308] [2023-02-15 10:22:44,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738653308] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:22:44,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [913116614] [2023-02-15 10:22:44,076 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 10:22:44,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:22:44,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:22:44,097 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 10:22:44,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-02-15 10:22:44,258 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 10:22:44,259 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 10:22:44,262 INFO L263 TraceCheckSpWp]: Trace formula consists of 900 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-15 10:22:44,265 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:22:44,315 INFO L134 CoverageAnalysis]: Checked inductivity of 4078 backedges. 1321 proven. 16 refuted. 0 times theorem prover too weak. 2741 trivial. 0 not checked. [2023-02-15 10:22:44,315 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:22:44,370 INFO L134 CoverageAnalysis]: Checked inductivity of 4078 backedges. 1321 proven. 16 refuted. 0 times theorem prover too weak. 2741 trivial. 0 not checked. [2023-02-15 10:22:44,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [913116614] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 10:22:44,371 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 10:22:44,371 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2023-02-15 10:22:44,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824752206] [2023-02-15 10:22:44,371 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 10:22:44,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 10:22:44,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:22:44,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 10:22:44,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-02-15 10:22:44,373 INFO L87 Difference]: Start difference. First operand 18645 states and 24563 transitions. Second operand has 8 states, 8 states have (on average 34.25) internal successors, (274), 8 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:22:45,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:22:45,038 INFO L93 Difference]: Finished difference Result 28966 states and 37845 transitions. [2023-02-15 10:22:45,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 10:22:45,039 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 34.25) internal successors, (274), 8 states have internal predecessors, (274), 0 states have call successors, (0), 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 583 [2023-02-15 10:22:45,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:22:45,039 INFO L225 Difference]: With dead ends: 28966 [2023-02-15 10:22:45,039 INFO L226 Difference]: Without dead ends: 0 [2023-02-15 10:22:45,056 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1176 GetRequests, 1166 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2023-02-15 10:22:45,056 INFO L413 NwaCegarLoop]: 293 mSDtfsCounter, 234 mSDsluCounter, 747 mSDsCounter, 0 mSdLazyCounter, 731 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 1040 SdHoareTripleChecker+Invalid, 768 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 731 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-15 10:22:45,057 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 1040 Invalid, 768 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 731 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-15 10:22:45,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-02-15 10:22:45,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-02-15 10:22:45,057 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) [2023-02-15 10:22:45,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-02-15 10:22:45,058 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 583 [2023-02-15 10:22:45,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:22:45,058 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-02-15 10:22:45,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 34.25) internal successors, (274), 8 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:22:45,058 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-02-15 10:22:45,058 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-02-15 10:22:45,060 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-02-15 10:22:45,069 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-02-15 10:22:45,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:22:45,268 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-02-15 10:23:00,954 INFO L899 garLoopResultBuilder]: For program point L267(lines 267 272) no Hoare annotation was computed. [2023-02-15 10:23:00,954 INFO L899 garLoopResultBuilder]: For program point L201(lines 201 608) no Hoare annotation was computed. [2023-02-15 10:23:00,954 INFO L899 garLoopResultBuilder]: For program point L168(lines 168 619) no Hoare annotation was computed. [2023-02-15 10:23:00,954 INFO L899 garLoopResultBuilder]: For program point L135(lines 135 630) no Hoare annotation was computed. [2023-02-15 10:23:00,955 INFO L895 garLoopResultBuilder]: At program point ssl3_accept_switch_1_8593#1(lines 186 613) the Hoare annotation is: (let ((.cse4 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse5 (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse6 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse7 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (.cse0 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse2 (let ((.cse9 (* 2 (mod (+ |ULTIMATE.start_ssl3_accept_~ag_X~0#1| |ULTIMATE.start_ssl3_accept_~ag_Y~0#1|) 2147483648)))) (or (not (<= .cse9 2147483647)) (< .cse9 8656)))) (.cse1 (<= 8512 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse8 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse3 (not (<= 8656 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and .cse0 .cse1 .cse2 (< |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8496) .cse3) (and .cse4 .cse1 .cse2 .cse3) (and .cse5 .cse4 .cse6 .cse1 .cse7) (and .cse5 .cse6 .cse1 .cse8 .cse7) (and .cse5 .cse0 .cse6 .cse1 .cse7) (and .cse0 .cse1 (< 8496 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|) .cse2 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576) .cse3) (and .cse1 .cse8 .cse3))) [2023-02-15 10:23:00,955 INFO L899 garLoopResultBuilder]: For program point L367(lines 367 398) no Hoare annotation was computed. [2023-02-15 10:23:00,955 INFO L899 garLoopResultBuilder]: For program point L334(lines 334 338) no Hoare annotation was computed. [2023-02-15 10:23:00,955 INFO L895 garLoopResultBuilder]: At program point ssl3_accept_switch_1_8529#1(lines 159 622) the Hoare annotation is: (let ((.cse2 (let ((.cse9 (* 2 (mod (+ |ULTIMATE.start_ssl3_accept_~ag_X~0#1| |ULTIMATE.start_ssl3_accept_~ag_Y~0#1|) 2147483648)))) (or (not (<= .cse9 2147483647)) (< .cse9 8656)))) (.cse3 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) (.cse0 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse5 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse6 (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse4 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse7 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse1 (<= 8512 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse8 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|)))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse1 .cse2 .cse3) (and .cse1 .cse5 .cse3) (and .cse6 .cse0 .cse7 .cse1 .cse8) (and .cse6 .cse7 .cse1 .cse5 .cse8) (and .cse6 .cse4 .cse7 .cse1 .cse8))) [2023-02-15 10:23:00,955 INFO L899 garLoopResultBuilder]: For program point L334-2(lines 334 338) no Hoare annotation was computed. [2023-02-15 10:23:00,955 INFO L899 garLoopResultBuilder]: For program point L533(lines 533 538) no Hoare annotation was computed. [2023-02-15 10:23:00,955 INFO L895 garLoopResultBuilder]: At program point ssl3_accept_switch_1_8497#1(lines 147 626) the Hoare annotation is: (let ((.cse11 (* 2 (mod (+ |ULTIMATE.start_ssl3_accept_~ag_X~0#1| |ULTIMATE.start_ssl3_accept_~ag_Y~0#1|) 2147483648)))) (let ((.cse9 (not (<= .cse11 2147483647))) (.cse10 (< .cse11 8656))) (let ((.cse1 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse5 (<= 8466 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse6 (or .cse9 .cse10)) (.cse7 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) (.cse4 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse0 (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse8 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse3 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|)))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse4 .cse2 .cse5 .cse6 .cse7) (and .cse0 (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|) .cse2 .cse8 .cse7) (and .cse0 (or .cse9 .cse10 (not (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8496))) .cse2 .cse5 .cse8 .cse7) (and .cse0 .cse1 .cse2 .cse5 .cse6 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576) .cse7) (and .cse0 .cse4 .cse2 .cse3) (and .cse0 .cse2 .cse8 .cse3))))) [2023-02-15 10:23:00,955 INFO L899 garLoopResultBuilder]: For program point L567(lines 567 571) no Hoare annotation was computed. [2023-02-15 10:23:00,955 INFO L899 garLoopResultBuilder]: For program point L303(lines 303 307) no Hoare annotation was computed. [2023-02-15 10:23:00,955 INFO L899 garLoopResultBuilder]: For program point L303-2(lines 221 599) no Hoare annotation was computed. [2023-02-15 10:23:00,955 INFO L899 garLoopResultBuilder]: For program point L204(lines 204 607) no Hoare annotation was computed. [2023-02-15 10:23:00,955 INFO L899 garLoopResultBuilder]: For program point L171(lines 171 618) no Hoare annotation was computed. [2023-02-15 10:23:00,955 INFO L899 garLoopResultBuilder]: For program point L138(lines 138 629) no Hoare annotation was computed. [2023-02-15 10:23:00,955 INFO L895 garLoopResultBuilder]: At program point ssl3_accept_switch_1_8482#1(lines 135 630) the Hoare annotation is: (let ((.cse1 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse4 (<= 8466 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse7 (let ((.cse9 (* 2 (mod (+ |ULTIMATE.start_ssl3_accept_~ag_X~0#1| |ULTIMATE.start_ssl3_accept_~ag_Y~0#1|) 2147483648)))) (or (not (<= .cse9 2147483647)) (< .cse9 8656)))) (.cse6 (not (<= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse8 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse0 (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse5 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse3 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|)))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6) (and .cse1 .cse4 .cse7 (< |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8496) .cse6) (and .cse8 .cse4 .cse7 .cse6) (and .cse1 .cse4 (< 8496 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|) .cse7 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576) .cse6) (and .cse0 .cse8 .cse2 .cse3) (and .cse0 .cse2 .cse5 .cse3))) [2023-02-15 10:23:00,955 INFO L899 garLoopResultBuilder]: For program point L370(lines 370 397) no Hoare annotation was computed. [2023-02-15 10:23:00,956 INFO L899 garLoopResultBuilder]: For program point L370-1(lines 370 397) no Hoare annotation was computed. [2023-02-15 10:23:00,956 INFO L899 garLoopResultBuilder]: For program point L371(lines 371 394) no Hoare annotation was computed. [2023-02-15 10:23:00,956 INFO L902 garLoopResultBuilder]: At program point L669(lines 76 686) the Hoare annotation is: true [2023-02-15 10:23:00,956 INFO L899 garLoopResultBuilder]: For program point L207(lines 207 606) no Hoare annotation was computed. [2023-02-15 10:23:00,956 INFO L899 garLoopResultBuilder]: For program point L174(lines 174 617) no Hoare annotation was computed. [2023-02-15 10:23:00,956 INFO L899 garLoopResultBuilder]: For program point L141(lines 141 628) no Hoare annotation was computed. [2023-02-15 10:23:00,956 INFO L899 garLoopResultBuilder]: For program point L406(lines 406 437) no Hoare annotation was computed. [2023-02-15 10:23:00,956 INFO L899 garLoopResultBuilder]: For program point L241(lines 241 258) no Hoare annotation was computed. [2023-02-15 10:23:00,956 INFO L899 garLoopResultBuilder]: For program point L241-2(lines 221 599) no Hoare annotation was computed. [2023-02-15 10:23:00,956 INFO L899 garLoopResultBuilder]: For program point L638(lines 638 666) no Hoare annotation was computed. [2023-02-15 10:23:00,956 INFO L899 garLoopResultBuilder]: For program point L407(lines 407 413) no Hoare annotation was computed. [2023-02-15 10:23:00,956 INFO L899 garLoopResultBuilder]: For program point L374(lines 374 393) no Hoare annotation was computed. [2023-02-15 10:23:00,956 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(lines 688 699) the Hoare annotation is: true [2023-02-15 10:23:00,956 INFO L899 garLoopResultBuilder]: For program point L639(lines 639 663) no Hoare annotation was computed. [2023-02-15 10:23:00,956 INFO L899 garLoopResultBuilder]: For program point L573(lines 573 577) no Hoare annotation was computed. [2023-02-15 10:23:00,956 INFO L899 garLoopResultBuilder]: For program point L540(lines 540 544) no Hoare annotation was computed. [2023-02-15 10:23:00,956 INFO L899 garLoopResultBuilder]: For program point L507(lines 507 511) no Hoare annotation was computed. [2023-02-15 10:23:00,956 INFO L899 garLoopResultBuilder]: For program point L573-2(lines 573 577) no Hoare annotation was computed. [2023-02-15 10:23:00,956 INFO L899 garLoopResultBuilder]: For program point L540-2(lines 221 599) no Hoare annotation was computed. [2023-02-15 10:23:00,956 INFO L899 garLoopResultBuilder]: For program point L375(lines 375 379) no Hoare annotation was computed. [2023-02-15 10:23:00,956 INFO L899 garLoopResultBuilder]: For program point L375-2(lines 374 391) no Hoare annotation was computed. [2023-02-15 10:23:00,957 INFO L899 garLoopResultBuilder]: For program point L243(lines 243 248) no Hoare annotation was computed. [2023-02-15 10:23:00,957 INFO L899 garLoopResultBuilder]: For program point L210(lines 210 605) no Hoare annotation was computed. [2023-02-15 10:23:00,957 INFO L899 garLoopResultBuilder]: For program point L177(lines 177 616) no Hoare annotation was computed. [2023-02-15 10:23:00,957 INFO L899 garLoopResultBuilder]: For program point L144(lines 144 627) no Hoare annotation was computed. [2023-02-15 10:23:00,957 INFO L895 garLoopResultBuilder]: At program point L111-2(lines 111 668) the Hoare annotation is: (let ((.cse28 (+ |ULTIMATE.start_ssl3_accept_~ag_X~0#1| |ULTIMATE.start_ssl3_accept_~ag_Y~0#1|))) (let ((.cse27 (* 2 (mod .cse28 2147483648))) (.cse10 (* (div .cse28 2147483648) 4294967296)) (.cse11 (+ (* 2 |ULTIMATE.start_ssl3_accept_~ag_X~0#1|) (* 2 |ULTIMATE.start_ssl3_accept_~ag_Y~0#1|)))) (let ((.cse4 (<= 8656 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse12 (= (+ .cse10 |ULTIMATE.start_ssl3_accept_~s__state~0#1|) .cse11)) (.cse21 (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|)) (.cse26 (not (<= .cse27 2147483647)))) (let ((.cse20 (= 3 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|)) (.cse9 (or .cse26 (<= .cse27 8496))) (.cse1 (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse16 (<= 8640 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|)) (.cse13 (<= 8512 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse6 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8448)) (.cse25 (<= 8466 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse18 (not .cse21)) (.cse14 (< |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8496)) (.cse24 (not (<= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse19 (or .cse12 (and (not (<= .cse11 (+ .cse10 2147483647))) (= (+ .cse10 |ULTIMATE.start_ssl3_accept_~s__state~0#1| 4294967296) .cse11)))) (.cse22 (not (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8496))) (.cse8 (< 8496 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|)) (.cse23 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) (.cse7 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse17 (<= 8640 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse2 (or .cse26 (< .cse27 8656))) (.cse3 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576)) (.cse15 (not .cse4)) (.cse0 (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse5 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse6 .cse2 (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 3)) (and .cse7 .cse6 .cse8 .cse2 .cse3) (and .cse9 .cse5) (and .cse7 (= (+ .cse10 8496) .cse11) .cse12 .cse3) (and .cse7 (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8512) .cse2) (and .cse7 .cse13 .cse2 .cse14 .cse15) (and .cse1 .cse16 .cse17 .cse18) (and .cse5 .cse13 .cse2 .cse15) (and .cse7 .cse18) (and .cse19 .cse7 .cse14 .cse15) (and .cse1 .cse6 .cse20 .cse2 .cse21) (and .cse5 .cse22 .cse8 .cse2 .cse3 .cse23) (and .cse5 .cse6 .cse20) (and .cse7 .cse2 (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (and .cse0 .cse1 .cse18 .cse4) (and .cse0 .cse7 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) .cse2 .cse3 .cse4) (and .cse9 .cse7 .cse8 .cse12 .cse3) (and (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8528) .cse7 .cse2) (and .cse5 .cse2 .cse14 .cse24) (and .cse1 .cse16 .cse6 .cse18) (and .cse7 .cse13 .cse8 .cse2 .cse3 .cse15) (and .cse5 .cse25 .cse2 .cse24) (and .cse5 .cse6 .cse8 .cse2 .cse3) (and .cse7 .cse25 .cse8 .cse2 .cse3 .cse24) (and .cse5 .cse18) (and .cse7 .cse2 .cse14 .cse24) (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0) (and .cse19 .cse5) (and .cse7 .cse22 .cse8 .cse2 .cse3 .cse23) (and .cse7 (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|) .cse2) (and .cse7 .cse17 .cse2 .cse3 .cse15) (and .cse0 .cse5 .cse4)))))) [2023-02-15 10:23:00,957 INFO L899 garLoopResultBuilder]: For program point L673(lines 673 677) no Hoare annotation was computed. [2023-02-15 10:23:00,957 INFO L899 garLoopResultBuilder]: For program point L640(lines 640 649) no Hoare annotation was computed. [2023-02-15 10:23:00,957 INFO L899 garLoopResultBuilder]: For program point L673-2(lines 673 677) no Hoare annotation was computed. [2023-02-15 10:23:00,957 INFO L899 garLoopResultBuilder]: For program point L640-2(lines 639 661) no Hoare annotation was computed. [2023-02-15 10:23:00,957 INFO L899 garLoopResultBuilder]: For program point L475(lines 475 479) no Hoare annotation was computed. [2023-02-15 10:23:00,957 INFO L899 garLoopResultBuilder]: For program point L343-1(lines 343 352) no Hoare annotation was computed. [2023-02-15 10:23:00,957 INFO L895 garLoopResultBuilder]: At program point ssl3_accept_switch_1_8481#1(lines 129 632) the Hoare annotation is: (let ((.cse5 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse2 (<= 8466 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse7 (let ((.cse9 (* 2 (mod (+ |ULTIMATE.start_ssl3_accept_~ag_X~0#1| |ULTIMATE.start_ssl3_accept_~ag_Y~0#1|) 2147483648)))) (or (not (<= .cse9 2147483647)) (< .cse9 8656)))) (.cse4 (not (<= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse8 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse0 (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse3 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse6 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse5 .cse1 .cse6) (and .cse0 .cse5 .cse1 .cse2 .cse7 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576) .cse4) (and .cse0 .cse8 .cse1 .cse2 .cse7 .cse4) (and .cse0 .cse8 .cse1 .cse6) (and .cse0 .cse1 .cse3 .cse6))) [2023-02-15 10:23:00,957 INFO L899 garLoopResultBuilder]: For program point L112(line 112) no Hoare annotation was computed. [2023-02-15 10:23:00,957 INFO L899 garLoopResultBuilder]: For program point L642(lines 642 646) no Hoare annotation was computed. [2023-02-15 10:23:00,957 INFO L899 garLoopResultBuilder]: For program point L213(lines 213 604) no Hoare annotation was computed. [2023-02-15 10:23:00,957 INFO L899 garLoopResultBuilder]: For program point L180(lines 180 615) no Hoare annotation was computed. [2023-02-15 10:23:00,958 INFO L899 garLoopResultBuilder]: For program point L147(lines 147 626) no Hoare annotation was computed. [2023-02-15 10:23:00,958 INFO L899 garLoopResultBuilder]: For program point L114(lines 114 637) no Hoare annotation was computed. [2023-02-15 10:23:00,958 INFO L899 garLoopResultBuilder]: For program point L347(lines 347 351) no Hoare annotation was computed. [2023-02-15 10:23:00,958 INFO L899 garLoopResultBuilder]: For program point L480(lines 480 491) no Hoare annotation was computed. [2023-02-15 10:23:00,958 INFO L899 garLoopResultBuilder]: For program point L447(lines 447 451) no Hoare annotation was computed. [2023-02-15 10:23:00,958 INFO L895 garLoopResultBuilder]: At program point L381(lines 364 399) the Hoare annotation is: (let ((.cse2 (let ((.cse9 (* 2 (mod (+ |ULTIMATE.start_ssl3_accept_~ag_X~0#1| |ULTIMATE.start_ssl3_accept_~ag_Y~0#1|) 2147483648)))) (or (not (<= .cse9 2147483647)) (< .cse9 8656)))) (.cse3 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) (.cse0 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse5 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse6 (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse4 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse7 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse1 (<= 8512 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse8 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|)))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse1 .cse2 .cse3) (and .cse1 .cse5 .cse3) (and .cse6 .cse0 .cse7 .cse1 .cse8) (and .cse6 .cse7 .cse1 .cse5 .cse8) (and .cse6 .cse4 .cse7 .cse1 .cse8))) [2023-02-15 10:23:00,958 INFO L899 garLoopResultBuilder]: For program point L249(lines 249 254) no Hoare annotation was computed. [2023-02-15 10:23:00,958 INFO L899 garLoopResultBuilder]: For program point L216(lines 216 603) no Hoare annotation was computed. [2023-02-15 10:23:00,958 INFO L899 garLoopResultBuilder]: For program point L183(lines 183 614) no Hoare annotation was computed. [2023-02-15 10:23:00,958 INFO L895 garLoopResultBuilder]: At program point ssl3_accept_switch_1_8657#1(lines 204 607) the Hoare annotation is: (let ((.cse1 (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse5 (let ((.cse8 (* 2 (mod (+ |ULTIMATE.start_ssl3_accept_~ag_X~0#1| |ULTIMATE.start_ssl3_accept_~ag_Y~0#1|) 2147483648)))) (or (not (<= .cse8 2147483647)) (< .cse8 8656)))) (.cse6 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576)) (.cse7 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse3 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (.cse0 (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse4 (<= 8656 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse5 .cse6 .cse4) (and .cse0 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1) .cse2 .cse4) (and .cse0 .cse7 .cse2 .cse5 .cse6 .cse4) (and .cse0 .cse7 .cse2 .cse3 .cse4) (and .cse0 .cse2 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0) .cse4))) [2023-02-15 10:23:00,958 INFO L899 garLoopResultBuilder]: For program point L150(lines 150 625) no Hoare annotation was computed. [2023-02-15 10:23:00,958 INFO L899 garLoopResultBuilder]: For program point L117(lines 117 636) no Hoare annotation was computed. [2023-02-15 10:23:00,958 INFO L899 garLoopResultBuilder]: For program point L85(lines 85 93) no Hoare annotation was computed. [2023-02-15 10:23:00,958 INFO L899 garLoopResultBuilder]: For program point L383(lines 383 387) no Hoare annotation was computed. [2023-02-15 10:23:00,958 INFO L899 garLoopResultBuilder]: For program point L417(lines 417 423) no Hoare annotation was computed. [2023-02-15 10:23:00,958 INFO L899 garLoopResultBuilder]: For program point L186(lines 186 613) no Hoare annotation was computed. [2023-02-15 10:23:00,958 INFO L899 garLoopResultBuilder]: For program point L153(lines 153 624) no Hoare annotation was computed. [2023-02-15 10:23:00,958 INFO L899 garLoopResultBuilder]: For program point L120(lines 120 635) no Hoare annotation was computed. [2023-02-15 10:23:00,958 INFO L899 garLoopResultBuilder]: For program point L583(lines 583 593) no Hoare annotation was computed. [2023-02-15 10:23:00,959 INFO L899 garLoopResultBuilder]: For program point L583-1(lines 583 593) no Hoare annotation was computed. [2023-02-15 10:23:00,959 INFO L899 garLoopResultBuilder]: For program point L484(lines 484 488) no Hoare annotation was computed. [2023-02-15 10:23:00,959 INFO L899 garLoopResultBuilder]: For program point L286(lines 286 290) no Hoare annotation was computed. [2023-02-15 10:23:00,959 INFO L899 garLoopResultBuilder]: For program point L88(lines 88 92) no Hoare annotation was computed. [2023-02-15 10:23:00,959 INFO L899 garLoopResultBuilder]: For program point L88-2(lines 85 93) no Hoare annotation was computed. [2023-02-15 10:23:00,959 INFO L895 garLoopResultBuilder]: At program point ssl3_accept_switch_1_3#1(lines 216 603) the Hoare annotation is: (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) [2023-02-15 10:23:00,959 INFO L899 garLoopResultBuilder]: For program point L518(lines 518 522) no Hoare annotation was computed. [2023-02-15 10:23:00,959 INFO L899 garLoopResultBuilder]: For program point L320(lines 320 328) no Hoare annotation was computed. [2023-02-15 10:23:00,959 INFO L902 garLoopResultBuilder]: At program point L684(lines 76 686) the Hoare annotation is: true [2023-02-15 10:23:00,959 INFO L899 garLoopResultBuilder]: For program point L651(lines 651 657) no Hoare annotation was computed. [2023-02-15 10:23:00,959 INFO L895 garLoopResultBuilder]: At program point ssl3_accept_switch_1_default#1(lines 219 602) the Hoare annotation is: (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) [2023-02-15 10:23:00,959 INFO L895 garLoopResultBuilder]: At program point $Ultimate##176(lines 457 469) the Hoare annotation is: (let ((.cse6 (* 2 (mod (+ |ULTIMATE.start_ssl3_accept_~ag_X~0#1| |ULTIMATE.start_ssl3_accept_~ag_Y~0#1|) 2147483648)))) (let ((.cse5 (not (<= .cse6 2147483647))) (.cse11 (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (let ((.cse10 (= 3 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|)) (.cse8 (< |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8496)) (.cse0 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse9 (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse12 (not .cse11)) (.cse7 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse1 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8448)) (.cse2 (< 8496 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|)) (.cse3 (or .cse5 (< .cse6 8656))) (.cse4 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and (or .cse5 (<= .cse6 8496)) .cse7 .cse1) (and .cse0 .cse1 .cse3 .cse8) (and .cse9 .cse1 .cse10 .cse3 .cse11) (and .cse1 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (and .cse7 .cse1 .cse10) (and .cse7 .cse1 .cse12) (and .cse7 .cse1 .cse3 .cse8) (and .cse0 .cse1 .cse12) (and .cse9 (<= 8640 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|) .cse1 .cse12) (and .cse7 .cse1 .cse2 .cse3 .cse4))))) [2023-02-15 10:23:00,959 INFO L899 garLoopResultBuilder]: For program point L552(lines 552 557) no Hoare annotation was computed. [2023-02-15 10:23:00,959 INFO L895 garLoopResultBuilder]: At program point ssl3_accept_switch_1_8577#1(lines 180 615) the Hoare annotation is: (let ((.cse4 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse5 (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse6 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse7 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (.cse0 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse2 (let ((.cse9 (* 2 (mod (+ |ULTIMATE.start_ssl3_accept_~ag_X~0#1| |ULTIMATE.start_ssl3_accept_~ag_Y~0#1|) 2147483648)))) (or (not (<= .cse9 2147483647)) (< .cse9 8656)))) (.cse1 (<= 8512 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse8 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse3 (not (<= 8656 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and .cse0 .cse1 .cse2 (< |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8496) .cse3) (and .cse4 .cse1 .cse2 .cse3) (and .cse5 .cse4 .cse6 .cse1 .cse7) (and .cse5 .cse6 .cse1 .cse8 .cse7) (and .cse5 .cse0 .cse6 .cse1 .cse7) (and .cse0 .cse1 (< 8496 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|) .cse2 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576) .cse3) (and .cse1 .cse8 .cse3))) [2023-02-15 10:23:00,959 INFO L899 garLoopResultBuilder]: For program point L189(lines 189 612) no Hoare annotation was computed. [2023-02-15 10:23:00,959 INFO L899 garLoopResultBuilder]: For program point L156(lines 156 623) no Hoare annotation was computed. [2023-02-15 10:23:00,959 INFO L899 garLoopResultBuilder]: For program point L123(lines 123 634) no Hoare annotation was computed. [2023-02-15 10:23:00,959 INFO L899 garLoopResultBuilder]: For program point L586(lines 586 590) no Hoare annotation was computed. [2023-02-15 10:23:00,959 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-02-15 10:23:00,960 INFO L895 garLoopResultBuilder]: At program point ssl3_accept_switch_1_8641#1(lines 198 609) the Hoare annotation is: (let ((.cse6 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse5 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse0 (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse4 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (.cse1 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse3 (<= 8640 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse8 (let ((.cse9 (* 2 (mod (+ |ULTIMATE.start_ssl3_accept_~ag_X~0#1| |ULTIMATE.start_ssl3_accept_~ag_Y~0#1|) 2147483648)))) (or (not (<= .cse9 2147483647)) (< .cse9 8656)))) (.cse7 (not (<= 8656 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse5 .cse2 .cse3 .cse4) (and .cse0 .cse2 .cse3 .cse6 .cse4) (and .cse3 .cse6 .cse7) (and .cse5 .cse3 .cse8 .cse7) (and .cse0 (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse2 (<= 8640 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|) .cse3 .cse4) (and .cse1 .cse3 .cse8 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576) .cse7))) [2023-02-15 10:23:00,960 INFO L899 garLoopResultBuilder]: For program point L323(lines 323 327) no Hoare annotation was computed. [2023-02-15 10:23:00,960 INFO L899 garLoopResultBuilder]: For program point L323-2(lines 221 599) no Hoare annotation was computed. [2023-02-15 10:23:00,960 INFO L895 garLoopResultBuilder]: At program point L224(lines 117 636) the Hoare annotation is: (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) [2023-02-15 10:23:00,960 INFO L895 garLoopResultBuilder]: At program point ssl3_accept_ERROR#1(lines 76 686) the Hoare annotation is: false [2023-02-15 10:23:00,960 INFO L902 garLoopResultBuilder]: At program point ssl3_accept_returnLabel#1(lines 19 687) the Hoare annotation is: true [2023-02-15 10:23:00,960 INFO L899 garLoopResultBuilder]: For program point L192(lines 192 611) no Hoare annotation was computed. [2023-02-15 10:23:00,960 INFO L899 garLoopResultBuilder]: For program point L159(lines 159 622) no Hoare annotation was computed. [2023-02-15 10:23:00,960 INFO L899 garLoopResultBuilder]: For program point L126(lines 126 633) no Hoare annotation was computed. [2023-02-15 10:23:00,960 INFO L899 garLoopResultBuilder]: For program point L523(lines 523 527) no Hoare annotation was computed. [2023-02-15 10:23:00,960 INFO L899 garLoopResultBuilder]: For program point L523-2(lines 523 527) no Hoare annotation was computed. [2023-02-15 10:23:00,960 INFO L899 garLoopResultBuilder]: For program point L457-1(lines 457 469) no Hoare annotation was computed. [2023-02-15 10:23:00,960 INFO L895 garLoopResultBuilder]: At program point $Ultimate##130(lines 343 352) the Hoare annotation is: (let ((.cse2 (let ((.cse9 (* 2 (mod (+ |ULTIMATE.start_ssl3_accept_~ag_X~0#1| |ULTIMATE.start_ssl3_accept_~ag_Y~0#1|) 2147483648)))) (or (not (<= .cse9 2147483647)) (< .cse9 8656)))) (.cse3 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) (.cse0 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse5 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse6 (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse4 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse7 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse1 (<= 8512 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse8 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|)))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse1 .cse2 .cse3) (and .cse1 .cse5 .cse3) (and .cse6 .cse0 .cse7 .cse1 .cse8) (and .cse6 .cse7 .cse1 .cse5 .cse8) (and .cse6 .cse4 .cse7 .cse1 .cse8))) [2023-02-15 10:23:00,960 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-02-15 10:23:00,960 INFO L895 garLoopResultBuilder]: At program point ssl3_accept_switch_1_8673#1(lines 210 605) the Hoare annotation is: (let ((.cse1 (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse3 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (.cse0 (<= 8656 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (or (and (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0) .cse0) (and .cse1 (let ((.cse2 (* 2 (mod (+ |ULTIMATE.start_ssl3_accept_~ag_X~0#1| |ULTIMATE.start_ssl3_accept_~ag_Y~0#1|) 2147483648)))) (or (not (<= .cse2 2147483647)) (< .cse2 8656))) (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576) .cse0) (and (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1) .cse0) (and .cse1 .cse3 .cse0) (and (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse3 .cse0))) [2023-02-15 10:23:00,960 INFO L895 garLoopResultBuilder]: At program point L425(lines 416 436) the Hoare annotation is: (let ((.cse6 (let ((.cse9 (* 2 (mod (+ |ULTIMATE.start_ssl3_accept_~ag_X~0#1| |ULTIMATE.start_ssl3_accept_~ag_Y~0#1|) 2147483648)))) (or (not (<= .cse9 2147483647)) (< .cse9 8656)))) (.cse4 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) (.cse7 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse3 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse0 (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse5 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse2 (<= 8512 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse8 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse5 .cse1 .cse2 .cse6 .cse4) (and .cse0 .cse7 .cse1 .cse2 .cse6 .cse4) (and .cse0 .cse7 .cse1 .cse2 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse8) (and .cse0 .cse5 .cse1 .cse2 .cse8))) [2023-02-15 10:23:00,960 INFO L899 garLoopResultBuilder]: For program point L359(lines 359 363) no Hoare annotation was computed. [2023-02-15 10:23:00,960 INFO L899 garLoopResultBuilder]: For program point L359-2(lines 221 599) no Hoare annotation was computed. [2023-02-15 10:23:00,961 INFO L899 garLoopResultBuilder]: For program point L95(lines 95 103) no Hoare annotation was computed. [2023-02-15 10:23:00,961 INFO L899 garLoopResultBuilder]: For program point L95-1(lines 76 686) no Hoare annotation was computed. [2023-02-15 10:23:00,961 INFO L895 garLoopResultBuilder]: At program point ssl3_accept_switch_1_8609#1(lines 192 611) the Hoare annotation is: (let ((.cse2 (let ((.cse9 (* 2 (mod (+ |ULTIMATE.start_ssl3_accept_~ag_X~0#1| |ULTIMATE.start_ssl3_accept_~ag_Y~0#1|) 2147483648)))) (or (not (<= .cse9 2147483647)) (< .cse9 8656)))) (.cse0 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse5 (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse4 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse6 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse7 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (.cse1 (<= 8512 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse8 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse3 (not (<= 8656 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse1 .cse2 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576) .cse3) (and .cse5 .cse0 .cse6 .cse1 .cse7) (and .cse5 .cse6 .cse1 .cse8 .cse7) (and .cse5 .cse4 .cse6 .cse1 .cse7) (and .cse1 .cse8 .cse3))) [2023-02-15 10:23:00,961 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-02-15 10:23:00,961 INFO L895 garLoopResultBuilder]: At program point $Ultimate##158(lines 405 442) the Hoare annotation is: (let ((.cse2 (let ((.cse9 (* 2 (mod (+ |ULTIMATE.start_ssl3_accept_~ag_X~0#1| |ULTIMATE.start_ssl3_accept_~ag_Y~0#1|) 2147483648)))) (or (not (<= .cse9 2147483647)) (< .cse9 8656)))) (.cse3 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) (.cse0 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse5 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse6 (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse4 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse7 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse1 (<= 8512 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse8 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|)))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse1 .cse2 .cse3) (and .cse1 .cse5 .cse3) (and .cse6 .cse0 .cse7 .cse1 .cse8) (and .cse6 .cse7 .cse1 .cse5 .cse8) (and .cse6 .cse4 .cse7 .cse1 .cse8))) [2023-02-15 10:23:00,961 INFO L899 garLoopResultBuilder]: For program point L195(lines 195 610) no Hoare annotation was computed. [2023-02-15 10:23:00,961 INFO L899 garLoopResultBuilder]: For program point L162(lines 162 621) no Hoare annotation was computed. [2023-02-15 10:23:00,961 INFO L899 garLoopResultBuilder]: For program point L129(lines 129 632) no Hoare annotation was computed. [2023-02-15 10:23:00,961 INFO L899 garLoopResultBuilder]: For program point L96(lines 96 100) no Hoare annotation was computed. [2023-02-15 10:23:00,961 INFO L895 garLoopResultBuilder]: At program point ssl3_accept_switch_1_8466#1(lines 138 629) the Hoare annotation is: (let ((.cse7 (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|)) (.cse10 (+ |ULTIMATE.start_ssl3_accept_~ag_X~0#1| |ULTIMATE.start_ssl3_accept_~ag_Y~0#1|))) (let ((.cse1 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse6 (let ((.cse11 (* 2 (mod .cse10 2147483648)))) (or (not (<= .cse11 2147483647)) (< .cse11 8656)))) (.cse8 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576)) (.cse5 (not (<= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse9 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse0 (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse4 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse3 (not .cse7))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5) (and .cse1 .cse6 .cse7 (< |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8496) .cse8 .cse5) (and .cse9 .cse6 .cse5) (and .cse1 (= (+ (* (div .cse10 2147483648) 4294967296) 8496) (+ (* 2 |ULTIMATE.start_ssl3_accept_~ag_X~0#1|) (* 2 |ULTIMATE.start_ssl3_accept_~ag_Y~0#1|))) .cse7 .cse8 .cse5) (and .cse1 (< 8496 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|) .cse6 .cse8 .cse5) (and .cse0 .cse9 .cse2 .cse3) (and .cse0 .cse2 .cse4 .cse3)))) [2023-02-15 10:23:00,961 INFO L899 garLoopResultBuilder]: For program point L460(lines 460 465) no Hoare annotation was computed. [2023-02-15 10:23:00,961 INFO L895 garLoopResultBuilder]: At program point $Ultimate##166(lines 416 436) the Hoare annotation is: (let ((.cse2 (let ((.cse9 (* 2 (mod (+ |ULTIMATE.start_ssl3_accept_~ag_X~0#1| |ULTIMATE.start_ssl3_accept_~ag_Y~0#1|) 2147483648)))) (or (not (<= .cse9 2147483647)) (< .cse9 8656)))) (.cse3 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) (.cse0 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse5 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse6 (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse4 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse7 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse1 (<= 8512 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse8 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|)))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse1 .cse2 .cse3) (and .cse1 .cse5 .cse3) (and .cse6 .cse0 .cse7 .cse1 .cse8) (and .cse6 .cse7 .cse1 .cse5 .cse8) (and .cse6 .cse4 .cse7 .cse1 .cse8))) [2023-02-15 10:23:00,961 INFO L895 garLoopResultBuilder]: At program point ssl3_accept_switch_1_12292#1(lines 114 637) the Hoare annotation is: (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) [2023-02-15 10:23:00,961 INFO L899 garLoopResultBuilder]: For program point L229(lines 229 233) no Hoare annotation was computed. [2023-02-15 10:23:00,961 INFO L899 garLoopResultBuilder]: For program point L229-2(lines 221 599) no Hoare annotation was computed. [2023-02-15 10:23:00,961 INFO L899 garLoopResultBuilder]: For program point L428(lines 428 432) no Hoare annotation was computed. [2023-02-15 10:23:00,961 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-02-15 10:23:00,962 INFO L895 garLoopResultBuilder]: At program point $Ultimate##219(lines 638 666) the Hoare annotation is: (let ((.cse28 (+ |ULTIMATE.start_ssl3_accept_~ag_X~0#1| |ULTIMATE.start_ssl3_accept_~ag_Y~0#1|))) (let ((.cse27 (* 2 (mod .cse28 2147483648))) (.cse10 (* (div .cse28 2147483648) 4294967296)) (.cse11 (+ (* 2 |ULTIMATE.start_ssl3_accept_~ag_X~0#1|) (* 2 |ULTIMATE.start_ssl3_accept_~ag_Y~0#1|)))) (let ((.cse4 (<= 8656 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse12 (= (+ .cse10 |ULTIMATE.start_ssl3_accept_~s__state~0#1|) .cse11)) (.cse21 (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|)) (.cse26 (not (<= .cse27 2147483647)))) (let ((.cse20 (= 3 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|)) (.cse9 (or .cse26 (<= .cse27 8496))) (.cse1 (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse16 (<= 8640 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|)) (.cse13 (<= 8512 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse6 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8448)) (.cse25 (<= 8466 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse18 (not .cse21)) (.cse14 (< |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8496)) (.cse24 (not (<= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse19 (or .cse12 (and (not (<= .cse11 (+ .cse10 2147483647))) (= (+ .cse10 |ULTIMATE.start_ssl3_accept_~s__state~0#1| 4294967296) .cse11)))) (.cse22 (not (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8496))) (.cse8 (< 8496 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|)) (.cse23 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) (.cse7 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse17 (<= 8640 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse2 (or .cse26 (< .cse27 8656))) (.cse3 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576)) (.cse15 (not .cse4)) (.cse0 (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse5 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse6 .cse2 (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 3)) (and .cse7 .cse6 .cse8 .cse2 .cse3) (and .cse9 .cse5) (and .cse7 (= (+ .cse10 8496) .cse11) .cse12 .cse3) (and .cse7 (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8512) .cse2) (and .cse7 .cse13 .cse2 .cse14 .cse15) (and .cse1 .cse16 .cse17 .cse18) (and .cse5 .cse13 .cse2 .cse15) (and .cse7 .cse18) (and .cse19 .cse7 .cse14 .cse15) (and .cse1 .cse6 .cse20 .cse2 .cse21) (and .cse5 .cse22 .cse8 .cse2 .cse3 .cse23) (and .cse5 .cse6 .cse20) (and .cse7 .cse2 (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (and .cse0 .cse1 .cse18 .cse4) (and .cse0 .cse7 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) .cse2 .cse3 .cse4) (and .cse9 .cse7 .cse8 .cse12 .cse3) (and (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8528) .cse7 .cse2) (and .cse5 .cse2 .cse14 .cse24) (and .cse1 .cse16 .cse6 .cse18) (and .cse7 .cse13 .cse8 .cse2 .cse3 .cse15) (and .cse5 .cse25 .cse2 .cse24) (and .cse5 .cse6 .cse8 .cse2 .cse3) (and .cse7 .cse25 .cse8 .cse2 .cse3 .cse24) (and .cse5 .cse18) (and .cse7 .cse2 .cse14 .cse24) (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0) (and .cse19 .cse5) (and .cse7 .cse22 .cse8 .cse2 .cse3 .cse23) (and .cse7 (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|) .cse2) (and .cse7 .cse17 .cse2 .cse3 .cse15) (and .cse0 .cse5 .cse4)))))) [2023-02-15 10:23:00,962 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 680) no Hoare annotation was computed. [2023-02-15 10:23:00,962 INFO L899 garLoopResultBuilder]: For program point L198(lines 198 609) no Hoare annotation was computed. [2023-02-15 10:23:00,962 INFO L899 garLoopResultBuilder]: For program point L165(lines 165 620) no Hoare annotation was computed. [2023-02-15 10:23:00,962 INFO L899 garLoopResultBuilder]: For program point L132(lines 132 631) no Hoare annotation was computed. [2023-02-15 10:23:00,962 INFO L895 garLoopResultBuilder]: At program point ssl3_accept_switch_1_8561#1(lines 171 618) the Hoare annotation is: (let ((.cse6 (let ((.cse9 (* 2 (mod (+ |ULTIMATE.start_ssl3_accept_~ag_X~0#1| |ULTIMATE.start_ssl3_accept_~ag_Y~0#1|) 2147483648)))) (or (not (<= .cse9 2147483647)) (< .cse9 8656)))) (.cse4 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) (.cse7 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse3 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse0 (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse5 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse2 (<= 8512 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse8 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse5 .cse1 .cse2 .cse6 .cse4) (and .cse0 .cse7 .cse1 .cse2 .cse6 .cse4) (and .cse0 .cse7 .cse1 .cse2 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse8) (and .cse0 .cse5 .cse1 .cse2 .cse8))) [2023-02-15 10:23:00,962 INFO L899 garLoopResultBuilder]: For program point L562(lines 562 566) no Hoare annotation was computed. [2023-02-15 10:23:00,962 INFO L899 garLoopResultBuilder]: For program point L496(lines 496 500) no Hoare annotation was computed. [2023-02-15 10:23:00,962 INFO L899 garLoopResultBuilder]: For program point L266(lines 266 280) no Hoare annotation was computed. [2023-02-15 10:23:00,964 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:23:00,966 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-15 10:23:00,993 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.02 10:23:00 BoogieIcfgContainer [2023-02-15 10:23:00,993 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-15 10:23:00,993 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-15 10:23:00,993 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-15 10:23:00,994 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-15 10:23:00,994 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:22:30" (3/4) ... [2023-02-15 10:23:00,996 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-02-15 10:23:01,006 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2023-02-15 10:23:01,006 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2023-02-15 10:23:01,007 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2023-02-15 10:23:01,007 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-02-15 10:23:01,052 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-15 10:23:01,052 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-15 10:23:01,053 INFO L158 Benchmark]: Toolchain (without parser) took 31161.32ms. Allocated memory was 138.4MB in the beginning and 1.1GB in the end (delta: 977.3MB). Free memory was 72.4MB in the beginning and 438.1MB in the end (delta: -365.7MB). Peak memory consumption was 614.1MB. Max. memory is 16.1GB. [2023-02-15 10:23:01,053 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 138.4MB. Free memory is still 109.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 10:23:01,053 INFO L158 Benchmark]: CACSL2BoogieTranslator took 220.50ms. Allocated memory was 138.4MB in the beginning and 218.1MB in the end (delta: 79.7MB). Free memory was 72.2MB in the beginning and 182.6MB in the end (delta: -110.3MB). Peak memory consumption was 12.0MB. Max. memory is 16.1GB. [2023-02-15 10:23:01,054 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.99ms. Allocated memory is still 218.1MB. Free memory was 182.6MB in the beginning and 179.5MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-15 10:23:01,054 INFO L158 Benchmark]: Boogie Preprocessor took 32.76ms. Allocated memory is still 218.1MB. Free memory was 179.5MB in the beginning and 177.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-15 10:23:01,054 INFO L158 Benchmark]: RCFGBuilder took 506.89ms. Allocated memory is still 218.1MB. Free memory was 177.4MB in the beginning and 141.8MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2023-02-15 10:23:01,054 INFO L158 Benchmark]: TraceAbstraction took 30303.46ms. Allocated memory was 218.1MB in the beginning and 1.1GB in the end (delta: 897.6MB). Free memory was 141.6MB in the beginning and 446.5MB in the end (delta: -304.9MB). Peak memory consumption was 671.3MB. Max. memory is 16.1GB. [2023-02-15 10:23:01,054 INFO L158 Benchmark]: Witness Printer took 58.86ms. Allocated memory is still 1.1GB. Free memory was 446.5MB in the beginning and 438.1MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-02-15 10:23:01,055 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.12ms. Allocated memory is still 138.4MB. Free memory is still 109.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 220.50ms. Allocated memory was 138.4MB in the beginning and 218.1MB in the end (delta: 79.7MB). Free memory was 72.2MB in the beginning and 182.6MB in the end (delta: -110.3MB). Peak memory consumption was 12.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.99ms. Allocated memory is still 218.1MB. Free memory was 182.6MB in the beginning and 179.5MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.76ms. Allocated memory is still 218.1MB. Free memory was 179.5MB in the beginning and 177.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 506.89ms. Allocated memory is still 218.1MB. Free memory was 177.4MB in the beginning and 141.8MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * TraceAbstraction took 30303.46ms. Allocated memory was 218.1MB in the beginning and 1.1GB in the end (delta: 897.6MB). Free memory was 141.6MB in the beginning and 446.5MB in the end (delta: -304.9MB). Peak memory consumption was 671.3MB. Max. memory is 16.1GB. * Witness Printer took 58.86ms. Allocated memory is still 1.1GB. Free memory was 446.5MB in the beginning and 438.1MB in the end (delta: 8.4MB). 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: 680]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 138 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 30.2s, OverallIterations: 21, TraceHistogramMax: 21, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.2s, AutomataDifference: 5.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 15.7s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3548 SdHoareTripleChecker+Valid, 3.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3548 mSDsluCounter, 9878 SdHoareTripleChecker+Invalid, 2.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4754 mSDsCounter, 692 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5092 IncrementalHoareTripleChecker+Invalid, 5784 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 692 mSolverCounterUnsat, 5124 mSDtfsCounter, 5092 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4503 GetRequests, 4435 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18645occurred in iteration=20, InterpolantAutomatonStates: 100, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.2s AutomataMinimizationTime, 21 MinimizatonAttempts, 7834 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 29 LocationsWithAnnotation, 29 PreInvPairs, 1191 NumberOfFragments, 4675 HoareAnnotationTreeSize, 29 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 29 FomulaSimplificationsInter, 176543 FormulaSimplificationTreeSizeReductionInter, 15.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 7884 NumberOfCodeBlocks, 7884 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 9619 ConstructedInterpolants, 0 QuantifiedInterpolants, 23496 SizeOfPredicates, 13 NumberOfNonLiveVariables, 4217 ConjunctsInSsa, 18 ConjunctsInUnsatCore, 31 InterpolantComputations, 17 PerfectInterpolantSequences, 43543/44409 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 1 specifications checked. All of them hold - InvariantResult [Line: 114]: Loop Invariant Derived loop invariant: !(s__state == 8672) - InvariantResult [Line: 76]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 416]: Loop Invariant Derived loop invariant: ((((((((!(8673 == s__state) && !(s__state == 8672)) && 8512 <= s__state) && blastFlag == 0) && s__state <= 8576) || (((((!(8673 == s__state) && 2 == blastFlag) && !(s__state == 8672)) && 8512 <= s__state) && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && s__state <= 8576)) || (((((!(8673 == s__state) && blastFlag == 1) && !(s__state == 8672)) && 8512 <= s__state) && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && s__state <= 8576)) || ((((!(8673 == s__state) && blastFlag == 1) && !(s__state == 8672)) && 8512 <= s__state) && !(0 == s__hit))) || ((((!(8673 == s__state) && !(s__state == 8672)) && 8512 <= s__state) && blastFlag == 0) && !(0 == s__hit))) || ((((!(8673 == s__state) && 2 == blastFlag) && !(s__state == 8672)) && 8512 <= s__state) && !(0 == s__hit)) - InvariantResult [Line: 159]: Loop Invariant Derived loop invariant: (((((((blastFlag == 1 && 8512 <= s__state) && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && s__state <= 8576) || (((2 == blastFlag && 8512 <= s__state) && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && s__state <= 8576)) || ((8512 <= s__state && blastFlag == 0) && s__state <= 8576)) || ((((!(8673 == s__state) && blastFlag == 1) && !(s__state == 8672)) && 8512 <= s__state) && !(0 == s__hit))) || ((((!(8673 == s__state) && !(s__state == 8672)) && 8512 <= s__state) && blastFlag == 0) && !(0 == s__hit))) || ((((!(8673 == s__state) && 2 == blastFlag) && !(s__state == 8672)) && 8512 <= s__state) && !(0 == s__hit)) - InvariantResult [Line: 147]: Loop Invariant Derived loop invariant: ((((((((!(8673 == s__state) && 2 == blastFlag) && !(s__state == 8672)) && !(0 == s__hit)) || (((((!(8673 == s__state) && blastFlag == 1) && !(s__state == 8672)) && 8466 <= s__state) && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && s__state <= 8576)) || ((((!(8673 == s__state) && 8496 == s__state) && !(s__state == 8672)) && blastFlag == 0) && s__state <= 8576)) || (((((!(8673 == s__state) && ((!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656) || !(s__state <= 8496))) && !(s__state == 8672)) && 8466 <= s__state) && blastFlag == 0) && s__state <= 8576)) || ((((((!(8673 == s__state) && 2 == blastFlag) && !(s__state == 8672)) && 8466 <= s__state) && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576)) || (((!(8673 == s__state) && blastFlag == 1) && !(s__state == 8672)) && !(0 == s__hit))) || (((!(8673 == s__state) && !(s__state == 8672)) && blastFlag == 0) && !(0 == s__hit)) - InvariantResult [Line: 76]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: !(s__state == 8672) - InvariantResult [Line: 192]: Loop Invariant Derived loop invariant: (((((((blastFlag == 1 && 8512 <= s__state) && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && !(8656 <= s__state)) || ((((2 == blastFlag && 8512 <= s__state) && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && s__s3__tmp__next_state___0 <= 8576) && !(8656 <= s__state))) || ((((!(8673 == s__state) && blastFlag == 1) && !(s__state == 8672)) && 8512 <= s__state) && !(0 == s__hit))) || ((((!(8673 == s__state) && !(s__state == 8672)) && 8512 <= s__state) && blastFlag == 0) && !(0 == s__hit))) || ((((!(8673 == s__state) && 2 == blastFlag) && !(s__state == 8672)) && 8512 <= s__state) && !(0 == s__hit))) || ((8512 <= s__state && blastFlag == 0) && !(8656 <= s__state)) - InvariantResult [Line: 186]: Loop Invariant Derived loop invariant: (((((((((2 == blastFlag && 8512 <= s__state) && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && s__s3__tmp__next_state___0 < 8496) && !(8656 <= s__state)) || (((blastFlag == 1 && 8512 <= s__state) && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && !(8656 <= s__state))) || ((((!(8673 == s__state) && blastFlag == 1) && !(s__state == 8672)) && 8512 <= s__state) && !(0 == s__hit))) || ((((!(8673 == s__state) && !(s__state == 8672)) && 8512 <= s__state) && blastFlag == 0) && !(0 == s__hit))) || ((((!(8673 == s__state) && 2 == blastFlag) && !(s__state == 8672)) && 8512 <= s__state) && !(0 == s__hit))) || (((((2 == blastFlag && 8512 <= s__state) && 8496 < s__s3__tmp__next_state___0) && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && s__s3__tmp__next_state___0 <= 8576) && !(8656 <= s__state))) || ((8512 <= s__state && blastFlag == 0) && !(8656 <= s__state)) - InvariantResult [Line: 138]: Loop Invariant Derived loop invariant: (((((((((!(8673 == s__state) && 2 == blastFlag) && !(s__state == 8672)) && !(0 == s__hit)) || (blastFlag == 0 && !(8496 <= s__state))) || (((((2 == blastFlag && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && 0 == s__hit) && s__s3__tmp__next_state___0 < 8496) && s__s3__tmp__next_state___0 <= 8576) && !(8496 <= s__state))) || ((blastFlag == 1 && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && !(8496 <= s__state))) || ((((2 == blastFlag && (ag_X + ag_Y) / 2147483648 * 4294967296 + 8496 == 2 * ag_X + 2 * ag_Y) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8576) && !(8496 <= s__state))) || ((((2 == blastFlag && 8496 < s__s3__tmp__next_state___0) && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && s__s3__tmp__next_state___0 <= 8576) && !(8496 <= s__state))) || (((!(8673 == s__state) && blastFlag == 1) && !(s__state == 8672)) && !(0 == s__hit))) || (((!(8673 == s__state) && !(s__state == 8672)) && blastFlag == 0) && !(0 == s__hit)) - InvariantResult [Line: 180]: Loop Invariant Derived loop invariant: (((((((((2 == blastFlag && 8512 <= s__state) && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && s__s3__tmp__next_state___0 < 8496) && !(8656 <= s__state)) || (((blastFlag == 1 && 8512 <= s__state) && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && !(8656 <= s__state))) || ((((!(8673 == s__state) && blastFlag == 1) && !(s__state == 8672)) && 8512 <= s__state) && !(0 == s__hit))) || ((((!(8673 == s__state) && !(s__state == 8672)) && 8512 <= s__state) && blastFlag == 0) && !(0 == s__hit))) || ((((!(8673 == s__state) && 2 == blastFlag) && !(s__state == 8672)) && 8512 <= s__state) && !(0 == s__hit))) || (((((2 == blastFlag && 8512 <= s__state) && 8496 < s__s3__tmp__next_state___0) && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && s__s3__tmp__next_state___0 <= 8576) && !(8656 <= s__state))) || ((8512 <= s__state && blastFlag == 0) && !(8656 <= s__state)) - InvariantResult [Line: 210]: Loop Invariant Derived loop invariant: ((((blastFlag == 0 && 8656 <= s__state) || (((3 == blastFlag && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && s__s3__tmp__next_state___0 <= 8576) && 8656 <= s__state)) || (blastFlag == 1 && 8656 <= s__state)) || ((3 == blastFlag && !(0 == s__hit)) && 8656 <= s__state)) || ((2 == blastFlag && !(0 == s__hit)) && 8656 <= s__state) - InvariantResult [Line: 129]: Loop Invariant Derived loop invariant: ((((((((!(8673 == s__state) && !(s__state == 8672)) && 8466 <= s__state) && blastFlag == 0) && !(8496 <= s__state)) || (((!(8673 == s__state) && 2 == blastFlag) && !(s__state == 8672)) && !(0 == s__hit))) || ((((((!(8673 == s__state) && 2 == blastFlag) && !(s__state == 8672)) && 8466 <= s__state) && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && s__s3__tmp__next_state___0 <= 8576) && !(8496 <= s__state))) || (((((!(8673 == s__state) && blastFlag == 1) && !(s__state == 8672)) && 8466 <= s__state) && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && !(8496 <= s__state))) || (((!(8673 == s__state) && blastFlag == 1) && !(s__state == 8672)) && !(0 == s__hit))) || (((!(8673 == s__state) && !(s__state == 8672)) && blastFlag == 0) && !(0 == s__hit)) - InvariantResult [Line: 638]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((!(8673 == s__state) && 3 == blastFlag) && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && s__s3__tmp__next_state___0 <= 8576) && 8656 <= s__state) || (((blastFlag == 1 && s__state <= 8448) && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && s__state == 3)) || ((((2 == blastFlag && s__state <= 8448) && 8496 < s__s3__tmp__next_state___0) && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && s__s3__tmp__next_state___0 <= 8576)) || ((!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) <= 8496) && blastFlag == 1)) || (((2 == blastFlag && (ag_X + ag_Y) / 2147483648 * 4294967296 + 8496 == 2 * ag_X + 2 * ag_Y) && (ag_X + ag_Y) / 2147483648 * 4294967296 + s__state == 2 * ag_X + 2 * ag_Y) && s__s3__tmp__next_state___0 <= 8576)) || ((2 == blastFlag && s__state == 8512) && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656))) || ((((2 == blastFlag && 8512 <= s__state) && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && s__s3__tmp__next_state___0 < 8496) && !(8656 <= s__state))) || (((3 == blastFlag && 8640 <= s__s3__tmp__next_state___0) && 8640 <= s__state) && !(0 == s__hit))) || (((blastFlag == 1 && 8512 <= s__state) && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && !(8656 <= s__state))) || (2 == blastFlag && !(0 == s__hit))) || (((((ag_X + ag_Y) / 2147483648 * 4294967296 + s__state == 2 * ag_X + 2 * ag_Y || (!(2 * ag_X + 2 * ag_Y <= (ag_X + ag_Y) / 2147483648 * 4294967296 + 2147483647) && (ag_X + ag_Y) / 2147483648 * 4294967296 + s__state + 4294967296 == 2 * ag_X + 2 * ag_Y)) && 2 == blastFlag) && s__s3__tmp__next_state___0 < 8496) && !(8656 <= s__state))) || ((((3 == blastFlag && s__state <= 8448) && 3 == s__s3__tmp__next_state___0) && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && 0 == s__hit)) || (((((blastFlag == 1 && !(s__state <= 8496)) && 8496 < s__s3__tmp__next_state___0) && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576)) || ((blastFlag == 1 && s__state <= 8448) && 3 == s__s3__tmp__next_state___0)) || ((2 == blastFlag && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && 8544 == s__state)) || (((!(8673 == s__state) && 3 == blastFlag) && !(0 == s__hit)) && 8656 <= s__state)) || (((((!(8673 == s__state) && 2 == blastFlag) && !(s__state == 8672)) && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && s__s3__tmp__next_state___0 <= 8576) && 8656 <= s__state)) || (((((!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) <= 8496) && 2 == blastFlag) && 8496 < s__s3__tmp__next_state___0) && (ag_X + ag_Y) / 2147483648 * 4294967296 + s__state == 2 * ag_X + 2 * ag_Y) && s__s3__tmp__next_state___0 <= 8576)) || ((s__state == 8528 && 2 == blastFlag) && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656))) || (((blastFlag == 1 && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && s__s3__tmp__next_state___0 < 8496) && !(8496 <= s__state))) || (((3 == blastFlag && 8640 <= s__s3__tmp__next_state___0) && s__state <= 8448) && !(0 == s__hit))) || (((((2 == blastFlag && 8512 <= s__state) && 8496 < s__s3__tmp__next_state___0) && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && s__s3__tmp__next_state___0 <= 8576) && !(8656 <= s__state))) || (((blastFlag == 1 && 8466 <= s__state) && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && !(8496 <= s__state))) || ((((blastFlag == 1 && s__state <= 8448) && 8496 < s__s3__tmp__next_state___0) && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && s__s3__tmp__next_state___0 <= 8576)) || (((((2 == blastFlag && 8466 <= s__state) && 8496 < s__s3__tmp__next_state___0) && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && s__s3__tmp__next_state___0 <= 8576) && !(8496 <= s__state))) || (blastFlag == 1 && !(0 == s__hit))) || (((2 == blastFlag && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && s__s3__tmp__next_state___0 < 8496) && !(8496 <= s__state))) || blastFlag == 0) || (((ag_X + ag_Y) / 2147483648 * 4294967296 + s__state == 2 * ag_X + 2 * ag_Y || (!(2 * ag_X + 2 * ag_Y <= (ag_X + ag_Y) / 2147483648 * 4294967296 + 2147483647) && (ag_X + ag_Y) / 2147483648 * 4294967296 + s__state + 4294967296 == 2 * ag_X + 2 * ag_Y)) && blastFlag == 1)) || (((((2 == blastFlag && !(s__state <= 8496)) && 8496 < s__s3__tmp__next_state___0) && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576)) || ((2 == blastFlag && 8560 == s__state) && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656))) || ((((2 == blastFlag && 8640 <= s__state) && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && s__s3__tmp__next_state___0 <= 8576) && !(8656 <= s__state))) || ((!(8673 == s__state) && blastFlag == 1) && 8656 <= s__state) - InvariantResult [Line: 457]: Loop Invariant Derived loop invariant: (((((((((((((2 == blastFlag && s__state <= 8448) && 8496 < s__s3__tmp__next_state___0) && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && s__s3__tmp__next_state___0 <= 8576) || (((!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) <= 8496) && blastFlag == 1) && s__state <= 8448)) || (((2 == blastFlag && s__state <= 8448) && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && s__s3__tmp__next_state___0 < 8496)) || ((((3 == blastFlag && s__state <= 8448) && 3 == s__s3__tmp__next_state___0) && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && 0 == s__hit)) || (s__state <= 8448 && blastFlag == 0)) || ((blastFlag == 1 && s__state <= 8448) && 3 == s__s3__tmp__next_state___0)) || ((blastFlag == 1 && s__state <= 8448) && !(0 == s__hit))) || (((blastFlag == 1 && s__state <= 8448) && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && s__s3__tmp__next_state___0 < 8496)) || ((2 == blastFlag && s__state <= 8448) && !(0 == s__hit))) || (((3 == blastFlag && 8640 <= s__s3__tmp__next_state___0) && s__state <= 8448) && !(0 == s__hit))) || ((((blastFlag == 1 && s__state <= 8448) && 8496 < s__s3__tmp__next_state___0) && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && s__s3__tmp__next_state___0 <= 8576) - InvariantResult [Line: 198]: Loop Invariant Derived loop invariant: (((((((((!(8673 == s__state) && 2 == blastFlag) && !(s__state == 8672)) && 8640 <= s__state) && !(0 == s__hit)) || ((((!(8673 == s__state) && blastFlag == 1) && !(s__state == 8672)) && 8640 <= s__state) && !(0 == s__hit))) || ((((!(8673 == s__state) && !(s__state == 8672)) && 8640 <= s__state) && blastFlag == 0) && !(0 == s__hit))) || ((8640 <= s__state && blastFlag == 0) && !(8656 <= s__state))) || (((blastFlag == 1 && 8640 <= s__state) && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && !(8656 <= s__state))) || (((((!(8673 == s__state) && 3 == blastFlag) && !(s__state == 8672)) && 8640 <= s__s3__tmp__next_state___0) && 8640 <= s__state) && !(0 == s__hit))) || ((((2 == blastFlag && 8640 <= s__state) && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && s__s3__tmp__next_state___0 <= 8576) && !(8656 <= s__state)) - InvariantResult [Line: 219]: Loop Invariant Derived loop invariant: !(s__state == 8672) - InvariantResult [Line: 135]: Loop Invariant Derived loop invariant: ((((((((!(8673 == s__state) && 2 == blastFlag) && !(s__state == 8672)) && !(0 == s__hit)) || ((8466 <= s__state && blastFlag == 0) && !(8496 <= s__state))) || ((((2 == blastFlag && 8466 <= s__state) && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && s__s3__tmp__next_state___0 < 8496) && !(8496 <= s__state))) || (((blastFlag == 1 && 8466 <= s__state) && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && !(8496 <= s__state))) || (((((2 == blastFlag && 8466 <= s__state) && 8496 < s__s3__tmp__next_state___0) && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && s__s3__tmp__next_state___0 <= 8576) && !(8496 <= s__state))) || (((!(8673 == s__state) && blastFlag == 1) && !(s__state == 8672)) && !(0 == s__hit))) || (((!(8673 == s__state) && !(s__state == 8672)) && blastFlag == 0) && !(0 == s__hit)) - InvariantResult [Line: 171]: Loop Invariant Derived loop invariant: ((((((((!(8673 == s__state) && !(s__state == 8672)) && 8512 <= s__state) && blastFlag == 0) && s__state <= 8576) || (((((!(8673 == s__state) && 2 == blastFlag) && !(s__state == 8672)) && 8512 <= s__state) && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && s__state <= 8576)) || (((((!(8673 == s__state) && blastFlag == 1) && !(s__state == 8672)) && 8512 <= s__state) && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && s__state <= 8576)) || ((((!(8673 == s__state) && blastFlag == 1) && !(s__state == 8672)) && 8512 <= s__state) && !(0 == s__hit))) || ((((!(8673 == s__state) && !(s__state == 8672)) && 8512 <= s__state) && blastFlag == 0) && !(0 == s__hit))) || ((((!(8673 == s__state) && 2 == blastFlag) && !(s__state == 8672)) && 8512 <= s__state) && !(0 == s__hit)) - InvariantResult [Line: 204]: Loop Invariant Derived loop invariant: ((((((((!(8673 == s__state) && 3 == blastFlag) && !(s__state == 8672)) && !(0 == s__hit)) && 8656 <= s__state) || (((((!(8673 == s__state) && 3 == blastFlag) && !(s__state == 8672)) && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && s__s3__tmp__next_state___0 <= 8576) && 8656 <= s__state)) || (((!(8673 == s__state) && blastFlag == 1) && !(s__state == 8672)) && 8656 <= s__state)) || (((((!(8673 == s__state) && 2 == blastFlag) && !(s__state == 8672)) && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && s__s3__tmp__next_state___0 <= 8576) && 8656 <= s__state)) || ((((!(8673 == s__state) && 2 == blastFlag) && !(s__state == 8672)) && !(0 == s__hit)) && 8656 <= s__state)) || (((!(8673 == s__state) && !(s__state == 8672)) && blastFlag == 0) && 8656 <= s__state) - InvariantResult [Line: 216]: Loop Invariant Derived loop invariant: !(s__state == 8672) - InvariantResult [Line: 76]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 688]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 343]: Loop Invariant Derived loop invariant: (((((((blastFlag == 1 && 8512 <= s__state) && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && s__state <= 8576) || (((2 == blastFlag && 8512 <= s__state) && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && s__state <= 8576)) || ((8512 <= s__state && blastFlag == 0) && s__state <= 8576)) || ((((!(8673 == s__state) && blastFlag == 1) && !(s__state == 8672)) && 8512 <= s__state) && !(0 == s__hit))) || ((((!(8673 == s__state) && !(s__state == 8672)) && 8512 <= s__state) && blastFlag == 0) && !(0 == s__hit))) || ((((!(8673 == s__state) && 2 == blastFlag) && !(s__state == 8672)) && 8512 <= s__state) && !(0 == s__hit)) - InvariantResult [Line: 111]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((!(8673 == s__state) && 3 == blastFlag) && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && s__s3__tmp__next_state___0 <= 8576) && 8656 <= s__state) || (((blastFlag == 1 && s__state <= 8448) && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && s__state == 3)) || ((((2 == blastFlag && s__state <= 8448) && 8496 < s__s3__tmp__next_state___0) && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && s__s3__tmp__next_state___0 <= 8576)) || ((!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) <= 8496) && blastFlag == 1)) || (((2 == blastFlag && (ag_X + ag_Y) / 2147483648 * 4294967296 + 8496 == 2 * ag_X + 2 * ag_Y) && (ag_X + ag_Y) / 2147483648 * 4294967296 + s__state == 2 * ag_X + 2 * ag_Y) && s__s3__tmp__next_state___0 <= 8576)) || ((2 == blastFlag && s__state == 8512) && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656))) || ((((2 == blastFlag && 8512 <= s__state) && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && s__s3__tmp__next_state___0 < 8496) && !(8656 <= s__state))) || (((3 == blastFlag && 8640 <= s__s3__tmp__next_state___0) && 8640 <= s__state) && !(0 == s__hit))) || (((blastFlag == 1 && 8512 <= s__state) && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && !(8656 <= s__state))) || (2 == blastFlag && !(0 == s__hit))) || (((((ag_X + ag_Y) / 2147483648 * 4294967296 + s__state == 2 * ag_X + 2 * ag_Y || (!(2 * ag_X + 2 * ag_Y <= (ag_X + ag_Y) / 2147483648 * 4294967296 + 2147483647) && (ag_X + ag_Y) / 2147483648 * 4294967296 + s__state + 4294967296 == 2 * ag_X + 2 * ag_Y)) && 2 == blastFlag) && s__s3__tmp__next_state___0 < 8496) && !(8656 <= s__state))) || ((((3 == blastFlag && s__state <= 8448) && 3 == s__s3__tmp__next_state___0) && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && 0 == s__hit)) || (((((blastFlag == 1 && !(s__state <= 8496)) && 8496 < s__s3__tmp__next_state___0) && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576)) || ((blastFlag == 1 && s__state <= 8448) && 3 == s__s3__tmp__next_state___0)) || ((2 == blastFlag && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && 8544 == s__state)) || (((!(8673 == s__state) && 3 == blastFlag) && !(0 == s__hit)) && 8656 <= s__state)) || (((((!(8673 == s__state) && 2 == blastFlag) && !(s__state == 8672)) && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && s__s3__tmp__next_state___0 <= 8576) && 8656 <= s__state)) || (((((!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) <= 8496) && 2 == blastFlag) && 8496 < s__s3__tmp__next_state___0) && (ag_X + ag_Y) / 2147483648 * 4294967296 + s__state == 2 * ag_X + 2 * ag_Y) && s__s3__tmp__next_state___0 <= 8576)) || ((s__state == 8528 && 2 == blastFlag) && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656))) || (((blastFlag == 1 && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && s__s3__tmp__next_state___0 < 8496) && !(8496 <= s__state))) || (((3 == blastFlag && 8640 <= s__s3__tmp__next_state___0) && s__state <= 8448) && !(0 == s__hit))) || (((((2 == blastFlag && 8512 <= s__state) && 8496 < s__s3__tmp__next_state___0) && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && s__s3__tmp__next_state___0 <= 8576) && !(8656 <= s__state))) || (((blastFlag == 1 && 8466 <= s__state) && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && !(8496 <= s__state))) || ((((blastFlag == 1 && s__state <= 8448) && 8496 < s__s3__tmp__next_state___0) && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && s__s3__tmp__next_state___0 <= 8576)) || (((((2 == blastFlag && 8466 <= s__state) && 8496 < s__s3__tmp__next_state___0) && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && s__s3__tmp__next_state___0 <= 8576) && !(8496 <= s__state))) || (blastFlag == 1 && !(0 == s__hit))) || (((2 == blastFlag && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && s__s3__tmp__next_state___0 < 8496) && !(8496 <= s__state))) || blastFlag == 0) || (((ag_X + ag_Y) / 2147483648 * 4294967296 + s__state == 2 * ag_X + 2 * ag_Y || (!(2 * ag_X + 2 * ag_Y <= (ag_X + ag_Y) / 2147483648 * 4294967296 + 2147483647) && (ag_X + ag_Y) / 2147483648 * 4294967296 + s__state + 4294967296 == 2 * ag_X + 2 * ag_Y)) && blastFlag == 1)) || (((((2 == blastFlag && !(s__state <= 8496)) && 8496 < s__s3__tmp__next_state___0) && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576)) || ((2 == blastFlag && 8560 == s__state) && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656))) || ((((2 == blastFlag && 8640 <= s__state) && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && s__s3__tmp__next_state___0 <= 8576) && !(8656 <= s__state))) || ((!(8673 == s__state) && blastFlag == 1) && 8656 <= s__state) - InvariantResult [Line: 416]: Loop Invariant Derived loop invariant: (((((((blastFlag == 1 && 8512 <= s__state) && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && s__state <= 8576) || (((2 == blastFlag && 8512 <= s__state) && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && s__state <= 8576)) || ((8512 <= s__state && blastFlag == 0) && s__state <= 8576)) || ((((!(8673 == s__state) && blastFlag == 1) && !(s__state == 8672)) && 8512 <= s__state) && !(0 == s__hit))) || ((((!(8673 == s__state) && !(s__state == 8672)) && 8512 <= s__state) && blastFlag == 0) && !(0 == s__hit))) || ((((!(8673 == s__state) && 2 == blastFlag) && !(s__state == 8672)) && 8512 <= s__state) && !(0 == s__hit)) - InvariantResult [Line: 405]: Loop Invariant Derived loop invariant: (((((((blastFlag == 1 && 8512 <= s__state) && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && s__state <= 8576) || (((2 == blastFlag && 8512 <= s__state) && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && s__state <= 8576)) || ((8512 <= s__state && blastFlag == 0) && s__state <= 8576)) || ((((!(8673 == s__state) && blastFlag == 1) && !(s__state == 8672)) && 8512 <= s__state) && !(0 == s__hit))) || ((((!(8673 == s__state) && !(s__state == 8672)) && 8512 <= s__state) && blastFlag == 0) && !(0 == s__hit))) || ((((!(8673 == s__state) && 2 == blastFlag) && !(s__state == 8672)) && 8512 <= s__state) && !(0 == s__hit)) - InvariantResult [Line: 364]: Loop Invariant Derived loop invariant: (((((((blastFlag == 1 && 8512 <= s__state) && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && s__state <= 8576) || (((2 == blastFlag && 8512 <= s__state) && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && s__state <= 8576)) || ((8512 <= s__state && blastFlag == 0) && s__state <= 8576)) || ((((!(8673 == s__state) && blastFlag == 1) && !(s__state == 8672)) && 8512 <= s__state) && !(0 == s__hit))) || ((((!(8673 == s__state) && !(s__state == 8672)) && 8512 <= s__state) && blastFlag == 0) && !(0 == s__hit))) || ((((!(8673 == s__state) && 2 == blastFlag) && !(s__state == 8672)) && 8512 <= s__state) && !(0 == s__hit)) RESULT: Ultimate proved your program to be correct! [2023-02-15 10:23:01,079 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE