./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/openssl-simplified/s3_srvr_4.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c 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_4.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f559dc59bc463f9a27da280f1f7098996cb99e14cb280bd541f8697a124cb729 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-11 23:46:19,194 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-11 23:46:19,196 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-11 23:46:19,234 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-11 23:46:19,235 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-11 23:46:19,236 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-11 23:46:19,237 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-11 23:46:19,238 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-11 23:46:19,240 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-11 23:46:19,241 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-11 23:46:19,241 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-11 23:46:19,242 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-11 23:46:19,243 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-11 23:46:19,244 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-11 23:46:19,245 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-11 23:46:19,256 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-11 23:46:19,257 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-11 23:46:19,260 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-11 23:46:19,262 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-11 23:46:19,268 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-11 23:46:19,272 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-11 23:46:19,273 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-11 23:46:19,274 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-11 23:46:19,275 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-11 23:46:19,279 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-11 23:46:19,281 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-11 23:46:19,283 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-11 23:46:19,283 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-11 23:46:19,284 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-11 23:46:19,284 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-11 23:46:19,285 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-11 23:46:19,285 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-11 23:46:19,287 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-11 23:46:19,287 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-11 23:46:19,288 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-11 23:46:19,288 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-11 23:46:19,288 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-11 23:46:19,289 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-11 23:46:19,289 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-11 23:46:19,289 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-11 23:46:19,289 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-11 23:46:19,290 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-11 23:46:19,291 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-11 23:46:19,323 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-11 23:46:19,323 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-11 23:46:19,323 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-11 23:46:19,324 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-11 23:46:19,324 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-11 23:46:19,324 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-11 23:46:19,325 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-11 23:46:19,325 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-11 23:46:19,325 INFO L138 SettingsManager]: * Use SBE=true [2022-07-11 23:46:19,326 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-11 23:46:19,326 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-11 23:46:19,327 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-11 23:46:19,327 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-11 23:46:19,327 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-11 23:46:19,327 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-11 23:46:19,327 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-11 23:46:19,327 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-11 23:46:19,328 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-11 23:46:19,328 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-11 23:46:19,328 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-11 23:46:19,328 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-11 23:46:19,328 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-11 23:46:19,328 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-11 23:46:19,329 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-11 23:46:19,329 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-11 23:46:19,329 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-11 23:46:19,329 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-11 23:46:19,329 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-11 23:46:19,330 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-11 23:46:19,330 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-11 23:46:19,330 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-11 23:46:19,330 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-11 23:46:19,330 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-11 23:46:19,331 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 -> f559dc59bc463f9a27da280f1f7098996cb99e14cb280bd541f8697a124cb729 [2022-07-11 23:46:19,543 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-11 23:46:19,574 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-11 23:46:19,576 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-11 23:46:19,577 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-11 23:46:19,577 INFO L275 PluginConnector]: CDTParser initialized [2022-07-11 23:46:19,578 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/openssl-simplified/s3_srvr_4.cil.c [2022-07-11 23:46:19,631 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8fe2fd70/bbf537b9d8d84172b3effbb7915a70bb/FLAG46212bd44 [2022-07-11 23:46:20,045 INFO L306 CDTParser]: Found 1 translation units. [2022-07-11 23:46:20,046 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl-simplified/s3_srvr_4.cil.c [2022-07-11 23:46:20,054 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8fe2fd70/bbf537b9d8d84172b3effbb7915a70bb/FLAG46212bd44 [2022-07-11 23:46:20,074 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8fe2fd70/bbf537b9d8d84172b3effbb7915a70bb [2022-07-11 23:46:20,077 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-11 23:46:20,078 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-11 23:46:20,079 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-11 23:46:20,079 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-11 23:46:20,081 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-11 23:46:20,082 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 11:46:20" (1/1) ... [2022-07-11 23:46:20,083 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@513e066b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:46:20, skipping insertion in model container [2022-07-11 23:46:20,083 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 11:46:20" (1/1) ... [2022-07-11 23:46:20,089 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-11 23:46:20,140 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-11 23:46:20,348 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_4.cil.c[42875,42888] [2022-07-11 23:46:20,354 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-11 23:46:20,363 INFO L203 MainTranslator]: Completed pre-run [2022-07-11 23:46:20,421 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_4.cil.c[42875,42888] [2022-07-11 23:46:20,440 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-11 23:46:20,451 INFO L208 MainTranslator]: Completed translation [2022-07-11 23:46:20,451 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:46:20 WrapperNode [2022-07-11 23:46:20,452 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-11 23:46:20,453 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-11 23:46:20,453 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-11 23:46:20,453 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-11 23:46:20,461 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:46:20" (1/1) ... [2022-07-11 23:46:20,477 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:46:20" (1/1) ... [2022-07-11 23:46:20,511 INFO L137 Inliner]: procedures = 15, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 546 [2022-07-11 23:46:20,512 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-11 23:46:20,513 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-11 23:46:20,513 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-11 23:46:20,513 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-11 23:46:20,518 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:46:20" (1/1) ... [2022-07-11 23:46:20,518 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:46:20" (1/1) ... [2022-07-11 23:46:20,521 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:46:20" (1/1) ... [2022-07-11 23:46:20,522 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:46:20" (1/1) ... [2022-07-11 23:46:20,528 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:46:20" (1/1) ... [2022-07-11 23:46:20,534 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:46:20" (1/1) ... [2022-07-11 23:46:20,536 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:46:20" (1/1) ... [2022-07-11 23:46:20,539 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-11 23:46:20,540 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-11 23:46:20,540 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-11 23:46:20,540 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-11 23:46:20,544 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:46:20" (1/1) ... [2022-07-11 23:46:20,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-11 23:46:20,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:46:20,576 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-11 23:46:20,578 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-11 23:46:20,610 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-11 23:46:20,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-11 23:46:20,610 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-11 23:46:20,611 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-11 23:46:20,708 INFO L234 CfgBuilder]: Building ICFG [2022-07-11 23:46:20,709 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-11 23:46:20,733 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-11 23:46:21,101 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2022-07-11 23:46:21,101 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2022-07-11 23:46:21,101 INFO L275 CfgBuilder]: Performing block encoding [2022-07-11 23:46:21,108 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-11 23:46:21,109 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-11 23:46:21,111 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 11:46:21 BoogieIcfgContainer [2022-07-11 23:46:21,111 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-11 23:46:21,112 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-11 23:46:21,113 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-11 23:46:21,116 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-11 23:46:21,116 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.07 11:46:20" (1/3) ... [2022-07-11 23:46:21,117 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cbe1b2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 11:46:21, skipping insertion in model container [2022-07-11 23:46:21,117 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:46:20" (2/3) ... [2022-07-11 23:46:21,117 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cbe1b2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 11:46:21, skipping insertion in model container [2022-07-11 23:46:21,117 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 11:46:21" (3/3) ... [2022-07-11 23:46:21,118 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr_4.cil.c [2022-07-11 23:46:21,131 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-11 23:46:21,131 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-11 23:46:21,185 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-11 23:46:21,193 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@10989e1b, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@79de61c1 [2022-07-11 23:46:21,194 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-11 23:46:21,199 INFO L276 IsEmpty]: Start isEmpty. Operand has 141 states, 139 states have (on average 1.7266187050359711) internal successors, (240), 140 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:46:21,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-11 23:46:21,211 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:46:21,211 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] [2022-07-11 23:46:21,212 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:46:21,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:46:21,218 INFO L85 PathProgramCache]: Analyzing trace with hash 1632005994, now seen corresponding path program 1 times [2022-07-11 23:46:21,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:46:21,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338884255] [2022-07-11 23:46:21,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:46:21,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:46:21,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:46:21,497 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-11 23:46:21,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:46:21,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338884255] [2022-07-11 23:46:21,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338884255] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:46:21,499 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:46:21,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:46:21,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375734533] [2022-07-11 23:46:21,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:46:21,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:46:21,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:46:21,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:46:21,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:46:21,541 INFO L87 Difference]: Start difference. First operand has 141 states, 139 states have (on average 1.7266187050359711) internal successors, (240), 140 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:46:21,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:46:21,769 INFO L93 Difference]: Finished difference Result 328 states and 564 transitions. [2022-07-11 23:46:21,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:46:21,772 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2022-07-11 23:46:21,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:46:21,780 INFO L225 Difference]: With dead ends: 328 [2022-07-11 23:46:21,781 INFO L226 Difference]: Without dead ends: 175 [2022-07-11 23:46:21,784 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-11 23:46:21,787 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 170 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 190 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.2s IncrementalHoareTripleChecker+Time [2022-07-11 23:46:21,788 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 190 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-11 23:46:21,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2022-07-11 23:46:21,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 170. [2022-07-11 23:46:21,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 169 states have (on average 1.6272189349112427) internal successors, (275), 169 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:46:21,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 275 transitions. [2022-07-11 23:46:21,827 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 275 transitions. Word has length 44 [2022-07-11 23:46:21,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:46:21,828 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 275 transitions. [2022-07-11 23:46:21,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:46:21,829 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 275 transitions. [2022-07-11 23:46:21,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-11 23:46:21,830 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:46:21,830 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-11 23:46:21,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-11 23:46:21,831 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:46:21,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:46:21,832 INFO L85 PathProgramCache]: Analyzing trace with hash -954576436, now seen corresponding path program 1 times [2022-07-11 23:46:21,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:46:21,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951938168] [2022-07-11 23:46:21,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:46:21,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:46:21,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:46:21,893 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-11 23:46:21,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:46:21,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951938168] [2022-07-11 23:46:21,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951938168] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:46:21,894 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:46:21,894 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:46:21,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258475932] [2022-07-11 23:46:21,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:46:21,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:46:21,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:46:21,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:46:21,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:46:21,908 INFO L87 Difference]: Start difference. First operand 170 states and 275 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:46:22,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:46:22,092 INFO L93 Difference]: Finished difference Result 380 states and 624 transitions. [2022-07-11 23:46:22,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:46:22,092 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-11 23:46:22,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:46:22,098 INFO L225 Difference]: With dead ends: 380 [2022-07-11 23:46:22,098 INFO L226 Difference]: Without dead ends: 216 [2022-07-11 23:46:22,105 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-11 23:46:22,107 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 129 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 142 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.2s IncrementalHoareTripleChecker+Time [2022-07-11 23:46:22,108 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 142 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-11 23:46:22,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2022-07-11 23:46:22,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 211. [2022-07-11 23:46:22,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 210 states have (on average 1.6761904761904762) internal successors, (352), 210 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:46:22,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 352 transitions. [2022-07-11 23:46:22,124 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 352 transitions. Word has length 45 [2022-07-11 23:46:22,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:46:22,124 INFO L495 AbstractCegarLoop]: Abstraction has 211 states and 352 transitions. [2022-07-11 23:46:22,125 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-11 23:46:22,125 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 352 transitions. [2022-07-11 23:46:22,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-07-11 23:46:22,127 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:46:22,128 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] [2022-07-11 23:46:22,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-11 23:46:22,128 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:46:22,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:46:22,129 INFO L85 PathProgramCache]: Analyzing trace with hash -1754997851, now seen corresponding path program 1 times [2022-07-11 23:46:22,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:46:22,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743273221] [2022-07-11 23:46:22,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:46:22,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:46:22,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:46:22,177 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-11 23:46:22,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:46:22,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743273221] [2022-07-11 23:46:22,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743273221] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:46:22,178 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:46:22,179 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:46:22,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832300835] [2022-07-11 23:46:22,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:46:22,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:46:22,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:46:22,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:46:22,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:46:22,181 INFO L87 Difference]: Start difference. First operand 211 states and 352 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-11 23:46:22,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:46:22,319 INFO L93 Difference]: Finished difference Result 445 states and 750 transitions. [2022-07-11 23:46:22,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:46:22,320 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 72 [2022-07-11 23:46:22,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:46:22,321 INFO L225 Difference]: With dead ends: 445 [2022-07-11 23:46:22,321 INFO L226 Difference]: Without dead ends: 242 [2022-07-11 23:46:22,322 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-11 23:46:22,323 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 136 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 155 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-11 23:46:22,324 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 155 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:46:22,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2022-07-11 23:46:22,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2022-07-11 23:46:22,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 241 states have (on average 1.6929460580912863) internal successors, (408), 241 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:46:22,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 408 transitions. [2022-07-11 23:46:22,335 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 408 transitions. Word has length 72 [2022-07-11 23:46:22,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:46:22,335 INFO L495 AbstractCegarLoop]: Abstraction has 242 states and 408 transitions. [2022-07-11 23:46:22,335 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-11 23:46:22,336 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 408 transitions. [2022-07-11 23:46:22,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-07-11 23:46:22,338 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:46:22,338 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] [2022-07-11 23:46:22,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-11 23:46:22,338 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:46:22,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:46:22,339 INFO L85 PathProgramCache]: Analyzing trace with hash -479038981, now seen corresponding path program 1 times [2022-07-11 23:46:22,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:46:22,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23420870] [2022-07-11 23:46:22,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:46:22,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:46:22,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:46:22,411 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-11 23:46:22,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:46:22,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23420870] [2022-07-11 23:46:22,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23420870] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:46:22,412 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:46:22,412 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:46:22,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543198078] [2022-07-11 23:46:22,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:46:22,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:46:22,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:46:22,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:46:22,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:46:22,415 INFO L87 Difference]: Start difference. First operand 242 states and 408 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:46:22,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:46:22,526 INFO L93 Difference]: Finished difference Result 493 states and 832 transitions. [2022-07-11 23:46:22,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:46:22,526 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2022-07-11 23:46:22,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:46:22,528 INFO L225 Difference]: With dead ends: 493 [2022-07-11 23:46:22,528 INFO L226 Difference]: Without dead ends: 259 [2022-07-11 23:46:22,529 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-11 23:46:22,530 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 158 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 150 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-11 23:46:22,530 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 150 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:46:22,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2022-07-11 23:46:22,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 257. [2022-07-11 23:46:22,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 256 states have (on average 1.68359375) internal successors, (431), 256 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:46:22,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 431 transitions. [2022-07-11 23:46:22,539 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 431 transitions. Word has length 84 [2022-07-11 23:46:22,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:46:22,540 INFO L495 AbstractCegarLoop]: Abstraction has 257 states and 431 transitions. [2022-07-11 23:46:22,540 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:46:22,540 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 431 transitions. [2022-07-11 23:46:22,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-07-11 23:46:22,541 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:46:22,541 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] [2022-07-11 23:46:22,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-11 23:46:22,542 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:46:22,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:46:22,543 INFO L85 PathProgramCache]: Analyzing trace with hash 1816808322, now seen corresponding path program 1 times [2022-07-11 23:46:22,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:46:22,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854718654] [2022-07-11 23:46:22,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:46:22,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:46:22,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:46:22,587 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-11 23:46:22,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:46:22,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854718654] [2022-07-11 23:46:22,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854718654] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:46:22,589 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:46:22,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:46:22,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201090693] [2022-07-11 23:46:22,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:46:22,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:46:22,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:46:22,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:46:22,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:46:22,592 INFO L87 Difference]: Start difference. First operand 257 states and 431 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:46:22,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:46:22,732 INFO L93 Difference]: Finished difference Result 553 states and 933 transitions. [2022-07-11 23:46:22,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:46:22,732 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 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 84 [2022-07-11 23:46:22,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:46:22,734 INFO L225 Difference]: With dead ends: 553 [2022-07-11 23:46:22,734 INFO L226 Difference]: Without dead ends: 304 [2022-07-11 23:46:22,735 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:46:22,736 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 133 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 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-11 23:46:22,736 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 147 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:46:22,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2022-07-11 23:46:22,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 299. [2022-07-11 23:46:22,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 298 states have (on average 1.6946308724832215) internal successors, (505), 298 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-11 23:46:22,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 505 transitions. [2022-07-11 23:46:22,754 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 505 transitions. Word has length 84 [2022-07-11 23:46:22,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:46:22,754 INFO L495 AbstractCegarLoop]: Abstraction has 299 states and 505 transitions. [2022-07-11 23:46:22,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:46:22,755 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 505 transitions. [2022-07-11 23:46:22,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-07-11 23:46:22,756 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:46:22,756 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] [2022-07-11 23:46:22,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-11 23:46:22,756 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:46:22,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:46:22,757 INFO L85 PathProgramCache]: Analyzing trace with hash -1697148062, now seen corresponding path program 1 times [2022-07-11 23:46:22,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:46:22,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756926729] [2022-07-11 23:46:22,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:46:22,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:46:22,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:46:22,789 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-11 23:46:22,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:46:22,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756926729] [2022-07-11 23:46:22,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756926729] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:46:22,790 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:46:22,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:46:22,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176553843] [2022-07-11 23:46:22,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:46:22,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:46:22,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:46:22,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:46:22,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:46:22,791 INFO L87 Difference]: Start difference. First operand 299 states and 505 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:46:22,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:46:22,888 INFO L93 Difference]: Finished difference Result 592 states and 1000 transitions. [2022-07-11 23:46:22,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:46:22,889 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2022-07-11 23:46:22,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:46:22,891 INFO L225 Difference]: With dead ends: 592 [2022-07-11 23:46:22,891 INFO L226 Difference]: Without dead ends: 301 [2022-07-11 23:46:22,892 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-11 23:46:22,892 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 157 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 138 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-11 23:46:22,893 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 138 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:46:22,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2022-07-11 23:46:22,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 299. [2022-07-11 23:46:22,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 298 states have (on average 1.6812080536912752) internal successors, (501), 298 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:46:22,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 501 transitions. [2022-07-11 23:46:22,901 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 501 transitions. Word has length 85 [2022-07-11 23:46:22,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:46:22,902 INFO L495 AbstractCegarLoop]: Abstraction has 299 states and 501 transitions. [2022-07-11 23:46:22,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:46:22,902 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 501 transitions. [2022-07-11 23:46:22,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-07-11 23:46:22,903 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:46:22,903 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] [2022-07-11 23:46:22,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-11 23:46:22,904 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:46:22,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:46:22,904 INFO L85 PathProgramCache]: Analyzing trace with hash -1432172412, now seen corresponding path program 1 times [2022-07-11 23:46:22,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:46:22,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000347793] [2022-07-11 23:46:22,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:46:22,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:46:22,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:46:22,938 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-11 23:46:22,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:46:22,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000347793] [2022-07-11 23:46:22,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000347793] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:46:22,939 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:46:22,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:46:22,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869991245] [2022-07-11 23:46:22,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:46:22,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:46:22,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:46:22,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:46:22,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:46:22,941 INFO L87 Difference]: Start difference. First operand 299 states and 501 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-11 23:46:23,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:46:23,081 INFO L93 Difference]: Finished difference Result 595 states and 997 transitions. [2022-07-11 23:46:23,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:46:23,082 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-11 23:46:23,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:46:23,083 INFO L225 Difference]: With dead ends: 595 [2022-07-11 23:46:23,084 INFO L226 Difference]: Without dead ends: 302 [2022-07-11 23:46:23,084 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-11 23:46:23,085 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 130 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:46:23,085 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 145 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:46:23,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2022-07-11 23:46:23,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 297. [2022-07-11 23:46:23,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 296 states have (on average 1.6756756756756757) internal successors, (496), 296 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:46:23,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 496 transitions. [2022-07-11 23:46:23,094 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 496 transitions. Word has length 85 [2022-07-11 23:46:23,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:46:23,094 INFO L495 AbstractCegarLoop]: Abstraction has 297 states and 496 transitions. [2022-07-11 23:46:23,094 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-11 23:46:23,094 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 496 transitions. [2022-07-11 23:46:23,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-07-11 23:46:23,095 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:46:23,096 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] [2022-07-11 23:46:23,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-11 23:46:23,096 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:46:23,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:46:23,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1085183485, now seen corresponding path program 1 times [2022-07-11 23:46:23,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:46:23,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073755698] [2022-07-11 23:46:23,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:46:23,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:46:23,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:46:23,124 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-11 23:46:23,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:46:23,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073755698] [2022-07-11 23:46:23,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073755698] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:46:23,125 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:46:23,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:46:23,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079913955] [2022-07-11 23:46:23,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:46:23,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:46:23,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:46:23,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:46:23,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:46:23,137 INFO L87 Difference]: Start difference. First operand 297 states and 496 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:46:23,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:46:23,211 INFO L93 Difference]: Finished difference Result 595 states and 992 transitions. [2022-07-11 23:46:23,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:46:23,212 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2022-07-11 23:46:23,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:46:23,213 INFO L225 Difference]: With dead ends: 595 [2022-07-11 23:46:23,213 INFO L226 Difference]: Without dead ends: 306 [2022-07-11 23:46:23,214 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-11 23:46:23,215 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 162 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 149 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-11 23:46:23,215 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 149 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:46:23,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2022-07-11 23:46:23,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 306. [2022-07-11 23:46:23,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 305 states have (on average 1.6459016393442623) internal successors, (502), 305 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:46:23,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 502 transitions. [2022-07-11 23:46:23,223 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 502 transitions. Word has length 97 [2022-07-11 23:46:23,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:46:23,224 INFO L495 AbstractCegarLoop]: Abstraction has 306 states and 502 transitions. [2022-07-11 23:46:23,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:46:23,224 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 502 transitions. [2022-07-11 23:46:23,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-07-11 23:46:23,225 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:46:23,226 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] [2022-07-11 23:46:23,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-11 23:46:23,226 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:46:23,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:46:23,227 INFO L85 PathProgramCache]: Analyzing trace with hash -860132162, now seen corresponding path program 1 times [2022-07-11 23:46:23,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:46:23,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262053379] [2022-07-11 23:46:23,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:46:23,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:46:23,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:46:23,255 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-11 23:46:23,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:46:23,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262053379] [2022-07-11 23:46:23,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262053379] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:46:23,256 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:46:23,256 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:46:23,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035725519] [2022-07-11 23:46:23,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:46:23,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:46:23,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:46:23,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:46:23,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:46:23,258 INFO L87 Difference]: Start difference. First operand 306 states and 502 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-11 23:46:23,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:46:23,358 INFO L93 Difference]: Finished difference Result 635 states and 1045 transitions. [2022-07-11 23:46:23,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:46:23,359 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 98 [2022-07-11 23:46:23,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:46:23,360 INFO L225 Difference]: With dead ends: 635 [2022-07-11 23:46:23,360 INFO L226 Difference]: Without dead ends: 337 [2022-07-11 23:46:23,361 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-11 23:46:23,362 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 141 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 141 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-11 23:46:23,362 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 141 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:46:23,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2022-07-11 23:46:23,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 335. [2022-07-11 23:46:23,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 334 states have (on average 1.6437125748502994) internal successors, (549), 334 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:46:23,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 549 transitions. [2022-07-11 23:46:23,371 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 549 transitions. Word has length 98 [2022-07-11 23:46:23,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:46:23,371 INFO L495 AbstractCegarLoop]: Abstraction has 335 states and 549 transitions. [2022-07-11 23:46:23,372 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-11 23:46:23,372 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 549 transitions. [2022-07-11 23:46:23,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-07-11 23:46:23,373 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:46:23,373 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] [2022-07-11 23:46:23,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-11 23:46:23,373 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:46:23,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:46:23,374 INFO L85 PathProgramCache]: Analyzing trace with hash 1120928325, now seen corresponding path program 1 times [2022-07-11 23:46:23,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:46:23,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396171253] [2022-07-11 23:46:23,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:46:23,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:46:23,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:46:23,401 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-11 23:46:23,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:46:23,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396171253] [2022-07-11 23:46:23,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396171253] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:46:23,402 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:46:23,402 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:46:23,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614292510] [2022-07-11 23:46:23,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:46:23,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:46:23,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:46:23,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:46:23,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:46:23,403 INFO L87 Difference]: Start difference. First operand 335 states and 549 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-11 23:46:23,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:46:23,508 INFO L93 Difference]: Finished difference Result 664 states and 1088 transitions. [2022-07-11 23:46:23,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:46:23,508 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 99 [2022-07-11 23:46:23,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:46:23,510 INFO L225 Difference]: With dead ends: 664 [2022-07-11 23:46:23,510 INFO L226 Difference]: Without dead ends: 337 [2022-07-11 23:46:23,510 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-11 23:46:23,511 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 140 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 141 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-11 23:46:23,512 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 141 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:46:23,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2022-07-11 23:46:23,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 335. [2022-07-11 23:46:23,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 334 states have (on average 1.6317365269461077) internal successors, (545), 334 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:46:23,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 545 transitions. [2022-07-11 23:46:23,522 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 545 transitions. Word has length 99 [2022-07-11 23:46:23,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:46:23,523 INFO L495 AbstractCegarLoop]: Abstraction has 335 states and 545 transitions. [2022-07-11 23:46:23,523 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-11 23:46:23,523 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 545 transitions. [2022-07-11 23:46:23,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-07-11 23:46:23,524 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:46:23,525 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] [2022-07-11 23:46:23,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-11 23:46:23,525 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:46:23,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:46:23,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1084775058, now seen corresponding path program 1 times [2022-07-11 23:46:23,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:46:23,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846063163] [2022-07-11 23:46:23,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:46:23,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:46:23,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:46:23,581 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-11 23:46:23,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:46:23,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846063163] [2022-07-11 23:46:23,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846063163] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:46:23,582 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:46:23,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:46:23,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961338887] [2022-07-11 23:46:23,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:46:23,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:46:23,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:46:23,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:46:23,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:46:23,584 INFO L87 Difference]: Start difference. First operand 335 states and 545 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-11 23:46:23,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:46:23,685 INFO L93 Difference]: Finished difference Result 697 states and 1138 transitions. [2022-07-11 23:46:23,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:46:23,685 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-11 23:46:23,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:46:23,687 INFO L225 Difference]: With dead ends: 697 [2022-07-11 23:46:23,687 INFO L226 Difference]: Without dead ends: 370 [2022-07-11 23:46:23,688 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-11 23:46:23,689 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 143 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 149 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-11 23:46:23,689 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 149 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:46:23,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2022-07-11 23:46:23,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 362. [2022-07-11 23:46:23,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 361 states have (on average 1.626038781163435) internal successors, (587), 361 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:46:23,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 587 transitions. [2022-07-11 23:46:23,699 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 587 transitions. Word has length 100 [2022-07-11 23:46:23,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:46:23,700 INFO L495 AbstractCegarLoop]: Abstraction has 362 states and 587 transitions. [2022-07-11 23:46:23,700 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-11 23:46:23,700 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 587 transitions. [2022-07-11 23:46:23,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-07-11 23:46:23,701 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:46:23,701 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] [2022-07-11 23:46:23,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-11 23:46:23,702 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:46:23,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:46:23,702 INFO L85 PathProgramCache]: Analyzing trace with hash -1691577195, now seen corresponding path program 1 times [2022-07-11 23:46:23,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:46:23,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383376200] [2022-07-11 23:46:23,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:46:23,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:46:23,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:46:23,727 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-11 23:46:23,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:46:23,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383376200] [2022-07-11 23:46:23,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383376200] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:46:23,728 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:46:23,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:46:23,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021282010] [2022-07-11 23:46:23,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:46:23,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:46:23,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:46:23,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:46:23,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:46:23,730 INFO L87 Difference]: Start difference. First operand 362 states and 587 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-11 23:46:23,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:46:23,830 INFO L93 Difference]: Finished difference Result 724 states and 1175 transitions. [2022-07-11 23:46:23,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:46:23,831 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-11 23:46:23,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:46:23,833 INFO L225 Difference]: With dead ends: 724 [2022-07-11 23:46:23,833 INFO L226 Difference]: Without dead ends: 370 [2022-07-11 23:46:23,834 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-11 23:46:23,834 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 142 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 149 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-11 23:46:23,834 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 149 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:46:23,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2022-07-11 23:46:23,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 362. [2022-07-11 23:46:23,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 361 states have (on average 1.6121883656509695) internal successors, (582), 361 states have internal predecessors, (582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:46:23,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 582 transitions. [2022-07-11 23:46:23,845 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 582 transitions. Word has length 101 [2022-07-11 23:46:23,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:46:23,846 INFO L495 AbstractCegarLoop]: Abstraction has 362 states and 582 transitions. [2022-07-11 23:46:23,846 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-11 23:46:23,846 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 582 transitions. [2022-07-11 23:46:23,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-07-11 23:46:23,847 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:46:23,847 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] [2022-07-11 23:46:23,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-11 23:46:23,848 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:46:23,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:46:23,848 INFO L85 PathProgramCache]: Analyzing trace with hash -479008336, now seen corresponding path program 1 times [2022-07-11 23:46:23,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:46:23,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249792454] [2022-07-11 23:46:23,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:46:23,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:46:23,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:46:23,875 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-11 23:46:23,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:46:23,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249792454] [2022-07-11 23:46:23,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249792454] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:46:23,877 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:46:23,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:46:23,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231863896] [2022-07-11 23:46:23,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:46:23,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:46:23,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:46:23,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:46:23,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:46:23,879 INFO L87 Difference]: Start difference. First operand 362 states and 582 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:46:23,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:46:23,978 INFO L93 Difference]: Finished difference Result 741 states and 1193 transitions. [2022-07-11 23:46:23,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:46:23,978 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-07-11 23:46:23,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:46:23,980 INFO L225 Difference]: With dead ends: 741 [2022-07-11 23:46:23,980 INFO L226 Difference]: Without dead ends: 387 [2022-07-11 23:46:23,981 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-11 23:46:23,982 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 149 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 144 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-11 23:46:23,982 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 144 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:46:23,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2022-07-11 23:46:23,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 383. [2022-07-11 23:46:23,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 382 states have (on average 1.5994764397905759) internal successors, (611), 382 states have internal predecessors, (611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:46:23,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 611 transitions. [2022-07-11 23:46:23,995 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 611 transitions. Word has length 105 [2022-07-11 23:46:23,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:46:23,996 INFO L495 AbstractCegarLoop]: Abstraction has 383 states and 611 transitions. [2022-07-11 23:46:23,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:46:23,996 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 611 transitions. [2022-07-11 23:46:23,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-07-11 23:46:23,997 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:46:23,997 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] [2022-07-11 23:46:23,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-11 23:46:23,998 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:46:23,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:46:23,998 INFO L85 PathProgramCache]: Analyzing trace with hash 2118869193, now seen corresponding path program 1 times [2022-07-11 23:46:23,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:46:23,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014814006] [2022-07-11 23:46:23,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:46:23,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:46:24,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:46:24,039 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-11 23:46:24,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:46:24,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014814006] [2022-07-11 23:46:24,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014814006] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:46:24,040 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:46:24,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:46:24,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483548762] [2022-07-11 23:46:24,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:46:24,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:46:24,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:46:24,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:46:24,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:46:24,042 INFO L87 Difference]: Start difference. First operand 383 states and 611 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-11 23:46:24,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:46:24,136 INFO L93 Difference]: Finished difference Result 762 states and 1216 transitions. [2022-07-11 23:46:24,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:46:24,137 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-11 23:46:24,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:46:24,139 INFO L225 Difference]: With dead ends: 762 [2022-07-11 23:46:24,139 INFO L226 Difference]: Without dead ends: 387 [2022-07-11 23:46:24,140 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-11 23:46:24,141 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 148 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 144 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-11 23:46:24,141 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 144 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:46:24,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2022-07-11 23:46:24,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 383. [2022-07-11 23:46:24,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 382 states have (on average 1.5837696335078535) internal successors, (605), 382 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:46:24,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 605 transitions. [2022-07-11 23:46:24,152 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 605 transitions. Word has length 106 [2022-07-11 23:46:24,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:46:24,152 INFO L495 AbstractCegarLoop]: Abstraction has 383 states and 605 transitions. [2022-07-11 23:46:24,153 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-11 23:46:24,153 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 605 transitions. [2022-07-11 23:46:24,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-07-11 23:46:24,154 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:46:24,154 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] [2022-07-11 23:46:24,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-11 23:46:24,154 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:46:24,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:46:24,155 INFO L85 PathProgramCache]: Analyzing trace with hash 1932137040, now seen corresponding path program 1 times [2022-07-11 23:46:24,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:46:24,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230251359] [2022-07-11 23:46:24,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:46:24,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:46:24,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:46:24,197 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-11 23:46:24,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:46:24,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230251359] [2022-07-11 23:46:24,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230251359] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:46:24,198 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:46:24,198 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:46:24,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420960383] [2022-07-11 23:46:24,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:46:24,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:46:24,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:46:24,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:46:24,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:46:24,200 INFO L87 Difference]: Start difference. First operand 383 states and 605 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:46:24,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:46:24,234 INFO L93 Difference]: Finished difference Result 1131 states and 1790 transitions. [2022-07-11 23:46:24,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:46:24,234 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 121 [2022-07-11 23:46:24,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:46:24,237 INFO L225 Difference]: With dead ends: 1131 [2022-07-11 23:46:24,238 INFO L226 Difference]: Without dead ends: 756 [2022-07-11 23:46:24,240 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-11 23:46:24,242 INFO L413 NwaCegarLoop]: 358 mSDtfsCounter, 137 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:46:24,242 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 543 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:46:24,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states. [2022-07-11 23:46:24,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 756. [2022-07-11 23:46:24,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 756 states, 755 states have (on average 1.5788079470198675) internal successors, (1192), 755 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:46:24,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 756 states to 756 states and 1192 transitions. [2022-07-11 23:46:24,263 INFO L78 Accepts]: Start accepts. Automaton has 756 states and 1192 transitions. Word has length 121 [2022-07-11 23:46:24,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:46:24,264 INFO L495 AbstractCegarLoop]: Abstraction has 756 states and 1192 transitions. [2022-07-11 23:46:24,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:46:24,264 INFO L276 IsEmpty]: Start isEmpty. Operand 756 states and 1192 transitions. [2022-07-11 23:46:24,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-07-11 23:46:24,265 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:46:24,266 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-11 23:46:24,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-11 23:46:24,266 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:46:24,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:46:24,267 INFO L85 PathProgramCache]: Analyzing trace with hash -1552830339, now seen corresponding path program 1 times [2022-07-11 23:46:24,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:46:24,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997683317] [2022-07-11 23:46:24,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:46:24,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:46:24,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:46:24,304 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-11 23:46:24,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:46:24,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997683317] [2022-07-11 23:46:24,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997683317] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:46:24,306 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:46:24,306 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:46:24,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893529638] [2022-07-11 23:46:24,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:46:24,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:46:24,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:46:24,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:46:24,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:46:24,308 INFO L87 Difference]: Start difference. First operand 756 states and 1192 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-11 23:46:24,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:46:24,346 INFO L93 Difference]: Finished difference Result 1832 states and 2893 transitions. [2022-07-11 23:46:24,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:46:24,346 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-11 23:46:24,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:46:24,351 INFO L225 Difference]: With dead ends: 1832 [2022-07-11 23:46:24,351 INFO L226 Difference]: Without dead ends: 1084 [2022-07-11 23:46:24,352 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-11 23:46:24,353 INFO L413 NwaCegarLoop]: 358 mSDtfsCounter, 134 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:46:24,353 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 543 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:46:24,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1084 states. [2022-07-11 23:46:24,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1084 to 1084. [2022-07-11 23:46:24,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1084 states, 1083 states have (on average 1.5780240073868883) internal successors, (1709), 1083 states have internal predecessors, (1709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:46:24,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1084 states to 1084 states and 1709 transitions. [2022-07-11 23:46:24,385 INFO L78 Accepts]: Start accepts. Automaton has 1084 states and 1709 transitions. Word has length 122 [2022-07-11 23:46:24,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:46:24,385 INFO L495 AbstractCegarLoop]: Abstraction has 1084 states and 1709 transitions. [2022-07-11 23:46:24,386 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-11 23:46:24,386 INFO L276 IsEmpty]: Start isEmpty. Operand 1084 states and 1709 transitions. [2022-07-11 23:46:24,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-07-11 23:46:24,388 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:46:24,388 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-11 23:46:24,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-11 23:46:24,389 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:46:24,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:46:24,389 INFO L85 PathProgramCache]: Analyzing trace with hash 323652479, now seen corresponding path program 1 times [2022-07-11 23:46:24,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:46:24,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151185877] [2022-07-11 23:46:24,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:46:24,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:46:24,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:46:24,424 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-11 23:46:24,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:46:24,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151185877] [2022-07-11 23:46:24,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151185877] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:46:24,425 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:46:24,425 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:46:24,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020119999] [2022-07-11 23:46:24,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:46:24,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:46:24,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:46:24,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:46:24,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:46:24,427 INFO L87 Difference]: Start difference. First operand 1084 states and 1709 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-11 23:46:24,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:46:24,476 INFO L93 Difference]: Finished difference Result 2529 states and 3993 transitions. [2022-07-11 23:46:24,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:46:24,476 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-11 23:46:24,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:46:24,482 INFO L225 Difference]: With dead ends: 2529 [2022-07-11 23:46:24,482 INFO L226 Difference]: Without dead ends: 1453 [2022-07-11 23:46:24,484 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-11 23:46:24,484 INFO L413 NwaCegarLoop]: 361 mSDtfsCounter, 155 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:46:24,485 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 546 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:46:24,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1453 states. [2022-07-11 23:46:24,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1453 to 1453. [2022-07-11 23:46:24,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1453 states, 1452 states have (on average 1.5778236914600552) internal successors, (2291), 1452 states have internal predecessors, (2291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:46:24,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1453 states to 1453 states and 2291 transitions. [2022-07-11 23:46:24,538 INFO L78 Accepts]: Start accepts. Automaton has 1453 states and 2291 transitions. Word has length 122 [2022-07-11 23:46:24,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:46:24,539 INFO L495 AbstractCegarLoop]: Abstraction has 1453 states and 2291 transitions. [2022-07-11 23:46:24,539 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-11 23:46:24,539 INFO L276 IsEmpty]: Start isEmpty. Operand 1453 states and 2291 transitions. [2022-07-11 23:46:24,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-07-11 23:46:24,542 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:46:24,542 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-11 23:46:24,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-11 23:46:24,542 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:46:24,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:46:24,543 INFO L85 PathProgramCache]: Analyzing trace with hash 1712946493, now seen corresponding path program 1 times [2022-07-11 23:46:24,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:46:24,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407182154] [2022-07-11 23:46:24,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:46:24,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:46:24,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:46:24,569 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-11 23:46:24,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:46:24,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407182154] [2022-07-11 23:46:24,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407182154] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:46:24,570 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:46:24,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:46:24,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791621748] [2022-07-11 23:46:24,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:46:24,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:46:24,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:46:24,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:46:24,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:46:24,573 INFO L87 Difference]: Start difference. First operand 1453 states and 2291 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-11 23:46:24,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:46:24,630 INFO L93 Difference]: Finished difference Result 3249 states and 5126 transitions. [2022-07-11 23:46:24,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:46:24,631 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-11 23:46:24,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:46:24,638 INFO L225 Difference]: With dead ends: 3249 [2022-07-11 23:46:24,638 INFO L226 Difference]: Without dead ends: 1804 [2022-07-11 23:46:24,640 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:46:24,640 INFO L413 NwaCegarLoop]: 213 mSDtfsCounter, 170 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:46:24,641 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 388 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:46:24,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1804 states. [2022-07-11 23:46:24,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1804 to 1804. [2022-07-11 23:46:24,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1804 states, 1803 states have (on average 1.5762617859123682) internal successors, (2842), 1803 states have internal predecessors, (2842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:46:24,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1804 states to 1804 states and 2842 transitions. [2022-07-11 23:46:24,696 INFO L78 Accepts]: Start accepts. Automaton has 1804 states and 2842 transitions. Word has length 122 [2022-07-11 23:46:24,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:46:24,696 INFO L495 AbstractCegarLoop]: Abstraction has 1804 states and 2842 transitions. [2022-07-11 23:46:24,696 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-11 23:46:24,697 INFO L276 IsEmpty]: Start isEmpty. Operand 1804 states and 2842 transitions. [2022-07-11 23:46:24,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2022-07-11 23:46:24,701 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:46:24,701 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 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, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:46:24,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-11 23:46:24,701 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:46:24,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:46:24,702 INFO L85 PathProgramCache]: Analyzing trace with hash -1532697181, now seen corresponding path program 1 times [2022-07-11 23:46:24,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:46:24,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178230929] [2022-07-11 23:46:24,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:46:24,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:46:24,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:46:24,755 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 256 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-07-11 23:46:24,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:46:24,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178230929] [2022-07-11 23:46:24,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178230929] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:46:24,756 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:46:24,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:46:24,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145053090] [2022-07-11 23:46:24,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:46:24,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:46:24,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:46:24,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:46:24,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:46:24,758 INFO L87 Difference]: Start difference. First operand 1804 states and 2842 transitions. Second operand has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:46:24,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:46:24,912 INFO L93 Difference]: Finished difference Result 3650 states and 5732 transitions. [2022-07-11 23:46:24,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:46:24,912 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 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 199 [2022-07-11 23:46:24,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:46:24,919 INFO L225 Difference]: With dead ends: 3650 [2022-07-11 23:46:24,920 INFO L226 Difference]: Without dead ends: 1854 [2022-07-11 23:46:24,922 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-11 23:46:24,923 INFO L413 NwaCegarLoop]: 202 mSDtfsCounter, 50 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 297 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-11 23:46:24,923 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 297 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:46:24,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1854 states. [2022-07-11 23:46:24,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1854 to 1804. [2022-07-11 23:46:24,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1804 states, 1803 states have (on average 1.5363283416528009) internal successors, (2770), 1803 states have internal predecessors, (2770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:46:24,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1804 states to 1804 states and 2770 transitions. [2022-07-11 23:46:24,976 INFO L78 Accepts]: Start accepts. Automaton has 1804 states and 2770 transitions. Word has length 199 [2022-07-11 23:46:24,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:46:24,976 INFO L495 AbstractCegarLoop]: Abstraction has 1804 states and 2770 transitions. [2022-07-11 23:46:24,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:46:24,976 INFO L276 IsEmpty]: Start isEmpty. Operand 1804 states and 2770 transitions. [2022-07-11 23:46:24,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2022-07-11 23:46:24,980 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:46:24,981 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 5, 5, 5, 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, 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-11 23:46:24,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-11 23:46:24,981 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:46:24,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:46:24,982 INFO L85 PathProgramCache]: Analyzing trace with hash -995291011, now seen corresponding path program 1 times [2022-07-11 23:46:24,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:46:24,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796110787] [2022-07-11 23:46:24,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:46:24,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:46:24,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:46:25,021 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 257 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2022-07-11 23:46:25,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:46:25,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796110787] [2022-07-11 23:46:25,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796110787] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:46:25,022 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:46:25,023 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:46:25,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930270574] [2022-07-11 23:46:25,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:46:25,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:46:25,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:46:25,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:46:25,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:46:25,024 INFO L87 Difference]: Start difference. First operand 1804 states and 2770 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:46:25,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:46:25,183 INFO L93 Difference]: Finished difference Result 3667 states and 5605 transitions. [2022-07-11 23:46:25,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:46:25,183 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 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 213 [2022-07-11 23:46:25,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:46:25,202 INFO L225 Difference]: With dead ends: 3667 [2022-07-11 23:46:25,202 INFO L226 Difference]: Without dead ends: 1871 [2022-07-11 23:46:25,204 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-11 23:46:25,205 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 152 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 163 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-11 23:46:25,205 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 163 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:46:25,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1871 states. [2022-07-11 23:46:25,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1871 to 1804. [2022-07-11 23:46:25,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1804 states, 1803 states have (on average 1.4941763727121464) internal successors, (2694), 1803 states have internal predecessors, (2694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:46:25,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1804 states to 1804 states and 2694 transitions. [2022-07-11 23:46:25,268 INFO L78 Accepts]: Start accepts. Automaton has 1804 states and 2694 transitions. Word has length 213 [2022-07-11 23:46:25,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:46:25,268 INFO L495 AbstractCegarLoop]: Abstraction has 1804 states and 2694 transitions. [2022-07-11 23:46:25,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:46:25,268 INFO L276 IsEmpty]: Start isEmpty. Operand 1804 states and 2694 transitions. [2022-07-11 23:46:25,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2022-07-11 23:46:25,274 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:46:25,275 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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-11 23:46:25,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-11 23:46:25,275 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:46:25,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:46:25,276 INFO L85 PathProgramCache]: Analyzing trace with hash -344869126, now seen corresponding path program 1 times [2022-07-11 23:46:25,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:46:25,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068184518] [2022-07-11 23:46:25,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:46:25,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:46:25,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:46:25,343 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 343 proven. 26 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-07-11 23:46:25,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:46:25,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068184518] [2022-07-11 23:46:25,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068184518] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:46:25,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1689897232] [2022-07-11 23:46:25,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:46:25,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:46:25,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:46:25,351 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-11 23:46:25,381 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-11 23:46:25,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:46:25,462 INFO L263 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-11 23:46:25,475 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:46:25,641 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 343 proven. 26 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-07-11 23:46:25,653 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:46:25,754 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 343 proven. 26 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-07-11 23:46:25,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1689897232] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:46:25,754 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:46:25,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-07-11 23:46:25,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97586313] [2022-07-11 23:46:25,761 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:46:25,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-11 23:46:25,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:46:25,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-11 23:46:25,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-11 23:46:25,762 INFO L87 Difference]: Start difference. First operand 1804 states and 2694 transitions. Second operand has 6 states, 6 states have (on average 39.666666666666664) internal successors, (238), 6 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:46:26,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:46:26,091 INFO L93 Difference]: Finished difference Result 4265 states and 6321 transitions. [2022-07-11 23:46:26,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-11 23:46:26,091 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 39.666666666666664) internal successors, (238), 6 states have internal predecessors, (238), 0 states have call successors, (0), 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 232 [2022-07-11 23:46:26,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:46:26,101 INFO L225 Difference]: With dead ends: 4265 [2022-07-11 23:46:26,101 INFO L226 Difference]: Without dead ends: 2436 [2022-07-11 23:46:26,104 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 469 GetRequests, 463 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-11 23:46:26,105 INFO L413 NwaCegarLoop]: 236 mSDtfsCounter, 486 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 486 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-11 23:46:26,105 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [486 Valid, 448 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-11 23:46:26,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2436 states. [2022-07-11 23:46:26,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2436 to 1604. [2022-07-11 23:46:26,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1604 states, 1603 states have (on average 1.470991890205864) internal successors, (2358), 1603 states have internal predecessors, (2358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:46:26,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1604 states to 1604 states and 2358 transitions. [2022-07-11 23:46:26,170 INFO L78 Accepts]: Start accepts. Automaton has 1604 states and 2358 transitions. Word has length 232 [2022-07-11 23:46:26,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:46:26,170 INFO L495 AbstractCegarLoop]: Abstraction has 1604 states and 2358 transitions. [2022-07-11 23:46:26,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 39.666666666666664) internal successors, (238), 6 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:46:26,171 INFO L276 IsEmpty]: Start isEmpty. Operand 1604 states and 2358 transitions. [2022-07-11 23:46:26,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2022-07-11 23:46:26,174 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:46:26,175 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:46:26,202 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-11 23:46:26,391 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,SelfDestructingSolverStorable20 [2022-07-11 23:46:26,392 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:46:26,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:46:26,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1731638989, now seen corresponding path program 1 times [2022-07-11 23:46:26,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:46:26,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550949173] [2022-07-11 23:46:26,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:46:26,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:46:26,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:46:26,447 INFO L134 CoverageAnalysis]: Checked inductivity of 526 backedges. 359 proven. 0 refuted. 0 times theorem prover too weak. 167 trivial. 0 not checked. [2022-07-11 23:46:26,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:46:26,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550949173] [2022-07-11 23:46:26,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550949173] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:46:26,448 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:46:26,448 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:46:26,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096019289] [2022-07-11 23:46:26,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:46:26,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:46:26,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:46:26,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:46:26,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:46:26,451 INFO L87 Difference]: Start difference. First operand 1604 states and 2358 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-11 23:46:26,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:46:26,608 INFO L93 Difference]: Finished difference Result 3395 states and 5009 transitions. [2022-07-11 23:46:26,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:46:26,609 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 241 [2022-07-11 23:46:26,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:46:26,615 INFO L225 Difference]: With dead ends: 3395 [2022-07-11 23:46:26,616 INFO L226 Difference]: Without dead ends: 1679 [2022-07-11 23:46:26,619 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-11 23:46:26,620 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 46 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:46:26,620 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 270 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:46:26,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1679 states. [2022-07-11 23:46:26,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1679 to 1679. [2022-07-11 23:46:26,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1679 states, 1678 states have (on average 1.4439809296781883) internal successors, (2423), 1678 states have internal predecessors, (2423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:46:26,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1679 states to 1679 states and 2423 transitions. [2022-07-11 23:46:26,679 INFO L78 Accepts]: Start accepts. Automaton has 1679 states and 2423 transitions. Word has length 241 [2022-07-11 23:46:26,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:46:26,679 INFO L495 AbstractCegarLoop]: Abstraction has 1679 states and 2423 transitions. [2022-07-11 23:46:26,680 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-11 23:46:26,680 INFO L276 IsEmpty]: Start isEmpty. Operand 1679 states and 2423 transitions. [2022-07-11 23:46:26,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2022-07-11 23:46:26,684 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:46:26,685 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:46:26,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-11 23:46:26,686 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:46:26,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:46:26,686 INFO L85 PathProgramCache]: Analyzing trace with hash 1272517136, now seen corresponding path program 1 times [2022-07-11 23:46:26,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:46:26,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180496129] [2022-07-11 23:46:26,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:46:26,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:46:26,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:46:26,739 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 430 proven. 16 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2022-07-11 23:46:26,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:46:26,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180496129] [2022-07-11 23:46:26,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180496129] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:46:26,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1685921821] [2022-07-11 23:46:26,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:46:26,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:46:26,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:46:26,744 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-11 23:46:26,745 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-11 23:46:26,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:46:26,843 INFO L263 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-11 23:46:26,847 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:46:26,911 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 430 proven. 16 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2022-07-11 23:46:26,911 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:46:26,969 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 430 proven. 16 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2022-07-11 23:46:26,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1685921821] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:46:26,969 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:46:26,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-07-11 23:46:26,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049449760] [2022-07-11 23:46:26,970 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:46:26,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-11 23:46:26,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:46:26,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-11 23:46:26,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-11 23:46:26,971 INFO L87 Difference]: Start difference. First operand 1679 states and 2423 transitions. Second operand has 6 states, 6 states have (on average 34.333333333333336) internal successors, (206), 6 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:46:27,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:46:27,617 INFO L93 Difference]: Finished difference Result 7700 states and 11238 transitions. [2022-07-11 23:46:27,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-11 23:46:27,617 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 34.333333333333336) internal successors, (206), 6 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 253 [2022-07-11 23:46:27,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:46:27,638 INFO L225 Difference]: With dead ends: 7700 [2022-07-11 23:46:27,638 INFO L226 Difference]: Without dead ends: 6029 [2022-07-11 23:46:27,641 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 516 GetRequests, 508 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2022-07-11 23:46:27,642 INFO L413 NwaCegarLoop]: 540 mSDtfsCounter, 438 mSDsluCounter, 646 mSDsCounter, 0 mSdLazyCounter, 739 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 438 SdHoareTripleChecker+Valid, 1186 SdHoareTripleChecker+Invalid, 800 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 739 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-11 23:46:27,643 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [438 Valid, 1186 Invalid, 800 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 739 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-11 23:46:27,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6029 states. [2022-07-11 23:46:27,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6029 to 2357. [2022-07-11 23:46:27,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2357 states, 2356 states have (on average 1.3247028862478778) internal successors, (3121), 2356 states have internal predecessors, (3121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:46:27,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2357 states to 2357 states and 3121 transitions. [2022-07-11 23:46:27,750 INFO L78 Accepts]: Start accepts. Automaton has 2357 states and 3121 transitions. Word has length 253 [2022-07-11 23:46:27,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:46:27,750 INFO L495 AbstractCegarLoop]: Abstraction has 2357 states and 3121 transitions. [2022-07-11 23:46:27,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 34.333333333333336) internal successors, (206), 6 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:46:27,751 INFO L276 IsEmpty]: Start isEmpty. Operand 2357 states and 3121 transitions. [2022-07-11 23:46:27,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2022-07-11 23:46:27,756 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:46:27,756 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:46:27,781 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-11 23:46:27,974 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,SelfDestructingSolverStorable22 [2022-07-11 23:46:27,975 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:46:27,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:46:27,975 INFO L85 PathProgramCache]: Analyzing trace with hash 1561336526, now seen corresponding path program 1 times [2022-07-11 23:46:27,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:46:27,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352087381] [2022-07-11 23:46:27,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:46:27,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:46:27,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:46:28,015 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 400 proven. 0 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2022-07-11 23:46:28,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:46:28,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352087381] [2022-07-11 23:46:28,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352087381] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:46:28,015 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:46:28,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:46:28,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841046477] [2022-07-11 23:46:28,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:46:28,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:46:28,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:46:28,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:46:28,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:46:28,017 INFO L87 Difference]: Start difference. First operand 2357 states and 3121 transitions. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:46:28,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:46:28,141 INFO L93 Difference]: Finished difference Result 6533 states and 8644 transitions. [2022-07-11 23:46:28,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:46:28,141 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 253 [2022-07-11 23:46:28,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:46:28,155 INFO L225 Difference]: With dead ends: 6533 [2022-07-11 23:46:28,155 INFO L226 Difference]: Without dead ends: 4184 [2022-07-11 23:46:28,159 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-11 23:46:28,160 INFO L413 NwaCegarLoop]: 333 mSDtfsCounter, 120 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 514 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-11 23:46:28,160 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 514 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:46:28,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4184 states. [2022-07-11 23:46:28,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4184 to 4182. [2022-07-11 23:46:28,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4182 states, 4181 states have (on average 1.3207366658694093) internal successors, (5522), 4181 states have internal predecessors, (5522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:46:28,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4182 states to 4182 states and 5522 transitions. [2022-07-11 23:46:28,322 INFO L78 Accepts]: Start accepts. Automaton has 4182 states and 5522 transitions. Word has length 253 [2022-07-11 23:46:28,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:46:28,322 INFO L495 AbstractCegarLoop]: Abstraction has 4182 states and 5522 transitions. [2022-07-11 23:46:28,323 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:46:28,323 INFO L276 IsEmpty]: Start isEmpty. Operand 4182 states and 5522 transitions. [2022-07-11 23:46:28,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2022-07-11 23:46:28,331 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:46:28,331 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-11 23:46:28,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-11 23:46:28,332 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:46:28,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:46:28,332 INFO L85 PathProgramCache]: Analyzing trace with hash -914284920, now seen corresponding path program 1 times [2022-07-11 23:46:28,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:46:28,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748750213] [2022-07-11 23:46:28,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:46:28,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:46:28,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:46:28,373 INFO L134 CoverageAnalysis]: Checked inductivity of 580 backedges. 374 proven. 0 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2022-07-11 23:46:28,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:46:28,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748750213] [2022-07-11 23:46:28,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748750213] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:46:28,374 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:46:28,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:46:28,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034830368] [2022-07-11 23:46:28,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:46:28,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:46:28,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:46:28,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:46:28,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:46:28,376 INFO L87 Difference]: Start difference. First operand 4182 states and 5522 transitions. Second operand has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:46:28,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:46:28,575 INFO L93 Difference]: Finished difference Result 8584 states and 11340 transitions. [2022-07-11 23:46:28,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:46:28,580 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 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 256 [2022-07-11 23:46:28,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:46:28,594 INFO L225 Difference]: With dead ends: 8584 [2022-07-11 23:46:28,594 INFO L226 Difference]: Without dead ends: 4410 [2022-07-11 23:46:28,600 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-11 23:46:28,600 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 137 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 166 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-11 23:46:28,601 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 166 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:46:28,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4410 states. [2022-07-11 23:46:28,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4410 to 4182. [2022-07-11 23:46:28,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4182 states, 4181 states have (on average 1.3035159052858167) internal successors, (5450), 4181 states have internal predecessors, (5450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:46:28,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4182 states to 4182 states and 5450 transitions. [2022-07-11 23:46:28,789 INFO L78 Accepts]: Start accepts. Automaton has 4182 states and 5450 transitions. Word has length 256 [2022-07-11 23:46:28,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:46:28,789 INFO L495 AbstractCegarLoop]: Abstraction has 4182 states and 5450 transitions. [2022-07-11 23:46:28,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:46:28,790 INFO L276 IsEmpty]: Start isEmpty. Operand 4182 states and 5450 transitions. [2022-07-11 23:46:28,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2022-07-11 23:46:28,799 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:46:28,799 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 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-11 23:46:28,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-11 23:46:28,800 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:46:28,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:46:28,801 INFO L85 PathProgramCache]: Analyzing trace with hash 1357789354, now seen corresponding path program 1 times [2022-07-11 23:46:28,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:46:28,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384794959] [2022-07-11 23:46:28,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:46:28,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:46:28,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:46:28,838 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 300 proven. 0 refuted. 0 times theorem prover too weak. 482 trivial. 0 not checked. [2022-07-11 23:46:28,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:46:28,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384794959] [2022-07-11 23:46:28,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384794959] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:46:28,839 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:46:28,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:46:28,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220279637] [2022-07-11 23:46:28,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:46:28,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:46:28,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:46:28,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:46:28,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:46:28,841 INFO L87 Difference]: Start difference. First operand 4182 states and 5450 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:46:29,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:46:29,089 INFO L93 Difference]: Finished difference Result 8488 states and 11054 transitions. [2022-07-11 23:46:29,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:46:29,090 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 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 290 [2022-07-11 23:46:29,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:46:29,098 INFO L225 Difference]: With dead ends: 8488 [2022-07-11 23:46:29,099 INFO L226 Difference]: Without dead ends: 4314 [2022-07-11 23:46:29,104 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-11 23:46:29,104 INFO L413 NwaCegarLoop]: 200 mSDtfsCounter, 13 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:46:29,104 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 300 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:46:29,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4314 states. [2022-07-11 23:46:29,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4314 to 4274. [2022-07-11 23:46:29,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4274 states, 4273 states have (on average 1.301661596068336) internal successors, (5562), 4273 states have internal predecessors, (5562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:46:29,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4274 states to 4274 states and 5562 transitions. [2022-07-11 23:46:29,254 INFO L78 Accepts]: Start accepts. Automaton has 4274 states and 5562 transitions. Word has length 290 [2022-07-11 23:46:29,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:46:29,254 INFO L495 AbstractCegarLoop]: Abstraction has 4274 states and 5562 transitions. [2022-07-11 23:46:29,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:46:29,254 INFO L276 IsEmpty]: Start isEmpty. Operand 4274 states and 5562 transitions. [2022-07-11 23:46:29,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2022-07-11 23:46:29,262 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:46:29,263 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 7, 7, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 23:46:29,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-07-11 23:46:29,263 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:46:29,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:46:29,264 INFO L85 PathProgramCache]: Analyzing trace with hash -1702375352, now seen corresponding path program 1 times [2022-07-11 23:46:29,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:46:29,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582277416] [2022-07-11 23:46:29,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:46:29,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:46:29,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:46:29,302 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 434 proven. 0 refuted. 0 times theorem prover too weak. 499 trivial. 0 not checked. [2022-07-11 23:46:29,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:46:29,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582277416] [2022-07-11 23:46:29,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582277416] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:46:29,303 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:46:29,303 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:46:29,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954405898] [2022-07-11 23:46:29,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:46:29,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:46:29,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:46:29,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:46:29,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:46:29,305 INFO L87 Difference]: Start difference. First operand 4274 states and 5562 transitions. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:46:29,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:46:29,499 INFO L93 Difference]: Finished difference Result 8920 states and 11652 transitions. [2022-07-11 23:46:29,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:46:29,499 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 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 311 [2022-07-11 23:46:29,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:46:29,508 INFO L225 Difference]: With dead ends: 8920 [2022-07-11 23:46:29,509 INFO L226 Difference]: Without dead ends: 4654 [2022-07-11 23:46:29,514 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-11 23:46:29,514 INFO L413 NwaCegarLoop]: 199 mSDtfsCounter, 29 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:46:29,515 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 299 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:46:29,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4654 states. [2022-07-11 23:46:29,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4654 to 4524. [2022-07-11 23:46:29,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4524 states, 4523 states have (on average 1.2960424497015255) internal successors, (5862), 4523 states have internal predecessors, (5862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:46:29,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4524 states to 4524 states and 5862 transitions. [2022-07-11 23:46:29,693 INFO L78 Accepts]: Start accepts. Automaton has 4524 states and 5862 transitions. Word has length 311 [2022-07-11 23:46:29,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:46:29,693 INFO L495 AbstractCegarLoop]: Abstraction has 4524 states and 5862 transitions. [2022-07-11 23:46:29,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:46:29,693 INFO L276 IsEmpty]: Start isEmpty. Operand 4524 states and 5862 transitions. [2022-07-11 23:46:29,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2022-07-11 23:46:29,701 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:46:29,702 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 23:46:29,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-07-11 23:46:29,702 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:46:29,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:46:29,703 INFO L85 PathProgramCache]: Analyzing trace with hash 602793911, now seen corresponding path program 1 times [2022-07-11 23:46:29,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:46:29,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546796387] [2022-07-11 23:46:29,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:46:29,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:46:29,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:46:29,749 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 564 proven. 0 refuted. 0 times theorem prover too weak. 404 trivial. 0 not checked. [2022-07-11 23:46:29,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:46:29,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546796387] [2022-07-11 23:46:29,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546796387] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:46:29,750 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:46:29,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:46:29,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306331146] [2022-07-11 23:46:29,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:46:29,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:46:29,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:46:29,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:46:29,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:46:29,752 INFO L87 Difference]: Start difference. First operand 4524 states and 5862 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-11 23:46:29,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:46:29,897 INFO L93 Difference]: Finished difference Result 7636 states and 9829 transitions. [2022-07-11 23:46:29,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:46:29,898 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 321 [2022-07-11 23:46:29,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:46:29,902 INFO L225 Difference]: With dead ends: 7636 [2022-07-11 23:46:29,903 INFO L226 Difference]: Without dead ends: 2476 [2022-07-11 23:46:29,907 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-11 23:46:29,908 INFO L413 NwaCegarLoop]: 188 mSDtfsCounter, 11 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:46:29,908 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 288 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:46:29,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2476 states. [2022-07-11 23:46:29,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2476 to 2476. [2022-07-11 23:46:29,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2476 states, 2475 states have (on average 1.2836363636363637) internal successors, (3177), 2475 states have internal predecessors, (3177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:46:29,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2476 states to 2476 states and 3177 transitions. [2022-07-11 23:46:29,998 INFO L78 Accepts]: Start accepts. Automaton has 2476 states and 3177 transitions. Word has length 321 [2022-07-11 23:46:29,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:46:29,998 INFO L495 AbstractCegarLoop]: Abstraction has 2476 states and 3177 transitions. [2022-07-11 23:46:29,998 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-11 23:46:29,998 INFO L276 IsEmpty]: Start isEmpty. Operand 2476 states and 3177 transitions. [2022-07-11 23:46:30,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2022-07-11 23:46:30,004 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:46:30,004 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 8, 8, 7, 7, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 23:46:30,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-07-11 23:46:30,004 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:46:30,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:46:30,005 INFO L85 PathProgramCache]: Analyzing trace with hash -616309997, now seen corresponding path program 1 times [2022-07-11 23:46:30,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:46:30,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467640556] [2022-07-11 23:46:30,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:46:30,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:46:30,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:46:30,047 INFO L134 CoverageAnalysis]: Checked inductivity of 1114 backedges. 580 proven. 0 refuted. 0 times theorem prover too weak. 534 trivial. 0 not checked. [2022-07-11 23:46:30,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:46:30,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467640556] [2022-07-11 23:46:30,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467640556] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:46:30,047 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:46:30,048 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:46:30,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959933027] [2022-07-11 23:46:30,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:46:30,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:46:30,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:46:30,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:46:30,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:46:30,049 INFO L87 Difference]: Start difference. First operand 2476 states and 3177 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:46:30,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:46:30,184 INFO L93 Difference]: Finished difference Result 4984 states and 6407 transitions. [2022-07-11 23:46:30,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:46:30,185 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 337 [2022-07-11 23:46:30,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:46:30,189 INFO L225 Difference]: With dead ends: 4984 [2022-07-11 23:46:30,189 INFO L226 Difference]: Without dead ends: 2516 [2022-07-11 23:46:30,192 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-11 23:46:30,192 INFO L413 NwaCegarLoop]: 194 mSDtfsCounter, 19 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:46:30,193 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 293 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:46:30,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2516 states. [2022-07-11 23:46:30,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2516 to 2476. [2022-07-11 23:46:30,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2476 states, 2475 states have (on average 1.2735353535353535) internal successors, (3152), 2475 states have internal predecessors, (3152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:46:30,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2476 states to 2476 states and 3152 transitions. [2022-07-11 23:46:30,252 INFO L78 Accepts]: Start accepts. Automaton has 2476 states and 3152 transitions. Word has length 337 [2022-07-11 23:46:30,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:46:30,252 INFO L495 AbstractCegarLoop]: Abstraction has 2476 states and 3152 transitions. [2022-07-11 23:46:30,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:46:30,253 INFO L276 IsEmpty]: Start isEmpty. Operand 2476 states and 3152 transitions. [2022-07-11 23:46:30,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2022-07-11 23:46:30,257 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:46:30,257 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 9, 9, 8, 8, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:46:30,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-07-11 23:46:30,257 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:46:30,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:46:30,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1063549815, now seen corresponding path program 1 times [2022-07-11 23:46:30,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:46:30,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064689915] [2022-07-11 23:46:30,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:46:30,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:46:30,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:46:30,301 INFO L134 CoverageAnalysis]: Checked inductivity of 1327 backedges. 738 proven. 0 refuted. 0 times theorem prover too weak. 589 trivial. 0 not checked. [2022-07-11 23:46:30,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:46:30,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064689915] [2022-07-11 23:46:30,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064689915] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:46:30,302 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:46:30,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:46:30,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76595137] [2022-07-11 23:46:30,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:46:30,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:46:30,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:46:30,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:46:30,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:46:30,304 INFO L87 Difference]: Start difference. First operand 2476 states and 3152 transitions. Second operand has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:46:30,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:46:30,447 INFO L93 Difference]: Finished difference Result 4954 states and 6302 transitions. [2022-07-11 23:46:30,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:46:30,448 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 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 360 [2022-07-11 23:46:30,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:46:30,452 INFO L225 Difference]: With dead ends: 4954 [2022-07-11 23:46:30,452 INFO L226 Difference]: Without dead ends: 2486 [2022-07-11 23:46:30,455 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-11 23:46:30,455 INFO L413 NwaCegarLoop]: 194 mSDtfsCounter, 11 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:46:30,455 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 293 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:46:30,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2486 states. [2022-07-11 23:46:30,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2486 to 2476. [2022-07-11 23:46:30,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2476 states, 2475 states have (on average 1.2634343434343434) internal successors, (3127), 2475 states have internal predecessors, (3127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:46:30,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2476 states to 2476 states and 3127 transitions. [2022-07-11 23:46:30,529 INFO L78 Accepts]: Start accepts. Automaton has 2476 states and 3127 transitions. Word has length 360 [2022-07-11 23:46:30,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:46:30,529 INFO L495 AbstractCegarLoop]: Abstraction has 2476 states and 3127 transitions. [2022-07-11 23:46:30,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:46:30,530 INFO L276 IsEmpty]: Start isEmpty. Operand 2476 states and 3127 transitions. [2022-07-11 23:46:30,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2022-07-11 23:46:30,534 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:46:30,534 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 23:46:30,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-07-11 23:46:30,534 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:46:30,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:46:30,535 INFO L85 PathProgramCache]: Analyzing trace with hash -2107174257, now seen corresponding path program 1 times [2022-07-11 23:46:30,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:46:30,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838289608] [2022-07-11 23:46:30,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:46:30,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:46:30,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:46:30,594 INFO L134 CoverageAnalysis]: Checked inductivity of 1588 backedges. 1011 proven. 26 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2022-07-11 23:46:30,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:46:30,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838289608] [2022-07-11 23:46:30,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838289608] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:46:30,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [813729174] [2022-07-11 23:46:30,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:46:30,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:46:30,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:46:30,596 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-11 23:46:30,623 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-11 23:46:30,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:46:30,730 INFO L263 TraceCheckSpWp]: Trace formula consists of 645 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-11 23:46:30,737 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:46:30,992 INFO L134 CoverageAnalysis]: Checked inductivity of 1588 backedges. 773 proven. 0 refuted. 0 times theorem prover too weak. 815 trivial. 0 not checked. [2022-07-11 23:46:30,992 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-11 23:46:30,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [813729174] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:46:30,992 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-11 23:46:30,993 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-07-11 23:46:30,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000496651] [2022-07-11 23:46:30,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:46:30,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:46:30,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:46:30,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:46:30,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:46:30,994 INFO L87 Difference]: Start difference. First operand 2476 states and 3127 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:46:31,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:46:31,072 INFO L93 Difference]: Finished difference Result 3068 states and 3883 transitions. [2022-07-11 23:46:31,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:46:31,072 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 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 393 [2022-07-11 23:46:31,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:46:31,077 INFO L225 Difference]: With dead ends: 3068 [2022-07-11 23:46:31,077 INFO L226 Difference]: Without dead ends: 2930 [2022-07-11 23:46:31,078 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 393 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-11 23:46:31,079 INFO L413 NwaCegarLoop]: 309 mSDtfsCounter, 91 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:46:31,079 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 447 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:46:31,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2930 states. [2022-07-11 23:46:31,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2930 to 2340. [2022-07-11 23:46:31,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2340 states, 2339 states have (on average 1.27105600684053) internal successors, (2973), 2339 states have internal predecessors, (2973), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:46:31,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2340 states to 2340 states and 2973 transitions. [2022-07-11 23:46:31,147 INFO L78 Accepts]: Start accepts. Automaton has 2340 states and 2973 transitions. Word has length 393 [2022-07-11 23:46:31,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:46:31,147 INFO L495 AbstractCegarLoop]: Abstraction has 2340 states and 2973 transitions. [2022-07-11 23:46:31,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:46:31,148 INFO L276 IsEmpty]: Start isEmpty. Operand 2340 states and 2973 transitions. [2022-07-11 23:46:31,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2022-07-11 23:46:31,152 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:46:31,152 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, 8, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:46:31,179 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-11 23:46:31,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:46:31,369 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:46:31,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:46:31,369 INFO L85 PathProgramCache]: Analyzing trace with hash 2021892229, now seen corresponding path program 1 times [2022-07-11 23:46:31,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:46:31,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823582132] [2022-07-11 23:46:31,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:46:31,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:46:31,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:46:31,426 INFO L134 CoverageAnalysis]: Checked inductivity of 1704 backedges. 1045 proven. 26 refuted. 0 times theorem prover too weak. 633 trivial. 0 not checked. [2022-07-11 23:46:31,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:46:31,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823582132] [2022-07-11 23:46:31,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823582132] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:46:31,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [875930955] [2022-07-11 23:46:31,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:46:31,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:46:31,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:46:31,428 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-11 23:46:31,457 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-11 23:46:31,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:46:31,560 INFO L263 TraceCheckSpWp]: Trace formula consists of 662 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-11 23:46:31,564 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:46:31,629 INFO L134 CoverageAnalysis]: Checked inductivity of 1704 backedges. 1045 proven. 26 refuted. 0 times theorem prover too weak. 633 trivial. 0 not checked. [2022-07-11 23:46:31,629 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:46:31,722 INFO L134 CoverageAnalysis]: Checked inductivity of 1704 backedges. 1045 proven. 26 refuted. 0 times theorem prover too weak. 633 trivial. 0 not checked. [2022-07-11 23:46:31,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [875930955] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:46:31,722 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:46:31,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-07-11 23:46:31,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083666479] [2022-07-11 23:46:31,723 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:46:31,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-11 23:46:31,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:46:31,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-11 23:46:31,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-11 23:46:31,725 INFO L87 Difference]: Start difference. First operand 2340 states and 2973 transitions. Second operand has 6 states, 6 states have (on average 39.666666666666664) internal successors, (238), 6 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:46:32,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:46:32,202 INFO L93 Difference]: Finished difference Result 5609 states and 7131 transitions. [2022-07-11 23:46:32,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-11 23:46:32,203 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 39.666666666666664) internal successors, (238), 6 states have internal predecessors, (238), 0 states have call successors, (0), 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 409 [2022-07-11 23:46:32,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:46:32,208 INFO L225 Difference]: With dead ends: 5609 [2022-07-11 23:46:32,208 INFO L226 Difference]: Without dead ends: 3228 [2022-07-11 23:46:32,211 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 824 GetRequests, 818 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-11 23:46:32,211 INFO L413 NwaCegarLoop]: 218 mSDtfsCounter, 586 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 586 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-11 23:46:32,212 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [586 Valid, 397 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-11 23:46:32,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3228 states. [2022-07-11 23:46:32,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3228 to 2400. [2022-07-11 23:46:32,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2400 states, 2399 states have (on average 1.2705293872446852) internal successors, (3048), 2399 states have internal predecessors, (3048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:46:32,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2400 states to 2400 states and 3048 transitions. [2022-07-11 23:46:32,295 INFO L78 Accepts]: Start accepts. Automaton has 2400 states and 3048 transitions. Word has length 409 [2022-07-11 23:46:32,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:46:32,295 INFO L495 AbstractCegarLoop]: Abstraction has 2400 states and 3048 transitions. [2022-07-11 23:46:32,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 39.666666666666664) internal successors, (238), 6 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:46:32,296 INFO L276 IsEmpty]: Start isEmpty. Operand 2400 states and 3048 transitions. [2022-07-11 23:46:32,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 538 [2022-07-11 23:46:32,302 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:46:32,302 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 15, 15, 14, 14, 13, 13, 12, 12, 12, 12, 10, 8, 8, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:46:32,326 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-07-11 23:46:32,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:46:32,526 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:46:32,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:46:32,526 INFO L85 PathProgramCache]: Analyzing trace with hash -50523035, now seen corresponding path program 1 times [2022-07-11 23:46:32,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:46:32,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598739728] [2022-07-11 23:46:32,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:46:32,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:46:32,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:46:32,607 INFO L134 CoverageAnalysis]: Checked inductivity of 3128 backedges. 1661 proven. 0 refuted. 0 times theorem prover too weak. 1467 trivial. 0 not checked. [2022-07-11 23:46:32,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:46:32,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598739728] [2022-07-11 23:46:32,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598739728] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:46:32,608 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:46:32,608 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:46:32,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541493103] [2022-07-11 23:46:32,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:46:32,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:46:32,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:46:32,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:46:32,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:46:32,610 INFO L87 Difference]: Start difference. First operand 2400 states and 3048 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:46:32,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:46:32,736 INFO L93 Difference]: Finished difference Result 4972 states and 6324 transitions. [2022-07-11 23:46:32,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:46:32,737 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 537 [2022-07-11 23:46:32,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:46:32,741 INFO L225 Difference]: With dead ends: 4972 [2022-07-11 23:46:32,741 INFO L226 Difference]: Without dead ends: 2580 [2022-07-11 23:46:32,743 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-11 23:46:32,743 INFO L413 NwaCegarLoop]: 191 mSDtfsCounter, 11 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:46:32,744 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 290 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:46:32,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2580 states. [2022-07-11 23:46:32,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2580 to 2570. [2022-07-11 23:46:32,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2570 states, 2569 states have (on average 1.262358894511483) internal successors, (3243), 2569 states have internal predecessors, (3243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:46:32,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2570 states to 2570 states and 3243 transitions. [2022-07-11 23:46:32,797 INFO L78 Accepts]: Start accepts. Automaton has 2570 states and 3243 transitions. Word has length 537 [2022-07-11 23:46:32,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:46:32,797 INFO L495 AbstractCegarLoop]: Abstraction has 2570 states and 3243 transitions. [2022-07-11 23:46:32,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:46:32,797 INFO L276 IsEmpty]: Start isEmpty. Operand 2570 states and 3243 transitions. [2022-07-11 23:46:32,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 600 [2022-07-11 23:46:32,803 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:46:32,803 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, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:46:32,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-07-11 23:46:32,803 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:46:32,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:46:32,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1600887189, now seen corresponding path program 1 times [2022-07-11 23:46:32,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:46:32,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229054271] [2022-07-11 23:46:32,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:46:32,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:46:32,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:46:32,928 INFO L134 CoverageAnalysis]: Checked inductivity of 4009 backedges. 2315 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2022-07-11 23:46:32,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:46:32,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229054271] [2022-07-11 23:46:32,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229054271] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:46:32,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [711615757] [2022-07-11 23:46:32,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:46:32,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:46:32,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:46:32,932 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-11 23:46:32,960 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-11 23:46:33,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:46:33,090 INFO L263 TraceCheckSpWp]: Trace formula consists of 920 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-11 23:46:33,095 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:46:33,160 INFO L134 CoverageAnalysis]: Checked inductivity of 4009 backedges. 2315 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2022-07-11 23:46:33,161 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:46:33,278 INFO L134 CoverageAnalysis]: Checked inductivity of 4009 backedges. 2315 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2022-07-11 23:46:33,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [711615757] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:46:33,278 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:46:33,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2022-07-11 23:46:33,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214049442] [2022-07-11 23:46:33,279 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:46:33,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-11 23:46:33,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:46:33,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-11 23:46:33,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-07-11 23:46:33,280 INFO L87 Difference]: Start difference. First operand 2570 states and 3243 transitions. Second operand has 8 states, 8 states have (on average 41.5) internal successors, (332), 8 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:46:33,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:46:33,559 INFO L93 Difference]: Finished difference Result 4135 states and 5217 transitions. [2022-07-11 23:46:33,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-11 23:46:33,559 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 41.5) internal successors, (332), 8 states have internal predecessors, (332), 0 states have call successors, (0), 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 599 [2022-07-11 23:46:33,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:46:33,560 INFO L225 Difference]: With dead ends: 4135 [2022-07-11 23:46:33,560 INFO L226 Difference]: Without dead ends: 0 [2022-07-11 23:46:33,564 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1204 GetRequests, 1196 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-07-11 23:46:33,565 INFO L413 NwaCegarLoop]: 151 mSDtfsCounter, 119 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-11 23:46:33,565 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 398 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-11 23:46:33,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-11 23:46:33,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-11 23:46:33,566 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-11 23:46:33,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-11 23:46:33,566 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 599 [2022-07-11 23:46:33,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:46:33,566 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-11 23:46:33,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 41.5) internal successors, (332), 8 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:46:33,566 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-11 23:46:33,566 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-11 23:46:33,569 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-11 23:46:33,599 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-11 23:46:33,785 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,SelfDestructingSolverStorable33 [2022-07-11 23:46:33,787 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-11 23:46:48,901 INFO L899 garLoopResultBuilder]: For program point L531(lines 531 535) no Hoare annotation was computed. [2022-07-11 23:46:48,902 INFO L899 garLoopResultBuilder]: For program point L531-2(lines 531 535) no Hoare annotation was computed. [2022-07-11 23:46:48,902 INFO L899 garLoopResultBuilder]: For program point L399(lines 399 417) no Hoare annotation was computed. [2022-07-11 23:46:48,902 INFO L895 garLoopResultBuilder]: At program point L201(lines 197 562) the Hoare annotation is: (let ((.cse2 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (.cse3 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse0 (<= 8640 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse1 (< |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656))) (or (and (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8640) .cse0 .cse1 .cse2) (and .cse0 .cse1 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (and .cse3 .cse0 .cse1 .cse2) (and (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1) .cse0 .cse1) (and .cse3 .cse0 .cse1 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576)))) [2022-07-11 23:46:48,902 INFO L895 garLoopResultBuilder]: At program point L168(lines 164 573) the Hoare annotation is: (let ((.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))) (.cse6 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse7 (not (= 8497 |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| 8496))) (.cse10 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse11 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656))) (.cse12 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0) .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|) .cse12))) [2022-07-11 23:46:48,903 INFO L895 garLoopResultBuilder]: At program point L135(lines 134 583) 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 (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse5 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8640)) (.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 (<= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse10 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8640) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (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 .cse9 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0) .cse10))) [2022-07-11 23:46:48,903 INFO L899 garLoopResultBuilder]: For program point L102(lines 102 104) no Hoare annotation was computed. [2022-07-11 23:46:48,903 INFO L899 garLoopResultBuilder]: For program point L499(lines 499 502) no Hoare annotation was computed. [2022-07-11 23:46:48,903 INFO L899 garLoopResultBuilder]: For program point L400(lines 400 406) no Hoare annotation was computed. [2022-07-11 23:46:48,903 INFO L902 garLoopResultBuilder]: At program point L632(lines 623 634) the Hoare annotation is: true [2022-07-11 23:46:48,903 INFO L899 garLoopResultBuilder]: For program point L203(lines 203 560) no Hoare annotation was computed. [2022-07-11 23:46:48,903 INFO L899 garLoopResultBuilder]: For program point L170(lines 170 571) no Hoare annotation was computed. [2022-07-11 23:46:48,904 INFO L899 garLoopResultBuilder]: For program point L137(lines 137 582) no Hoare annotation was computed. [2022-07-11 23:46:48,904 INFO L899 garLoopResultBuilder]: For program point L600(lines 600 604) no Hoare annotation was computed. [2022-07-11 23:46:48,904 INFO L899 garLoopResultBuilder]: For program point L468(lines 468 470) no Hoare annotation was computed. [2022-07-11 23:46:48,904 INFO L899 garLoopResultBuilder]: For program point L270(lines 270 272) no Hoare annotation was computed. [2022-07-11 23:46:48,904 INFO L899 garLoopResultBuilder]: For program point L237(lines 237 248) no Hoare annotation was computed. [2022-07-11 23:46:48,904 INFO L899 garLoopResultBuilder]: For program point L237-2(lines 219 553) no Hoare annotation was computed. [2022-07-11 23:46:48,904 INFO L899 garLoopResultBuilder]: For program point L304(lines 304 308) no Hoare annotation was computed. [2022-07-11 23:46:48,904 INFO L899 garLoopResultBuilder]: For program point L304-2(lines 304 308) no Hoare annotation was computed. [2022-07-11 23:46:48,905 INFO L899 garLoopResultBuilder]: For program point L437-1(lines 437 445) no Hoare annotation was computed. [2022-07-11 23:46:48,905 INFO L899 garLoopResultBuilder]: For program point L239(lines 239 242) no Hoare annotation was computed. [2022-07-11 23:46:48,905 INFO L899 garLoopResultBuilder]: For program point L206(lines 206 559) no Hoare annotation was computed. [2022-07-11 23:46:48,905 INFO L899 garLoopResultBuilder]: For program point L173(lines 173 570) no Hoare annotation was computed. [2022-07-11 23:46:48,905 INFO L899 garLoopResultBuilder]: For program point L140(lines 140 581) no Hoare annotation was computed. [2022-07-11 23:46:48,905 INFO L899 garLoopResultBuilder]: For program point L504(lines 504 510) no Hoare annotation was computed. [2022-07-11 23:46:48,905 INFO L895 garLoopResultBuilder]: At program point L207(lines 203 560) 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| 8481))) (.cse2 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse4 (<= 8640 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse5 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse7 (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|)) (.cse6 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576) .cse6) (and .cse0 .cse1 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1) .cse3 .cse4 .cse5 .cse7 .cse6) (and .cse0 .cse1 .cse3 .cse4 .cse5 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0) .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not .cse7) .cse6))) [2022-07-11 23:46:48,906 INFO L895 garLoopResultBuilder]: At program point L174(lines 170 571) the Hoare annotation is: (let ((.cse0 (not (<= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse2 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse3 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse4 (not (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8496)))) (or (and .cse0 .cse1 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse2 .cse3 .cse4 (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (and .cse0 .cse1 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1) .cse2 .cse3 .cse4))) [2022-07-11 23:46:48,906 INFO L899 garLoopResultBuilder]: For program point L440(lines 440 443) no Hoare annotation was computed. [2022-07-11 23:46:48,906 INFO L899 garLoopResultBuilder]: For program point L341(lines 341 379) no Hoare annotation was computed. [2022-07-11 23:46:48,906 INFO L899 garLoopResultBuilder]: For program point L209(lines 209 558) no Hoare annotation was computed. [2022-07-11 23:46:48,906 INFO L899 garLoopResultBuilder]: For program point L176(lines 176 569) no Hoare annotation was computed. [2022-07-11 23:46:48,906 INFO L899 garLoopResultBuilder]: For program point L143(lines 143 580) no Hoare annotation was computed. [2022-07-11 23:46:48,907 INFO L895 garLoopResultBuilder]: At program point L110-2(lines 110 609) the Hoare annotation is: (let ((.cse6 (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse25 (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse19 (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (let ((.cse0 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8640)) (.cse18 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse26 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse4 (<= 8640 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse31 (<= 8672 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse30 (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse3 (not .cse19)) (.cse20 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) (.cse21 (not (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8496))) (.cse15 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) (.cse22 (< 8496 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|)) (.cse23 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576)) (.cse7 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse1 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8448)) (.cse28 (= 3 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|)) (.cse2 (<= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse12 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse8 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse9 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse10 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse11 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse24 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse13 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse5 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8640)) (.cse16 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse29 (not .cse25)) (.cse27 (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 3)) (.cse14 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse17 (not .cse6))) (or (and (<= 8640 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|) .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse4 .cse5 .cse3) (and .cse6 .cse7) (and .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse2 .cse15) (and .cse8 .cse9 .cse10 .cse11 .cse13 .cse5 .cse16 .cse14 .cse2 .cse7 .cse17) (and .cse18 .cse12 .cse4 .cse19 .cse20) (and .cse21 .cse22 .cse23 .cse7 .cse15) (and .cse8 .cse9 .cse10 .cse11 .cse24 (< |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576) .cse13 .cse14 .cse19 .cse2 .cse23) (and .cse24 .cse19 .cse25) (and .cse24 .cse18 .cse26 .cse4 .cse23 .cse20) (and .cse0 .cse27) (and .cse1 .cse28 .cse19 .cse2 .cse7) (and .cse12 .cse1 .cse22 .cse2 .cse23) (and .cse18 .cse4 .cse7 .cse20) (and .cse24 .cse18 .cse26 .cse4 .cse3 .cse20) (and .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse5 .cse21 .cse14) (and (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8528) .cse8 .cse9 .cse10 .cse11 .cse24 .cse13 .cse5 .cse16 .cse29 .cse21 .cse14 .cse19 .cse17) (and .cse30 .cse1 .cse28 .cse19 .cse2) (and .cse24 .cse1 .cse22 .cse19 .cse2 .cse23) (and .cse31 .cse30 .cse23 .cse20) (and .cse8 .cse9 .cse10 .cse11 .cse24 (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8512) .cse13 .cse5 .cse16 .cse29 .cse21 .cse14 .cse19 .cse17) (and .cse31 .cse30 .cse3 .cse20) (and .cse8 .cse9 .cse10 .cse11 .cse13 .cse5 .cse16 .cse27 .cse14 .cse7 .cse17) (and .cse8 .cse9 .cse10 .cse11 .cse24 .cse13 .cse5 .cse16 .cse29 .cse21 .cse14 .cse19 .cse23 .cse17) (and .cse12 .cse21 .cse22 .cse23 .cse15) (and .cse24 (< 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|) .cse22 .cse19 .cse23 .cse15) (and .cse24 .cse6 .cse19) (and .cse1 .cse22 .cse2 .cse23 .cse7) (and .cse12 .cse1 .cse28 .cse19 .cse2) (and .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse5 .cse27 .cse14) (and .cse8 .cse9 .cse10 .cse11 .cse24 .cse13 .cse5 .cse16 .cse29 .cse27 .cse14 .cse17)))) [2022-07-11 23:46:48,907 INFO L899 garLoopResultBuilder]: For program point L507(lines 507 509) no Hoare annotation was computed. [2022-07-11 23:46:48,907 INFO L899 garLoopResultBuilder]: For program point L507-2(lines 219 553) no Hoare annotation was computed. [2022-07-11 23:46:48,907 INFO L895 garLoopResultBuilder]: At program point L408(lines 399 417) the Hoare annotation is: (let ((.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))) (.cse6 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse7 (not (= 8497 |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| 8496))) (.cse10 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse11 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656))) (.cse12 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0) .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|) .cse12))) [2022-07-11 23:46:48,907 INFO L899 garLoopResultBuilder]: For program point L243(lines 243 246) no Hoare annotation was computed. [2022-07-11 23:46:48,907 INFO L895 garLoopResultBuilder]: At program point L177(lines 176 569) the Hoare annotation is: (let ((.cse6 (< 8496 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|)) (.cse7 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576)) (.cse4 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse5 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse0 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8448)) (.cse3 (= 3 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|)) (.cse2 (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|)) (.cse1 (<= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (or (and (<= 8640 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|) (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8640) .cse0 .cse1 (not .cse2)) (and .cse0 .cse3 .cse2 .cse1 .cse4) (and .cse5 .cse0 .cse6 .cse1 .cse7) (and (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse0 .cse3 .cse2 .cse1) (and (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse0 .cse6 .cse2 .cse1 .cse7) (and .cse0 .cse6 .cse1 .cse7 .cse4) (and .cse5 .cse0 .cse3 .cse2 .cse1))) [2022-07-11 23:46:48,908 INFO L895 garLoopResultBuilder]: At program point L144(lines 137 582) the Hoare annotation is: (let ((.cse0 (not (<= 8576 |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 (= 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 (<= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse10 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0) .cse10) (and .cse1 .cse2 .cse3 .cse4 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) (< |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576) .cse5 .cse6 .cse7 .cse8 (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|) .cse9 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576) .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) [2022-07-11 23:46:48,908 INFO L899 garLoopResultBuilder]: For program point L111(line 111) no Hoare annotation was computed. [2022-07-11 23:46:48,908 INFO L899 garLoopResultBuilder]: For program point L541(lines 541 547) no Hoare annotation was computed. [2022-07-11 23:46:48,908 INFO L899 garLoopResultBuilder]: For program point L541-1(lines 541 547) no Hoare annotation was computed. [2022-07-11 23:46:48,908 INFO L899 garLoopResultBuilder]: For program point L344(lines 344 378) no Hoare annotation was computed. [2022-07-11 23:46:48,908 INFO L899 garLoopResultBuilder]: For program point L344-1(lines 344 378) no Hoare annotation was computed. [2022-07-11 23:46:48,908 INFO L899 garLoopResultBuilder]: For program point L212(lines 212 557) no Hoare annotation was computed. [2022-07-11 23:46:48,909 INFO L899 garLoopResultBuilder]: For program point L179(lines 179 568) no Hoare annotation was computed. [2022-07-11 23:46:48,909 INFO L899 garLoopResultBuilder]: For program point L146(lines 146 579) no Hoare annotation was computed. [2022-07-11 23:46:48,909 INFO L899 garLoopResultBuilder]: For program point L113(lines 113 590) no Hoare annotation was computed. [2022-07-11 23:46:48,909 INFO L899 garLoopResultBuilder]: For program point L477(lines 477 479) no Hoare annotation was computed. [2022-07-11 23:46:48,909 INFO L899 garLoopResultBuilder]: For program point L411(lines 411 413) no Hoare annotation was computed. [2022-07-11 23:46:48,909 INFO L899 garLoopResultBuilder]: For program point L345(lines 345 375) no Hoare annotation was computed. [2022-07-11 23:46:48,909 INFO L895 garLoopResultBuilder]: At program point L213(lines 209 558) the Hoare annotation is: (let ((.cse1 (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse0 (<= 8672 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse2 (not (= 12292 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse3 (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (or (and .cse0 .cse1 .cse2 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576)) (and .cse0 .cse2 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (and .cse0 .cse1 .cse2 (not .cse3)) (and .cse0 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1) .cse2 .cse3))) [2022-07-11 23:46:48,910 INFO L895 garLoopResultBuilder]: At program point L114(lines 113 590) the Hoare annotation is: false [2022-07-11 23:46:48,910 INFO L902 garLoopResultBuilder]: At program point L610(lines 109 611) the Hoare annotation is: true [2022-07-11 23:46:48,910 INFO L899 garLoopResultBuilder]: For program point L544(lines 544 546) no Hoare annotation was computed. [2022-07-11 23:46:48,910 INFO L899 garLoopResultBuilder]: For program point L215(lines 215 556) no Hoare annotation was computed. [2022-07-11 23:46:48,910 INFO L899 garLoopResultBuilder]: For program point L182(lines 182 567) no Hoare annotation was computed. [2022-07-11 23:46:48,910 INFO L899 garLoopResultBuilder]: For program point L149(lines 149 578) no Hoare annotation was computed. [2022-07-11 23:46:48,910 INFO L899 garLoopResultBuilder]: For program point L116(lines 116 589) no Hoare annotation was computed. [2022-07-11 23:46:48,910 INFO L899 garLoopResultBuilder]: For program point L315(lines 315 322) no Hoare annotation was computed. [2022-07-11 23:46:48,911 INFO L899 garLoopResultBuilder]: For program point L315-2(lines 315 322) no Hoare annotation was computed. [2022-07-11 23:46:48,911 INFO L895 garLoopResultBuilder]: At program point L216(lines 215 556) the Hoare annotation is: (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) [2022-07-11 23:46:48,911 INFO L895 garLoopResultBuilder]: At program point L183(lines 179 568) the Hoare annotation is: (let ((.cse0 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse2 (not (<= 8640 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse3 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse4 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse5 (not (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8496))) (.cse6 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and .cse0 .cse1 .cse2 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1) .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse3 .cse4 .cse5 (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|) (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576) .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0) .cse6))) [2022-07-11 23:46:48,911 INFO L895 garLoopResultBuilder]: At program point L150(lines 146 579) the Hoare annotation is: (let ((.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 (< |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) (.cse6 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse7 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse8 (not (= 8544 |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))) (.cse12 (<= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse13 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576)) (.cse14 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|) .cse12 .cse13 .cse14) (and (not (<= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0) .cse14))) [2022-07-11 23:46:48,911 INFO L899 garLoopResultBuilder]: For program point L350(lines 350 373) no Hoare annotation was computed. [2022-07-11 23:46:48,911 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-11 23:46:48,912 INFO L895 garLoopResultBuilder]: At program point L218(lines 217 556) the Hoare annotation is: (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) [2022-07-11 23:46:48,912 INFO L899 garLoopResultBuilder]: For program point L185(lines 185 566) no Hoare annotation was computed. [2022-07-11 23:46:48,912 INFO L899 garLoopResultBuilder]: For program point L152(lines 152 577) no Hoare annotation was computed. [2022-07-11 23:46:48,912 INFO L899 garLoopResultBuilder]: For program point L119(lines 119 588) no Hoare annotation was computed. [2022-07-11 23:46:48,912 INFO L899 garLoopResultBuilder]: For program point L615(lines 615 617) no Hoare annotation was computed. [2022-07-11 23:46:48,912 INFO L899 garLoopResultBuilder]: For program point L615-2(lines 615 617) no Hoare annotation was computed. [2022-07-11 23:46:48,912 INFO L899 garLoopResultBuilder]: For program point L516(lines 516 519) no Hoare annotation was computed. [2022-07-11 23:46:48,912 INFO L899 garLoopResultBuilder]: For program point L285(lines 285 287) no Hoare annotation was computed. [2022-07-11 23:46:48,913 INFO L899 garLoopResultBuilder]: For program point L285-2(lines 219 553) no Hoare annotation was computed. [2022-07-11 23:46:48,913 INFO L899 garLoopResultBuilder]: For program point L451(lines 451 453) no Hoare annotation was computed. [2022-07-11 23:46:48,913 INFO L899 garLoopResultBuilder]: For program point L319(lines 319 321) no Hoare annotation was computed. [2022-07-11 23:46:48,913 INFO L899 garLoopResultBuilder]: For program point L353(lines 353 357) no Hoare annotation was computed. [2022-07-11 23:46:48,913 INFO L899 garLoopResultBuilder]: For program point L353-2(lines 353 357) no Hoare annotation was computed. [2022-07-11 23:46:48,913 INFO L899 garLoopResultBuilder]: For program point L254(lines 254 264) no Hoare annotation was computed. [2022-07-11 23:46:48,913 INFO L899 garLoopResultBuilder]: For program point L188(lines 188 565) no Hoare annotation was computed. [2022-07-11 23:46:48,913 INFO L899 garLoopResultBuilder]: For program point L155(lines 155 576) no Hoare annotation was computed. [2022-07-11 23:46:48,914 INFO L899 garLoopResultBuilder]: For program point L122(lines 122 587) no Hoare annotation was computed. [2022-07-11 23:46:48,914 INFO L899 garLoopResultBuilder]: For program point L486(lines 486 488) no Hoare annotation was computed. [2022-07-11 23:46:48,914 INFO L899 garLoopResultBuilder]: For program point L387(lines 387 419) no Hoare annotation was computed. [2022-07-11 23:46:48,914 INFO L899 garLoopResultBuilder]: For program point L255(lines 255 258) no Hoare annotation was computed. [2022-07-11 23:46:48,914 INFO L895 garLoopResultBuilder]: At program point L222(lines 116 589) the Hoare annotation is: false [2022-07-11 23:46:48,914 INFO L895 garLoopResultBuilder]: At program point L189(lines 185 566) the Hoare annotation is: (let ((.cse0 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse2 (not (<= 8640 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse3 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse4 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse5 (not (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8496))) (.cse6 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and .cse0 .cse1 .cse2 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1) .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse3 .cse4 .cse5 (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|) (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576) .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0) .cse6))) [2022-07-11 23:46:48,914 INFO L895 garLoopResultBuilder]: At program point L156(lines 152 577) the Hoare annotation is: (let ((.cse0 (not (<= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse3 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse4 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse5 (not (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8496))) (.cse6 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and .cse0 .cse1 .cse2 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1) .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0) .cse6) (and .cse0 .cse1 .cse2 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse3 .cse4 .cse5 (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|) .cse6))) [2022-07-11 23:46:48,915 INFO L899 garLoopResultBuilder]: For program point L454(lines 454 463) no Hoare annotation was computed. [2022-07-11 23:46:48,915 INFO L899 garLoopResultBuilder]: For program point L388(lines 388 394) no Hoare annotation was computed. [2022-07-11 23:46:48,915 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-11 23:46:48,915 INFO L902 garLoopResultBuilder]: At program point L620(lines 22 622) the Hoare annotation is: true [2022-07-11 23:46:48,915 INFO L895 garLoopResultBuilder]: At program point L554(lines 110 609) the Hoare annotation is: (let ((.cse6 (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse25 (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse19 (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (let ((.cse0 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8640)) (.cse18 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse26 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse4 (<= 8640 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse31 (<= 8672 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse30 (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse3 (not .cse19)) (.cse20 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) (.cse21 (not (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8496))) (.cse15 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) (.cse22 (< 8496 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|)) (.cse23 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576)) (.cse7 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse1 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8448)) (.cse28 (= 3 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|)) (.cse2 (<= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse12 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse8 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse9 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse10 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse11 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse24 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse13 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse5 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8640)) (.cse16 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse29 (not .cse25)) (.cse27 (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 3)) (.cse14 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse17 (not .cse6))) (or (and (<= 8640 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|) .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse4 .cse5 .cse3) (and .cse6 .cse7) (and .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse2 .cse15) (and .cse8 .cse9 .cse10 .cse11 .cse13 .cse5 .cse16 .cse14 .cse2 .cse7 .cse17) (and .cse18 .cse12 .cse4 .cse19 .cse20) (and .cse21 .cse22 .cse23 .cse7 .cse15) (and .cse8 .cse9 .cse10 .cse11 .cse24 (< |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576) .cse13 .cse14 .cse19 .cse2 .cse23) (and .cse24 .cse19 .cse25) (and .cse24 .cse18 .cse26 .cse4 .cse23 .cse20) (and .cse0 .cse27) (and .cse1 .cse28 .cse19 .cse2 .cse7) (and .cse12 .cse1 .cse22 .cse2 .cse23) (and .cse18 .cse4 .cse7 .cse20) (and .cse24 .cse18 .cse26 .cse4 .cse3 .cse20) (and .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse5 .cse21 .cse14) (and (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8528) .cse8 .cse9 .cse10 .cse11 .cse24 .cse13 .cse5 .cse16 .cse29 .cse21 .cse14 .cse19 .cse17) (and .cse30 .cse1 .cse28 .cse19 .cse2) (and .cse24 .cse1 .cse22 .cse19 .cse2 .cse23) (and .cse31 .cse30 .cse23 .cse20) (and .cse8 .cse9 .cse10 .cse11 .cse24 (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8512) .cse13 .cse5 .cse16 .cse29 .cse21 .cse14 .cse19 .cse17) (and .cse31 .cse30 .cse3 .cse20) (and .cse8 .cse9 .cse10 .cse11 .cse13 .cse5 .cse16 .cse27 .cse14 .cse7 .cse17) (and .cse8 .cse9 .cse10 .cse11 .cse24 .cse13 .cse5 .cse16 .cse29 .cse21 .cse14 .cse19 .cse23 .cse17) (and .cse12 .cse21 .cse22 .cse23 .cse15) (and .cse24 (< 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|) .cse22 .cse19 .cse23 .cse15) (and .cse24 .cse6 .cse19) (and .cse1 .cse22 .cse2 .cse23 .cse7) (and .cse12 .cse1 .cse28 .cse19 .cse2) (and .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse5 .cse27 .cse14) (and .cse8 .cse9 .cse10 .cse11 .cse24 .cse13 .cse5 .cse16 .cse29 .cse27 .cse14 .cse17)))) [2022-07-11 23:46:48,915 INFO L899 garLoopResultBuilder]: For program point L191(lines 191 564) no Hoare annotation was computed. [2022-07-11 23:46:48,916 INFO L899 garLoopResultBuilder]: For program point L158(lines 158 575) no Hoare annotation was computed. [2022-07-11 23:46:48,916 INFO L899 garLoopResultBuilder]: For program point L125(lines 125 586) no Hoare annotation was computed. [2022-07-11 23:46:48,916 INFO L899 garLoopResultBuilder]: For program point L489(lines 489 493) no Hoare annotation was computed. [2022-07-11 23:46:48,916 INFO L899 garLoopResultBuilder]: For program point L489-2(lines 489 493) no Hoare annotation was computed. [2022-07-11 23:46:48,916 INFO L899 garLoopResultBuilder]: For program point L93(lines 93 99) no Hoare annotation was computed. [2022-07-11 23:46:48,916 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-11 23:46:48,916 INFO L899 garLoopResultBuilder]: For program point L524(lines 524 526) no Hoare annotation was computed. [2022-07-11 23:46:48,916 INFO L899 garLoopResultBuilder]: For program point L458(lines 458 460) no Hoare annotation was computed. [2022-07-11 23:46:48,917 INFO L899 garLoopResultBuilder]: For program point L227(lines 227 229) no Hoare annotation was computed. [2022-07-11 23:46:48,917 INFO L899 garLoopResultBuilder]: For program point L194(lines 194 563) no Hoare annotation was computed. [2022-07-11 23:46:48,917 INFO L899 garLoopResultBuilder]: For program point L161(lines 161 574) no Hoare annotation was computed. [2022-07-11 23:46:48,917 INFO L899 garLoopResultBuilder]: For program point L227-2(lines 227 229) no Hoare annotation was computed. [2022-07-11 23:46:48,917 INFO L899 garLoopResultBuilder]: For program point L128(lines 128 585) no Hoare annotation was computed. [2022-07-11 23:46:48,917 INFO L899 garLoopResultBuilder]: For program point L591(lines 591 607) no Hoare annotation was computed. [2022-07-11 23:46:48,917 INFO L895 garLoopResultBuilder]: At program point L525(lines 83 621) the Hoare annotation is: false [2022-07-11 23:46:48,917 INFO L895 garLoopResultBuilder]: At program point L195(lines 191 564) the Hoare annotation is: (let ((.cse0 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse2 (not (<= 8640 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse3 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse4 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse5 (not (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8496))) (.cse6 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and .cse0 .cse1 .cse2 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1) .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse3 .cse4 .cse5 (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|) (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576) .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0) .cse6))) [2022-07-11 23:46:48,918 INFO L895 garLoopResultBuilder]: At program point L162(lines 158 575) the Hoare annotation is: (let ((.cse0 (not (<= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse3 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse4 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse5 (not (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8496))) (.cse6 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and .cse0 .cse1 .cse2 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1) .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0) .cse6) (and .cse0 .cse1 .cse2 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse3 .cse4 .cse5 (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|) .cse6))) [2022-07-11 23:46:48,918 INFO L899 garLoopResultBuilder]: For program point L96(lines 96 98) no Hoare annotation was computed. [2022-07-11 23:46:48,918 INFO L899 garLoopResultBuilder]: For program point L96-2(lines 93 99) no Hoare annotation was computed. [2022-07-11 23:46:48,918 INFO L899 garLoopResultBuilder]: For program point L592(lines 592 606) no Hoare annotation was computed. [2022-07-11 23:46:48,918 INFO L899 garLoopResultBuilder]: For program point L361(lines 361 369) no Hoare annotation was computed. [2022-07-11 23:46:48,918 INFO L899 garLoopResultBuilder]: For program point L593(lines 593 598) no Hoare annotation was computed. [2022-07-11 23:46:48,918 INFO L899 garLoopResultBuilder]: For program point L527(lines 527 529) no Hoare annotation was computed. [2022-07-11 23:46:48,918 INFO L899 garLoopResultBuilder]: For program point L593-2(lines 592 606) no Hoare annotation was computed. [2022-07-11 23:46:48,919 INFO L895 garLoopResultBuilder]: At program point L362(lines 338 380) the Hoare annotation is: (let ((.cse0 (not (<= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse3 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse4 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse5 (not (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8496))) (.cse6 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and .cse0 .cse1 .cse2 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1) .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0) .cse6) (and .cse0 .cse1 .cse2 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse3 .cse4 .cse5 (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|) .cse6))) [2022-07-11 23:46:48,919 INFO L899 garLoopResultBuilder]: For program point L197(lines 197 562) no Hoare annotation was computed. [2022-07-11 23:46:48,919 INFO L899 garLoopResultBuilder]: For program point L164(lines 164 573) no Hoare annotation was computed. [2022-07-11 23:46:48,919 INFO L899 garLoopResultBuilder]: For program point L131(lines 131 584) no Hoare annotation was computed. [2022-07-11 23:46:48,919 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-11 23:46:48,919 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 619) no Hoare annotation was computed. [2022-07-11 23:46:48,920 INFO L899 garLoopResultBuilder]: For program point L429(lines 429 431) no Hoare annotation was computed. [2022-07-11 23:46:48,920 INFO L895 garLoopResultBuilder]: At program point L396(lines 387 419) the Hoare annotation is: (let ((.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))) (.cse6 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse7 (not (= 8497 |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| 8496))) (.cse10 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse11 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656))) (.cse12 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0) .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|) .cse12))) [2022-07-11 23:46:48,920 INFO L895 garLoopResultBuilder]: At program point L132(lines 128 585) the Hoare annotation is: false [2022-07-11 23:46:48,920 INFO L899 garLoopResultBuilder]: For program point L595(lines 595 597) no Hoare annotation was computed. [2022-07-11 23:46:48,920 INFO L899 garLoopResultBuilder]: For program point L364(lines 364 366) no Hoare annotation was computed. [2022-07-11 23:46:48,920 INFO L899 garLoopResultBuilder]: For program point L298(lines 298 300) no Hoare annotation was computed. [2022-07-11 23:46:48,920 INFO L899 garLoopResultBuilder]: For program point L232(lines 232 234) no Hoare annotation was computed. [2022-07-11 23:46:48,920 INFO L899 garLoopResultBuilder]: For program point L298-2(lines 219 553) no Hoare annotation was computed. [2022-07-11 23:46:48,921 INFO L899 garLoopResultBuilder]: For program point L332(lines 332 336) no Hoare annotation was computed. [2022-07-11 23:46:48,921 INFO L899 garLoopResultBuilder]: For program point L332-2(lines 219 553) no Hoare annotation was computed. [2022-07-11 23:46:48,921 INFO L899 garLoopResultBuilder]: For program point L200(lines 200 561) no Hoare annotation was computed. [2022-07-11 23:46:48,921 INFO L899 garLoopResultBuilder]: For program point L167(lines 167 572) no Hoare annotation was computed. [2022-07-11 23:46:48,921 INFO L899 garLoopResultBuilder]: For program point L134(lines 134 583) no Hoare annotation was computed. [2022-07-11 23:46:48,921 INFO L899 garLoopResultBuilder]: For program point L101(lines 101 105) no Hoare annotation was computed. [2022-07-11 23:46:48,921 INFO L899 garLoopResultBuilder]: For program point L101-1(lines 83 621) no Hoare annotation was computed. [2022-07-11 23:46:48,924 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, 1] [2022-07-11 23:46:48,926 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-11 23:46:48,962 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.07 11:46:48 BoogieIcfgContainer [2022-07-11 23:46:48,963 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-11 23:46:48,963 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-11 23:46:48,963 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-11 23:46:48,964 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-11 23:46:48,964 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 11:46:21" (3/4) ... [2022-07-11 23:46:48,967 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-11 23:46:48,980 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2022-07-11 23:46:48,981 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-07-11 23:46:48,981 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-07-11 23:46:48,982 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-11 23:46:49,056 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-11 23:46:49,056 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-11 23:46:49,056 INFO L158 Benchmark]: Toolchain (without parser) took 28978.72ms. Allocated memory was 94.4MB in the beginning and 490.7MB in the end (delta: 396.4MB). Free memory was 71.3MB in the beginning and 434.5MB in the end (delta: -363.2MB). Peak memory consumption was 35.6MB. Max. memory is 16.1GB. [2022-07-11 23:46:49,057 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 73.4MB. Free memory is still 42.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-11 23:46:49,057 INFO L158 Benchmark]: CACSL2BoogieTranslator took 373.27ms. Allocated memory is still 94.4MB. Free memory was 71.1MB in the beginning and 55.9MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-07-11 23:46:49,057 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.44ms. Allocated memory is still 94.4MB. Free memory was 55.8MB in the beginning and 52.9MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-11 23:46:49,057 INFO L158 Benchmark]: Boogie Preprocessor took 26.76ms. Allocated memory is still 94.4MB. Free memory was 52.9MB in the beginning and 50.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-11 23:46:49,058 INFO L158 Benchmark]: RCFGBuilder took 571.14ms. Allocated memory is still 94.4MB. Free memory was 50.8MB in the beginning and 56.4MB in the end (delta: -5.6MB). Peak memory consumption was 23.0MB. Max. memory is 16.1GB. [2022-07-11 23:46:49,058 INFO L158 Benchmark]: TraceAbstraction took 27850.34ms. Allocated memory was 94.4MB in the beginning and 490.7MB in the end (delta: 396.4MB). Free memory was 56.0MB in the beginning and 441.8MB in the end (delta: -385.8MB). Peak memory consumption was 305.1MB. Max. memory is 16.1GB. [2022-07-11 23:46:49,058 INFO L158 Benchmark]: Witness Printer took 92.66ms. Allocated memory is still 490.7MB. Free memory was 441.8MB in the beginning and 434.5MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-11 23:46:49,059 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.19ms. Allocated memory is still 73.4MB. Free memory is still 42.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 373.27ms. Allocated memory is still 94.4MB. Free memory was 71.1MB in the beginning and 55.9MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.44ms. Allocated memory is still 94.4MB. Free memory was 55.8MB in the beginning and 52.9MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 26.76ms. Allocated memory is still 94.4MB. Free memory was 52.9MB in the beginning and 50.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 571.14ms. Allocated memory is still 94.4MB. Free memory was 50.8MB in the beginning and 56.4MB in the end (delta: -5.6MB). Peak memory consumption was 23.0MB. Max. memory is 16.1GB. * TraceAbstraction took 27850.34ms. Allocated memory was 94.4MB in the beginning and 490.7MB in the end (delta: 396.4MB). Free memory was 56.0MB in the beginning and 441.8MB in the end (delta: -385.8MB). Peak memory consumption was 305.1MB. Max. memory is 16.1GB. * Witness Printer took 92.66ms. Allocated memory is still 490.7MB. Free memory was 441.8MB in the beginning and 434.5MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 619]: 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, 141 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 27.8s, OverallIterations: 34, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 5.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 15.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4953 SdHoareTripleChecker+Valid, 3.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4953 mSDsluCounter, 10153 SdHoareTripleChecker+Invalid, 2.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3407 mSDsCounter, 1020 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4114 IncrementalHoareTripleChecker+Invalid, 5134 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1020 mSolverCounterUnsat, 6746 mSDtfsCounter, 4114 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3496 GetRequests, 3436 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4524occurred in iteration=27, InterpolantAutomatonStates: 119, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.8s AutomataMinimizationTime, 34 MinimizatonAttempts, 6551 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 28 LocationsWithAnnotation, 28 PreInvPairs, 235 NumberOfFragments, 3584 HoareAnnotationTreeSize, 28 FomulaSimplifications, 59890 FormulaSimplificationTreeSizeReduction, 6.4s HoareSimplificationTime, 28 FomulaSimplificationsInter, 208853 FormulaSimplificationTreeSizeReductionInter, 8.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 8782 NumberOfCodeBlocks, 8782 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 10232 ConstructedInterpolants, 0 QuantifiedInterpolants, 14466 SizeOfPredicates, 4 NumberOfNonLiveVariables, 3095 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 43 InterpolantComputations, 30 PerfectInterpolantSequences, 34894/35202 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: 83]: Loop Invariant Derived loop invariant: 0 - 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)) && !(12292 == s__state)) && !(s__state <= 8496)) && !(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)) && !(s__state == 8657)) && blastFlag == 1) && !(s__state == 8672)) && !(8497 == s__state)) && !(12292 == s__state)) && !(s__state <= 8496)) && !(s__state == 8480)) && !(s__state == 8656)) && !(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)) && !(12292 == s__state)) && !(s__state <= 8496)) && !(s__state == 8480)) && !(s__state == 8656)) && 0 == s__hit) && !(8560 == s__state)) - InvariantResult [Line: 134]: Loop Invariant Derived loop invariant: (((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(8497 == s__state)) && s__s3__tmp__next_state___0 <= 8640) && s__state <= 8640) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && 8448 <= s__state) && !(8560 == s__state)) || (((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(8497 == s__state)) && s__state <= 8640) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && 8448 <= s__state) && !(8560 == s__state))) || (((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && blastFlag == 1) && !(8497 == s__state)) && s__state <= 8640) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && 8448 <= s__state) && !(8560 == s__state))) || (((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(8497 == s__state)) && s__state <= 8640) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && 8448 <= s__state) && blastFlag == 0) && !(8560 == s__state)) - InvariantResult [Line: 215]: Loop Invariant Derived loop invariant: !(s__state == 8672) - InvariantResult [Line: 203]: Loop Invariant Derived loop invariant: (((((((((!(8448 == s__state) && !(s__state == 8481)) && 2 == blastFlag) && !(s__state == 8672)) && 8640 <= s__state) && !(s__state == 8480)) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8672) || (((((((!(8448 == s__state) && !(s__state == 8481)) && blastFlag == 1) && !(s__state == 8672)) && 8640 <= s__state) && !(s__state == 8480)) && 0 == s__hit) && s__state <= 8672)) || ((((((!(8448 == s__state) && !(s__state == 8481)) && !(s__state == 8672)) && 8640 <= s__state) && !(s__state == 8480)) && blastFlag == 0) && s__state <= 8672)) || (((((((!(8448 == s__state) && !(s__state == 8481)) && 2 == blastFlag) && !(s__state == 8672)) && 8640 <= s__state) && !(s__state == 8480)) && !(0 == s__hit)) && s__state <= 8672) - InvariantResult [Line: 399]: 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)) && !(12292 == s__state)) && !(s__state <= 8496)) && !(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)) && !(s__state == 8657)) && blastFlag == 1) && !(s__state == 8672)) && !(8497 == s__state)) && !(12292 == s__state)) && !(s__state <= 8496)) && !(s__state == 8480)) && !(s__state == 8656)) && !(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)) && !(12292 == s__state)) && !(s__state <= 8496)) && !(s__state == 8480)) && !(s__state == 8656)) && 0 == s__hit) && !(8560 == s__state)) - InvariantResult [Line: 191]: Loop Invariant Derived loop invariant: ((((((((!(s__state == 8561) && !(s__state == 8545)) && !(8640 <= s__state)) && blastFlag == 1) && !(8497 == s__state)) && !(8544 == s__state)) && !(s__state <= 8496)) && !(8560 == s__state)) || (((((((((!(s__state == 8561) && !(s__state == 8545)) && !(8640 <= s__state)) && 2 == blastFlag) && !(8497 == s__state)) && !(8544 == s__state)) && !(s__state <= 8496)) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8576) && !(8560 == s__state))) || (((((((!(s__state == 8561) && !(s__state == 8545)) && !(8640 <= s__state)) && !(8497 == s__state)) && !(8544 == s__state)) && !(s__state <= 8496)) && blastFlag == 0) && !(8560 == s__state)) - InvariantResult [Line: 137]: Loop Invariant Derived loop invariant: ((((((((((((!(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)) && 8448 <= s__state) && blastFlag == 0) && !(8560 == s__state)) || (((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && s__state < 8576) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && 0 == s__hit) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && !(8560 == s__state))) || (((((((((((!(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)) && 8448 <= s__state) && !(8560 == s__state)) - InvariantResult [Line: 217]: Loop Invariant Derived loop invariant: !(s__state == 8672) - InvariantResult [Line: 110]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((8640 <= s__s3__tmp__next_state___0 && s__s3__tmp__next_state___0 <= 8640) && s__state <= 8448) && 8448 <= s__state) && !(0 == s__hit)) || (((s__s3__tmp__next_state___0 <= 8640 && 8640 <= s__state) && s__state <= 8640) && !(0 == s__hit))) || (8560 == s__state && blastFlag == 0)) || ((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && blastFlag == 1) && !(8497 == s__state)) && !(s__state == 8480)) && 8448 <= s__state) && s__state <= 8576)) || ((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(8497 == s__state)) && s__state <= 8640) && !(8496 == s__state)) && !(s__state == 8480)) && 8448 <= s__state) && blastFlag == 0) && !(8560 == s__state))) || ((((!(s__state == 8657) && blastFlag == 1) && 8640 <= s__state) && 0 == s__hit) && s__state <= 8672)) || ((((!(s__state <= 8496) && 8496 < s__s3__tmp__next_state___0) && s__s3__tmp__next_state___0 <= 8576) && blastFlag == 0) && s__state <= 8576)) || ((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && s__state < 8576) && !(8497 == s__state)) && !(s__state == 8480)) && 0 == s__hit) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576)) || ((2 == blastFlag && 0 == s__hit) && 8544 == s__state)) || (((((2 == blastFlag && !(s__state == 8657)) && !(s__state == 8672)) && 8640 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8672)) || (s__s3__tmp__next_state___0 <= 8640 && s__state == 3)) || ((((s__state <= 8448 && 3 == s__s3__tmp__next_state___0) && 0 == s__hit) && 8448 <= s__state) && blastFlag == 0)) || ((((blastFlag == 1 && s__state <= 8448) && 8496 < s__s3__tmp__next_state___0) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576)) || (((!(s__state == 8657) && 8640 <= s__state) && blastFlag == 0) && s__state <= 8672)) || (((((2 == blastFlag && !(s__state == 8657)) && !(s__state == 8672)) && 8640 <= s__state) && !(0 == s__hit)) && s__state <= 8672)) || ((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && blastFlag == 1) && !(8497 == s__state)) && s__state <= 8640) && !(s__state <= 8496)) && !(s__state == 8480))) || (((((((((((((s__state == 8528 && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(8497 == s__state)) && s__state <= 8640) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state <= 8496)) && !(s__state == 8480)) && 0 == s__hit) && !(8560 == s__state))) || ((((3 == blastFlag && s__state <= 8448) && 3 == s__s3__tmp__next_state___0) && 0 == s__hit) && 8448 <= s__state)) || (((((2 == blastFlag && s__state <= 8448) && 8496 < s__s3__tmp__next_state___0) && 0 == s__hit) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576)) || (((8672 <= s__state && 3 == blastFlag) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8672)) || (((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && s__state == 8512) && !(8497 == s__state)) && s__state <= 8640) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state <= 8496)) && !(s__state == 8480)) && 0 == s__hit) && !(8560 == s__state))) || (((8672 <= s__state && 3 == blastFlag) && !(0 == s__hit)) && s__state <= 8672)) || ((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(8497 == s__state)) && s__state <= 8640) && !(8496 == s__state)) && s__state == 3) && !(s__state == 8480)) && blastFlag == 0) && !(8560 == s__state))) || (((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(8497 == s__state)) && s__state <= 8640) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state <= 8496)) && !(s__state == 8480)) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8576) && !(8560 == s__state))) || ((((blastFlag == 1 && !(s__state <= 8496)) && 8496 < s__s3__tmp__next_state___0) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576)) || (((((2 == blastFlag && 8496 < s__state) && 8496 < s__s3__tmp__next_state___0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576)) || ((2 == blastFlag && 8560 == s__state) && 0 == s__hit)) || ((((s__state <= 8448 && 8496 < s__s3__tmp__next_state___0) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && blastFlag == 0)) || ((((blastFlag == 1 && s__state <= 8448) && 3 == s__s3__tmp__next_state___0) && 0 == s__hit) && 8448 <= s__state)) || ((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && blastFlag == 1) && !(8497 == s__state)) && s__state <= 8640) && s__state == 3) && !(s__state == 8480))) || (((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(8497 == s__state)) && s__state <= 8640) && !(8496 == s__state)) && !(8544 == s__state)) && s__state == 3) && !(s__state == 8480)) && !(8560 == s__state)) - InvariantResult [Line: 116]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 109]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 113]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 176]: Loop Invariant Derived loop invariant: (((((((((8640 <= s__s3__tmp__next_state___0 && s__s3__tmp__next_state___0 <= 8640) && s__state <= 8448) && 8448 <= s__state) && !(0 == s__hit)) || ((((s__state <= 8448 && 3 == s__s3__tmp__next_state___0) && 0 == s__hit) && 8448 <= s__state) && blastFlag == 0)) || ((((blastFlag == 1 && s__state <= 8448) && 8496 < s__s3__tmp__next_state___0) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576)) || ((((3 == blastFlag && s__state <= 8448) && 3 == s__s3__tmp__next_state___0) && 0 == s__hit) && 8448 <= s__state)) || (((((2 == blastFlag && s__state <= 8448) && 8496 < s__s3__tmp__next_state___0) && 0 == s__hit) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576)) || ((((s__state <= 8448 && 8496 < s__s3__tmp__next_state___0) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && blastFlag == 0)) || ((((blastFlag == 1 && s__state <= 8448) && 3 == s__s3__tmp__next_state___0) && 0 == s__hit) && 8448 <= s__state) - InvariantResult [Line: 185]: Loop Invariant Derived loop invariant: ((((((((!(s__state == 8561) && !(s__state == 8545)) && !(8640 <= s__state)) && blastFlag == 1) && !(8497 == s__state)) && !(8544 == s__state)) && !(s__state <= 8496)) && !(8560 == s__state)) || (((((((((!(s__state == 8561) && !(s__state == 8545)) && !(8640 <= s__state)) && 2 == blastFlag) && !(8497 == s__state)) && !(8544 == s__state)) && !(s__state <= 8496)) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8576) && !(8560 == s__state))) || (((((((!(s__state == 8561) && !(s__state == 8545)) && !(8640 <= s__state)) && !(8497 == s__state)) && !(8544 == s__state)) && !(s__state <= 8496)) && blastFlag == 0) && !(8560 == s__state)) - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 387]: 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)) && !(12292 == s__state)) && !(s__state <= 8496)) && !(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)) && !(s__state == 8657)) && blastFlag == 1) && !(s__state == 8672)) && !(8497 == s__state)) && !(12292 == s__state)) && !(s__state <= 8496)) && !(s__state == 8480)) && !(s__state == 8656)) && !(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)) && !(12292 == s__state)) && !(s__state <= 8496)) && !(s__state == 8480)) && !(s__state == 8656)) && 0 == s__hit) && !(8560 == s__state)) - InvariantResult [Line: 209]: Loop Invariant Derived loop invariant: (((((8672 <= s__state && 3 == blastFlag) && !(12292 == s__state)) && s__s3__tmp__next_state___0 <= 8576) || ((8672 <= s__state && !(12292 == s__state)) && blastFlag == 0)) || (((8672 <= s__state && 3 == blastFlag) && !(12292 == s__state)) && !(0 == s__hit))) || (((8672 <= s__state && blastFlag == 1) && !(12292 == s__state)) && 0 == s__hit) - InvariantResult [Line: 128]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 338]: Loop Invariant Derived loop invariant: ((((((((!(8576 <= s__state) && !(s__state == 8561)) && !(s__state == 8545)) && blastFlag == 1) && !(8497 == s__state)) && !(8544 == s__state)) && !(s__state <= 8496)) && !(8560 == s__state)) || (((((((!(8576 <= s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(8497 == s__state)) && !(8544 == s__state)) && !(s__state <= 8496)) && blastFlag == 0) && !(8560 == s__state))) || ((((((((!(8576 <= s__state) && !(s__state == 8561)) && !(s__state == 8545)) && 2 == blastFlag) && !(8497 == s__state)) && !(8544 == s__state)) && !(s__state <= 8496)) && 0 == s__hit) && !(8560 == s__state)) - InvariantResult [Line: 152]: Loop Invariant Derived loop invariant: ((((((((!(8576 <= s__state) && !(s__state == 8561)) && !(s__state == 8545)) && blastFlag == 1) && !(8497 == s__state)) && !(8544 == s__state)) && !(s__state <= 8496)) && !(8560 == s__state)) || (((((((!(8576 <= s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(8497 == s__state)) && !(8544 == s__state)) && !(s__state <= 8496)) && blastFlag == 0) && !(8560 == s__state))) || ((((((((!(8576 <= s__state) && !(s__state == 8561)) && !(s__state == 8545)) && 2 == blastFlag) && !(8497 == s__state)) && !(8544 == s__state)) && !(s__state <= 8496)) && 0 == s__hit) && !(8560 == s__state)) - InvariantResult [Line: 623]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 170]: Loop Invariant Derived loop invariant: (((((((!(8576 <= s__state) && !(s__state == 8545)) && 2 == blastFlag) && !(8497 == s__state)) && !(8544 == s__state)) && !(s__state <= 8496)) && 0 == s__hit) || (((((!(8576 <= s__state) && !(s__state == 8545)) && !(8497 == s__state)) && !(8544 == s__state)) && !(s__state <= 8496)) && blastFlag == 0)) || (((((!(8576 <= s__state) && !(s__state == 8545)) && blastFlag == 1) && !(8497 == s__state)) && !(8544 == s__state)) && !(s__state <= 8496)) - InvariantResult [Line: 179]: Loop Invariant Derived loop invariant: ((((((((!(s__state == 8561) && !(s__state == 8545)) && !(8640 <= s__state)) && blastFlag == 1) && !(8497 == s__state)) && !(8544 == s__state)) && !(s__state <= 8496)) && !(8560 == s__state)) || (((((((((!(s__state == 8561) && !(s__state == 8545)) && !(8640 <= s__state)) && 2 == blastFlag) && !(8497 == s__state)) && !(8544 == s__state)) && !(s__state <= 8496)) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8576) && !(8560 == s__state))) || (((((((!(s__state == 8561) && !(s__state == 8545)) && !(8640 <= s__state)) && !(8497 == s__state)) && !(8544 == s__state)) && !(s__state <= 8496)) && blastFlag == 0) && !(8560 == s__state)) - InvariantResult [Line: 146]: Loop Invariant Derived loop invariant: (((((((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && s__state < 8576) && !(s__state == 8657)) && !(s__state == 8672)) && !(8544 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && 0 == s__hit) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && !(8560 == s__state)) || ((((((((((((((!(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)) && 8448 <= s__state) && !(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)) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && blastFlag == 0) && !(8560 == s__state)) - InvariantResult [Line: 197]: Loop Invariant Derived loop invariant: ((((((s__s3__tmp__next_state___0 <= 8640 && 8640 <= s__state) && s__state < 8656) && !(0 == s__hit)) || ((8640 <= s__state && s__state < 8656) && blastFlag == 0)) || (((2 == blastFlag && 8640 <= s__state) && s__state < 8656) && !(0 == s__hit))) || ((blastFlag == 1 && 8640 <= s__state) && s__state < 8656)) || (((2 == blastFlag && 8640 <= s__state) && s__state < 8656) && s__s3__tmp__next_state___0 <= 8576) - InvariantResult [Line: 158]: Loop Invariant Derived loop invariant: ((((((((!(8576 <= s__state) && !(s__state == 8561)) && !(s__state == 8545)) && blastFlag == 1) && !(8497 == s__state)) && !(8544 == s__state)) && !(s__state <= 8496)) && !(8560 == s__state)) || (((((((!(8576 <= s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(8497 == s__state)) && !(8544 == s__state)) && !(s__state <= 8496)) && blastFlag == 0) && !(8560 == s__state))) || ((((((((!(8576 <= s__state) && !(s__state == 8561)) && !(s__state == 8545)) && 2 == blastFlag) && !(8497 == s__state)) && !(8544 == s__state)) && !(s__state <= 8496)) && 0 == s__hit) && !(8560 == s__state)) - InvariantResult [Line: 110]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((8640 <= s__s3__tmp__next_state___0 && s__s3__tmp__next_state___0 <= 8640) && s__state <= 8448) && 8448 <= s__state) && !(0 == s__hit)) || (((s__s3__tmp__next_state___0 <= 8640 && 8640 <= s__state) && s__state <= 8640) && !(0 == s__hit))) || (8560 == s__state && blastFlag == 0)) || ((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && blastFlag == 1) && !(8497 == s__state)) && !(s__state == 8480)) && 8448 <= s__state) && s__state <= 8576)) || ((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(8497 == s__state)) && s__state <= 8640) && !(8496 == s__state)) && !(s__state == 8480)) && 8448 <= s__state) && blastFlag == 0) && !(8560 == s__state))) || ((((!(s__state == 8657) && blastFlag == 1) && 8640 <= s__state) && 0 == s__hit) && s__state <= 8672)) || ((((!(s__state <= 8496) && 8496 < s__s3__tmp__next_state___0) && s__s3__tmp__next_state___0 <= 8576) && blastFlag == 0) && s__state <= 8576)) || ((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && s__state < 8576) && !(8497 == s__state)) && !(s__state == 8480)) && 0 == s__hit) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576)) || ((2 == blastFlag && 0 == s__hit) && 8544 == s__state)) || (((((2 == blastFlag && !(s__state == 8657)) && !(s__state == 8672)) && 8640 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8672)) || (s__s3__tmp__next_state___0 <= 8640 && s__state == 3)) || ((((s__state <= 8448 && 3 == s__s3__tmp__next_state___0) && 0 == s__hit) && 8448 <= s__state) && blastFlag == 0)) || ((((blastFlag == 1 && s__state <= 8448) && 8496 < s__s3__tmp__next_state___0) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576)) || (((!(s__state == 8657) && 8640 <= s__state) && blastFlag == 0) && s__state <= 8672)) || (((((2 == blastFlag && !(s__state == 8657)) && !(s__state == 8672)) && 8640 <= s__state) && !(0 == s__hit)) && s__state <= 8672)) || ((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && blastFlag == 1) && !(8497 == s__state)) && s__state <= 8640) && !(s__state <= 8496)) && !(s__state == 8480))) || (((((((((((((s__state == 8528 && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(8497 == s__state)) && s__state <= 8640) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state <= 8496)) && !(s__state == 8480)) && 0 == s__hit) && !(8560 == s__state))) || ((((3 == blastFlag && s__state <= 8448) && 3 == s__s3__tmp__next_state___0) && 0 == s__hit) && 8448 <= s__state)) || (((((2 == blastFlag && s__state <= 8448) && 8496 < s__s3__tmp__next_state___0) && 0 == s__hit) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576)) || (((8672 <= s__state && 3 == blastFlag) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8672)) || (((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && s__state == 8512) && !(8497 == s__state)) && s__state <= 8640) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state <= 8496)) && !(s__state == 8480)) && 0 == s__hit) && !(8560 == s__state))) || (((8672 <= s__state && 3 == blastFlag) && !(0 == s__hit)) && s__state <= 8672)) || ((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(8497 == s__state)) && s__state <= 8640) && !(8496 == s__state)) && s__state == 3) && !(s__state == 8480)) && blastFlag == 0) && !(8560 == s__state))) || (((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(8497 == s__state)) && s__state <= 8640) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state <= 8496)) && !(s__state == 8480)) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8576) && !(8560 == s__state))) || ((((blastFlag == 1 && !(s__state <= 8496)) && 8496 < s__s3__tmp__next_state___0) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576)) || (((((2 == blastFlag && 8496 < s__state) && 8496 < s__s3__tmp__next_state___0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576)) || ((2 == blastFlag && 8560 == s__state) && 0 == s__hit)) || ((((s__state <= 8448 && 8496 < s__s3__tmp__next_state___0) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && blastFlag == 0)) || ((((blastFlag == 1 && s__state <= 8448) && 3 == s__s3__tmp__next_state___0) && 0 == s__hit) && 8448 <= s__state)) || ((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && blastFlag == 1) && !(8497 == s__state)) && s__state <= 8640) && s__state == 3) && !(s__state == 8480))) || (((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(8497 == s__state)) && s__state <= 8640) && !(8496 == s__state)) && !(8544 == s__state)) && s__state == 3) && !(s__state == 8480)) && !(8560 == s__state)) RESULT: Ultimate proved your program to be correct! [2022-07-11 23:46:49,111 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