./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/openssl-simplified/s3_srvr_1.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 791161d1 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/openssl-simplified/s3_srvr_1.cil-2.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 01b0b8134efbdf074cddaa1833662276f2c77ab674782f72d5e58899909f6aa6 --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-22 11:09:26,134 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 11:09:26,135 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 11:09:26,158 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 11:09:26,158 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 11:09:26,159 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 11:09:26,161 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 11:09:26,165 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 11:09:26,167 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 11:09:26,170 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 11:09:26,171 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 11:09:26,173 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 11:09:26,173 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 11:09:26,174 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 11:09:26,176 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 11:09:26,177 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 11:09:26,178 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 11:09:26,179 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 11:09:26,182 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 11:09:26,186 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 11:09:26,187 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 11:09:26,188 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 11:09:26,188 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 11:09:26,189 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 11:09:26,190 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 11:09:26,195 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 11:09:26,195 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 11:09:26,196 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 11:09:26,197 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 11:09:26,197 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 11:09:26,198 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 11:09:26,199 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 11:09:26,200 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 11:09:26,200 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 11:09:26,201 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 11:09:26,201 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 11:09:26,202 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 11:09:26,202 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 11:09:26,202 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 11:09:26,202 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 11:09:26,203 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 11:09:26,204 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 11:09:26,205 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-22 11:09:26,233 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 11:09:26,233 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 11:09:26,233 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 11:09:26,234 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 11:09:26,234 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-22 11:09:26,234 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-22 11:09:26,235 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 11:09:26,235 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 11:09:26,235 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 11:09:26,236 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 11:09:26,236 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 11:09:26,236 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 11:09:26,236 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 11:09:26,236 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 11:09:26,237 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-22 11:09:26,237 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-22 11:09:26,237 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-22 11:09:26,237 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 11:09:26,237 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 11:09:26,237 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 11:09:26,237 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-22 11:09:26,238 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 11:09:26,238 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 11:09:26,238 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-22 11:09:26,238 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 11:09:26,238 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 11:09:26,238 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-22 11:09:26,239 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-22 11:09:26,239 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 11:09:26,239 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-22 11:09:26,239 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 11:09:26,239 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-22 11:09:26,239 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-22 11:09:26,240 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! 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 -> 01b0b8134efbdf074cddaa1833662276f2c77ab674782f72d5e58899909f6aa6 [2022-07-22 11:09:26,418 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 11:09:26,432 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 11:09:26,434 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 11:09:26,434 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 11:09:26,435 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 11:09:26,436 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/openssl-simplified/s3_srvr_1.cil-2.c [2022-07-22 11:09:26,472 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f35b98ac/7c2633a5e3d84cd5b8703c78a725ba01/FLAGe17d782f1 [2022-07-22 11:09:26,853 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 11:09:26,854 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl-simplified/s3_srvr_1.cil-2.c [2022-07-22 11:09:26,871 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f35b98ac/7c2633a5e3d84cd5b8703c78a725ba01/FLAGe17d782f1 [2022-07-22 11:09:26,883 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f35b98ac/7c2633a5e3d84cd5b8703c78a725ba01 [2022-07-22 11:09:26,885 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 11:09:26,886 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 11:09:26,888 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 11:09:26,888 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 11:09:26,890 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 11:09:26,891 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 11:09:26" (1/1) ... [2022-07-22 11:09:26,891 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5220d910 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:09:26, skipping insertion in model container [2022-07-22 11:09:26,891 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 11:09:26" (1/1) ... [2022-07-22 11:09:26,897 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 11:09:26,941 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 11:09:27,206 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl-simplified/s3_srvr_1.cil-2.c[43387,43400] [2022-07-22 11:09:27,218 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 11:09:27,223 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 11:09:27,279 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl-simplified/s3_srvr_1.cil-2.c[43387,43400] [2022-07-22 11:09:27,281 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 11:09:27,290 INFO L208 MainTranslator]: Completed translation [2022-07-22 11:09:27,290 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:09:27 WrapperNode [2022-07-22 11:09:27,290 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 11:09:27,292 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 11:09:27,292 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 11:09:27,292 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 11:09:27,296 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:09:27" (1/1) ... [2022-07-22 11:09:27,316 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:09:27" (1/1) ... [2022-07-22 11:09:27,348 INFO L137 Inliner]: procedures = 16, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 549 [2022-07-22 11:09:27,351 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 11:09:27,352 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 11:09:27,352 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 11:09:27,352 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 11:09:27,357 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:09:27" (1/1) ... [2022-07-22 11:09:27,358 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:09:27" (1/1) ... [2022-07-22 11:09:27,364 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:09:27" (1/1) ... [2022-07-22 11:09:27,364 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:09:27" (1/1) ... [2022-07-22 11:09:27,377 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:09:27" (1/1) ... [2022-07-22 11:09:27,384 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:09:27" (1/1) ... [2022-07-22 11:09:27,394 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:09:27" (1/1) ... [2022-07-22 11:09:27,396 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 11:09:27,397 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 11:09:27,397 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 11:09:27,397 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 11:09:27,401 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:09:27" (1/1) ... [2022-07-22 11:09:27,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 11:09:27,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:09:27,456 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-22 11:09:27,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-22 11:09:27,563 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 11:09:27,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 11:09:27,564 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 11:09:27,564 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 11:09:27,653 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 11:09:27,654 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 11:09:27,670 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-22 11:09:28,066 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2022-07-22 11:09:28,067 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2022-07-22 11:09:28,067 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 11:09:28,072 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 11:09:28,074 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-22 11:09:28,076 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 11:09:28 BoogieIcfgContainer [2022-07-22 11:09:28,077 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 11:09:28,078 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-22 11:09:28,079 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-22 11:09:28,081 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-22 11:09:28,081 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 11:09:26" (1/3) ... [2022-07-22 11:09:28,082 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@295a26b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 11:09:28, skipping insertion in model container [2022-07-22 11:09:28,082 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:09:27" (2/3) ... [2022-07-22 11:09:28,083 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@295a26b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 11:09:28, skipping insertion in model container [2022-07-22 11:09:28,083 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 11:09:28" (3/3) ... [2022-07-22 11:09:28,084 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr_1.cil-2.c [2022-07-22 11:09:28,094 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-22 11:09:28,094 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-22 11:09:28,145 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-22 11:09:28,151 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6df4e2df, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@40de24e0 [2022-07-22 11:09:28,151 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-22 11:09:28,155 INFO L276 IsEmpty]: Start isEmpty. Operand has 144 states, 142 states have (on average 1.7112676056338028) internal successors, (243), 143 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:09:28,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-22 11:09:28,164 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:09:28,165 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] [2022-07-22 11:09:28,165 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:09:28,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:09:28,169 INFO L85 PathProgramCache]: Analyzing trace with hash -947483280, now seen corresponding path program 1 times [2022-07-22 11:09:28,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:09:28,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756564691] [2022-07-22 11:09:28,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:09:28,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:09:28,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:09:28,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 11:09:28,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:09:28,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756564691] [2022-07-22 11:09:28,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756564691] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:09:28,398 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:09:28,398 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 11:09:28,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026845929] [2022-07-22 11:09:28,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:09:28,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 11:09:28,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:09:28,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 11:09:28,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:09:28,427 INFO L87 Difference]: Start difference. First operand has 144 states, 142 states have (on average 1.7112676056338028) internal successors, (243), 143 states have internal predecessors, (243), 0 states have call successors, (0), 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 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) [2022-07-22 11:09:28,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:09:28,647 INFO L93 Difference]: Finished difference Result 334 states and 571 transitions. [2022-07-22 11:09:28,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 11:09:28,649 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 [2022-07-22 11:09:28,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:09:28,656 INFO L225 Difference]: With dead ends: 334 [2022-07-22 11:09:28,656 INFO L226 Difference]: Without dead ends: 178 [2022-07-22 11:09:28,658 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:09:28,660 INFO L413 NwaCegarLoop]: 165 mSDtfsCounter, 172 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 11:09:28,661 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 194 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 11:09:28,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2022-07-22 11:09:28,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 172. [2022-07-22 11:09:28,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 171 states have (on average 1.6257309941520468) internal successors, (278), 171 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:09:28,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 278 transitions. [2022-07-22 11:09:28,704 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 278 transitions. Word has length 45 [2022-07-22 11:09:28,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:09:28,705 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 278 transitions. [2022-07-22 11:09:28,705 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) [2022-07-22 11:09:28,705 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 278 transitions. [2022-07-22 11:09:28,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-22 11:09:28,707 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:09:28,707 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, 1] [2022-07-22 11:09:28,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-22 11:09:28,707 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:09:28,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:09:28,708 INFO L85 PathProgramCache]: Analyzing trace with hash 472840014, now seen corresponding path program 1 times [2022-07-22 11:09:28,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:09:28,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370896768] [2022-07-22 11:09:28,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:09:28,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:09:28,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:09:28,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 11:09:28,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:09:28,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370896768] [2022-07-22 11:09:28,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370896768] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:09:28,767 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:09:28,767 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 11:09:28,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829194061] [2022-07-22 11:09:28,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:09:28,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 11:09:28,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:09:28,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 11:09:28,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:09:28,770 INFO L87 Difference]: Start difference. First operand 172 states and 278 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:09:28,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:09:28,900 INFO L93 Difference]: Finished difference Result 385 states and 632 transitions. [2022-07-22 11:09:28,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 11:09:28,901 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2022-07-22 11:09:28,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:09:28,902 INFO L225 Difference]: With dead ends: 385 [2022-07-22 11:09:28,903 INFO L226 Difference]: Without dead ends: 219 [2022-07-22 11:09:28,903 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:09:28,904 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 132 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 11:09:28,905 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 147 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 11:09:28,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2022-07-22 11:09:28,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 213. [2022-07-22 11:09:28,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 212 states have (on average 1.6745283018867925) internal successors, (355), 212 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:09:28,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 355 transitions. [2022-07-22 11:09:28,920 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 355 transitions. Word has length 46 [2022-07-22 11:09:28,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:09:28,921 INFO L495 AbstractCegarLoop]: Abstraction has 213 states and 355 transitions. [2022-07-22 11:09:28,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:09:28,922 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 355 transitions. [2022-07-22 11:09:28,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-07-22 11:09:28,926 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:09:28,926 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:09:28,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-22 11:09:28,926 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:09:28,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:09:28,927 INFO L85 PathProgramCache]: Analyzing trace with hash -1882217598, now seen corresponding path program 1 times [2022-07-22 11:09:28,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:09:28,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406967211] [2022-07-22 11:09:28,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:09:28,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:09:28,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:09:28,963 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 11:09:28,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:09:28,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406967211] [2022-07-22 11:09:28,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406967211] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:09:28,963 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:09:28,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 11:09:28,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519806708] [2022-07-22 11:09:28,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:09:28,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 11:09:28,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:09:28,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 11:09:28,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:09:28,965 INFO L87 Difference]: Start difference. First operand 213 states and 355 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:09:29,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:09:29,115 INFO L93 Difference]: Finished difference Result 449 states and 756 transitions. [2022-07-22 11:09:29,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 11:09:29,116 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2022-07-22 11:09:29,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:09:29,118 INFO L225 Difference]: With dead ends: 449 [2022-07-22 11:09:29,118 INFO L226 Difference]: Without dead ends: 244 [2022-07-22 11:09:29,120 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:09:29,121 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 138 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 11:09:29,121 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 159 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 11:09:29,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2022-07-22 11:09:29,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 244. [2022-07-22 11:09:29,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 243 states have (on average 1.691358024691358) internal successors, (411), 243 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:09:29,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 411 transitions. [2022-07-22 11:09:29,142 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 411 transitions. Word has length 74 [2022-07-22 11:09:29,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:09:29,143 INFO L495 AbstractCegarLoop]: Abstraction has 244 states and 411 transitions. [2022-07-22 11:09:29,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:09:29,143 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 411 transitions. [2022-07-22 11:09:29,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-07-22 11:09:29,148 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:09:29,148 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-22 11:09:29,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-22 11:09:29,149 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:09:29,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:09:29,152 INFO L85 PathProgramCache]: Analyzing trace with hash 273082035, now seen corresponding path program 1 times [2022-07-22 11:09:29,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:09:29,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702316000] [2022-07-22 11:09:29,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:09:29,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:09:29,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:09:29,223 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 11:09:29,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:09:29,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702316000] [2022-07-22 11:09:29,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702316000] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:09:29,225 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:09:29,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 11:09:29,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528392961] [2022-07-22 11:09:29,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:09:29,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 11:09:29,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:09:29,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 11:09:29,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:09:29,238 INFO L87 Difference]: Start difference. First operand 244 states and 411 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:09:29,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:09:29,351 INFO L93 Difference]: Finished difference Result 526 states and 892 transitions. [2022-07-22 11:09:29,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 11:09:29,351 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2022-07-22 11:09:29,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:09:29,353 INFO L225 Difference]: With dead ends: 526 [2022-07-22 11:09:29,353 INFO L226 Difference]: Without dead ends: 290 [2022-07-22 11:09:29,353 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:09:29,354 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 136 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 11:09:29,355 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 147 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 11:09:29,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2022-07-22 11:09:29,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 286. [2022-07-22 11:09:29,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 285 states have (on average 1.7052631578947368) internal successors, (486), 285 states have internal predecessors, (486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:09:29,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 486 transitions. [2022-07-22 11:09:29,365 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 486 transitions. Word has length 85 [2022-07-22 11:09:29,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:09:29,365 INFO L495 AbstractCegarLoop]: Abstraction has 286 states and 486 transitions. [2022-07-22 11:09:29,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:09:29,366 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 486 transitions. [2022-07-22 11:09:29,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-07-22 11:09:29,367 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:09:29,368 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:09:29,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-22 11:09:29,368 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:09:29,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:09:29,368 INFO L85 PathProgramCache]: Analyzing trace with hash -189215496, now seen corresponding path program 1 times [2022-07-22 11:09:29,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:09:29,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486163266] [2022-07-22 11:09:29,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:09:29,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:09:29,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:09:29,407 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-07-22 11:09:29,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:09:29,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486163266] [2022-07-22 11:09:29,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486163266] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:09:29,407 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:09:29,407 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 11:09:29,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864811474] [2022-07-22 11:09:29,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:09:29,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 11:09:29,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:09:29,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 11:09:29,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:09:29,409 INFO L87 Difference]: Start difference. First operand 286 states and 486 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:09:29,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:09:29,494 INFO L93 Difference]: Finished difference Result 581 states and 988 transitions. [2022-07-22 11:09:29,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 11:09:29,495 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2022-07-22 11:09:29,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:09:29,496 INFO L225 Difference]: With dead ends: 581 [2022-07-22 11:09:29,496 INFO L226 Difference]: Without dead ends: 303 [2022-07-22 11:09:29,497 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:09:29,497 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 161 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 11:09:29,498 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 141 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 11:09:29,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2022-07-22 11:09:29,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 301. [2022-07-22 11:09:29,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 300 states have (on average 1.6933333333333334) internal successors, (508), 300 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:09:29,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 508 transitions. [2022-07-22 11:09:29,505 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 508 transitions. Word has length 86 [2022-07-22 11:09:29,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:09:29,505 INFO L495 AbstractCegarLoop]: Abstraction has 301 states and 508 transitions. [2022-07-22 11:09:29,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:09:29,506 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 508 transitions. [2022-07-22 11:09:29,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-07-22 11:09:29,507 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:09:29,507 INFO L195 NwaCegarLoop]: trace histogram [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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:09:29,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-22 11:09:29,508 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:09:29,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:09:29,508 INFO L85 PathProgramCache]: Analyzing trace with hash -1661072911, now seen corresponding path program 1 times [2022-07-22 11:09:29,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:09:29,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123874213] [2022-07-22 11:09:29,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:09:29,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:09:29,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:09:29,541 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 11:09:29,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:09:29,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123874213] [2022-07-22 11:09:29,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123874213] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:09:29,542 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:09:29,542 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 11:09:29,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848319376] [2022-07-22 11:09:29,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:09:29,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 11:09:29,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:09:29,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 11:09:29,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:09:29,544 INFO L87 Difference]: Start difference. First operand 301 states and 508 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:09:29,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:09:29,730 INFO L93 Difference]: Finished difference Result 598 states and 1009 transitions. [2022-07-22 11:09:29,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 11:09:29,730 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2022-07-22 11:09:29,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:09:29,731 INFO L225 Difference]: With dead ends: 598 [2022-07-22 11:09:29,732 INFO L226 Difference]: Without dead ends: 303 [2022-07-22 11:09:29,732 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:09:29,733 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 134 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-22 11:09:29,733 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 145 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-22 11:09:29,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2022-07-22 11:09:29,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 299. [2022-07-22 11:09:29,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 298 states have (on average 1.6879194630872483) internal successors, (503), 298 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:09:29,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 503 transitions. [2022-07-22 11:09:29,739 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 503 transitions. Word has length 86 [2022-07-22 11:09:29,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:09:29,740 INFO L495 AbstractCegarLoop]: Abstraction has 299 states and 503 transitions. [2022-07-22 11:09:29,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:09:29,740 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 503 transitions. [2022-07-22 11:09:29,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-07-22 11:09:29,741 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:09:29,741 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:09:29,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-22 11:09:29,741 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:09:29,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:09:29,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1734029471, now seen corresponding path program 1 times [2022-07-22 11:09:29,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:09:29,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402028417] [2022-07-22 11:09:29,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:09:29,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:09:29,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:09:29,766 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-07-22 11:09:29,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:09:29,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402028417] [2022-07-22 11:09:29,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402028417] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:09:29,767 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:09:29,767 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 11:09:29,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689601139] [2022-07-22 11:09:29,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:09:29,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 11:09:29,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:09:29,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 11:09:29,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:09:29,768 INFO L87 Difference]: Start difference. First operand 299 states and 503 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:09:29,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:09:29,848 INFO L93 Difference]: Finished difference Result 592 states and 996 transitions. [2022-07-22 11:09:29,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 11:09:29,848 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2022-07-22 11:09:29,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:09:29,850 INFO L225 Difference]: With dead ends: 592 [2022-07-22 11:09:29,850 INFO L226 Difference]: Without dead ends: 301 [2022-07-22 11:09:29,850 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:09:29,851 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 160 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 11:09:29,851 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 141 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 11:09:29,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2022-07-22 11:09:29,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 299. [2022-07-22 11:09:29,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 298 states have (on average 1.674496644295302) internal successors, (499), 298 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:09:29,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 499 transitions. [2022-07-22 11:09:29,858 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 499 transitions. Word has length 87 [2022-07-22 11:09:29,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:09:29,858 INFO L495 AbstractCegarLoop]: Abstraction has 299 states and 499 transitions. [2022-07-22 11:09:29,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:09:29,858 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 499 transitions. [2022-07-22 11:09:29,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-07-22 11:09:29,859 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:09:29,859 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:09:29,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-22 11:09:29,859 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:09:29,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:09:29,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1834464481, now seen corresponding path program 1 times [2022-07-22 11:09:29,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:09:29,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083766371] [2022-07-22 11:09:29,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:09:29,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:09:29,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:09:29,890 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-07-22 11:09:29,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:09:29,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083766371] [2022-07-22 11:09:29,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083766371] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:09:29,891 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:09:29,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 11:09:29,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615062741] [2022-07-22 11:09:29,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:09:29,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 11:09:29,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:09:29,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 11:09:29,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:09:29,893 INFO L87 Difference]: Start difference. First operand 299 states and 499 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:09:29,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:09:29,980 INFO L93 Difference]: Finished difference Result 599 states and 998 transitions. [2022-07-22 11:09:29,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 11:09:29,981 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2022-07-22 11:09:29,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:09:29,982 INFO L225 Difference]: With dead ends: 599 [2022-07-22 11:09:29,982 INFO L226 Difference]: Without dead ends: 308 [2022-07-22 11:09:29,983 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:09:29,983 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 165 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 11:09:29,984 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 152 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 11:09:29,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2022-07-22 11:09:29,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 308. [2022-07-22 11:09:29,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 307 states have (on average 1.6449511400651466) internal successors, (505), 307 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:09:29,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 505 transitions. [2022-07-22 11:09:29,991 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 505 transitions. Word has length 100 [2022-07-22 11:09:29,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:09:29,992 INFO L495 AbstractCegarLoop]: Abstraction has 308 states and 505 transitions. [2022-07-22 11:09:29,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:09:29,992 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 505 transitions. [2022-07-22 11:09:29,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-07-22 11:09:29,993 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:09:29,993 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:09:29,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-22 11:09:29,993 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:09:29,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:09:29,994 INFO L85 PathProgramCache]: Analyzing trace with hash -1347542277, now seen corresponding path program 1 times [2022-07-22 11:09:29,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:09:29,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205417420] [2022-07-22 11:09:29,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:09:29,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:09:30,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:09:30,023 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-07-22 11:09:30,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:09:30,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205417420] [2022-07-22 11:09:30,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205417420] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:09:30,024 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:09:30,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 11:09:30,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59078023] [2022-07-22 11:09:30,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:09:30,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 11:09:30,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:09:30,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 11:09:30,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:09:30,025 INFO L87 Difference]: Start difference. First operand 308 states and 505 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:09:30,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:09:30,116 INFO L93 Difference]: Finished difference Result 639 states and 1051 transitions. [2022-07-22 11:09:30,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 11:09:30,117 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2022-07-22 11:09:30,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:09:30,118 INFO L225 Difference]: With dead ends: 639 [2022-07-22 11:09:30,118 INFO L226 Difference]: Without dead ends: 339 [2022-07-22 11:09:30,119 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:09:30,119 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 144 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 11:09:30,120 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 144 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 11:09:30,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2022-07-22 11:09:30,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 337. [2022-07-22 11:09:30,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 336 states have (on average 1.6428571428571428) internal successors, (552), 336 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:09:30,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 552 transitions. [2022-07-22 11:09:30,127 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 552 transitions. Word has length 100 [2022-07-22 11:09:30,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:09:30,127 INFO L495 AbstractCegarLoop]: Abstraction has 337 states and 552 transitions. [2022-07-22 11:09:30,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:09:30,128 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 552 transitions. [2022-07-22 11:09:30,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-07-22 11:09:30,128 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:09:30,129 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:09:30,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-22 11:09:30,129 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:09:30,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:09:30,129 INFO L85 PathProgramCache]: Analyzing trace with hash -218926398, now seen corresponding path program 1 times [2022-07-22 11:09:30,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:09:30,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86216821] [2022-07-22 11:09:30,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:09:30,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:09:30,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:09:30,151 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-07-22 11:09:30,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:09:30,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86216821] [2022-07-22 11:09:30,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86216821] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:09:30,151 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:09:30,151 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 11:09:30,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963278225] [2022-07-22 11:09:30,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:09:30,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 11:09:30,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:09:30,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 11:09:30,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:09:30,153 INFO L87 Difference]: Start difference. First operand 337 states and 552 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:09:30,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:09:30,242 INFO L93 Difference]: Finished difference Result 668 states and 1094 transitions. [2022-07-22 11:09:30,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 11:09:30,243 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2022-07-22 11:09:30,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:09:30,244 INFO L225 Difference]: With dead ends: 668 [2022-07-22 11:09:30,244 INFO L226 Difference]: Without dead ends: 339 [2022-07-22 11:09:30,245 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:09:30,245 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 143 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 11:09:30,246 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 144 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 11:09:30,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2022-07-22 11:09:30,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 337. [2022-07-22 11:09:30,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 336 states have (on average 1.630952380952381) internal successors, (548), 336 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:09:30,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 548 transitions. [2022-07-22 11:09:30,253 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 548 transitions. Word has length 101 [2022-07-22 11:09:30,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:09:30,253 INFO L495 AbstractCegarLoop]: Abstraction has 337 states and 548 transitions. [2022-07-22 11:09:30,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:09:30,253 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 548 transitions. [2022-07-22 11:09:30,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-07-22 11:09:30,254 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:09:30,254 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:09:30,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-22 11:09:30,255 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:09:30,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:09:30,255 INFO L85 PathProgramCache]: Analyzing trace with hash 253103787, now seen corresponding path program 1 times [2022-07-22 11:09:30,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:09:30,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343585243] [2022-07-22 11:09:30,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:09:30,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:09:30,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:09:30,276 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-07-22 11:09:30,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:09:30,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343585243] [2022-07-22 11:09:30,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343585243] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:09:30,277 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:09:30,277 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 11:09:30,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43578906] [2022-07-22 11:09:30,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:09:30,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 11:09:30,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:09:30,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 11:09:30,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:09:30,278 INFO L87 Difference]: Start difference. First operand 337 states and 548 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:09:30,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:09:30,367 INFO L93 Difference]: Finished difference Result 701 states and 1144 transitions. [2022-07-22 11:09:30,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 11:09:30,367 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 102 [2022-07-22 11:09:30,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:09:30,368 INFO L225 Difference]: With dead ends: 701 [2022-07-22 11:09:30,368 INFO L226 Difference]: Without dead ends: 372 [2022-07-22 11:09:30,369 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:09:30,370 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 146 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 11:09:30,370 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 152 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 11:09:30,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2022-07-22 11:09:30,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 364. [2022-07-22 11:09:30,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 363 states have (on average 1.6253443526170799) internal successors, (590), 363 states have internal predecessors, (590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:09:30,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 590 transitions. [2022-07-22 11:09:30,377 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 590 transitions. Word has length 102 [2022-07-22 11:09:30,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:09:30,377 INFO L495 AbstractCegarLoop]: Abstraction has 364 states and 590 transitions. [2022-07-22 11:09:30,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:09:30,377 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 590 transitions. [2022-07-22 11:09:30,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-07-22 11:09:30,378 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:09:30,378 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:09:30,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-22 11:09:30,379 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:09:30,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:09:30,379 INFO L85 PathProgramCache]: Analyzing trace with hash 1231802386, now seen corresponding path program 1 times [2022-07-22 11:09:30,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:09:30,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754300238] [2022-07-22 11:09:30,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:09:30,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:09:30,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:09:30,407 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-07-22 11:09:30,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:09:30,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754300238] [2022-07-22 11:09:30,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754300238] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:09:30,408 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:09:30,408 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 11:09:30,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488747352] [2022-07-22 11:09:30,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:09:30,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 11:09:30,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:09:30,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 11:09:30,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:09:30,409 INFO L87 Difference]: Start difference. First operand 364 states and 590 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:09:30,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:09:30,500 INFO L93 Difference]: Finished difference Result 728 states and 1181 transitions. [2022-07-22 11:09:30,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 11:09:30,500 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 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 103 [2022-07-22 11:09:30,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:09:30,502 INFO L225 Difference]: With dead ends: 728 [2022-07-22 11:09:30,502 INFO L226 Difference]: Without dead ends: 372 [2022-07-22 11:09:30,502 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:09:30,503 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 145 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 11:09:30,503 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 152 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 11:09:30,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2022-07-22 11:09:30,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 364. [2022-07-22 11:09:30,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 363 states have (on average 1.6115702479338843) internal successors, (585), 363 states have internal predecessors, (585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:09:30,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 585 transitions. [2022-07-22 11:09:30,510 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 585 transitions. Word has length 103 [2022-07-22 11:09:30,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:09:30,510 INFO L495 AbstractCegarLoop]: Abstraction has 364 states and 585 transitions. [2022-07-22 11:09:30,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:09:30,511 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 585 transitions. [2022-07-22 11:09:30,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-07-22 11:09:30,512 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:09:30,512 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:09:30,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-22 11:09:30,512 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:09:30,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:09:30,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1055170647, now seen corresponding path program 1 times [2022-07-22 11:09:30,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:09:30,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069216101] [2022-07-22 11:09:30,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:09:30,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:09:30,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:09:30,530 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-07-22 11:09:30,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:09:30,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069216101] [2022-07-22 11:09:30,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069216101] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:09:30,530 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:09:30,530 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 11:09:30,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450979290] [2022-07-22 11:09:30,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:09:30,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 11:09:30,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:09:30,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 11:09:30,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:09:30,532 INFO L87 Difference]: Start difference. First operand 364 states and 585 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:09:30,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:09:30,612 INFO L93 Difference]: Finished difference Result 745 states and 1199 transitions. [2022-07-22 11:09:30,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 11:09:30,613 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 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 106 [2022-07-22 11:09:30,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:09:30,614 INFO L225 Difference]: With dead ends: 745 [2022-07-22 11:09:30,614 INFO L226 Difference]: Without dead ends: 389 [2022-07-22 11:09:30,615 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:09:30,615 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 152 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 11:09:30,615 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 147 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 11:09:30,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2022-07-22 11:09:30,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 385. [2022-07-22 11:09:30,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 384 states have (on average 1.5989583333333333) internal successors, (614), 384 states have internal predecessors, (614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:09:30,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 614 transitions. [2022-07-22 11:09:30,623 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 614 transitions. Word has length 106 [2022-07-22 11:09:30,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:09:30,623 INFO L495 AbstractCegarLoop]: Abstraction has 385 states and 614 transitions. [2022-07-22 11:09:30,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:09:30,623 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 614 transitions. [2022-07-22 11:09:30,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-07-22 11:09:30,624 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:09:30,624 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:09:30,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-22 11:09:30,624 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:09:30,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:09:30,625 INFO L85 PathProgramCache]: Analyzing trace with hash -2125345872, now seen corresponding path program 1 times [2022-07-22 11:09:30,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:09:30,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202037065] [2022-07-22 11:09:30,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:09:30,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:09:30,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:09:30,641 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-07-22 11:09:30,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:09:30,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202037065] [2022-07-22 11:09:30,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202037065] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:09:30,642 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:09:30,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 11:09:30,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470135332] [2022-07-22 11:09:30,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:09:30,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 11:09:30,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:09:30,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 11:09:30,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:09:30,643 INFO L87 Difference]: Start difference. First operand 385 states and 614 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:09:30,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:09:30,725 INFO L93 Difference]: Finished difference Result 766 states and 1222 transitions. [2022-07-22 11:09:30,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 11:09:30,726 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 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 107 [2022-07-22 11:09:30,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:09:30,727 INFO L225 Difference]: With dead ends: 766 [2022-07-22 11:09:30,727 INFO L226 Difference]: Without dead ends: 389 [2022-07-22 11:09:30,728 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:09:30,728 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 151 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 11:09:30,728 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 147 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 11:09:30,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2022-07-22 11:09:30,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 385. [2022-07-22 11:09:30,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 384 states have (on average 1.5833333333333333) internal successors, (608), 384 states have internal predecessors, (608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:09:30,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 608 transitions. [2022-07-22 11:09:30,736 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 608 transitions. Word has length 107 [2022-07-22 11:09:30,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:09:30,736 INFO L495 AbstractCegarLoop]: Abstraction has 385 states and 608 transitions. [2022-07-22 11:09:30,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:09:30,736 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 608 transitions. [2022-07-22 11:09:30,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-07-22 11:09:30,737 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:09:30,737 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, 1] [2022-07-22 11:09:30,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-22 11:09:30,737 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:09:30,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:09:30,738 INFO L85 PathProgramCache]: Analyzing trace with hash -1817702491, now seen corresponding path program 1 times [2022-07-22 11:09:30,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:09:30,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245955151] [2022-07-22 11:09:30,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:09:30,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:09:30,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:09:30,779 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-22 11:09:30,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:09:30,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245955151] [2022-07-22 11:09:30,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245955151] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:09:30,780 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:09:30,780 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 11:09:30,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431711633] [2022-07-22 11:09:30,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:09:30,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 11:09:30,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:09:30,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 11:09:30,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:09:30,781 INFO L87 Difference]: Start difference. First operand 385 states and 608 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:09:30,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:09:30,808 INFO L93 Difference]: Finished difference Result 1093 states and 1730 transitions. [2022-07-22 11:09:30,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 11:09:30,808 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 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 122 [2022-07-22 11:09:30,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:09:30,810 INFO L225 Difference]: With dead ends: 1093 [2022-07-22 11:09:30,810 INFO L226 Difference]: Without dead ends: 716 [2022-07-22 11:09:30,812 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:09:30,813 INFO L413 NwaCegarLoop]: 362 mSDtfsCounter, 137 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 11:09:30,813 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 548 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 11:09:30,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2022-07-22 11:09:30,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 716. [2022-07-22 11:09:30,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 716 states, 715 states have (on average 1.5776223776223777) internal successors, (1128), 715 states have internal predecessors, (1128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:09:30,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 716 states and 1128 transitions. [2022-07-22 11:09:30,826 INFO L78 Accepts]: Start accepts. Automaton has 716 states and 1128 transitions. Word has length 122 [2022-07-22 11:09:30,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:09:30,827 INFO L495 AbstractCegarLoop]: Abstraction has 716 states and 1128 transitions. [2022-07-22 11:09:30,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:09:30,827 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 1128 transitions. [2022-07-22 11:09:30,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-07-22 11:09:30,828 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:09:30,828 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, 1] [2022-07-22 11:09:30,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-22 11:09:30,829 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:09:30,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:09:30,829 INFO L85 PathProgramCache]: Analyzing trace with hash 231685351, now seen corresponding path program 1 times [2022-07-22 11:09:30,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:09:30,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892618462] [2022-07-22 11:09:30,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:09:30,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:09:30,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:09:30,877 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-07-22 11:09:30,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:09:30,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892618462] [2022-07-22 11:09:30,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892618462] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:09:30,879 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:09:30,879 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 11:09:30,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994059837] [2022-07-22 11:09:30,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:09:30,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 11:09:30,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:09:30,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 11:09:30,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:09:30,880 INFO L87 Difference]: Start difference. First operand 716 states and 1128 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:09:30,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:09:30,910 INFO L93 Difference]: Finished difference Result 1795 states and 2834 transitions. [2022-07-22 11:09:30,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 11:09:30,910 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 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 122 [2022-07-22 11:09:30,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:09:30,913 INFO L225 Difference]: With dead ends: 1795 [2022-07-22 11:09:30,913 INFO L226 Difference]: Without dead ends: 1087 [2022-07-22 11:09:30,914 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:09:30,915 INFO L413 NwaCegarLoop]: 361 mSDtfsCounter, 134 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 11:09:30,916 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 547 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 11:09:30,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1087 states. [2022-07-22 11:09:30,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1087 to 1087. [2022-07-22 11:09:30,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1087 states, 1086 states have (on average 1.576427255985267) internal successors, (1712), 1086 states have internal predecessors, (1712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:09:30,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1087 states to 1087 states and 1712 transitions. [2022-07-22 11:09:30,936 INFO L78 Accepts]: Start accepts. Automaton has 1087 states and 1712 transitions. Word has length 122 [2022-07-22 11:09:30,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:09:30,936 INFO L495 AbstractCegarLoop]: Abstraction has 1087 states and 1712 transitions. [2022-07-22 11:09:30,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:09:30,937 INFO L276 IsEmpty]: Start isEmpty. Operand 1087 states and 1712 transitions. [2022-07-22 11:09:30,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-07-22 11:09:30,938 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:09:30,938 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, 1] [2022-07-22 11:09:30,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-22 11:09:30,938 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:09:30,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:09:30,939 INFO L85 PathProgramCache]: Analyzing trace with hash 58780327, now seen corresponding path program 1 times [2022-07-22 11:09:30,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:09:30,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339785682] [2022-07-22 11:09:30,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:09:30,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:09:30,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:09:30,960 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-07-22 11:09:30,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:09:30,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339785682] [2022-07-22 11:09:30,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339785682] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:09:30,961 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:09:30,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 11:09:30,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602684499] [2022-07-22 11:09:30,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:09:30,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 11:09:30,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:09:30,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 11:09:30,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:09:30,962 INFO L87 Difference]: Start difference. First operand 1087 states and 1712 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:09:30,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:09:30,997 INFO L93 Difference]: Finished difference Result 2537 states and 4002 transitions. [2022-07-22 11:09:30,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 11:09:30,997 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 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 122 [2022-07-22 11:09:30,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:09:31,001 INFO L225 Difference]: With dead ends: 2537 [2022-07-22 11:09:31,001 INFO L226 Difference]: Without dead ends: 1458 [2022-07-22 11:09:31,002 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:09:31,003 INFO L413 NwaCegarLoop]: 365 mSDtfsCounter, 157 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 11:09:31,003 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 551 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 11:09:31,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1458 states. [2022-07-22 11:09:31,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1458 to 1458. [2022-07-22 11:09:31,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1458 states, 1457 states have (on average 1.575840768702814) internal successors, (2296), 1457 states have internal predecessors, (2296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:09:31,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1458 states to 1458 states and 2296 transitions. [2022-07-22 11:09:31,030 INFO L78 Accepts]: Start accepts. Automaton has 1458 states and 2296 transitions. Word has length 122 [2022-07-22 11:09:31,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:09:31,030 INFO L495 AbstractCegarLoop]: Abstraction has 1458 states and 2296 transitions. [2022-07-22 11:09:31,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:09:31,030 INFO L276 IsEmpty]: Start isEmpty. Operand 1458 states and 2296 transitions. [2022-07-22 11:09:31,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-07-22 11:09:31,032 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:09:31,032 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, 1] [2022-07-22 11:09:31,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-22 11:09:31,032 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:09:31,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:09:31,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1448074341, now seen corresponding path program 1 times [2022-07-22 11:09:31,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:09:31,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174148132] [2022-07-22 11:09:31,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:09:31,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:09:31,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:09:31,050 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2022-07-22 11:09:31,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:09:31,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174148132] [2022-07-22 11:09:31,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174148132] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:09:31,051 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:09:31,051 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 11:09:31,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104037435] [2022-07-22 11:09:31,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:09:31,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 11:09:31,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:09:31,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 11:09:31,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:09:31,052 INFO L87 Difference]: Start difference. First operand 1458 states and 2296 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:09:31,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:09:31,089 INFO L93 Difference]: Finished difference Result 3261 states and 5139 transitions. [2022-07-22 11:09:31,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 11:09:31,090 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 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 122 [2022-07-22 11:09:31,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:09:31,094 INFO L225 Difference]: With dead ends: 3261 [2022-07-22 11:09:31,094 INFO L226 Difference]: Without dead ends: 1811 [2022-07-22 11:09:31,096 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:09:31,096 INFO L413 NwaCegarLoop]: 216 mSDtfsCounter, 172 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 11:09:31,096 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 392 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 11:09:31,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1811 states. [2022-07-22 11:09:31,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1811 to 1811. [2022-07-22 11:09:31,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1811 states, 1810 states have (on average 1.5740331491712707) internal successors, (2849), 1810 states have internal predecessors, (2849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:09:31,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1811 states to 1811 states and 2849 transitions. [2022-07-22 11:09:31,145 INFO L78 Accepts]: Start accepts. Automaton has 1811 states and 2849 transitions. Word has length 122 [2022-07-22 11:09:31,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:09:31,145 INFO L495 AbstractCegarLoop]: Abstraction has 1811 states and 2849 transitions. [2022-07-22 11:09:31,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:09:31,145 INFO L276 IsEmpty]: Start isEmpty. Operand 1811 states and 2849 transitions. [2022-07-22 11:09:31,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2022-07-22 11:09:31,148 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:09:31,149 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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] [2022-07-22 11:09:31,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-22 11:09:31,149 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:09:31,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:09:31,149 INFO L85 PathProgramCache]: Analyzing trace with hash -969992260, now seen corresponding path program 1 times [2022-07-22 11:09:31,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:09:31,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964897678] [2022-07-22 11:09:31,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:09:31,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:09:31,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:09:31,186 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 255 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2022-07-22 11:09:31,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:09:31,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964897678] [2022-07-22 11:09:31,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964897678] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:09:31,187 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:09:31,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 11:09:31,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058537164] [2022-07-22 11:09:31,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:09:31,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 11:09:31,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:09:31,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 11:09:31,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:09:31,189 INFO L87 Difference]: Start difference. First operand 1811 states and 2849 transitions. Second operand has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:09:31,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:09:31,304 INFO L93 Difference]: Finished difference Result 3664 states and 5746 transitions. [2022-07-22 11:09:31,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 11:09:31,305 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 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 200 [2022-07-22 11:09:31,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:09:31,311 INFO L225 Difference]: With dead ends: 3664 [2022-07-22 11:09:31,311 INFO L226 Difference]: Without dead ends: 1861 [2022-07-22 11:09:31,314 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:09:31,314 INFO L413 NwaCegarLoop]: 205 mSDtfsCounter, 32 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 11:09:31,314 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 301 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 11:09:31,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1861 states. [2022-07-22 11:09:31,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1861 to 1811. [2022-07-22 11:09:31,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1811 states, 1810 states have (on average 1.5342541436464088) internal successors, (2777), 1810 states have internal predecessors, (2777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:09:31,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1811 states to 1811 states and 2777 transitions. [2022-07-22 11:09:31,348 INFO L78 Accepts]: Start accepts. Automaton has 1811 states and 2777 transitions. Word has length 200 [2022-07-22 11:09:31,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:09:31,349 INFO L495 AbstractCegarLoop]: Abstraction has 1811 states and 2777 transitions. [2022-07-22 11:09:31,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:09:31,349 INFO L276 IsEmpty]: Start isEmpty. Operand 1811 states and 2777 transitions. [2022-07-22 11:09:31,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2022-07-22 11:09:31,352 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:09:31,352 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:09:31,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-22 11:09:31,353 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:09:31,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:09:31,353 INFO L85 PathProgramCache]: Analyzing trace with hash 1149451039, now seen corresponding path program 1 times [2022-07-22 11:09:31,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:09:31,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641759337] [2022-07-22 11:09:31,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:09:31,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:09:31,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:09:31,404 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 223 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2022-07-22 11:09:31,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:09:31,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641759337] [2022-07-22 11:09:31,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641759337] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:09:31,405 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:09:31,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 11:09:31,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000175399] [2022-07-22 11:09:31,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:09:31,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 11:09:31,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:09:31,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 11:09:31,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:09:31,406 INFO L87 Difference]: Start difference. First operand 1811 states and 2777 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:09:31,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:09:31,533 INFO L93 Difference]: Finished difference Result 3686 states and 5625 transitions. [2022-07-22 11:09:31,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 11:09:31,533 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 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 215 [2022-07-22 11:09:31,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:09:31,538 INFO L225 Difference]: With dead ends: 3686 [2022-07-22 11:09:31,538 INFO L226 Difference]: Without dead ends: 1883 [2022-07-22 11:09:31,540 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:09:31,541 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 155 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 11:09:31,541 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 168 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 11:09:31,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1883 states. [2022-07-22 11:09:31,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1883 to 1811. [2022-07-22 11:09:31,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1811 states, 1810 states have (on average 1.4922651933701658) internal successors, (2701), 1810 states have internal predecessors, (2701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:09:31,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1811 states to 1811 states and 2701 transitions. [2022-07-22 11:09:31,619 INFO L78 Accepts]: Start accepts. Automaton has 1811 states and 2701 transitions. Word has length 215 [2022-07-22 11:09:31,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:09:31,619 INFO L495 AbstractCegarLoop]: Abstraction has 1811 states and 2701 transitions. [2022-07-22 11:09:31,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:09:31,620 INFO L276 IsEmpty]: Start isEmpty. Operand 1811 states and 2701 transitions. [2022-07-22 11:09:31,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2022-07-22 11:09:31,623 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:09:31,623 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:09:31,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-22 11:09:31,623 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:09:31,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:09:31,624 INFO L85 PathProgramCache]: Analyzing trace with hash 978401702, now seen corresponding path program 1 times [2022-07-22 11:09:31,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:09:31,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430493805] [2022-07-22 11:09:31,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:09:31,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:09:31,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:09:31,671 INFO L134 CoverageAnalysis]: Checked inductivity of 498 backedges. 349 proven. 0 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2022-07-22 11:09:31,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:09:31,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430493805] [2022-07-22 11:09:31,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430493805] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:09:31,671 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:09:31,671 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 11:09:31,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277123311] [2022-07-22 11:09:31,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:09:31,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 11:09:31,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:09:31,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 11:09:31,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:09:31,673 INFO L87 Difference]: Start difference. First operand 1811 states and 2701 transitions. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:09:31,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:09:31,816 INFO L93 Difference]: Finished difference Result 3614 states and 5390 transitions. [2022-07-22 11:09:31,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 11:09:31,831 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 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 243 [2022-07-22 11:09:31,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:09:31,837 INFO L225 Difference]: With dead ends: 3614 [2022-07-22 11:09:31,837 INFO L226 Difference]: Without dead ends: 1811 [2022-07-22 11:09:31,839 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:09:31,840 INFO L413 NwaCegarLoop]: 209 mSDtfsCounter, 15 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 11:09:31,840 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 306 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 11:09:31,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1811 states. [2022-07-22 11:09:31,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1811 to 1811. [2022-07-22 11:09:31,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1811 states, 1810 states have (on average 1.4618784530386741) internal successors, (2646), 1810 states have internal predecessors, (2646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:09:31,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1811 states to 1811 states and 2646 transitions. [2022-07-22 11:09:31,892 INFO L78 Accepts]: Start accepts. Automaton has 1811 states and 2646 transitions. Word has length 243 [2022-07-22 11:09:31,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:09:31,893 INFO L495 AbstractCegarLoop]: Abstraction has 1811 states and 2646 transitions. [2022-07-22 11:09:31,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:09:31,893 INFO L276 IsEmpty]: Start isEmpty. Operand 1811 states and 2646 transitions. [2022-07-22 11:09:31,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2022-07-22 11:09:31,897 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:09:31,897 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:09:31,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-22 11:09:31,897 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:09:31,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:09:31,898 INFO L85 PathProgramCache]: Analyzing trace with hash -904430186, now seen corresponding path program 1 times [2022-07-22 11:09:31,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:09:31,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838573224] [2022-07-22 11:09:31,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:09:31,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:09:31,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:09:31,936 INFO L134 CoverageAnalysis]: Checked inductivity of 655 backedges. 430 proven. 0 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2022-07-22 11:09:31,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:09:31,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838573224] [2022-07-22 11:09:31,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838573224] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:09:31,937 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:09:31,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 11:09:31,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136162970] [2022-07-22 11:09:31,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:09:31,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 11:09:31,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:09:31,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 11:09:31,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:09:31,938 INFO L87 Difference]: Start difference. First operand 1811 states and 2646 transitions. Second operand has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:09:31,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:09:31,990 INFO L93 Difference]: Finished difference Result 5321 states and 7772 transitions. [2022-07-22 11:09:31,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 11:09:31,991 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 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 272 [2022-07-22 11:09:31,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:09:32,000 INFO L225 Difference]: With dead ends: 5321 [2022-07-22 11:09:32,000 INFO L226 Difference]: Without dead ends: 3518 [2022-07-22 11:09:32,003 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:09:32,004 INFO L413 NwaCegarLoop]: 357 mSDtfsCounter, 124 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 549 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 11:09:32,004 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 549 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 11:09:32,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3518 states. [2022-07-22 11:09:32,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3518 to 3516. [2022-07-22 11:09:32,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3516 states, 3515 states have (on average 1.4577524893314366) internal successors, (5124), 3515 states have internal predecessors, (5124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:09:32,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3516 states to 3516 states and 5124 transitions. [2022-07-22 11:09:32,074 INFO L78 Accepts]: Start accepts. Automaton has 3516 states and 5124 transitions. Word has length 272 [2022-07-22 11:09:32,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:09:32,075 INFO L495 AbstractCegarLoop]: Abstraction has 3516 states and 5124 transitions. [2022-07-22 11:09:32,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:09:32,075 INFO L276 IsEmpty]: Start isEmpty. Operand 3516 states and 5124 transitions. [2022-07-22 11:09:32,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2022-07-22 11:09:32,081 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:09:32,081 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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] [2022-07-22 11:09:32,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-22 11:09:32,082 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:09:32,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:09:32,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1940271524, now seen corresponding path program 1 times [2022-07-22 11:09:32,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:09:32,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089450610] [2022-07-22 11:09:32,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:09:32,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:09:32,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:09:32,179 INFO L134 CoverageAnalysis]: Checked inductivity of 901 backedges. 525 proven. 66 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2022-07-22 11:09:32,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:09:32,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089450610] [2022-07-22 11:09:32,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089450610] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 11:09:32,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [491393973] [2022-07-22 11:09:32,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:09:32,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 11:09:32,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:09:32,181 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 11:09:32,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-22 11:09:32,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:09:32,284 INFO L263 TraceCheckSpWp]: Trace formula consists of 535 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 11:09:32,300 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 11:09:32,465 INFO L134 CoverageAnalysis]: Checked inductivity of 901 backedges. 497 proven. 0 refuted. 0 times theorem prover too weak. 404 trivial. 0 not checked. [2022-07-22 11:09:32,465 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 11:09:32,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [491393973] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:09:32,465 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 11:09:32,466 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-07-22 11:09:32,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269066639] [2022-07-22 11:09:32,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:09:32,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 11:09:32,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:09:32,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 11:09:32,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-22 11:09:32,466 INFO L87 Difference]: Start difference. First operand 3516 states and 5124 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) [2022-07-22 11:09:32,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:09:32,569 INFO L93 Difference]: Finished difference Result 4264 states and 6218 transitions. [2022-07-22 11:09:32,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 11:09:32,570 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 309 [2022-07-22 11:09:32,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:09:32,581 INFO L225 Difference]: With dead ends: 4264 [2022-07-22 11:09:32,582 INFO L226 Difference]: Without dead ends: 4262 [2022-07-22 11:09:32,583 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 310 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-22 11:09:32,583 INFO L413 NwaCegarLoop]: 188 mSDtfsCounter, 132 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 11:09:32,584 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 364 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 11:09:32,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4262 states. [2022-07-22 11:09:32,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4262 to 4262. [2022-07-22 11:09:32,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4262 states, 4261 states have (on average 1.458577798638817) internal successors, (6215), 4261 states have internal predecessors, (6215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:09:32,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4262 states to 4262 states and 6215 transitions. [2022-07-22 11:09:32,689 INFO L78 Accepts]: Start accepts. Automaton has 4262 states and 6215 transitions. Word has length 309 [2022-07-22 11:09:32,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:09:32,690 INFO L495 AbstractCegarLoop]: Abstraction has 4262 states and 6215 transitions. [2022-07-22 11:09:32,690 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) [2022-07-22 11:09:32,690 INFO L276 IsEmpty]: Start isEmpty. Operand 4262 states and 6215 transitions. [2022-07-22 11:09:32,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 381 [2022-07-22 11:09:32,698 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:09:32,698 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 10, 10, 10, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:09:32,732 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-22 11:09:32,911 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,SelfDestructingSolverStorable22 [2022-07-22 11:09:32,912 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:09:32,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:09:32,912 INFO L85 PathProgramCache]: Analyzing trace with hash 809426729, now seen corresponding path program 1 times [2022-07-22 11:09:32,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:09:32,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975091741] [2022-07-22 11:09:32,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:09:32,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:09:32,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:09:32,953 INFO L134 CoverageAnalysis]: Checked inductivity of 1408 backedges. 848 proven. 66 refuted. 0 times theorem prover too weak. 494 trivial. 0 not checked. [2022-07-22 11:09:32,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:09:32,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975091741] [2022-07-22 11:09:32,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975091741] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 11:09:32,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1988080981] [2022-07-22 11:09:32,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:09:32,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 11:09:32,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:09:32,972 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 11:09:33,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-22 11:09:33,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:09:33,098 INFO L263 TraceCheckSpWp]: Trace formula consists of 627 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 11:09:33,101 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 11:09:33,123 INFO L134 CoverageAnalysis]: Checked inductivity of 1408 backedges. 859 proven. 0 refuted. 0 times theorem prover too weak. 549 trivial. 0 not checked. [2022-07-22 11:09:33,124 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 11:09:33,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1988080981] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:09:33,124 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 11:09:33,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-07-22 11:09:33,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864127765] [2022-07-22 11:09:33,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:09:33,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 11:09:33,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:09:33,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 11:09:33,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-22 11:09:33,125 INFO L87 Difference]: Start difference. First operand 4262 states and 6215 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) [2022-07-22 11:09:33,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:09:33,292 INFO L93 Difference]: Finished difference Result 8984 states and 13150 transitions. [2022-07-22 11:09:33,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 11:09:33,293 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 380 [2022-07-22 11:09:33,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:09:33,300 INFO L225 Difference]: With dead ends: 8984 [2022-07-22 11:09:33,301 INFO L226 Difference]: Without dead ends: 2860 [2022-07-22 11:09:33,306 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 381 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-22 11:09:33,306 INFO L413 NwaCegarLoop]: 198 mSDtfsCounter, 30 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 11:09:33,307 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 302 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 11:09:33,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2860 states. [2022-07-22 11:09:33,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2860 to 2860. [2022-07-22 11:09:33,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2860 states, 2859 states have (on average 1.4379153550192374) internal successors, (4111), 2859 states have internal predecessors, (4111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:09:33,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2860 states to 2860 states and 4111 transitions. [2022-07-22 11:09:33,368 INFO L78 Accepts]: Start accepts. Automaton has 2860 states and 4111 transitions. Word has length 380 [2022-07-22 11:09:33,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:09:33,368 INFO L495 AbstractCegarLoop]: Abstraction has 2860 states and 4111 transitions. [2022-07-22 11:09:33,368 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) [2022-07-22 11:09:33,368 INFO L276 IsEmpty]: Start isEmpty. Operand 2860 states and 4111 transitions. [2022-07-22 11:09:33,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 382 [2022-07-22 11:09:33,374 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:09:33,374 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 7, 7, 7, 7, 7, 7, 7, 5, 5, 3, 3, 3, 3, 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] [2022-07-22 11:09:33,409 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-07-22 11:09:33,612 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,SelfDestructingSolverStorable23 [2022-07-22 11:09:33,612 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:09:33,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:09:33,613 INFO L85 PathProgramCache]: Analyzing trace with hash -806194589, now seen corresponding path program 1 times [2022-07-22 11:09:33,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:09:33,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742853657] [2022-07-22 11:09:33,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:09:33,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:09:33,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:09:33,641 INFO L134 CoverageAnalysis]: Checked inductivity of 1386 backedges. 387 proven. 0 refuted. 0 times theorem prover too weak. 999 trivial. 0 not checked. [2022-07-22 11:09:33,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:09:33,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742853657] [2022-07-22 11:09:33,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742853657] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:09:33,642 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:09:33,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 11:09:33,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82106172] [2022-07-22 11:09:33,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:09:33,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 11:09:33,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:09:33,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 11:09:33,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:09:33,643 INFO L87 Difference]: Start difference. First operand 2860 states and 4111 transitions. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:09:33,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:09:33,756 INFO L93 Difference]: Finished difference Result 5859 states and 8420 transitions. [2022-07-22 11:09:33,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 11:09:33,762 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 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 381 [2022-07-22 11:09:33,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:09:33,772 INFO L225 Difference]: With dead ends: 5859 [2022-07-22 11:09:33,776 INFO L226 Difference]: Without dead ends: 3007 [2022-07-22 11:09:33,779 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:09:33,780 INFO L413 NwaCegarLoop]: 207 mSDtfsCounter, 13 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 11:09:33,780 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 311 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 11:09:33,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3007 states. [2022-07-22 11:09:33,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3007 to 2975. [2022-07-22 11:09:33,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2975 states, 2974 states have (on average 1.429388029589778) internal successors, (4251), 2974 states have internal predecessors, (4251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:09:33,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2975 states to 2975 states and 4251 transitions. [2022-07-22 11:09:33,857 INFO L78 Accepts]: Start accepts. Automaton has 2975 states and 4251 transitions. Word has length 381 [2022-07-22 11:09:33,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:09:33,857 INFO L495 AbstractCegarLoop]: Abstraction has 2975 states and 4251 transitions. [2022-07-22 11:09:33,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:09:33,858 INFO L276 IsEmpty]: Start isEmpty. Operand 2975 states and 4251 transitions. [2022-07-22 11:09:33,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 403 [2022-07-22 11:09:33,862 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:09:33,862 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 7, 7, 7, 7, 7, 7, 7, 5, 5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:09:33,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-22 11:09:33,863 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:09:33,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:09:33,863 INFO L85 PathProgramCache]: Analyzing trace with hash 588994465, now seen corresponding path program 1 times [2022-07-22 11:09:33,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:09:33,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256127214] [2022-07-22 11:09:33,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:09:33,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:09:33,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:09:33,899 INFO L134 CoverageAnalysis]: Checked inductivity of 1575 backedges. 565 proven. 0 refuted. 0 times theorem prover too weak. 1010 trivial. 0 not checked. [2022-07-22 11:09:33,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:09:33,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256127214] [2022-07-22 11:09:33,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256127214] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:09:33,899 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:09:33,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 11:09:33,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529040644] [2022-07-22 11:09:33,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:09:33,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 11:09:33,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:09:33,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 11:09:33,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:09:33,901 INFO L87 Difference]: Start difference. First operand 2975 states and 4251 transitions. Second operand has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:09:34,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:09:34,011 INFO L93 Difference]: Finished difference Result 6246 states and 8962 transitions. [2022-07-22 11:09:34,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 11:09:34,011 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 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 402 [2022-07-22 11:09:34,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:09:34,015 INFO L225 Difference]: With dead ends: 6246 [2022-07-22 11:09:34,016 INFO L226 Difference]: Without dead ends: 3279 [2022-07-22 11:09:34,018 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:09:34,018 INFO L413 NwaCegarLoop]: 207 mSDtfsCounter, 29 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 11:09:34,020 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 311 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 11:09:34,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3279 states. [2022-07-22 11:09:34,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3279 to 3175. [2022-07-22 11:09:34,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3175 states, 3174 states have (on average 1.4149338374291116) internal successors, (4491), 3174 states have internal predecessors, (4491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:09:34,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3175 states to 3175 states and 4491 transitions. [2022-07-22 11:09:34,070 INFO L78 Accepts]: Start accepts. Automaton has 3175 states and 4491 transitions. Word has length 402 [2022-07-22 11:09:34,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:09:34,070 INFO L495 AbstractCegarLoop]: Abstraction has 3175 states and 4491 transitions. [2022-07-22 11:09:34,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:09:34,071 INFO L276 IsEmpty]: Start isEmpty. Operand 3175 states and 4491 transitions. [2022-07-22 11:09:34,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 429 [2022-07-22 11:09:34,076 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:09:34,076 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 11, 11, 10, 10, 9, 9, 9, 9, 9, 9, 7, 7, 7, 7, 7, 7, 7, 5, 5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:09:34,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-07-22 11:09:34,077 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:09:34,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:09:34,077 INFO L85 PathProgramCache]: Analyzing trace with hash 434686614, now seen corresponding path program 1 times [2022-07-22 11:09:34,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:09:34,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006638528] [2022-07-22 11:09:34,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:09:34,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:09:34,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:09:34,133 INFO L134 CoverageAnalysis]: Checked inductivity of 1800 backedges. 761 proven. 0 refuted. 0 times theorem prover too weak. 1039 trivial. 0 not checked. [2022-07-22 11:09:34,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:09:34,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006638528] [2022-07-22 11:09:34,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006638528] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:09:34,134 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:09:34,134 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 11:09:34,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049382224] [2022-07-22 11:09:34,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:09:34,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 11:09:34,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:09:34,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 11:09:34,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:09:34,135 INFO L87 Difference]: Start difference. First operand 3175 states and 4491 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:09:34,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:09:34,249 INFO L93 Difference]: Finished difference Result 6406 states and 9074 transitions. [2022-07-22 11:09:34,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 11:09:34,249 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 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 428 [2022-07-22 11:09:34,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:09:34,253 INFO L225 Difference]: With dead ends: 6406 [2022-07-22 11:09:34,253 INFO L226 Difference]: Without dead ends: 3239 [2022-07-22 11:09:34,256 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:09:34,256 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 19 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 11:09:34,256 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 310 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 11:09:34,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3239 states. [2022-07-22 11:09:34,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3239 to 3175. [2022-07-22 11:09:34,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3175 states, 3174 states have (on average 1.3897290485192186) internal successors, (4411), 3174 states have internal predecessors, (4411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:09:34,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3175 states to 3175 states and 4411 transitions. [2022-07-22 11:09:34,305 INFO L78 Accepts]: Start accepts. Automaton has 3175 states and 4411 transitions. Word has length 428 [2022-07-22 11:09:34,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:09:34,305 INFO L495 AbstractCegarLoop]: Abstraction has 3175 states and 4411 transitions. [2022-07-22 11:09:34,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:09:34,305 INFO L276 IsEmpty]: Start isEmpty. Operand 3175 states and 4411 transitions. [2022-07-22 11:09:34,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 448 [2022-07-22 11:09:34,309 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:09:34,310 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 9, 9, 9, 9, 6, 6, 6, 6, 6, 6, 6, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:09:34,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-07-22 11:09:34,310 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:09:34,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:09:34,310 INFO L85 PathProgramCache]: Analyzing trace with hash -785344079, now seen corresponding path program 1 times [2022-07-22 11:09:34,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:09:34,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523857] [2022-07-22 11:09:34,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:09:34,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:09:34,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:09:34,356 INFO L134 CoverageAnalysis]: Checked inductivity of 2022 backedges. 1196 proven. 26 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2022-07-22 11:09:34,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:09:34,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523857] [2022-07-22 11:09:34,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523857] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 11:09:34,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [135207083] [2022-07-22 11:09:34,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:09:34,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 11:09:34,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:09:34,372 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 11:09:34,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-22 11:09:34,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:09:34,489 INFO L263 TraceCheckSpWp]: Trace formula consists of 721 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-22 11:09:34,493 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 11:09:34,833 INFO L134 CoverageAnalysis]: Checked inductivity of 2022 backedges. 867 proven. 0 refuted. 0 times theorem prover too weak. 1155 trivial. 0 not checked. [2022-07-22 11:09:34,833 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 11:09:34,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [135207083] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:09:34,833 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 11:09:34,833 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-07-22 11:09:34,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895895383] [2022-07-22 11:09:34,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:09:34,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 11:09:34,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:09:34,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 11:09:34,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-22 11:09:34,834 INFO L87 Difference]: Start difference. First operand 3175 states and 4411 transitions. Second operand has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:09:34,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:09:34,918 INFO L93 Difference]: Finished difference Result 3863 states and 5353 transitions. [2022-07-22 11:09:34,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 11:09:34,919 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 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 447 [2022-07-22 11:09:34,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:09:34,923 INFO L225 Difference]: With dead ends: 3863 [2022-07-22 11:09:34,923 INFO L226 Difference]: Without dead ends: 3081 [2022-07-22 11:09:34,924 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 450 GetRequests, 447 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-22 11:09:34,925 INFO L413 NwaCegarLoop]: 350 mSDtfsCounter, 101 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 11:09:34,925 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 532 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 11:09:34,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3081 states. [2022-07-22 11:09:34,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3081 to 2395. [2022-07-22 11:09:34,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2395 states, 2394 states have (on average 1.3893065998329157) internal successors, (3326), 2394 states have internal predecessors, (3326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:09:34,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2395 states to 2395 states and 3326 transitions. [2022-07-22 11:09:34,965 INFO L78 Accepts]: Start accepts. Automaton has 2395 states and 3326 transitions. Word has length 447 [2022-07-22 11:09:34,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:09:34,965 INFO L495 AbstractCegarLoop]: Abstraction has 2395 states and 3326 transitions. [2022-07-22 11:09:34,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:09:34,966 INFO L276 IsEmpty]: Start isEmpty. Operand 2395 states and 3326 transitions. [2022-07-22 11:09:34,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 448 [2022-07-22 11:09:34,969 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:09:34,969 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 9, 9, 9, 9, 6, 6, 6, 6, 6, 6, 6, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:09:35,001 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-22 11:09:35,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 11:09:35,187 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:09:35,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:09:35,187 INFO L85 PathProgramCache]: Analyzing trace with hash -708443281, now seen corresponding path program 1 times [2022-07-22 11:09:35,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:09:35,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345263453] [2022-07-22 11:09:35,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:09:35,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:09:35,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:09:35,244 INFO L134 CoverageAnalysis]: Checked inductivity of 2022 backedges. 1196 proven. 26 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2022-07-22 11:09:35,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:09:35,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345263453] [2022-07-22 11:09:35,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345263453] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 11:09:35,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1155757614] [2022-07-22 11:09:35,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:09:35,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 11:09:35,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:09:35,264 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 11:09:35,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-22 11:09:35,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:09:35,422 INFO L263 TraceCheckSpWp]: Trace formula consists of 722 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-22 11:09:35,426 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 11:09:35,499 INFO L134 CoverageAnalysis]: Checked inductivity of 2022 backedges. 1196 proven. 26 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2022-07-22 11:09:35,500 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 11:09:35,586 INFO L134 CoverageAnalysis]: Checked inductivity of 2022 backedges. 1196 proven. 26 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2022-07-22 11:09:35,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1155757614] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 11:09:35,587 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 11:09:35,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-07-22 11:09:35,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354375297] [2022-07-22 11:09:35,587 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 11:09:35,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-22 11:09:35,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:09:35,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 11:09:35,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-22 11:09:35,589 INFO L87 Difference]: Start difference. First operand 2395 states and 3326 transitions. Second operand has 6 states, 6 states have (on average 41.166666666666664) internal successors, (247), 6 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:09:35,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:09:35,900 INFO L93 Difference]: Finished difference Result 5876 states and 8163 transitions. [2022-07-22 11:09:35,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-22 11:09:35,900 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 41.166666666666664) internal successors, (247), 6 states have internal predecessors, (247), 0 states have call successors, (0), 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 447 [2022-07-22 11:09:35,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:09:35,905 INFO L225 Difference]: With dead ends: 5876 [2022-07-22 11:09:35,905 INFO L226 Difference]: Without dead ends: 3360 [2022-07-22 11:09:35,908 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 900 GetRequests, 894 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-07-22 11:09:35,908 INFO L413 NwaCegarLoop]: 223 mSDtfsCounter, 341 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-22 11:09:35,909 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [341 Valid, 550 Invalid, 468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-22 11:09:35,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3360 states. [2022-07-22 11:09:35,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3360 to 2356. [2022-07-22 11:09:35,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2356 states, 2355 states have (on average 1.367728237791932) internal successors, (3221), 2355 states have internal predecessors, (3221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:09:35,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2356 states to 2356 states and 3221 transitions. [2022-07-22 11:09:35,965 INFO L78 Accepts]: Start accepts. Automaton has 2356 states and 3221 transitions. Word has length 447 [2022-07-22 11:09:35,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:09:35,965 INFO L495 AbstractCegarLoop]: Abstraction has 2356 states and 3221 transitions. [2022-07-22 11:09:35,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 41.166666666666664) internal successors, (247), 6 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:09:35,966 INFO L276 IsEmpty]: Start isEmpty. Operand 2356 states and 3221 transitions. [2022-07-22 11:09:35,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 623 [2022-07-22 11:09:35,970 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:09:35,971 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 17, 17, 16, 16, 15, 15, 14, 14, 14, 14, 12, 9, 9, 9, 9, 9, 9, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:09:36,011 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-22 11:09:36,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-07-22 11:09:36,190 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:09:36,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:09:36,190 INFO L85 PathProgramCache]: Analyzing trace with hash -1730115607, now seen corresponding path program 1 times [2022-07-22 11:09:36,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:09:36,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288715428] [2022-07-22 11:09:36,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:09:36,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:09:36,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:09:36,245 INFO L134 CoverageAnalysis]: Checked inductivity of 4105 backedges. 1530 proven. 0 refuted. 0 times theorem prover too weak. 2575 trivial. 0 not checked. [2022-07-22 11:09:36,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:09:36,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288715428] [2022-07-22 11:09:36,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288715428] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:09:36,246 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:09:36,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 11:09:36,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088929655] [2022-07-22 11:09:36,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:09:36,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 11:09:36,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:09:36,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 11:09:36,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:09:36,248 INFO L87 Difference]: Start difference. First operand 2356 states and 3221 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:09:36,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:09:36,350 INFO L93 Difference]: Finished difference Result 4716 states and 6442 transitions. [2022-07-22 11:09:36,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 11:09:36,350 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 622 [2022-07-22 11:09:36,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:09:36,353 INFO L225 Difference]: With dead ends: 4716 [2022-07-22 11:09:36,353 INFO L226 Difference]: Without dead ends: 2368 [2022-07-22 11:09:36,355 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:09:36,355 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 11 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 11:09:36,356 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 298 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 11:09:36,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2368 states. [2022-07-22 11:09:36,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2368 to 2356. [2022-07-22 11:09:36,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2356 states, 2355 states have (on average 1.3422505307855626) internal successors, (3161), 2355 states have internal predecessors, (3161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:09:36,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2356 states to 2356 states and 3161 transitions. [2022-07-22 11:09:36,446 INFO L78 Accepts]: Start accepts. Automaton has 2356 states and 3161 transitions. Word has length 622 [2022-07-22 11:09:36,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:09:36,447 INFO L495 AbstractCegarLoop]: Abstraction has 2356 states and 3161 transitions. [2022-07-22 11:09:36,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:09:36,447 INFO L276 IsEmpty]: Start isEmpty. Operand 2356 states and 3161 transitions. [2022-07-22 11:09:36,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 657 [2022-07-22 11:09:36,452 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:09:36,452 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 19, 19, 19, 19, 19, 18, 18, 17, 17, 16, 16, 15, 15, 15, 15, 12, 9, 9, 9, 9, 9, 9, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:09:36,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-07-22 11:09:36,452 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:09:36,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:09:36,453 INFO L85 PathProgramCache]: Analyzing trace with hash 264105968, now seen corresponding path program 1 times [2022-07-22 11:09:36,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:09:36,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312188321] [2022-07-22 11:09:36,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:09:36,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:09:36,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:09:36,508 INFO L134 CoverageAnalysis]: Checked inductivity of 4562 backedges. 2170 proven. 0 refuted. 0 times theorem prover too weak. 2392 trivial. 0 not checked. [2022-07-22 11:09:36,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:09:36,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312188321] [2022-07-22 11:09:36,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312188321] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:09:36,508 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:09:36,508 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 11:09:36,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748725675] [2022-07-22 11:09:36,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:09:36,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 11:09:36,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:09:36,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 11:09:36,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:09:36,510 INFO L87 Difference]: Start difference. First operand 2356 states and 3161 transitions. Second operand has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:09:36,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:09:36,617 INFO L93 Difference]: Finished difference Result 4920 states and 6628 transitions. [2022-07-22 11:09:36,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 11:09:36,617 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 656 [2022-07-22 11:09:36,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:09:36,620 INFO L225 Difference]: With dead ends: 4920 [2022-07-22 11:09:36,620 INFO L226 Difference]: Without dead ends: 2572 [2022-07-22 11:09:36,622 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:09:36,622 INFO L413 NwaCegarLoop]: 194 mSDtfsCounter, 11 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 11:09:36,623 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 296 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 11:09:36,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2572 states. [2022-07-22 11:09:36,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2572 to 2560. [2022-07-22 11:09:36,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2560 states, 2559 states have (on average 1.3266901133255178) internal successors, (3395), 2559 states have internal predecessors, (3395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:09:36,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2560 states to 2560 states and 3395 transitions. [2022-07-22 11:09:36,663 INFO L78 Accepts]: Start accepts. Automaton has 2560 states and 3395 transitions. Word has length 656 [2022-07-22 11:09:36,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:09:36,663 INFO L495 AbstractCegarLoop]: Abstraction has 2560 states and 3395 transitions. [2022-07-22 11:09:36,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:09:36,663 INFO L276 IsEmpty]: Start isEmpty. Operand 2560 states and 3395 transitions. [2022-07-22 11:09:36,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 750 [2022-07-22 11:09:36,669 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:09:36,670 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 22, 22, 22, 22, 22, 21, 21, 20, 20, 19, 19, 18, 18, 18, 18, 15, 12, 12, 9, 9, 9, 9, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:09:36,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-07-22 11:09:36,670 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:09:36,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:09:36,670 INFO L85 PathProgramCache]: Analyzing trace with hash -951624686, now seen corresponding path program 1 times [2022-07-22 11:09:36,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:09:36,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335549187] [2022-07-22 11:09:36,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:09:36,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:09:36,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:09:36,734 INFO L134 CoverageAnalysis]: Checked inductivity of 6176 backedges. 2953 proven. 0 refuted. 0 times theorem prover too weak. 3223 trivial. 0 not checked. [2022-07-22 11:09:36,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:09:36,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335549187] [2022-07-22 11:09:36,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335549187] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:09:36,735 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:09:36,735 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 11:09:36,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632058392] [2022-07-22 11:09:36,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:09:36,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 11:09:36,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:09:36,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 11:09:36,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:09:36,737 INFO L87 Difference]: Start difference. First operand 2560 states and 3395 transitions. Second operand has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:09:36,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:09:36,858 INFO L93 Difference]: Finished difference Result 5340 states and 7120 transitions. [2022-07-22 11:09:36,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 11:09:36,859 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 0 states have call successors, (0), 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 749 [2022-07-22 11:09:36,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:09:36,862 INFO L225 Difference]: With dead ends: 5340 [2022-07-22 11:09:36,863 INFO L226 Difference]: Without dead ends: 2788 [2022-07-22 11:09:36,865 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:09:36,865 INFO L413 NwaCegarLoop]: 194 mSDtfsCounter, 11 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 11:09:36,865 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 296 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 11:09:36,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2788 states. [2022-07-22 11:09:36,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2788 to 2776. [2022-07-22 11:09:36,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2776 states, 2775 states have (on average 1.312072072072072) internal successors, (3641), 2775 states have internal predecessors, (3641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:09:36,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2776 states to 2776 states and 3641 transitions. [2022-07-22 11:09:36,907 INFO L78 Accepts]: Start accepts. Automaton has 2776 states and 3641 transitions. Word has length 749 [2022-07-22 11:09:36,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:09:36,907 INFO L495 AbstractCegarLoop]: Abstraction has 2776 states and 3641 transitions. [2022-07-22 11:09:36,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:09:36,908 INFO L276 IsEmpty]: Start isEmpty. Operand 2776 states and 3641 transitions. [2022-07-22 11:09:36,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 849 [2022-07-22 11:09:36,914 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:09:36,915 INFO L195 NwaCegarLoop]: trace histogram [26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 25, 25, 25, 25, 25, 24, 24, 23, 23, 22, 22, 21, 21, 21, 21, 18, 15, 15, 12, 12, 9, 9, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:09:36,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-07-22 11:09:36,915 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:09:36,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:09:36,915 INFO L85 PathProgramCache]: Analyzing trace with hash -1071625077, now seen corresponding path program 1 times [2022-07-22 11:09:36,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:09:36,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088465148] [2022-07-22 11:09:36,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:09:36,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:09:36,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:09:37,010 INFO L134 CoverageAnalysis]: Checked inductivity of 8111 backedges. 4746 proven. 26 refuted. 0 times theorem prover too weak. 3339 trivial. 0 not checked. [2022-07-22 11:09:37,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:09:37,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088465148] [2022-07-22 11:09:37,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088465148] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 11:09:37,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [352993579] [2022-07-22 11:09:37,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:09:37,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 11:09:37,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:09:37,028 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 11:09:37,039 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-22 11:09:37,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:09:37,232 INFO L263 TraceCheckSpWp]: Trace formula consists of 1265 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-22 11:09:37,237 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 11:09:37,307 INFO L134 CoverageAnalysis]: Checked inductivity of 8111 backedges. 4746 proven. 26 refuted. 0 times theorem prover too weak. 3339 trivial. 0 not checked. [2022-07-22 11:09:37,307 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 11:09:37,372 INFO L134 CoverageAnalysis]: Checked inductivity of 8111 backedges. 4746 proven. 26 refuted. 0 times theorem prover too weak. 3339 trivial. 0 not checked. [2022-07-22 11:09:37,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [352993579] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 11:09:37,373 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 11:09:37,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2022-07-22 11:09:37,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204566992] [2022-07-22 11:09:37,373 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 11:09:37,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-22 11:09:37,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:09:37,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-22 11:09:37,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-07-22 11:09:37,375 INFO L87 Difference]: Start difference. First operand 2776 states and 3641 transitions. Second operand has 8 states, 8 states have (on average 43.625) internal successors, (349), 8 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:09:37,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:09:37,673 INFO L93 Difference]: Finished difference Result 5149 states and 6786 transitions. [2022-07-22 11:09:37,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 11:09:37,674 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 43.625) internal successors, (349), 8 states have internal predecessors, (349), 0 states have call successors, (0), 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 848 [2022-07-22 11:09:37,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:09:37,675 INFO L225 Difference]: With dead ends: 5149 [2022-07-22 11:09:37,675 INFO L226 Difference]: Without dead ends: 0 [2022-07-22 11:09:37,678 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1704 GetRequests, 1695 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-07-22 11:09:37,679 INFO L413 NwaCegarLoop]: 248 mSDtfsCounter, 225 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 788 SdHoareTripleChecker+Invalid, 522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-22 11:09:37,679 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 788 Invalid, 522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 462 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-22 11:09:37,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-22 11:09:37,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-22 11:09:37,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:09:37,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-22 11:09:37,680 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 848 [2022-07-22 11:09:37,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:09:37,680 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-22 11:09:37,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 43.625) internal successors, (349), 8 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:09:37,680 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-22 11:09:37,680 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-22 11:09:37,682 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-22 11:09:37,702 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-22 11:09:37,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2022-07-22 11:09:37,905 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-22 11:09:50,158 INFO L899 garLoopResultBuilder]: For program point L630(line 630) no Hoare annotation was computed. [2022-07-22 11:09:50,158 INFO L899 garLoopResultBuilder]: For program point L597(lines 597 611) no Hoare annotation was computed. [2022-07-22 11:09:50,158 INFO L899 garLoopResultBuilder]: For program point L399(lines 399 405) no Hoare annotation was computed. [2022-07-22 11:09:50,158 INFO L895 garLoopResultBuilder]: At program point L201(lines 197 567) the Hoare annotation is: (let ((.cse9 (not (<= 8656 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse0 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse4 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse5 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse6 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse7 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse8 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and .cse0 .cse1 .cse2 .cse3 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse4 .cse5 (< |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656) .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse3 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0) .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) .cse4 .cse5 .cse6 .cse7 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656)) (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|)) .cse8 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)))) [2022-07-22 11:09:50,159 INFO L895 garLoopResultBuilder]: At program point L168(lines 164 578) the Hoare annotation is: (let ((.cse12 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse14 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse15 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (.cse16 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) (.cse0 (not (<= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse2 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse5 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse17 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse6 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse7 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse8 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse9 (not (= 12292 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse10 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse11 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656))) (.cse13 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse14 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse15 .cse13 .cse16) (and .cse1 (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse15 .cse13 .cse16) (and .cse1 .cse2 .cse3 .cse4 .cse14 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse15 .cse13 .cse16) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse17 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse15 .cse13 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse17 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13))) [2022-07-22 11:09:50,159 INFO L895 garLoopResultBuilder]: At program point L135(lines 134 588) the Hoare annotation is: (and (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656)) (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) [2022-07-22 11:09:50,159 INFO L899 garLoopResultBuilder]: For program point L102(lines 102 104) no Hoare annotation was computed. [2022-07-22 11:09:50,159 INFO L895 garLoopResultBuilder]: At program point L631(lines 629 632) the Hoare annotation is: false [2022-07-22 11:09:50,159 INFO L899 garLoopResultBuilder]: For program point L598(lines 598 603) no Hoare annotation was computed. [2022-07-22 11:09:50,159 INFO L899 garLoopResultBuilder]: For program point L598-2(lines 597 611) no Hoare annotation was computed. [2022-07-22 11:09:50,159 INFO L899 garLoopResultBuilder]: For program point L268(lines 268 270) no Hoare annotation was computed. [2022-07-22 11:09:50,159 INFO L899 garLoopResultBuilder]: For program point L302(lines 302 306) no Hoare annotation was computed. [2022-07-22 11:09:50,160 INFO L899 garLoopResultBuilder]: For program point L302-2(lines 302 306) no Hoare annotation was computed. [2022-07-22 11:09:50,160 INFO L899 garLoopResultBuilder]: For program point L203(lines 203 565) no Hoare annotation was computed. [2022-07-22 11:09:50,160 INFO L899 garLoopResultBuilder]: For program point L170(lines 170 576) no Hoare annotation was computed. [2022-07-22 11:09:50,160 INFO L899 garLoopResultBuilder]: For program point L137(lines 137 587) no Hoare annotation was computed. [2022-07-22 11:09:50,160 INFO L899 garLoopResultBuilder]: For program point L600(lines 600 602) no Hoare annotation was computed. [2022-07-22 11:09:50,160 INFO L899 garLoopResultBuilder]: For program point L468(lines 468 470) no Hoare annotation was computed. [2022-07-22 11:09:50,160 INFO L899 garLoopResultBuilder]: For program point L237(lines 237 244) no Hoare annotation was computed. [2022-07-22 11:09:50,160 INFO L899 garLoopResultBuilder]: For program point L237-2(lines 237 244) no Hoare annotation was computed. [2022-07-22 11:09:50,160 INFO L899 garLoopResultBuilder]: For program point L536(lines 536 540) no Hoare annotation was computed. [2022-07-22 11:09:50,160 INFO L899 garLoopResultBuilder]: For program point L503(lines 503 506) no Hoare annotation was computed. [2022-07-22 11:09:50,161 INFO L899 garLoopResultBuilder]: For program point L536-2(lines 536 540) no Hoare annotation was computed. [2022-07-22 11:09:50,161 INFO L899 garLoopResultBuilder]: For program point L437(lines 437 445) no Hoare annotation was computed. [2022-07-22 11:09:50,161 INFO L899 garLoopResultBuilder]: For program point L437-2(lines 437 445) no Hoare annotation was computed. [2022-07-22 11:09:50,161 INFO L899 garLoopResultBuilder]: For program point L239(lines 239 242) no Hoare annotation was computed. [2022-07-22 11:09:50,161 INFO L899 garLoopResultBuilder]: For program point L206(lines 206 564) no Hoare annotation was computed. [2022-07-22 11:09:50,161 INFO L899 garLoopResultBuilder]: For program point L173(lines 173 575) no Hoare annotation was computed. [2022-07-22 11:09:50,161 INFO L899 garLoopResultBuilder]: For program point L140(lines 140 586) no Hoare annotation was computed. [2022-07-22 11:09:50,161 INFO L899 garLoopResultBuilder]: For program point L339(lines 339 378) no Hoare annotation was computed. [2022-07-22 11:09:50,161 INFO L895 garLoopResultBuilder]: At program point L207(lines 203 565) the Hoare annotation is: (let ((.cse0 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse5 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse6 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse7 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse8 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse9 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse10 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (or (and .cse0 .cse1 .cse2 .cse3 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0) .cse9 .cse10) (and (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|)) .cse9 .cse10))) [2022-07-22 11:09:50,162 INFO L895 garLoopResultBuilder]: At program point L174(lines 170 576) the Hoare annotation is: (let ((.cse14 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse6 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse15 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (.cse16 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) (.cse0 (not (<= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse2 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse17 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse5 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse7 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse8 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse9 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse10 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse11 (not (= 12292 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse12 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse13 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse1 .cse2 .cse3 .cse4 .cse17 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse1 (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse17 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))) [2022-07-22 11:09:50,162 INFO L899 garLoopResultBuilder]: For program point L605(lines 605 609) no Hoare annotation was computed. [2022-07-22 11:09:50,162 INFO L899 garLoopResultBuilder]: For program point L440(lines 440 443) no Hoare annotation was computed. [2022-07-22 11:09:50,162 INFO L895 garLoopResultBuilder]: At program point L407(lines 398 416) the Hoare annotation is: (let ((.cse12 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse14 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse15 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (.cse16 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) (.cse0 (not (<= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse2 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse5 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse17 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse6 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse7 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse8 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse9 (not (= 12292 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse10 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse11 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656))) (.cse13 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse14 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse15 .cse13 .cse16) (and .cse1 (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse15 .cse13 .cse16) (and .cse1 .cse2 .cse3 .cse4 .cse14 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse15 .cse13 .cse16) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse17 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse15 .cse13 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse17 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13))) [2022-07-22 11:09:50,162 INFO L899 garLoopResultBuilder]: For program point L209(lines 209 563) no Hoare annotation was computed. [2022-07-22 11:09:50,162 INFO L899 garLoopResultBuilder]: For program point L176(lines 176 574) no Hoare annotation was computed. [2022-07-22 11:09:50,162 INFO L899 garLoopResultBuilder]: For program point L143(lines 143 585) no Hoare annotation was computed. [2022-07-22 11:09:50,162 INFO L895 garLoopResultBuilder]: At program point L110-2(lines 110 614) the Hoare annotation is: (let ((.cse12 (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (let ((.cse11 (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse4 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse0 (not .cse12)) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse5 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse6 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse7 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse8 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) (.cse13 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse10 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (.cse14 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576)) (.cse9 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse15 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) .cse7 .cse9 .cse8) (and .cse4 .cse10) (and (<= 8672 |ULTIMATE.start_ssl3_accept_~s__state~0#1|) .cse11 .cse8) (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 3) (and .cse11 (= 3 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|) .cse12) (and .cse11 .cse10) (and .cse13 .cse14 .cse15) (and .cse4 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse13 .cse6 .cse7 .cse8) (and .cse9 .cse10) (and .cse13 .cse10) (and .cse14 .cse9 .cse15)))) [2022-07-22 11:09:50,163 INFO L899 garLoopResultBuilder]: For program point L342(lines 342 377) no Hoare annotation was computed. [2022-07-22 11:09:50,163 INFO L899 garLoopResultBuilder]: For program point L342-1(lines 342 377) no Hoare annotation was computed. [2022-07-22 11:09:50,163 INFO L895 garLoopResultBuilder]: At program point L177(lines 176 574) the Hoare annotation is: (let ((.cse4 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse2 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (.cse6 (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse0 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse5 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse1 (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse3 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576))) (or (and .cse0 .cse1 .cse2) (and .cse1 .cse3 .cse4) (and .cse1 .cse4 .cse2) (and .cse5 .cse1 .cse2) (and .cse6 .cse1 .cse2) (and .cse6 (= 3 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|) .cse1) (and .cse0 .cse1 .cse3) (and .cse5 .cse1 .cse3))) [2022-07-22 11:09:50,163 INFO L895 garLoopResultBuilder]: At program point L144(lines 137 587) the Hoare annotation is: (let ((.cse0 (not (<= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse5 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse16 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse1 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse17 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse11 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse12 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse6 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse7 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse8 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse9 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse13 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656))) (.cse14 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (.cse10 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse15 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse1 .cse2 .cse3 .cse4 .cse11 .cse12 .cse6 .cse7 .cse8 .cse9 .cse13 .cse14 .cse10 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse16 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse17 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse1 .cse2 .cse3 .cse4 .cse11 .cse5 .cse12 .cse6 .cse7 .cse8 .cse9 .cse13 .cse14 .cse10 .cse15) (and .cse1 .cse2 .cse3 .cse4 .cse11 .cse12 .cse6 .cse7 .cse8 .cse9 .cse13 .cse16 .cse14 .cse10 .cse15) (and .cse1 .cse2 .cse3 .cse4 .cse17 .cse11 .cse12 .cse6 .cse7 .cse8 .cse9 .cse13 .cse14 .cse10 .cse15))) [2022-07-22 11:09:50,163 INFO L899 garLoopResultBuilder]: For program point L111(line 111) no Hoare annotation was computed. [2022-07-22 11:09:50,163 INFO L899 garLoopResultBuilder]: For program point L508(lines 508 510) no Hoare annotation was computed. [2022-07-22 11:09:50,163 INFO L899 garLoopResultBuilder]: For program point L508-2(lines 219 558) no Hoare annotation was computed. [2022-07-22 11:09:50,163 INFO L899 garLoopResultBuilder]: For program point L343(lines 343 374) no Hoare annotation was computed. [2022-07-22 11:09:50,164 INFO L899 garLoopResultBuilder]: For program point L410(lines 410 412) no Hoare annotation was computed. [2022-07-22 11:09:50,164 INFO L899 garLoopResultBuilder]: For program point L212(lines 212 562) no Hoare annotation was computed. [2022-07-22 11:09:50,164 INFO L899 garLoopResultBuilder]: For program point L179(lines 179 573) no Hoare annotation was computed. [2022-07-22 11:09:50,164 INFO L899 garLoopResultBuilder]: For program point L146(lines 146 584) no Hoare annotation was computed. [2022-07-22 11:09:50,164 INFO L899 garLoopResultBuilder]: For program point L113(lines 113 595) no Hoare annotation was computed. [2022-07-22 11:09:50,164 INFO L902 garLoopResultBuilder]: At program point L642(lines 633 644) the Hoare annotation is: true [2022-07-22 11:09:50,164 INFO L899 garLoopResultBuilder]: For program point L477(lines 477 479) no Hoare annotation was computed. [2022-07-22 11:09:50,164 INFO L899 garLoopResultBuilder]: For program point L246(lines 246 249) no Hoare annotation was computed. [2022-07-22 11:09:50,164 INFO L895 garLoopResultBuilder]: At program point L213(lines 209 563) the Hoare annotation is: (let ((.cse0 (<= 8672 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse1 (not (= 12292 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and .cse0 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1) .cse1) (and .cse0 .cse1 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (and .cse0 (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse1) (and .cse0 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse1 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))))) [2022-07-22 11:09:50,165 INFO L895 garLoopResultBuilder]: At program point L114(lines 113 595) the Hoare annotation is: (let ((.cse0 (<= 8672 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse1 (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse3 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|)))) (or (and .cse0 .cse1 (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse2 .cse3) (and .cse0 .cse1 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse2 .cse3) (and .cse0 .cse1 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1) .cse2 .cse3) (and .cse0 .cse1 .cse2 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0) .cse3))) [2022-07-22 11:09:50,165 INFO L899 garLoopResultBuilder]: For program point L313(lines 313 320) no Hoare annotation was computed. [2022-07-22 11:09:50,165 INFO L899 garLoopResultBuilder]: For program point L313-2(lines 313 320) no Hoare annotation was computed. [2022-07-22 11:09:50,165 INFO L899 garLoopResultBuilder]: For program point L215(lines 215 561) no Hoare annotation was computed. [2022-07-22 11:09:50,165 INFO L899 garLoopResultBuilder]: For program point L182(lines 182 572) no Hoare annotation was computed. [2022-07-22 11:09:50,165 INFO L899 garLoopResultBuilder]: For program point L149(lines 149 583) no Hoare annotation was computed. [2022-07-22 11:09:50,165 INFO L899 garLoopResultBuilder]: For program point L116(lines 116 594) no Hoare annotation was computed. [2022-07-22 11:09:50,165 INFO L899 garLoopResultBuilder]: For program point L546(lines 546 552) no Hoare annotation was computed. [2022-07-22 11:09:50,165 INFO L899 garLoopResultBuilder]: For program point L546-1(lines 546 552) no Hoare annotation was computed. [2022-07-22 11:09:50,165 INFO L899 garLoopResultBuilder]: For program point L348(lines 348 372) no Hoare annotation was computed. [2022-07-22 11:09:50,165 INFO L895 garLoopResultBuilder]: At program point L216(lines 215 561) the Hoare annotation is: (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) [2022-07-22 11:09:50,166 INFO L895 garLoopResultBuilder]: At program point L183(lines 179 573) the Hoare annotation is: (let ((.cse15 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse16 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse17 (not (<= 8656 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse0 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse14 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse5 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse6 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse7 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse8 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse9 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse10 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656))) (.cse11 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (.cse12 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse13 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (or (and (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse14 .cse6 .cse7 (< |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656) .cse8 .cse9 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse15 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse16 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse15 .cse6 .cse7 .cse8 .cse9 .cse12 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse7 .cse8 .cse9 .cse16 .cse12 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse14 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))) [2022-07-22 11:09:50,166 INFO L895 garLoopResultBuilder]: At program point L150(lines 146 584) the Hoare annotation is: (let ((.cse16 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse17 (not (<= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse15 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse11 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse0 (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse5 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse6 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse7 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse8 (not (= 12292 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse9 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse10 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656))) (.cse12 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (.cse13 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse14 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse15 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse16 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14) (and .cse17 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse16 .cse6 .cse7 .cse8 .cse9 .cse10 .cse13) (and .cse17 .cse0 .cse1 .cse2 .cse3 .cse4 .cse15 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 (< |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576) .cse11 .cse13) (and .cse0 (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14))) [2022-07-22 11:09:50,166 INFO L899 garLoopResultBuilder]: For program point L283(lines 283 285) no Hoare annotation was computed. [2022-07-22 11:09:50,166 INFO L899 garLoopResultBuilder]: For program point L283-2(lines 219 558) no Hoare annotation was computed. [2022-07-22 11:09:50,166 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-22 11:09:50,166 INFO L899 garLoopResultBuilder]: For program point L317(lines 317 319) no Hoare annotation was computed. [2022-07-22 11:09:50,166 INFO L899 garLoopResultBuilder]: For program point L251(lines 251 262) no Hoare annotation was computed. [2022-07-22 11:09:50,166 INFO L895 garLoopResultBuilder]: At program point L218(lines 217 561) the Hoare annotation is: (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) [2022-07-22 11:09:50,167 INFO L899 garLoopResultBuilder]: For program point L185(lines 185 571) no Hoare annotation was computed. [2022-07-22 11:09:50,167 INFO L899 garLoopResultBuilder]: For program point L152(lines 152 582) no Hoare annotation was computed. [2022-07-22 11:09:50,167 INFO L899 garLoopResultBuilder]: For program point L119(lines 119 593) no Hoare annotation was computed. [2022-07-22 11:09:50,167 INFO L902 garLoopResultBuilder]: At program point L615(lines 109 616) the Hoare annotation is: true [2022-07-22 11:09:50,167 INFO L899 garLoopResultBuilder]: For program point L549(lines 549 551) no Hoare annotation was computed. [2022-07-22 11:09:50,167 INFO L899 garLoopResultBuilder]: For program point L517(lines 517 520) no Hoare annotation was computed. [2022-07-22 11:09:50,167 INFO L899 garLoopResultBuilder]: For program point L451(lines 451 453) no Hoare annotation was computed. [2022-07-22 11:09:50,167 INFO L899 garLoopResultBuilder]: For program point L352(lines 352 356) no Hoare annotation was computed. [2022-07-22 11:09:50,167 INFO L899 garLoopResultBuilder]: For program point L352-2(lines 352 356) no Hoare annotation was computed. [2022-07-22 11:09:50,167 INFO L899 garLoopResultBuilder]: For program point L253(lines 253 256) no Hoare annotation was computed. [2022-07-22 11:09:50,168 INFO L899 garLoopResultBuilder]: For program point L386(lines 386 418) no Hoare annotation was computed. [2022-07-22 11:09:50,168 INFO L899 garLoopResultBuilder]: For program point L188(lines 188 570) no Hoare annotation was computed. [2022-07-22 11:09:50,168 INFO L899 garLoopResultBuilder]: For program point L155(lines 155 581) no Hoare annotation was computed. [2022-07-22 11:09:50,168 INFO L899 garLoopResultBuilder]: For program point L122(lines 122 592) no Hoare annotation was computed. [2022-07-22 11:09:50,168 INFO L899 garLoopResultBuilder]: For program point L486(lines 486 488) no Hoare annotation was computed. [2022-07-22 11:09:50,168 INFO L899 garLoopResultBuilder]: For program point L486-2(lines 219 558) no Hoare annotation was computed. [2022-07-22 11:09:50,168 INFO L899 garLoopResultBuilder]: For program point L387(lines 387 393) no Hoare annotation was computed. [2022-07-22 11:09:50,168 INFO L895 garLoopResultBuilder]: At program point L222(lines 116 594) the Hoare annotation is: (let ((.cse0 (not (<= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse19 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse7 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse12 (not (= 12292 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse18 (<= 8672 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse16 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse1 (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse2 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse5 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse6 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse8 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse9 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse10 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse11 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse13 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse14 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656))) (.cse17 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (.cse15 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse15) (and .cse18 .cse1 .cse19 .cse8 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse19 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse18 .cse1 .cse7 .cse8 .cse17) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse19 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse17 .cse15) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse17 .cse15) (and .cse18 .cse1 .cse8 .cse16 .cse17) (and .cse1 (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse17 .cse15))) [2022-07-22 11:09:50,169 INFO L895 garLoopResultBuilder]: At program point L189(lines 185 571) the Hoare annotation is: (let ((.cse15 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse16 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse17 (not (<= 8656 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse0 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse14 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse5 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse6 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse7 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse8 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse9 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse10 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656))) (.cse11 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (.cse12 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse13 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (or (and (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse14 .cse6 .cse7 (< |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656) .cse8 .cse9 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse15 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse16 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse15 .cse6 .cse7 .cse8 .cse9 .cse12 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse7 .cse8 .cse9 .cse16 .cse12 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse14 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))) [2022-07-22 11:09:50,169 INFO L895 garLoopResultBuilder]: At program point L156(lines 152 582) the Hoare annotation is: (let ((.cse0 (not (<= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse5 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse16 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse1 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse17 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse11 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse12 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse6 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse7 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse8 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse9 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse13 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656))) (.cse14 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (.cse10 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse15 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse1 .cse2 .cse3 .cse4 .cse11 .cse12 .cse6 .cse7 .cse8 .cse9 .cse13 .cse14 .cse10 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse16 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse17 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse1 .cse2 .cse3 .cse4 .cse11 .cse5 .cse12 .cse6 .cse7 .cse8 .cse9 .cse13 .cse14 .cse10 .cse15) (and .cse1 .cse2 .cse3 .cse4 .cse11 .cse12 .cse6 .cse7 .cse8 .cse9 .cse13 .cse16 .cse14 .cse10 .cse15) (and .cse1 .cse2 .cse3 .cse4 .cse17 .cse11 .cse12 .cse6 .cse7 .cse8 .cse9 .cse13 .cse14 .cse10 .cse15))) [2022-07-22 11:09:50,169 INFO L899 garLoopResultBuilder]: For program point L454(lines 454 463) no Hoare annotation was computed. [2022-07-22 11:09:50,169 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-22 11:09:50,169 INFO L899 garLoopResultBuilder]: For program point L620(lines 620 622) no Hoare annotation was computed. [2022-07-22 11:09:50,169 INFO L899 garLoopResultBuilder]: For program point L620-2(lines 620 622) no Hoare annotation was computed. [2022-07-22 11:09:50,169 INFO L899 garLoopResultBuilder]: For program point L191(lines 191 569) no Hoare annotation was computed. [2022-07-22 11:09:50,169 INFO L899 garLoopResultBuilder]: For program point L158(lines 158 580) no Hoare annotation was computed. [2022-07-22 11:09:50,169 INFO L899 garLoopResultBuilder]: For program point L125(lines 125 591) no Hoare annotation was computed. [2022-07-22 11:09:50,170 INFO L899 garLoopResultBuilder]: For program point L93(lines 93 99) no Hoare annotation was computed. [2022-07-22 11:09:50,170 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-22 11:09:50,170 INFO L902 garLoopResultBuilder]: At program point L623(lines 23 627) the Hoare annotation is: true [2022-07-22 11:09:50,170 INFO L899 garLoopResultBuilder]: For program point L458(lines 458 460) no Hoare annotation was computed. [2022-07-22 11:09:50,170 INFO L899 garLoopResultBuilder]: For program point L227(lines 227 229) no Hoare annotation was computed. [2022-07-22 11:09:50,170 INFO L899 garLoopResultBuilder]: For program point L194(lines 194 568) no Hoare annotation was computed. [2022-07-22 11:09:50,170 INFO L899 garLoopResultBuilder]: For program point L161(lines 161 579) no Hoare annotation was computed. [2022-07-22 11:09:50,170 INFO L899 garLoopResultBuilder]: For program point L227-2(lines 227 229) no Hoare annotation was computed. [2022-07-22 11:09:50,170 INFO L899 garLoopResultBuilder]: For program point L128(lines 128 590) no Hoare annotation was computed. [2022-07-22 11:09:50,170 INFO L899 garLoopResultBuilder]: For program point L525(lines 525 531) no Hoare annotation was computed. [2022-07-22 11:09:50,171 INFO L899 garLoopResultBuilder]: For program point L492(lines 492 496) no Hoare annotation was computed. [2022-07-22 11:09:50,171 INFO L899 garLoopResultBuilder]: For program point L492-2(lines 492 496) no Hoare annotation was computed. [2022-07-22 11:09:50,171 INFO L899 garLoopResultBuilder]: For program point L360(lines 360 368) no Hoare annotation was computed. [2022-07-22 11:09:50,171 INFO L895 garLoopResultBuilder]: At program point L195(lines 191 569) the Hoare annotation is: (let ((.cse15 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse16 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse17 (not (<= 8656 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse0 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse14 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse5 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse6 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse7 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse8 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse9 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse10 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656))) (.cse11 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (.cse12 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse13 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (or (and (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse14 .cse6 .cse7 (< |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656) .cse8 .cse9 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse15 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse16 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse15 .cse6 .cse7 .cse8 .cse9 .cse12 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse7 .cse8 .cse9 .cse16 .cse12 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse14 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))) [2022-07-22 11:09:50,171 INFO L895 garLoopResultBuilder]: At program point L162(lines 158 580) the Hoare annotation is: (let ((.cse0 (not (<= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse5 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse16 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse1 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse17 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse11 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse12 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse6 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse7 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse8 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse9 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse13 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656))) (.cse14 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (.cse10 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse15 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse1 .cse2 .cse3 .cse4 .cse11 .cse12 .cse6 .cse7 .cse8 .cse9 .cse13 .cse14 .cse10 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse16 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse17 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse1 .cse2 .cse3 .cse4 .cse11 .cse5 .cse12 .cse6 .cse7 .cse8 .cse9 .cse13 .cse14 .cse10 .cse15) (and .cse1 .cse2 .cse3 .cse4 .cse11 .cse12 .cse6 .cse7 .cse8 .cse9 .cse13 .cse16 .cse14 .cse10 .cse15) (and .cse1 .cse2 .cse3 .cse4 .cse17 .cse11 .cse12 .cse6 .cse7 .cse8 .cse9 .cse13 .cse14 .cse10 .cse15))) [2022-07-22 11:09:50,171 INFO L899 garLoopResultBuilder]: For program point L96(lines 96 98) no Hoare annotation was computed. [2022-07-22 11:09:50,171 INFO L899 garLoopResultBuilder]: For program point L96-2(lines 93 99) no Hoare annotation was computed. [2022-07-22 11:09:50,172 INFO L895 garLoopResultBuilder]: At program point L559(lines 110 614) the Hoare annotation is: (let ((.cse12 (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (let ((.cse11 (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse4 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse0 (not .cse12)) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse5 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse6 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse7 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse8 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) (.cse13 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse10 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (.cse14 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576)) (.cse9 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse15 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) .cse7 .cse9 .cse8) (and .cse4 .cse10) (and (<= 8672 |ULTIMATE.start_ssl3_accept_~s__state~0#1|) .cse11 .cse8) (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 3) (and .cse11 (= 3 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|) .cse12) (and .cse11 .cse10) (and .cse13 .cse14 .cse15) (and .cse4 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse13 .cse6 .cse7 .cse8) (and .cse9 .cse10) (and .cse13 .cse10) (and .cse14 .cse9 .cse15)))) [2022-07-22 11:09:50,172 INFO L895 garLoopResultBuilder]: At program point L361(lines 336 379) the Hoare annotation is: (let ((.cse0 (not (<= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse5 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse16 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse1 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse17 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse11 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse12 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse6 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse7 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse8 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse9 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse13 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656))) (.cse14 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (.cse10 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse15 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse1 .cse2 .cse3 .cse4 .cse11 .cse12 .cse6 .cse7 .cse8 .cse9 .cse13 .cse14 .cse10 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse16 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse17 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse1 .cse2 .cse3 .cse4 .cse11 .cse5 .cse12 .cse6 .cse7 .cse8 .cse9 .cse13 .cse14 .cse10 .cse15) (and .cse1 .cse2 .cse3 .cse4 .cse11 .cse12 .cse6 .cse7 .cse8 .cse9 .cse13 .cse16 .cse14 .cse10 .cse15) (and .cse1 .cse2 .cse3 .cse4 .cse17 .cse11 .cse12 .cse6 .cse7 .cse8 .cse9 .cse13 .cse14 .cse10 .cse15))) [2022-07-22 11:09:50,172 INFO L899 garLoopResultBuilder]: For program point L428(lines 428 430) no Hoare annotation was computed. [2022-07-22 11:09:50,172 INFO L895 garLoopResultBuilder]: At program point L395(lines 386 418) the Hoare annotation is: (let ((.cse12 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse14 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse15 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (.cse16 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) (.cse0 (not (<= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse2 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse5 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse17 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse6 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse7 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse8 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse9 (not (= 12292 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse10 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse11 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656))) (.cse13 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse14 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse15 .cse13 .cse16) (and .cse1 (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse15 .cse13 .cse16) (and .cse1 .cse2 .cse3 .cse4 .cse14 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse15 .cse13 .cse16) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse17 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse15 .cse13 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse17 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13))) [2022-07-22 11:09:50,172 INFO L899 garLoopResultBuilder]: For program point L296(lines 296 298) no Hoare annotation was computed. [2022-07-22 11:09:50,172 INFO L899 garLoopResultBuilder]: For program point L296-2(lines 219 558) no Hoare annotation was computed. [2022-07-22 11:09:50,172 INFO L899 garLoopResultBuilder]: For program point L197(lines 197 567) no Hoare annotation was computed. [2022-07-22 11:09:50,172 INFO L899 garLoopResultBuilder]: For program point L164(lines 164 578) no Hoare annotation was computed. [2022-07-22 11:09:50,172 INFO L899 garLoopResultBuilder]: For program point L131(lines 131 589) no Hoare annotation was computed. [2022-07-22 11:09:50,173 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-22 11:09:50,173 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 630) no Hoare annotation was computed. [2022-07-22 11:09:50,173 INFO L899 garLoopResultBuilder]: For program point L528(lines 528 530) no Hoare annotation was computed. [2022-07-22 11:09:50,173 INFO L899 garLoopResultBuilder]: For program point L528-2(lines 219 558) no Hoare annotation was computed. [2022-07-22 11:09:50,173 INFO L899 garLoopResultBuilder]: For program point L363(lines 363 365) no Hoare annotation was computed. [2022-07-22 11:09:50,173 INFO L899 garLoopResultBuilder]: For program point L330(lines 330 334) no Hoare annotation was computed. [2022-07-22 11:09:50,173 INFO L899 garLoopResultBuilder]: For program point L330-2(lines 219 558) no Hoare annotation was computed. [2022-07-22 11:09:50,173 INFO L895 garLoopResultBuilder]: At program point L132(lines 128 590) the Hoare annotation is: (let ((.cse14 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse16 (< |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) (.cse17 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576)) (.cse10 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse0 (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse15 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse5 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse6 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse7 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse8 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse9 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656))) (.cse11 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (.cse12 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse13 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse14 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse15 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse17 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse16 .cse4 .cse14 .cse5 .cse6 .cse7 .cse8 .cse9 .cse17 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse17 .cse10 .cse12) (and .cse0 (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse15 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13))) [2022-07-22 11:09:50,174 INFO L899 garLoopResultBuilder]: For program point L232(lines 232 234) no Hoare annotation was computed. [2022-07-22 11:09:50,174 INFO L899 garLoopResultBuilder]: For program point L596(lines 596 612) no Hoare annotation was computed. [2022-07-22 11:09:50,174 INFO L899 garLoopResultBuilder]: For program point L398(lines 398 416) no Hoare annotation was computed. [2022-07-22 11:09:50,174 INFO L899 garLoopResultBuilder]: For program point L200(lines 200 566) no Hoare annotation was computed. [2022-07-22 11:09:50,174 INFO L899 garLoopResultBuilder]: For program point L167(lines 167 577) no Hoare annotation was computed. [2022-07-22 11:09:50,174 INFO L899 garLoopResultBuilder]: For program point L134(lines 134 588) no Hoare annotation was computed. [2022-07-22 11:09:50,174 INFO L899 garLoopResultBuilder]: For program point L101(lines 101 105) no Hoare annotation was computed. [2022-07-22 11:09:50,174 INFO L899 garLoopResultBuilder]: For program point L101-1(lines 84 626) no Hoare annotation was computed. [2022-07-22 11:09:50,178 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:09:50,180 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-22 11:09:50,231 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.07 11:09:50 BoogieIcfgContainer [2022-07-22 11:09:50,233 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-22 11:09:50,233 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-22 11:09:50,234 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-22 11:09:50,234 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-22 11:09:50,234 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 11:09:28" (3/4) ... [2022-07-22 11:09:50,236 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-22 11:09:50,252 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2022-07-22 11:09:50,253 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-07-22 11:09:50,253 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-07-22 11:09:50,254 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-22 11:09:50,330 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-22 11:09:50,330 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-22 11:09:50,331 INFO L158 Benchmark]: Toolchain (without parser) took 23444.87ms. Allocated memory was 109.1MB in the beginning and 532.7MB in the end (delta: 423.6MB). Free memory was 77.9MB in the beginning and 323.4MB in the end (delta: -245.5MB). Peak memory consumption was 177.9MB. Max. memory is 16.1GB. [2022-07-22 11:09:50,331 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 109.1MB. Free memory was 63.5MB in the beginning and 63.5MB in the end (delta: 45.8kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 11:09:50,333 INFO L158 Benchmark]: CACSL2BoogieTranslator took 402.93ms. Allocated memory is still 109.1MB. Free memory was 77.7MB in the beginning and 78.8MB in the end (delta: -1.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-22 11:09:50,333 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.14ms. Allocated memory is still 109.1MB. Free memory was 78.8MB in the beginning and 75.7MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-22 11:09:50,337 INFO L158 Benchmark]: Boogie Preprocessor took 44.69ms. Allocated memory is still 109.1MB. Free memory was 75.7MB in the beginning and 73.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-22 11:09:50,337 INFO L158 Benchmark]: RCFGBuilder took 680.34ms. Allocated memory was 109.1MB in the beginning and 140.5MB in the end (delta: 31.5MB). Free memory was 73.6MB in the beginning and 103.8MB in the end (delta: -30.2MB). Peak memory consumption was 27.2MB. Max. memory is 16.1GB. [2022-07-22 11:09:50,337 INFO L158 Benchmark]: TraceAbstraction took 22154.19ms. Allocated memory was 140.5MB in the beginning and 532.7MB in the end (delta: 392.2MB). Free memory was 103.8MB in the beginning and 331.8MB in the end (delta: -228.0MB). Peak memory consumption was 315.4MB. Max. memory is 16.1GB. [2022-07-22 11:09:50,337 INFO L158 Benchmark]: Witness Printer took 96.83ms. Allocated memory is still 532.7MB. Free memory was 331.8MB in the beginning and 323.4MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-22 11:09:50,340 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.16ms. Allocated memory is still 109.1MB. Free memory was 63.5MB in the beginning and 63.5MB in the end (delta: 45.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 402.93ms. Allocated memory is still 109.1MB. Free memory was 77.7MB in the beginning and 78.8MB in the end (delta: -1.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.14ms. Allocated memory is still 109.1MB. Free memory was 78.8MB in the beginning and 75.7MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.69ms. Allocated memory is still 109.1MB. Free memory was 75.7MB in the beginning and 73.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 680.34ms. Allocated memory was 109.1MB in the beginning and 140.5MB in the end (delta: 31.5MB). Free memory was 73.6MB in the beginning and 103.8MB in the end (delta: -30.2MB). Peak memory consumption was 27.2MB. Max. memory is 16.1GB. * TraceAbstraction took 22154.19ms. Allocated memory was 140.5MB in the beginning and 532.7MB in the end (delta: 392.2MB). Free memory was 103.8MB in the beginning and 331.8MB in the end (delta: -228.0MB). Peak memory consumption was 315.4MB. Max. memory is 16.1GB. * Witness Printer took 96.83ms. Allocated memory is still 532.7MB. Free memory was 331.8MB in the beginning and 323.4MB 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: 630]: 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, 144 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 22.0s, OverallIterations: 33, TraceHistogramMax: 26, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 4.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 12.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3928 SdHoareTripleChecker+Valid, 2.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3928 mSDsluCounter, 9832 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3344 mSDsCounter, 941 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3412 IncrementalHoareTripleChecker+Invalid, 4353 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 941 mSolverCounterUnsat, 6488 mSDtfsCounter, 3412 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3835 GetRequests, 3783 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4262occurred in iteration=23, InterpolantAutomatonStates: 106, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 33 MinimizatonAttempts, 2102 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 28 LocationsWithAnnotation, 28 PreInvPairs, 443 NumberOfFragments, 6546 HoareAnnotationTreeSize, 28 FomulaSimplifications, 27679 FormulaSimplificationTreeSizeReduction, 3.6s HoareSimplificationTime, 28 FomulaSimplificationsInter, 66868 FormulaSimplificationTreeSizeReductionInter, 8.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 10746 NumberOfCodeBlocks, 10746 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 12001 ConstructedInterpolants, 0 QuantifiedInterpolants, 16552 SizeOfPredicates, 2 NumberOfNonLiveVariables, 3870 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 40 InterpolantComputations, 31 PerfectInterpolantSequences, 61230/61544 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: 23]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 164]: Loop Invariant Derived loop invariant: ((((((((((((((((((!(8576 <= s__state) && !(8673 == s__state)) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && blastFlag == 0) && !(8560 == s__state)) || (((((((((((((!(8576 <= s__state) && !(8673 == s__state)) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && 2 == blastFlag) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(8560 == s__state))) || ((((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && blastFlag == 0) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || ((((((((((((((!(8673 == s__state) && 3 == blastFlag) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || ((((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && 2 == blastFlag) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || ((((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8657)) && blastFlag == 1) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || (((((((((((((!(8576 <= s__state) && !(8673 == s__state)) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8657)) && blastFlag == 1) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(8560 == s__state)) - InvariantResult [Line: 629]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 134]: Loop Invariant Derived loop invariant: (((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(8560 == s__state)) && s__state <= 8672 - InvariantResult [Line: 215]: Loop Invariant Derived loop invariant: !(s__state == 8672) - InvariantResult [Line: 203]: Loop Invariant Derived loop invariant: (((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(8560 == s__state)) && s__state <= 8672) || (((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && blastFlag == 1) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(8560 == s__state)) && s__state <= 8672)) || (((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && blastFlag == 0) && !(8560 == s__state)) && s__state <= 8672)) || ((((((((((((3 == blastFlag && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672) - InvariantResult [Line: 191]: Loop Invariant Derived loop invariant: (((((((((((((((((((3 == blastFlag && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672) || ((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(8497 == s__state)) && !(8496 == s__state)) && s__state < 8656) && !(8544 == s__state)) && !(s__state == 8480)) && !(8560 == s__state))) || ((((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && blastFlag == 1) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || ((((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && blastFlag == 0) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || ((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && blastFlag == 1) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(8560 == s__state)) && !(8656 <= s__state))) || ((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && blastFlag == 0) && !(8560 == s__state)) && !(8656 <= s__state))) || ((((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672) - InvariantResult [Line: 109]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 137]: Loop Invariant Derived loop invariant: (((((((((((((((!(8576 <= s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && blastFlag == 1) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(8560 == s__state)) || ((((((((((((((3 == blastFlag && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || ((((((((((!(8576 <= s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && blastFlag == 0) && !(8560 == s__state))) || ((((((((((!(8576 <= s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(8560 == s__state))) || ((((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && blastFlag == 1) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || ((((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && blastFlag == 0) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || ((((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672) - InvariantResult [Line: 336]: Loop Invariant Derived loop invariant: (((((((((((((((!(8576 <= s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && blastFlag == 1) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(8560 == s__state)) || ((((((((((((((3 == blastFlag && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || ((((((((((!(8576 <= s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && blastFlag == 0) && !(8560 == s__state))) || ((((((((((!(8576 <= s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(8560 == s__state))) || ((((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && blastFlag == 1) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || ((((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && blastFlag == 0) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || ((((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672) - InvariantResult [Line: 217]: Loop Invariant Derived loop invariant: !(s__state == 8672) - InvariantResult [Line: 110]: Loop Invariant Derived loop invariant: ((((((((((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(s__state == 8480)) && s__state <= 8672) || (((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(8497 == s__state)) && !(8496 == s__state)) && !(s__state == 8480)) && blastFlag == 0) && s__state <= 8672)) || (2 == blastFlag && !(0 == s__hit))) || ((8672 <= s__state && 3 == blastFlag) && s__state <= 8672)) || s__state <= 3) || ((3 == blastFlag && 3 == s__s3__tmp__next_state___0) && 8448 == s__state)) || (3 == blastFlag && !(0 == s__hit))) || ((blastFlag == 1 && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576)) || ((2 == blastFlag && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576)) || ((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && blastFlag == 1) && !(8497 == s__state)) && !(s__state == 8480)) && s__state <= 8672)) || (blastFlag == 0 && !(0 == s__hit))) || (blastFlag == 1 && !(0 == s__hit))) || ((s__s3__tmp__next_state___0 <= 8576 && blastFlag == 0) && s__state <= 8576) - InvariantResult [Line: 110]: Loop Invariant Derived loop invariant: ((((((((((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(s__state == 8480)) && s__state <= 8672) || (((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(8497 == s__state)) && !(8496 == s__state)) && !(s__state == 8480)) && blastFlag == 0) && s__state <= 8672)) || (2 == blastFlag && !(0 == s__hit))) || ((8672 <= s__state && 3 == blastFlag) && s__state <= 8672)) || s__state <= 3) || ((3 == blastFlag && 3 == s__s3__tmp__next_state___0) && 8448 == s__state)) || (3 == blastFlag && !(0 == s__hit))) || ((blastFlag == 1 && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576)) || ((2 == blastFlag && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576)) || ((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && blastFlag == 1) && !(8497 == s__state)) && !(s__state == 8480)) && s__state <= 8672)) || (blastFlag == 0 && !(0 == s__hit))) || (blastFlag == 1 && !(0 == s__hit))) || ((s__s3__tmp__next_state___0 <= 8576 && blastFlag == 0) && s__state <= 8576) - InvariantResult [Line: 633]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 398]: Loop Invariant Derived loop invariant: ((((((((((((((((((!(8576 <= s__state) && !(8673 == s__state)) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && blastFlag == 0) && !(8560 == s__state)) || (((((((((((((!(8576 <= s__state) && !(8673 == s__state)) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && 2 == blastFlag) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(8560 == s__state))) || ((((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && blastFlag == 0) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || ((((((((((((((!(8673 == s__state) && 3 == blastFlag) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || ((((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && 2 == blastFlag) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || ((((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8657)) && blastFlag == 1) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || (((((((((((((!(8576 <= s__state) && !(8673 == s__state)) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8657)) && blastFlag == 1) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(8560 == s__state)) - InvariantResult [Line: 386]: Loop Invariant Derived loop invariant: ((((((((((((((((((!(8576 <= s__state) && !(8673 == s__state)) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && blastFlag == 0) && !(8560 == s__state)) || (((((((((((((!(8576 <= s__state) && !(8673 == s__state)) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && 2 == blastFlag) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(8560 == s__state))) || ((((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && blastFlag == 0) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || ((((((((((((((!(8673 == s__state) && 3 == blastFlag) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || ((((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && 2 == blastFlag) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || ((((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8657)) && blastFlag == 1) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || (((((((((((((!(8576 <= s__state) && !(8673 == s__state)) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8657)) && blastFlag == 1) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(8560 == s__state)) - InvariantResult [Line: 116]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((!(8576 <= s__state) && !(8673 == s__state)) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && blastFlag == 1) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(8560 == s__state)) || (((((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && blastFlag == 0) && !(0 == s__hit)) && !(8560 == s__state))) || ((((8672 <= s__state && !(8673 == s__state)) && 2 == blastFlag) && !(s__state == 8672)) && !(0 == s__hit))) || (((((((((((((((!(8576 <= s__state) && !(8673 == s__state)) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && blastFlag == 0) && !(8560 == s__state))) || (((((((((((((((!(8576 <= s__state) && !(8673 == s__state)) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(8560 == s__state))) || ((((8672 <= s__state && !(8673 == s__state)) && blastFlag == 1) && !(s__state == 8672)) && !(0 == s__hit))) || (((((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state))) || (((((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && blastFlag == 1) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state))) || ((((8672 <= s__state && !(8673 == s__state)) && !(s__state == 8672)) && blastFlag == 0) && !(0 == s__hit))) || ((((((((((((((!(8673 == s__state) && 3 == blastFlag) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) - InvariantResult [Line: 113]: Loop Invariant Derived loop invariant: ((((((8672 <= s__state && !(8673 == s__state)) && 3 == blastFlag) && !(s__state == 8672)) && !(0 == s__hit)) || ((((8672 <= s__state && !(8673 == s__state)) && 2 == blastFlag) && !(s__state == 8672)) && !(0 == s__hit))) || ((((8672 <= s__state && !(8673 == s__state)) && blastFlag == 1) && !(s__state == 8672)) && !(0 == s__hit))) || ((((8672 <= s__state && !(8673 == s__state)) && !(s__state == 8672)) && blastFlag == 0) && !(0 == s__hit)) - InvariantResult [Line: 176]: Loop Invariant Derived loop invariant: ((((((((blastFlag == 1 && 8448 == s__state) && !(0 == s__hit)) || ((8448 == s__state && s__s3__tmp__next_state___0 <= 8576) && blastFlag == 0)) || ((8448 == s__state && blastFlag == 0) && !(0 == s__hit))) || ((2 == blastFlag && 8448 == s__state) && !(0 == s__hit))) || ((3 == blastFlag && 8448 == s__state) && !(0 == s__hit))) || ((3 == blastFlag && 3 == s__s3__tmp__next_state___0) && 8448 == s__state)) || ((blastFlag == 1 && 8448 == s__state) && s__s3__tmp__next_state___0 <= 8576)) || ((2 == blastFlag && 8448 == s__state) && s__s3__tmp__next_state___0 <= 8576) - InvariantResult [Line: 185]: Loop Invariant Derived loop invariant: (((((((((((((((((((3 == blastFlag && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672) || ((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(8497 == s__state)) && !(8496 == s__state)) && s__state < 8656) && !(8544 == s__state)) && !(s__state == 8480)) && !(8560 == s__state))) || ((((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && blastFlag == 1) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || ((((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && blastFlag == 0) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || ((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && blastFlag == 1) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(8560 == s__state)) && !(8656 <= s__state))) || ((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && blastFlag == 0) && !(8560 == s__state)) && !(8656 <= s__state))) || ((((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672) - InvariantResult [Line: 209]: Loop Invariant Derived loop invariant: ((((8672 <= s__state && blastFlag == 1) && !(12292 == s__state)) || ((8672 <= s__state && !(12292 == s__state)) && blastFlag == 0)) || ((8672 <= s__state && 3 == blastFlag) && !(12292 == s__state))) || (((8672 <= s__state && 2 == blastFlag) && !(12292 == s__state)) && !(0 == s__hit)) - InvariantResult [Line: 128]: Loop Invariant Derived loop invariant: ((((((((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8656)) && blastFlag == 0) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672) || (((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8657)) && blastFlag == 1) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || (((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && 2 == blastFlag) && s__state < 8576) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8656)) && s__s3__tmp__next_state___0 <= 8576) && !(8560 == s__state))) || (((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && s__state < 8576) && !(s__state == 8657)) && blastFlag == 1) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8656)) && s__s3__tmp__next_state___0 <= 8576) && !(8560 == s__state))) || (((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && s__state < 8576) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8656)) && s__s3__tmp__next_state___0 <= 8576) && blastFlag == 0) && !(8560 == s__state))) || (((((((((((((!(8673 == s__state) && 3 == blastFlag) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || (((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && 2 == blastFlag) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672) - InvariantResult [Line: 152]: Loop Invariant Derived loop invariant: (((((((((((((((!(8576 <= s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && blastFlag == 1) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(8560 == s__state)) || ((((((((((((((3 == blastFlag && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || ((((((((((!(8576 <= s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && blastFlag == 0) && !(8560 == s__state))) || ((((((((((!(8576 <= s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(8560 == s__state))) || ((((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && blastFlag == 1) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || ((((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && blastFlag == 0) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || ((((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672) - InvariantResult [Line: 170]: Loop Invariant Derived loop invariant: ((((((((((((((((((!(8576 <= s__state) && !(8673 == s__state)) && !(8448 == s__state)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && blastFlag == 1) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) || ((((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && blastFlag == 0) && !(0 == s__hit)) && s__state <= 8672)) || ((((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && s__state <= 8672)) || (((((((((((((!(8576 <= s__state) && !(8673 == s__state)) && !(8448 == s__state)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && blastFlag == 0)) || ((((((((((((((!(8673 == s__state) && 3 == blastFlag) && !(8448 == s__state)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && s__state <= 8672)) || ((((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && blastFlag == 1) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && s__state <= 8672)) || (((((((((((((!(8576 <= s__state) && !(8673 == s__state)) && !(8448 == s__state)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) - InvariantResult [Line: 179]: Loop Invariant Derived loop invariant: (((((((((((((((((((3 == blastFlag && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672) || ((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(8497 == s__state)) && !(8496 == s__state)) && s__state < 8656) && !(8544 == s__state)) && !(s__state == 8480)) && !(8560 == s__state))) || ((((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && blastFlag == 1) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || ((((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && blastFlag == 0) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || ((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && blastFlag == 1) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(8560 == s__state)) && !(8656 <= s__state))) || ((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && blastFlag == 0) && !(8560 == s__state)) && !(8656 <= s__state))) || ((((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672) - InvariantResult [Line: 146]: Loop Invariant Derived loop invariant: (((((((((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8544 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && blastFlag == 0) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672) || ((((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(s__state == 8657)) && !(s__state == 8672)) && !(8544 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || ((((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && blastFlag == 1) && !(s__state == 8672)) && !(8544 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || (((((((((((((!(8576 <= s__state) && !(8673 == s__state)) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && blastFlag == 1) && !(s__state == 8672)) && !(8544 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(8560 == s__state))) || (((((((((((((!(8576 <= s__state) && !(8673 == s__state)) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(s__state == 8657)) && !(s__state == 8672)) && !(8544 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(8560 == s__state))) || ((((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && s__state < 8576) && !(s__state == 8657)) && !(s__state == 8672)) && !(8544 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && s__s3__tmp__next_state___0 <= 8576) && blastFlag == 0) && !(8560 == s__state))) || ((((((((((((((!(8673 == s__state) && 3 == blastFlag) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8544 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672) - InvariantResult [Line: 197]: Loop Invariant Derived loop invariant: ((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(8497 == s__state)) && !(8496 == s__state)) && s__state < 8656) && !(8544 == s__state)) && !(s__state == 8480)) && !(8560 == s__state)) || ((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && blastFlag == 1) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(8560 == s__state)) && !(8656 <= s__state))) || ((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && blastFlag == 0) && !(8560 == s__state)) && !(8656 <= s__state))) || (((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672) - InvariantResult [Line: 158]: Loop Invariant Derived loop invariant: (((((((((((((((!(8576 <= s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && blastFlag == 1) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(8560 == s__state)) || ((((((((((((((3 == blastFlag && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || ((((((((((!(8576 <= s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && blastFlag == 0) && !(8560 == s__state))) || ((((((((((!(8576 <= s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(8560 == s__state))) || ((((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && blastFlag == 1) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || ((((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && blastFlag == 0) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || ((((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672) RESULT: Ultimate proved your program to be correct! [2022-07-22 11:09:50,395 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