./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/bitvector/s3_srvr_3a_alt.BV.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version eb692b52 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector/s3_srvr_3a_alt.BV.c.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c802d0dd4f8edaf03f1251784a424c8f295192f6a4e7c65ec93469eacce08251 --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-19 10:50:41,008 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 10:50:41,009 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 10:50:41,043 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 10:50:41,044 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 10:50:41,045 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 10:50:41,047 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 10:50:41,052 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 10:50:41,054 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 10:50:41,058 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 10:50:41,060 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 10:50:41,062 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 10:50:41,062 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 10:50:41,064 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 10:50:41,066 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 10:50:41,069 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 10:50:41,070 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 10:50:41,071 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 10:50:41,073 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 10:50:41,078 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 10:50:41,079 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 10:50:41,080 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 10:50:41,081 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 10:50:41,082 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 10:50:41,083 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 10:50:41,090 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 10:50:41,090 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 10:50:41,091 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 10:50:41,092 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 10:50:41,093 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 10:50:41,094 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 10:50:41,094 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 10:50:41,095 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 10:50:41,096 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 10:50:41,097 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 10:50:41,098 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 10:50:41,098 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 10:50:41,098 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 10:50:41,099 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 10:50:41,099 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 10:50:41,100 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 10:50:41,102 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 10:50:41,103 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-19 10:50:41,141 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 10:50:41,141 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 10:50:41,142 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 10:50:41,142 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 10:50:41,142 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 10:50:41,143 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 10:50:41,143 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 10:50:41,143 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 10:50:41,144 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 10:50:41,145 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 10:50:41,145 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-19 10:50:41,145 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-19 10:50:41,145 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-19 10:50:41,145 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 10:50:41,145 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 10:50:41,146 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 10:50:41,146 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 10:50:41,146 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-19 10:50:41,146 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 10:50:41,147 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 10:50:41,148 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 10:50:41,148 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 10:50:41,148 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 10:50:41,148 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 10:50:41,148 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 10:50:41,149 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 10:50:41,149 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 10:50:41,149 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 10:50:41,149 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-19 10:50:41,149 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-19 10:50:41,150 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 10:50:41,150 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 10:50:41,150 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 10:50:41,150 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 -> c802d0dd4f8edaf03f1251784a424c8f295192f6a4e7c65ec93469eacce08251 [2022-07-19 10:50:41,413 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 10:50:41,432 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 10:50:41,436 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 10:50:41,437 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 10:50:41,438 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 10:50:41,439 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/s3_srvr_3a_alt.BV.c.cil.c [2022-07-19 10:50:41,497 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1caee62c7/11f7899d26a14c8f9b7edb7a546b2e3b/FLAG1d0c95958 [2022-07-19 10:50:41,941 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 10:50:41,942 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/s3_srvr_3a_alt.BV.c.cil.c [2022-07-19 10:50:41,964 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1caee62c7/11f7899d26a14c8f9b7edb7a546b2e3b/FLAG1d0c95958 [2022-07-19 10:50:42,005 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1caee62c7/11f7899d26a14c8f9b7edb7a546b2e3b [2022-07-19 10:50:42,008 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 10:50:42,009 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 10:50:42,010 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 10:50:42,010 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 10:50:42,013 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 10:50:42,013 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 10:50:42" (1/1) ... [2022-07-19 10:50:42,014 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19326330 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:50:42, skipping insertion in model container [2022-07-19 10:50:42,014 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 10:50:42" (1/1) ... [2022-07-19 10:50:42,020 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 10:50:42,046 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 10:50:42,272 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/s3_srvr_3a_alt.BV.c.cil.c[44628,44641] [2022-07-19 10:50:42,281 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 10:50:42,292 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 10:50:42,352 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/s3_srvr_3a_alt.BV.c.cil.c[44628,44641] [2022-07-19 10:50:42,361 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 10:50:42,372 INFO L208 MainTranslator]: Completed translation [2022-07-19 10:50:42,372 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:50:42 WrapperNode [2022-07-19 10:50:42,372 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 10:50:42,373 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 10:50:42,373 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 10:50:42,373 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 10:50:42,386 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:50:42" (1/1) ... [2022-07-19 10:50:42,405 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:50:42" (1/1) ... [2022-07-19 10:50:42,445 INFO L137 Inliner]: procedures = 15, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 522 [2022-07-19 10:50:42,445 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 10:50:42,451 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 10:50:42,451 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 10:50:42,451 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 10:50:42,458 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:50:42" (1/1) ... [2022-07-19 10:50:42,459 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:50:42" (1/1) ... [2022-07-19 10:50:42,462 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:50:42" (1/1) ... [2022-07-19 10:50:42,462 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:50:42" (1/1) ... [2022-07-19 10:50:42,469 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:50:42" (1/1) ... [2022-07-19 10:50:42,485 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:50:42" (1/1) ... [2022-07-19 10:50:42,487 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:50:42" (1/1) ... [2022-07-19 10:50:42,490 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 10:50:42,491 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 10:50:42,491 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 10:50:42,491 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 10:50:42,492 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:50:42" (1/1) ... [2022-07-19 10:50:42,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 10:50:42,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:50:42,545 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-19 10:50:42,558 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-19 10:50:42,575 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 10:50:42,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-19 10:50:42,576 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 10:50:42,576 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 10:50:42,648 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 10:50:42,664 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 10:50:42,694 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-19 10:50:43,280 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2022-07-19 10:50:43,280 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2022-07-19 10:50:43,280 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 10:50:43,287 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 10:50:43,288 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-19 10:50:43,290 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 10:50:43 BoogieIcfgContainer [2022-07-19 10:50:43,290 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 10:50:43,291 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 10:50:43,292 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 10:50:43,294 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 10:50:43,295 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 10:50:42" (1/3) ... [2022-07-19 10:50:43,295 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76a04db2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 10:50:43, skipping insertion in model container [2022-07-19 10:50:43,295 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:50:42" (2/3) ... [2022-07-19 10:50:43,296 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76a04db2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 10:50:43, skipping insertion in model container [2022-07-19 10:50:43,296 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 10:50:43" (3/3) ... [2022-07-19 10:50:43,297 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr_3a_alt.BV.c.cil.c [2022-07-19 10:50:43,309 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 10:50:43,309 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-19 10:50:43,354 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 10:50:43,358 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@7f77c567, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@e7318f [2022-07-19 10:50:43,359 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-19 10:50:43,362 INFO L276 IsEmpty]: Start isEmpty. Operand has 138 states, 136 states have (on average 1.7426470588235294) internal successors, (237), 137 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:50:43,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-19 10:50:43,370 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:50:43,371 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-19 10:50:43,371 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:50:43,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:50:43,376 INFO L85 PathProgramCache]: Analyzing trace with hash 1632003015, now seen corresponding path program 1 times [2022-07-19 10:50:43,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:50:43,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497907883] [2022-07-19 10:50:43,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:50:43,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:50:43,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:50:43,632 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-19 10:50:43,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:50:43,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497907883] [2022-07-19 10:50:43,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497907883] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:50:43,634 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:50:43,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:50:43,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631228806] [2022-07-19 10:50:43,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:50:43,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:50:43,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:50:43,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:50:43,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:50:43,668 INFO L87 Difference]: Start difference. First operand has 138 states, 136 states have (on average 1.7426470588235294) internal successors, (237), 137 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:50:43,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:50:43,909 INFO L93 Difference]: Finished difference Result 317 states and 547 transitions. [2022-07-19 10:50:43,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:50:43,911 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-19 10:50:43,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:50:43,923 INFO L225 Difference]: With dead ends: 317 [2022-07-19 10:50:43,924 INFO L226 Difference]: Without dead ends: 161 [2022-07-19 10:50:43,928 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-19 10:50:43,934 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 156 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 10:50:43,935 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 176 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 10:50:43,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2022-07-19 10:50:43,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 156. [2022-07-19 10:50:43,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 155 states have (on average 1.6) internal successors, (248), 155 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:50:43,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 248 transitions. [2022-07-19 10:50:43,974 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 248 transitions. Word has length 44 [2022-07-19 10:50:43,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:50:43,975 INFO L495 AbstractCegarLoop]: Abstraction has 156 states and 248 transitions. [2022-07-19 10:50:43,975 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-19 10:50:43,976 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 248 transitions. [2022-07-19 10:50:43,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-19 10:50:43,977 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:50:43,977 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-19 10:50:43,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-19 10:50:43,978 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:50:43,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:50:43,979 INFO L85 PathProgramCache]: Analyzing trace with hash -954579415, now seen corresponding path program 1 times [2022-07-19 10:50:43,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:50:43,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022078254] [2022-07-19 10:50:43,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:50:43,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:50:44,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:50:44,042 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-19 10:50:44,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:50:44,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022078254] [2022-07-19 10:50:44,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022078254] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:50:44,044 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:50:44,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:50:44,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229549047] [2022-07-19 10:50:44,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:50:44,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:50:44,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:50:44,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:50:44,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:50:44,047 INFO L87 Difference]: Start difference. First operand 156 states and 248 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:50:44,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:50:44,204 INFO L93 Difference]: Finished difference Result 352 states and 565 transitions. [2022-07-19 10:50:44,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:50:44,205 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-19 10:50:44,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:50:44,207 INFO L225 Difference]: With dead ends: 352 [2022-07-19 10:50:44,207 INFO L226 Difference]: Without dead ends: 202 [2022-07-19 10:50:44,208 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-19 10:50:44,209 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 109 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:50:44,210 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 126 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:50:44,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2022-07-19 10:50:44,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 197. [2022-07-19 10:50:44,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 196 states have (on average 1.6326530612244898) internal successors, (320), 196 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:50:44,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 320 transitions. [2022-07-19 10:50:44,223 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 320 transitions. Word has length 45 [2022-07-19 10:50:44,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:50:44,223 INFO L495 AbstractCegarLoop]: Abstraction has 197 states and 320 transitions. [2022-07-19 10:50:44,223 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-19 10:50:44,224 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 320 transitions. [2022-07-19 10:50:44,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-07-19 10:50:44,226 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:50:44,226 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-19 10:50:44,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-19 10:50:44,226 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:50:44,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:50:44,227 INFO L85 PathProgramCache]: Analyzing trace with hash -420309214, now seen corresponding path program 1 times [2022-07-19 10:50:44,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:50:44,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112196939] [2022-07-19 10:50:44,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:50:44,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:50:44,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:50:44,292 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-19 10:50:44,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:50:44,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112196939] [2022-07-19 10:50:44,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112196939] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:50:44,293 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:50:44,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:50:44,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183949171] [2022-07-19 10:50:44,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:50:44,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:50:44,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:50:44,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:50:44,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:50:44,295 INFO L87 Difference]: Start difference. First operand 197 states and 320 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-19 10:50:44,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:50:44,412 INFO L93 Difference]: Finished difference Result 417 states and 681 transitions. [2022-07-19 10:50:44,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:50:44,412 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-19 10:50:44,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:50:44,414 INFO L225 Difference]: With dead ends: 417 [2022-07-19 10:50:44,414 INFO L226 Difference]: Without dead ends: 228 [2022-07-19 10:50:44,416 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-19 10:50:44,417 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 116 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:50:44,417 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 139 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:50:44,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2022-07-19 10:50:44,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 228. [2022-07-19 10:50:44,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 227 states have (on average 1.6343612334801763) internal successors, (371), 227 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:50:44,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 371 transitions. [2022-07-19 10:50:44,440 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 371 transitions. Word has length 72 [2022-07-19 10:50:44,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:50:44,440 INFO L495 AbstractCegarLoop]: Abstraction has 228 states and 371 transitions. [2022-07-19 10:50:44,441 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-19 10:50:44,441 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 371 transitions. [2022-07-19 10:50:44,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-07-19 10:50:44,444 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:50:44,444 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-19 10:50:44,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-19 10:50:44,444 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:50:44,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:50:44,445 INFO L85 PathProgramCache]: Analyzing trace with hash -1606429448, now seen corresponding path program 1 times [2022-07-19 10:50:44,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:50:44,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931508802] [2022-07-19 10:50:44,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:50:44,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:50:44,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:50:44,506 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-19 10:50:44,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:50:44,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931508802] [2022-07-19 10:50:44,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931508802] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:50:44,507 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:50:44,508 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:50:44,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111680] [2022-07-19 10:50:44,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:50:44,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:50:44,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:50:44,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:50:44,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:50:44,510 INFO L87 Difference]: Start difference. First operand 228 states and 371 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-19 10:50:44,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:50:44,606 INFO L93 Difference]: Finished difference Result 450 states and 732 transitions. [2022-07-19 10:50:44,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:50:44,606 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-19 10:50:44,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:50:44,609 INFO L225 Difference]: With dead ends: 450 [2022-07-19 10:50:44,609 INFO L226 Difference]: Without dead ends: 230 [2022-07-19 10:50:44,609 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-19 10:50:44,610 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 138 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:50:44,611 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 122 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:50:44,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2022-07-19 10:50:44,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 228. [2022-07-19 10:50:44,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 227 states have (on average 1.6211453744493391) internal successors, (368), 227 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:50:44,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 368 transitions. [2022-07-19 10:50:44,620 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 368 transitions. Word has length 84 [2022-07-19 10:50:44,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:50:44,620 INFO L495 AbstractCegarLoop]: Abstraction has 228 states and 368 transitions. [2022-07-19 10:50:44,620 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-19 10:50:44,621 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 368 transitions. [2022-07-19 10:50:44,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-07-19 10:50:44,623 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:50:44,623 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-19 10:50:44,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-19 10:50:44,624 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:50:44,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:50:44,625 INFO L85 PathProgramCache]: Analyzing trace with hash -1610778141, now seen corresponding path program 1 times [2022-07-19 10:50:44,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:50:44,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877573808] [2022-07-19 10:50:44,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:50:44,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:50:44,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:50:44,674 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-19 10:50:44,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:50:44,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877573808] [2022-07-19 10:50:44,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877573808] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:50:44,677 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:50:44,678 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:50:44,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743790811] [2022-07-19 10:50:44,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:50:44,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:50:44,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:50:44,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:50:44,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:50:44,680 INFO L87 Difference]: Start difference. First operand 228 states and 368 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-19 10:50:44,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:50:44,808 INFO L93 Difference]: Finished difference Result 494 states and 800 transitions. [2022-07-19 10:50:44,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:50:44,809 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-19 10:50:44,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:50:44,810 INFO L225 Difference]: With dead ends: 494 [2022-07-19 10:50:44,811 INFO L226 Difference]: Without dead ends: 274 [2022-07-19 10:50:44,811 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-19 10:50:44,812 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 112 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:50:44,813 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 128 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:50:44,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2022-07-19 10:50:44,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 270. [2022-07-19 10:50:44,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 269 states have (on average 1.6245353159851301) internal successors, (437), 269 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:50:44,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 437 transitions. [2022-07-19 10:50:44,822 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 437 transitions. Word has length 84 [2022-07-19 10:50:44,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:50:44,822 INFO L495 AbstractCegarLoop]: Abstraction has 270 states and 437 transitions. [2022-07-19 10:50:44,822 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-19 10:50:44,823 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 437 transitions. [2022-07-19 10:50:44,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-07-19 10:50:44,824 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:50:44,825 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-19 10:50:44,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-19 10:50:44,825 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:50:44,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:50:44,826 INFO L85 PathProgramCache]: Analyzing trace with hash 1470428767, now seen corresponding path program 1 times [2022-07-19 10:50:44,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:50:44,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071957942] [2022-07-19 10:50:44,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:50:44,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:50:44,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:50:44,863 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-19 10:50:44,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:50:44,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071957942] [2022-07-19 10:50:44,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071957942] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:50:44,864 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:50:44,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:50:44,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624320897] [2022-07-19 10:50:44,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:50:44,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:50:44,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:50:44,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:50:44,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:50:44,866 INFO L87 Difference]: Start difference. First operand 270 states and 437 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-19 10:50:44,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:50:44,953 INFO L93 Difference]: Finished difference Result 534 states and 864 transitions. [2022-07-19 10:50:44,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:50:44,954 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-19 10:50:44,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:50:44,955 INFO L225 Difference]: With dead ends: 534 [2022-07-19 10:50:44,956 INFO L226 Difference]: Without dead ends: 272 [2022-07-19 10:50:44,956 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-19 10:50:44,957 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 136 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:50:44,958 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 123 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:50:44,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2022-07-19 10:50:44,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 270. [2022-07-19 10:50:44,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 269 states have (on average 1.6096654275092936) internal successors, (433), 269 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:50:44,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 433 transitions. [2022-07-19 10:50:44,967 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 433 transitions. Word has length 85 [2022-07-19 10:50:44,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:50:44,967 INFO L495 AbstractCegarLoop]: Abstraction has 270 states and 433 transitions. [2022-07-19 10:50:44,967 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-19 10:50:44,968 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 433 transitions. [2022-07-19 10:50:44,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-07-19 10:50:44,969 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:50:44,969 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-19 10:50:44,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-19 10:50:44,969 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:50:44,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:50:44,970 INFO L85 PathProgramCache]: Analyzing trace with hash -564791579, now seen corresponding path program 1 times [2022-07-19 10:50:44,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:50:44,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236888369] [2022-07-19 10:50:44,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:50:44,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:50:45,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:50:45,032 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-19 10:50:45,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:50:45,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236888369] [2022-07-19 10:50:45,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236888369] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:50:45,033 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:50:45,033 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:50:45,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859853562] [2022-07-19 10:50:45,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:50:45,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:50:45,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:50:45,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:50:45,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:50:45,035 INFO L87 Difference]: Start difference. First operand 270 states and 433 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-19 10:50:45,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:50:45,164 INFO L93 Difference]: Finished difference Result 536 states and 859 transitions. [2022-07-19 10:50:45,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:50:45,165 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-19 10:50:45,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:50:45,167 INFO L225 Difference]: With dead ends: 536 [2022-07-19 10:50:45,167 INFO L226 Difference]: Without dead ends: 272 [2022-07-19 10:50:45,168 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-19 10:50:45,170 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 109 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:50:45,170 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 128 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:50:45,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2022-07-19 10:50:45,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 268. [2022-07-19 10:50:45,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 267 states have (on average 1.6029962546816479) internal successors, (428), 267 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:50:45,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 428 transitions. [2022-07-19 10:50:45,184 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 428 transitions. Word has length 85 [2022-07-19 10:50:45,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:50:45,185 INFO L495 AbstractCegarLoop]: Abstraction has 268 states and 428 transitions. [2022-07-19 10:50:45,185 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-19 10:50:45,185 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 428 transitions. [2022-07-19 10:50:45,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-07-19 10:50:45,187 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:50:45,187 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-19 10:50:45,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-19 10:50:45,189 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:50:45,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:50:45,191 INFO L85 PathProgramCache]: Analyzing trace with hash 183697243, now seen corresponding path program 1 times [2022-07-19 10:50:45,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:50:45,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660815699] [2022-07-19 10:50:45,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:50:45,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:50:45,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:50:45,225 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-19 10:50:45,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:50:45,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660815699] [2022-07-19 10:50:45,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660815699] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:50:45,226 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:50:45,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:50:45,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49673559] [2022-07-19 10:50:45,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:50:45,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:50:45,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:50:45,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:50:45,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:50:45,228 INFO L87 Difference]: Start difference. First operand 268 states and 428 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-19 10:50:45,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:50:45,336 INFO L93 Difference]: Finished difference Result 559 states and 893 transitions. [2022-07-19 10:50:45,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:50:45,337 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-19 10:50:45,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:50:45,338 INFO L225 Difference]: With dead ends: 559 [2022-07-19 10:50:45,339 INFO L226 Difference]: Without dead ends: 299 [2022-07-19 10:50:45,339 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-19 10:50:45,340 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 122 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:50:45,340 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 124 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:50:45,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2022-07-19 10:50:45,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 297. [2022-07-19 10:50:45,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 296 states have (on average 1.5912162162162162) internal successors, (471), 296 states have internal predecessors, (471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:50:45,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 471 transitions. [2022-07-19 10:50:45,350 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 471 transitions. Word has length 98 [2022-07-19 10:50:45,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:50:45,350 INFO L495 AbstractCegarLoop]: Abstraction has 297 states and 471 transitions. [2022-07-19 10:50:45,350 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-19 10:50:45,351 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 471 transitions. [2022-07-19 10:50:45,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-07-19 10:50:45,352 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:50:45,352 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] [2022-07-19 10:50:45,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-19 10:50:45,352 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:50:45,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:50:45,353 INFO L85 PathProgramCache]: Analyzing trace with hash 156444990, now seen corresponding path program 1 times [2022-07-19 10:50:45,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:50:45,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871129401] [2022-07-19 10:50:45,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:50:45,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:50:45,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:50:45,384 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-19 10:50:45,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:50:45,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871129401] [2022-07-19 10:50:45,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871129401] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:50:45,385 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:50:45,385 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:50:45,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334263128] [2022-07-19 10:50:45,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:50:45,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:50:45,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:50:45,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:50:45,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:50:45,387 INFO L87 Difference]: Start difference. First operand 297 states and 471 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-19 10:50:45,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:50:45,495 INFO L93 Difference]: Finished difference Result 620 states and 985 transitions. [2022-07-19 10:50:45,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:50:45,496 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-19 10:50:45,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:50:45,499 INFO L225 Difference]: With dead ends: 620 [2022-07-19 10:50:45,499 INFO L226 Difference]: Without dead ends: 331 [2022-07-19 10:50:45,500 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-19 10:50:45,502 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 124 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:50:45,503 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 131 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:50:45,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2022-07-19 10:50:45,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 324. [2022-07-19 10:50:45,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 323 states have (on average 1.5758513931888545) internal successors, (509), 323 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:50:45,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 509 transitions. [2022-07-19 10:50:45,515 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 509 transitions. Word has length 99 [2022-07-19 10:50:45,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:50:45,516 INFO L495 AbstractCegarLoop]: Abstraction has 324 states and 509 transitions. [2022-07-19 10:50:45,516 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-19 10:50:45,517 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 509 transitions. [2022-07-19 10:50:45,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-07-19 10:50:45,518 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:50:45,518 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-19 10:50:45,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-19 10:50:45,519 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:50:45,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:50:45,520 INFO L85 PathProgramCache]: Analyzing trace with hash -2130209566, now seen corresponding path program 1 times [2022-07-19 10:50:45,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:50:45,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575779594] [2022-07-19 10:50:45,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:50:45,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:50:45,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:50:45,593 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-19 10:50:45,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:50:45,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575779594] [2022-07-19 10:50:45,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575779594] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:50:45,596 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:50:45,596 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:50:45,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796537907] [2022-07-19 10:50:45,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:50:45,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:50:45,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:50:45,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:50:45,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:50:45,600 INFO L87 Difference]: Start difference. First operand 324 states and 509 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-19 10:50:45,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:50:45,707 INFO L93 Difference]: Finished difference Result 642 states and 1008 transitions. [2022-07-19 10:50:45,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:50:45,707 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-19 10:50:45,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:50:45,709 INFO L225 Difference]: With dead ends: 642 [2022-07-19 10:50:45,709 INFO L226 Difference]: Without dead ends: 326 [2022-07-19 10:50:45,710 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-19 10:50:45,711 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 121 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:50:45,712 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 124 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:50:45,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2022-07-19 10:50:45,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 324. [2022-07-19 10:50:45,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 323 states have (on average 1.563467492260062) internal successors, (505), 323 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-19 10:50:45,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 505 transitions. [2022-07-19 10:50:45,723 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 505 transitions. Word has length 99 [2022-07-19 10:50:45,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:50:45,724 INFO L495 AbstractCegarLoop]: Abstraction has 324 states and 505 transitions. [2022-07-19 10:50:45,724 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-19 10:50:45,724 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 505 transitions. [2022-07-19 10:50:45,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-07-19 10:50:45,725 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:50:45,725 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] [2022-07-19 10:50:45,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-19 10:50:45,726 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:50:45,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:50:45,727 INFO L85 PathProgramCache]: Analyzing trace with hash -417318601, now seen corresponding path program 1 times [2022-07-19 10:50:45,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:50:45,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430747228] [2022-07-19 10:50:45,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:50:45,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:50:45,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:50:45,771 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-19 10:50:45,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:50:45,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430747228] [2022-07-19 10:50:45,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430747228] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:50:45,772 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:50:45,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:50:45,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639066339] [2022-07-19 10:50:45,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:50:45,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:50:45,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:50:45,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:50:45,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:50:45,774 INFO L87 Difference]: Start difference. First operand 324 states and 505 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:50:45,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:50:45,872 INFO L93 Difference]: Finished difference Result 647 states and 1010 transitions. [2022-07-19 10:50:45,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:50:45,873 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-19 10:50:45,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:50:45,875 INFO L225 Difference]: With dead ends: 647 [2022-07-19 10:50:45,875 INFO L226 Difference]: Without dead ends: 331 [2022-07-19 10:50:45,879 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-19 10:50:45,880 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 123 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:50:45,880 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 131 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:50:45,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2022-07-19 10:50:45,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 324. [2022-07-19 10:50:45,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 323 states have (on average 1.5479876160990713) internal successors, (500), 323 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:50:45,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 500 transitions. [2022-07-19 10:50:45,890 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 500 transitions. Word has length 100 [2022-07-19 10:50:45,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:50:45,892 INFO L495 AbstractCegarLoop]: Abstraction has 324 states and 500 transitions. [2022-07-19 10:50:45,892 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-19 10:50:45,892 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 500 transitions. [2022-07-19 10:50:45,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-07-19 10:50:45,895 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:50:45,895 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-19 10:50:45,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-19 10:50:45,896 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:50:45,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:50:45,897 INFO L85 PathProgramCache]: Analyzing trace with hash -1321281040, now seen corresponding path program 1 times [2022-07-19 10:50:45,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:50:45,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046284553] [2022-07-19 10:50:45,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:50:45,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:50:45,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:50:45,927 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-19 10:50:45,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:50:45,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046284553] [2022-07-19 10:50:45,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046284553] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:50:45,928 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:50:45,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:50:45,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291719766] [2022-07-19 10:50:45,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:50:45,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:50:45,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:50:45,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:50:45,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:50:45,929 INFO L87 Difference]: Start difference. First operand 324 states and 500 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-19 10:50:46,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:50:46,012 INFO L93 Difference]: Finished difference Result 665 states and 1025 transitions. [2022-07-19 10:50:46,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:50:46,012 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-19 10:50:46,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:50:46,014 INFO L225 Difference]: With dead ends: 665 [2022-07-19 10:50:46,014 INFO L226 Difference]: Without dead ends: 349 [2022-07-19 10:50:46,015 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-19 10:50:46,015 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 130 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:50:46,016 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 127 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:50:46,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2022-07-19 10:50:46,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 345. [2022-07-19 10:50:46,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 344 states have (on average 1.5261627906976745) internal successors, (525), 344 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:50:46,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 525 transitions. [2022-07-19 10:50:46,027 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 525 transitions. Word has length 105 [2022-07-19 10:50:46,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:50:46,028 INFO L495 AbstractCegarLoop]: Abstraction has 345 states and 525 transitions. [2022-07-19 10:50:46,028 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-19 10:50:46,028 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 525 transitions. [2022-07-19 10:50:46,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-07-19 10:50:46,029 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:50:46,029 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-19 10:50:46,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-19 10:50:46,030 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:50:46,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:50:46,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1276596489, now seen corresponding path program 1 times [2022-07-19 10:50:46,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:50:46,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139928195] [2022-07-19 10:50:46,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:50:46,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:50:46,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:50:46,079 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-19 10:50:46,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:50:46,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139928195] [2022-07-19 10:50:46,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139928195] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:50:46,080 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:50:46,080 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:50:46,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616666030] [2022-07-19 10:50:46,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:50:46,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:50:46,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:50:46,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:50:46,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:50:46,082 INFO L87 Difference]: Start difference. First operand 345 states and 525 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-19 10:50:46,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:50:46,169 INFO L93 Difference]: Finished difference Result 686 states and 1044 transitions. [2022-07-19 10:50:46,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:50:46,170 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-19 10:50:46,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:50:46,171 INFO L225 Difference]: With dead ends: 686 [2022-07-19 10:50:46,171 INFO L226 Difference]: Without dead ends: 349 [2022-07-19 10:50:46,172 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-19 10:50:46,173 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 129 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:50:46,173 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 127 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:50:46,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2022-07-19 10:50:46,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 345. [2022-07-19 10:50:46,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 344 states have (on average 1.5087209302325582) internal successors, (519), 344 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:50:46,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 519 transitions. [2022-07-19 10:50:46,183 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 519 transitions. Word has length 106 [2022-07-19 10:50:46,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:50:46,184 INFO L495 AbstractCegarLoop]: Abstraction has 345 states and 519 transitions. [2022-07-19 10:50:46,184 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-19 10:50:46,184 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 519 transitions. [2022-07-19 10:50:46,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-07-19 10:50:46,185 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:50:46,186 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-19 10:50:46,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-19 10:50:46,186 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:50:46,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:50:46,187 INFO L85 PathProgramCache]: Analyzing trace with hash -687746511, now seen corresponding path program 1 times [2022-07-19 10:50:46,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:50:46,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946057048] [2022-07-19 10:50:46,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:50:46,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:50:46,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:50:46,219 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-19 10:50:46,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:50:46,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946057048] [2022-07-19 10:50:46,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946057048] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:50:46,220 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:50:46,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:50:46,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341824320] [2022-07-19 10:50:46,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:50:46,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:50:46,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:50:46,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:50:46,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:50:46,222 INFO L87 Difference]: Start difference. First operand 345 states and 519 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:50:46,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:50:46,256 INFO L93 Difference]: Finished difference Result 973 states and 1467 transitions. [2022-07-19 10:50:46,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:50:46,256 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 121 [2022-07-19 10:50:46,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:50:46,259 INFO L225 Difference]: With dead ends: 973 [2022-07-19 10:50:46,259 INFO L226 Difference]: Without dead ends: 636 [2022-07-19 10:50:46,260 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-19 10:50:46,261 INFO L413 NwaCegarLoop]: 314 mSDtfsCounter, 113 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 477 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-19 10:50:46,261 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 477 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:50:46,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2022-07-19 10:50:46,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 636. [2022-07-19 10:50:46,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 636 states, 635 states have (on average 1.5039370078740157) internal successors, (955), 635 states have internal predecessors, (955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:50:46,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 955 transitions. [2022-07-19 10:50:46,278 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 955 transitions. Word has length 121 [2022-07-19 10:50:46,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:50:46,279 INFO L495 AbstractCegarLoop]: Abstraction has 636 states and 955 transitions. [2022-07-19 10:50:46,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:50:46,279 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 955 transitions. [2022-07-19 10:50:46,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-07-19 10:50:46,281 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:50:46,281 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-19 10:50:46,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-19 10:50:46,281 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:50:46,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:50:46,282 INFO L85 PathProgramCache]: Analyzing trace with hash 209646767, now seen corresponding path program 1 times [2022-07-19 10:50:46,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:50:46,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106311624] [2022-07-19 10:50:46,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:50:46,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:50:46,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:50:46,312 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-19 10:50:46,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:50:46,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106311624] [2022-07-19 10:50:46,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106311624] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:50:46,313 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:50:46,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:50:46,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935048322] [2022-07-19 10:50:46,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:50:46,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:50:46,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:50:46,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:50:46,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:50:46,314 INFO L87 Difference]: Start difference. First operand 636 states and 955 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-19 10:50:46,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:50:46,351 INFO L93 Difference]: Finished difference Result 1595 states and 2399 transitions. [2022-07-19 10:50:46,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:50:46,351 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-19 10:50:46,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:50:46,354 INFO L225 Difference]: With dead ends: 1595 [2022-07-19 10:50:46,355 INFO L226 Difference]: Without dead ends: 967 [2022-07-19 10:50:46,355 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:50:46,356 INFO L413 NwaCegarLoop]: 310 mSDtfsCounter, 111 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 473 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-19 10:50:46,356 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 473 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:50:46,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 967 states. [2022-07-19 10:50:46,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 967 to 967. [2022-07-19 10:50:46,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 967 states, 966 states have (on average 1.5020703933747412) internal successors, (1451), 966 states have internal predecessors, (1451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:50:46,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 967 states to 967 states and 1451 transitions. [2022-07-19 10:50:46,380 INFO L78 Accepts]: Start accepts. Automaton has 967 states and 1451 transitions. Word has length 121 [2022-07-19 10:50:46,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:50:46,381 INFO L495 AbstractCegarLoop]: Abstraction has 967 states and 1451 transitions. [2022-07-19 10:50:46,381 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-19 10:50:46,381 INFO L276 IsEmpty]: Start isEmpty. Operand 967 states and 1451 transitions. [2022-07-19 10:50:46,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-07-19 10:50:46,383 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:50:46,383 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-19 10:50:46,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-19 10:50:46,383 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:50:46,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:50:46,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1728089839, now seen corresponding path program 1 times [2022-07-19 10:50:46,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:50:46,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276917748] [2022-07-19 10:50:46,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:50:46,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:50:46,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:50:46,406 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-19 10:50:46,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:50:46,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276917748] [2022-07-19 10:50:46,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276917748] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:50:46,407 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:50:46,407 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:50:46,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453575522] [2022-07-19 10:50:46,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:50:46,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:50:46,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:50:46,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:50:46,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:50:46,408 INFO L87 Difference]: Start difference. First operand 967 states and 1451 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:50:46,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:50:46,466 INFO L93 Difference]: Finished difference Result 2257 states and 3391 transitions. [2022-07-19 10:50:46,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:50:46,466 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 121 [2022-07-19 10:50:46,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:50:46,470 INFO L225 Difference]: With dead ends: 2257 [2022-07-19 10:50:46,471 INFO L226 Difference]: Without dead ends: 1298 [2022-07-19 10:50:46,472 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-19 10:50:46,472 INFO L413 NwaCegarLoop]: 317 mSDtfsCounter, 133 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 480 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-19 10:50:46,473 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 480 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:50:46,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1298 states. [2022-07-19 10:50:46,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1298 to 1298. [2022-07-19 10:50:46,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1298 states, 1297 states have (on average 1.5011565150346955) internal successors, (1947), 1297 states have internal predecessors, (1947), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:50:46,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1298 states to 1298 states and 1947 transitions. [2022-07-19 10:50:46,505 INFO L78 Accepts]: Start accepts. Automaton has 1298 states and 1947 transitions. Word has length 121 [2022-07-19 10:50:46,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:50:46,506 INFO L495 AbstractCegarLoop]: Abstraction has 1298 states and 1947 transitions. [2022-07-19 10:50:46,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:50:46,506 INFO L276 IsEmpty]: Start isEmpty. Operand 1298 states and 1947 transitions. [2022-07-19 10:50:46,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-07-19 10:50:46,508 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:50:46,509 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-19 10:50:46,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-19 10:50:46,509 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:50:46,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:50:46,509 INFO L85 PathProgramCache]: Analyzing trace with hash -305304207, now seen corresponding path program 1 times [2022-07-19 10:50:46,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:50:46,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593397822] [2022-07-19 10:50:46,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:50:46,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:50:46,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:50:46,532 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-19 10:50:46,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:50:46,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593397822] [2022-07-19 10:50:46,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593397822] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:50:46,533 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:50:46,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:50:46,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801966830] [2022-07-19 10:50:46,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:50:46,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:50:46,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:50:46,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:50:46,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:50:46,535 INFO L87 Difference]: Start difference. First operand 1298 states and 1947 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-19 10:50:46,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:50:46,581 INFO L93 Difference]: Finished difference Result 2901 states and 4356 transitions. [2022-07-19 10:50:46,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:50:46,582 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 121 [2022-07-19 10:50:46,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:50:46,588 INFO L225 Difference]: With dead ends: 2901 [2022-07-19 10:50:46,588 INFO L226 Difference]: Without dead ends: 1611 [2022-07-19 10:50:46,590 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-19 10:50:46,591 INFO L413 NwaCegarLoop]: 191 mSDtfsCounter, 148 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 344 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-19 10:50:46,591 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 344 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:50:46,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1611 states. [2022-07-19 10:50:46,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1611 to 1611. [2022-07-19 10:50:46,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1611 states, 1610 states have (on average 1.5006211180124223) internal successors, (2416), 1610 states have internal predecessors, (2416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:50:46,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1611 states to 1611 states and 2416 transitions. [2022-07-19 10:50:46,632 INFO L78 Accepts]: Start accepts. Automaton has 1611 states and 2416 transitions. Word has length 121 [2022-07-19 10:50:46,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:50:46,632 INFO L495 AbstractCegarLoop]: Abstraction has 1611 states and 2416 transitions. [2022-07-19 10:50:46,632 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-19 10:50:46,633 INFO L276 IsEmpty]: Start isEmpty. Operand 1611 states and 2416 transitions. [2022-07-19 10:50:46,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2022-07-19 10:50:46,636 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:50:46,637 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:50:46,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-19 10:50:46,638 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:50:46,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:50:46,638 INFO L85 PathProgramCache]: Analyzing trace with hash 230274424, now seen corresponding path program 1 times [2022-07-19 10:50:46,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:50:46,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50291820] [2022-07-19 10:50:46,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:50:46,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:50:46,662 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-19 10:50:46,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [174963821] [2022-07-19 10:50:46,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:50:46,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:50:46,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:50:46,671 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-19 10:50:46,702 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-19 10:50:46,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:50:46,774 INFO L263 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-19 10:50:46,804 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:50:46,931 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 255 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2022-07-19 10:50:46,931 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 10:50:46,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:50:46,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50291820] [2022-07-19 10:50:46,932 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-19 10:50:46,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [174963821] [2022-07-19 10:50:46,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [174963821] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:50:46,932 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:50:46,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:50:46,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675738720] [2022-07-19 10:50:46,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:50:46,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:50:46,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:50:46,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:50:46,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:50:46,934 INFO L87 Difference]: Start difference. First operand 1611 states and 2416 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-19 10:50:47,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:50:47,098 INFO L93 Difference]: Finished difference Result 3214 states and 4820 transitions. [2022-07-19 10:50:47,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:50:47,099 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 199 [2022-07-19 10:50:47,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:50:47,105 INFO L225 Difference]: With dead ends: 3214 [2022-07-19 10:50:47,105 INFO L226 Difference]: Without dead ends: 1611 [2022-07-19 10:50:47,107 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 197 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-19 10:50:47,108 INFO L413 NwaCegarLoop]: 182 mSDtfsCounter, 18 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:50:47,108 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 263 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:50:47,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1611 states. [2022-07-19 10:50:47,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1611 to 1611. [2022-07-19 10:50:47,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1611 states, 1610 states have (on average 1.4608695652173913) internal successors, (2352), 1610 states have internal predecessors, (2352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:50:47,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1611 states to 1611 states and 2352 transitions. [2022-07-19 10:50:47,154 INFO L78 Accepts]: Start accepts. Automaton has 1611 states and 2352 transitions. Word has length 199 [2022-07-19 10:50:47,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:50:47,154 INFO L495 AbstractCegarLoop]: Abstraction has 1611 states and 2352 transitions. [2022-07-19 10:50:47,154 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-19 10:50:47,154 INFO L276 IsEmpty]: Start isEmpty. Operand 1611 states and 2352 transitions. [2022-07-19 10:50:47,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2022-07-19 10:50:47,159 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:50:47,159 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 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-19 10:50:47,188 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-19 10:50:47,384 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,SelfDestructingSolverStorable17 [2022-07-19 10:50:47,385 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:50:47,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:50:47,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1759452965, now seen corresponding path program 1 times [2022-07-19 10:50:47,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:50:47,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690563422] [2022-07-19 10:50:47,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:50:47,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:50:47,402 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-19 10:50:47,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [187236500] [2022-07-19 10:50:47,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:50:47,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:50:47,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:50:47,404 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-19 10:50:47,406 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-19 10:50:47,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:50:47,512 INFO L263 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-19 10:50:47,529 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:50:47,602 INFO L134 CoverageAnalysis]: Checked inductivity of 497 backedges. 362 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2022-07-19 10:50:47,602 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 10:50:47,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:50:47,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690563422] [2022-07-19 10:50:47,603 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-19 10:50:47,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [187236500] [2022-07-19 10:50:47,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [187236500] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:50:47,603 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:50:47,603 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:50:47,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247771339] [2022-07-19 10:50:47,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:50:47,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:50:47,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:50:47,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:50:47,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:50:47,605 INFO L87 Difference]: Start difference. First operand 1611 states and 2352 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:50:47,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:50:47,774 INFO L93 Difference]: Finished difference Result 3409 states and 4987 transitions. [2022-07-19 10:50:47,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:50:47,774 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 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-19 10:50:47,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:50:47,780 INFO L225 Difference]: With dead ends: 3409 [2022-07-19 10:50:47,780 INFO L226 Difference]: Without dead ends: 1602 [2022-07-19 10:50:47,782 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 239 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-19 10:50:47,783 INFO L413 NwaCegarLoop]: 172 mSDtfsCounter, 16 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:50:47,783 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 252 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:50:47,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1602 states. [2022-07-19 10:50:47,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1602 to 1602. [2022-07-19 10:50:47,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1602 states, 1601 states have (on average 1.41474078700812) internal successors, (2265), 1601 states have internal predecessors, (2265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:50:47,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1602 states to 1602 states and 2265 transitions. [2022-07-19 10:50:47,831 INFO L78 Accepts]: Start accepts. Automaton has 1602 states and 2265 transitions. Word has length 241 [2022-07-19 10:50:47,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:50:47,831 INFO L495 AbstractCegarLoop]: Abstraction has 1602 states and 2265 transitions. [2022-07-19 10:50:47,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:50:47,832 INFO L276 IsEmpty]: Start isEmpty. Operand 1602 states and 2265 transitions. [2022-07-19 10:50:47,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2022-07-19 10:50:47,837 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:50:47,837 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 10:50:47,865 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-19 10:50:48,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:50:48,052 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:50:48,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:50:48,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1622703552, now seen corresponding path program 1 times [2022-07-19 10:50:48,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:50:48,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466856888] [2022-07-19 10:50:48,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:50:48,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:50:48,069 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-19 10:50:48,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [704664178] [2022-07-19 10:50:48,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:50:48,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:50:48,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:50:48,070 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-19 10:50:48,072 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-19 10:50:48,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:50:48,172 INFO L263 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-19 10:50:48,175 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:50:48,327 INFO L134 CoverageAnalysis]: Checked inductivity of 654 backedges. 429 proven. 0 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2022-07-19 10:50:48,327 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 10:50:48,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:50:48,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466856888] [2022-07-19 10:50:48,328 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-19 10:50:48,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [704664178] [2022-07-19 10:50:48,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [704664178] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:50:48,328 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:50:48,328 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:50:48,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153307014] [2022-07-19 10:50:48,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:50:48,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:50:48,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:50:48,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:50:48,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:50:48,330 INFO L87 Difference]: Start difference. First operand 1602 states and 2265 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-19 10:50:48,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:50:48,418 INFO L93 Difference]: Finished difference Result 4698 states and 6639 transitions. [2022-07-19 10:50:48,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:50:48,419 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 269 [2022-07-19 10:50:48,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:50:48,425 INFO L225 Difference]: With dead ends: 4698 [2022-07-19 10:50:48,425 INFO L226 Difference]: Without dead ends: 1885 [2022-07-19 10:50:48,429 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 267 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-19 10:50:48,430 INFO L413 NwaCegarLoop]: 308 mSDtfsCounter, 98 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:50:48,430 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 473 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:50:48,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1885 states. [2022-07-19 10:50:48,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1885 to 1883. [2022-07-19 10:50:48,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1883 states, 1882 states have (on average 1.4059511158342188) internal successors, (2646), 1882 states have internal predecessors, (2646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:50:48,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1883 states to 1883 states and 2646 transitions. [2022-07-19 10:50:48,486 INFO L78 Accepts]: Start accepts. Automaton has 1883 states and 2646 transitions. Word has length 269 [2022-07-19 10:50:48,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:50:48,486 INFO L495 AbstractCegarLoop]: Abstraction has 1883 states and 2646 transitions. [2022-07-19 10:50:48,486 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-19 10:50:48,486 INFO L276 IsEmpty]: Start isEmpty. Operand 1883 states and 2646 transitions. [2022-07-19 10:50:48,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2022-07-19 10:50:48,492 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:50:48,492 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 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, 1, 1, 1, 1, 1] [2022-07-19 10:50:48,520 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-19 10:50:48,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:50:48,706 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:50:48,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:50:48,706 INFO L85 PathProgramCache]: Analyzing trace with hash -1812515673, now seen corresponding path program 1 times [2022-07-19 10:50:48,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:50:48,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221448431] [2022-07-19 10:50:48,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:50:48,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:50:48,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:50:48,764 INFO L134 CoverageAnalysis]: Checked inductivity of 877 backedges. 297 proven. 0 refuted. 0 times theorem prover too weak. 580 trivial. 0 not checked. [2022-07-19 10:50:48,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:50:48,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221448431] [2022-07-19 10:50:48,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221448431] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:50:48,765 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:50:48,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:50:48,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639941503] [2022-07-19 10:50:48,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:50:48,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:50:48,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:50:48,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:50:48,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:50:48,766 INFO L87 Difference]: Start difference. First operand 1883 states and 2646 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:50:48,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:50:48,887 INFO L93 Difference]: Finished difference Result 3868 states and 5432 transitions. [2022-07-19 10:50:48,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:50:48,888 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 307 [2022-07-19 10:50:48,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:50:48,894 INFO L225 Difference]: With dead ends: 3868 [2022-07-19 10:50:48,895 INFO L226 Difference]: Without dead ends: 1993 [2022-07-19 10:50:48,897 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-19 10:50:48,898 INFO L413 NwaCegarLoop]: 182 mSDtfsCounter, 12 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:50:48,898 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 268 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:50:48,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1993 states. [2022-07-19 10:50:48,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1993 to 1975. [2022-07-19 10:50:48,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1975 states, 1974 states have (on average 1.3971631205673758) internal successors, (2758), 1974 states have internal predecessors, (2758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:50:48,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1975 states to 1975 states and 2758 transitions. [2022-07-19 10:50:48,951 INFO L78 Accepts]: Start accepts. Automaton has 1975 states and 2758 transitions. Word has length 307 [2022-07-19 10:50:48,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:50:48,951 INFO L495 AbstractCegarLoop]: Abstraction has 1975 states and 2758 transitions. [2022-07-19 10:50:48,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:50:48,952 INFO L276 IsEmpty]: Start isEmpty. Operand 1975 states and 2758 transitions. [2022-07-19 10:50:48,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2022-07-19 10:50:48,957 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:50:48,958 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:50:48,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-19 10:50:48,958 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:50:48,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:50:48,959 INFO L85 PathProgramCache]: Analyzing trace with hash 493001237, now seen corresponding path program 1 times [2022-07-19 10:50:48,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:50:48,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024090986] [2022-07-19 10:50:48,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:50:48,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:50:49,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:50:49,026 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 435 proven. 0 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2022-07-19 10:50:49,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:50:49,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024090986] [2022-07-19 10:50:49,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024090986] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:50:49,027 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:50:49,027 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:50:49,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256837344] [2022-07-19 10:50:49,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:50:49,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:50:49,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:50:49,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:50:49,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:50:49,029 INFO L87 Difference]: Start difference. First operand 1975 states and 2758 transitions. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:50:49,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:50:49,158 INFO L93 Difference]: Finished difference Result 4164 states and 5840 transitions. [2022-07-19 10:50:49,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:50:49,159 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 327 [2022-07-19 10:50:49,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:50:49,166 INFO L225 Difference]: With dead ends: 4164 [2022-07-19 10:50:49,166 INFO L226 Difference]: Without dead ends: 2197 [2022-07-19 10:50:49,169 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-19 10:50:49,170 INFO L413 NwaCegarLoop]: 182 mSDtfsCounter, 28 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:50:49,171 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 268 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:50:49,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2197 states. [2022-07-19 10:50:49,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2197 to 2125. [2022-07-19 10:50:49,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2125 states, 2124 states have (on average 1.3832391713747645) internal successors, (2938), 2124 states have internal predecessors, (2938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:50:49,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2125 states to 2125 states and 2938 transitions. [2022-07-19 10:50:49,231 INFO L78 Accepts]: Start accepts. Automaton has 2125 states and 2938 transitions. Word has length 327 [2022-07-19 10:50:49,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:50:49,232 INFO L495 AbstractCegarLoop]: Abstraction has 2125 states and 2938 transitions. [2022-07-19 10:50:49,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:50:49,232 INFO L276 IsEmpty]: Start isEmpty. Operand 2125 states and 2938 transitions. [2022-07-19 10:50:49,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2022-07-19 10:50:49,238 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:50:49,239 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:50:49,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-19 10:50:49,239 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:50:49,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:50:49,240 INFO L85 PathProgramCache]: Analyzing trace with hash -1757399063, now seen corresponding path program 1 times [2022-07-19 10:50:49,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:50:49,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489566300] [2022-07-19 10:50:49,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:50:49,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:50:49,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:50:49,304 INFO L134 CoverageAnalysis]: Checked inductivity of 1215 backedges. 587 proven. 0 refuted. 0 times theorem prover too weak. 628 trivial. 0 not checked. [2022-07-19 10:50:49,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:50:49,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489566300] [2022-07-19 10:50:49,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489566300] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:50:49,305 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:50:49,305 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:50:49,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816369930] [2022-07-19 10:50:49,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:50:49,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:50:49,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:50:49,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:50:49,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:50:49,307 INFO L87 Difference]: Start difference. First operand 2125 states and 2938 transitions. Second operand has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:50:49,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:50:49,462 INFO L93 Difference]: Finished difference Result 4284 states and 5936 transitions. [2022-07-19 10:50:49,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:50:49,462 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 353 [2022-07-19 10:50:49,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:50:49,469 INFO L225 Difference]: With dead ends: 4284 [2022-07-19 10:50:49,469 INFO L226 Difference]: Without dead ends: 2167 [2022-07-19 10:50:49,472 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-19 10:50:49,473 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 18 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:50:49,473 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 267 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:50:49,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2167 states. [2022-07-19 10:50:49,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2167 to 2125. [2022-07-19 10:50:49,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2125 states, 2124 states have (on average 1.3606403013182675) internal successors, (2890), 2124 states have internal predecessors, (2890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:50:49,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2125 states to 2125 states and 2890 transitions. [2022-07-19 10:50:49,529 INFO L78 Accepts]: Start accepts. Automaton has 2125 states and 2890 transitions. Word has length 353 [2022-07-19 10:50:49,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:50:49,530 INFO L495 AbstractCegarLoop]: Abstraction has 2125 states and 2890 transitions. [2022-07-19 10:50:49,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:50:49,530 INFO L276 IsEmpty]: Start isEmpty. Operand 2125 states and 2890 transitions. [2022-07-19 10:50:49,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2022-07-19 10:50:49,536 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:50:49,537 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 10:50:49,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-19 10:50:49,537 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:50:49,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:50:49,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1876884711, now seen corresponding path program 1 times [2022-07-19 10:50:49,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:50:49,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161598936] [2022-07-19 10:50:49,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:50:49,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:50:49,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:50:49,605 INFO L134 CoverageAnalysis]: Checked inductivity of 1396 backedges. 905 proven. 26 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2022-07-19 10:50:49,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:50:49,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161598936] [2022-07-19 10:50:49,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161598936] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:50:49,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [690128855] [2022-07-19 10:50:49,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:50:49,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:50:49,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:50:49,612 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-19 10:50:49,613 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-19 10:50:49,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:50:49,741 INFO L263 TraceCheckSpWp]: Trace formula consists of 599 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-19 10:50:49,744 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:50:49,836 INFO L134 CoverageAnalysis]: Checked inductivity of 1396 backedges. 905 proven. 26 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2022-07-19 10:50:49,836 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:50:49,927 INFO L134 CoverageAnalysis]: Checked inductivity of 1396 backedges. 905 proven. 26 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2022-07-19 10:50:49,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [690128855] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:50:49,928 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 10:50:49,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-07-19 10:50:49,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735326887] [2022-07-19 10:50:49,928 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 10:50:49,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 10:50:49,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:50:49,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 10:50:49,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-19 10:50:49,930 INFO L87 Difference]: Start difference. First operand 2125 states and 2890 transitions. Second operand has 6 states, 6 states have (on average 40.0) internal successors, (240), 6 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-19 10:50:50,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:50:50,394 INFO L93 Difference]: Finished difference Result 6740 states and 9173 transitions. [2022-07-19 10:50:50,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-19 10:50:50,395 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 40.0) internal successors, (240), 6 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) Word has length 370 [2022-07-19 10:50:50,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:50:50,409 INFO L225 Difference]: With dead ends: 6740 [2022-07-19 10:50:50,410 INFO L226 Difference]: Without dead ends: 4466 [2022-07-19 10:50:50,414 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 750 GetRequests, 742 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2022-07-19 10:50:50,415 INFO L413 NwaCegarLoop]: 192 mSDtfsCounter, 661 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 661 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-19 10:50:50,415 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [661 Valid, 470 Invalid, 512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 427 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-19 10:50:50,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4466 states. [2022-07-19 10:50:50,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4466 to 2302. [2022-07-19 10:50:50,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2302 states, 2301 states have (on average 1.348109517601043) internal successors, (3102), 2301 states have internal predecessors, (3102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:50:50,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2302 states to 2302 states and 3102 transitions. [2022-07-19 10:50:50,500 INFO L78 Accepts]: Start accepts. Automaton has 2302 states and 3102 transitions. Word has length 370 [2022-07-19 10:50:50,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:50:50,501 INFO L495 AbstractCegarLoop]: Abstraction has 2302 states and 3102 transitions. [2022-07-19 10:50:50,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 40.0) internal successors, (240), 6 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-19 10:50:50,501 INFO L276 IsEmpty]: Start isEmpty. Operand 2302 states and 3102 transitions. [2022-07-19 10:50:50,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 439 [2022-07-19 10:50:50,509 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:50:50,510 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 9, 9, 9, 9, 8, 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:50:50,535 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-19 10:50:50,731 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:50:50,731 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:50:50,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:50:50,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1628763683, now seen corresponding path program 1 times [2022-07-19 10:50:50,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:50:50,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944004602] [2022-07-19 10:50:50,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:50:50,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:50:50,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:50:50,796 INFO L134 CoverageAnalysis]: Checked inductivity of 2015 backedges. 975 proven. 0 refuted. 0 times theorem prover too weak. 1040 trivial. 0 not checked. [2022-07-19 10:50:50,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:50:50,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944004602] [2022-07-19 10:50:50,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944004602] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:50:50,797 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:50:50,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:50:50,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717032002] [2022-07-19 10:50:50,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:50:50,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:50:50,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:50:50,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:50:50,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:50:50,798 INFO L87 Difference]: Start difference. First operand 2302 states and 3102 transitions. Second operand has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:50:50,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:50:50,934 INFO L93 Difference]: Finished difference Result 4608 states and 6204 transitions. [2022-07-19 10:50:50,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:50:50,935 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 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 438 [2022-07-19 10:50:50,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:50:50,953 INFO L225 Difference]: With dead ends: 4608 [2022-07-19 10:50:50,953 INFO L226 Difference]: Without dead ends: 2314 [2022-07-19 10:50:50,956 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-19 10:50:50,957 INFO L413 NwaCegarLoop]: 178 mSDtfsCounter, 11 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:50:50,957 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 264 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:50:50,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2314 states. [2022-07-19 10:50:51,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2314 to 2302. [2022-07-19 10:50:51,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2302 states, 2301 states have (on average 1.3272490221642763) internal successors, (3054), 2301 states have internal predecessors, (3054), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:50:51,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2302 states to 2302 states and 3054 transitions. [2022-07-19 10:50:51,039 INFO L78 Accepts]: Start accepts. Automaton has 2302 states and 3054 transitions. Word has length 438 [2022-07-19 10:50:51,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:50:51,039 INFO L495 AbstractCegarLoop]: Abstraction has 2302 states and 3054 transitions. [2022-07-19 10:50:51,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:50:51,040 INFO L276 IsEmpty]: Start isEmpty. Operand 2302 states and 3054 transitions. [2022-07-19 10:50:51,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 471 [2022-07-19 10:50:51,050 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:50:51,052 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 13, 13, 12, 12, 11, 11, 10, 10, 10, 10, 8, 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, 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-19 10:50:51,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-19 10:50:51,052 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:50:51,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:50:51,053 INFO L85 PathProgramCache]: Analyzing trace with hash 1752367566, now seen corresponding path program 1 times [2022-07-19 10:50:51,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:50:51,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85764046] [2022-07-19 10:50:51,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:50:51,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:50:51,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:50:51,112 INFO L134 CoverageAnalysis]: Checked inductivity of 2338 backedges. 1323 proven. 0 refuted. 0 times theorem prover too weak. 1015 trivial. 0 not checked. [2022-07-19 10:50:51,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:50:51,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85764046] [2022-07-19 10:50:51,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85764046] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:50:51,113 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:50:51,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:50:51,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877484841] [2022-07-19 10:50:51,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:50:51,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:50:51,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:50:51,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:50:51,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:50:51,116 INFO L87 Difference]: Start difference. First operand 2302 states and 3054 transitions. Second operand has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:50:51,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:50:51,257 INFO L93 Difference]: Finished difference Result 4812 states and 6402 transitions. [2022-07-19 10:50:51,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:50:51,257 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 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 470 [2022-07-19 10:50:51,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:50:51,266 INFO L225 Difference]: With dead ends: 4812 [2022-07-19 10:50:51,266 INFO L226 Difference]: Without dead ends: 2518 [2022-07-19 10:50:51,269 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:50:51,270 INFO L413 NwaCegarLoop]: 176 mSDtfsCounter, 11 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:50:51,271 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 262 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:50:51,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2518 states. [2022-07-19 10:50:51,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2518 to 2506. [2022-07-19 10:50:51,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2506 states, 2505 states have (on average 1.3125748502994012) internal successors, (3288), 2505 states have internal predecessors, (3288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:50:51,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2506 states to 2506 states and 3288 transitions. [2022-07-19 10:50:51,349 INFO L78 Accepts]: Start accepts. Automaton has 2506 states and 3288 transitions. Word has length 470 [2022-07-19 10:50:51,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:50:51,350 INFO L495 AbstractCegarLoop]: Abstraction has 2506 states and 3288 transitions. [2022-07-19 10:50:51,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:50:51,350 INFO L276 IsEmpty]: Start isEmpty. Operand 2506 states and 3288 transitions. [2022-07-19 10:50:51,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 533 [2022-07-19 10:50:51,355 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:50:51,356 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, 6, 6, 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] [2022-07-19 10:50:51,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-07-19 10:50:51,357 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:50:51,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:50:51,357 INFO L85 PathProgramCache]: Analyzing trace with hash -742298620, now seen corresponding path program 1 times [2022-07-19 10:50:51,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:50:51,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748275517] [2022-07-19 10:50:51,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:50:51,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:50:51,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:50:51,433 INFO L134 CoverageAnalysis]: Checked inductivity of 3103 backedges. 1760 proven. 0 refuted. 0 times theorem prover too weak. 1343 trivial. 0 not checked. [2022-07-19 10:50:51,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:50:51,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748275517] [2022-07-19 10:50:51,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748275517] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:50:51,433 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:50:51,433 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:50:51,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105401914] [2022-07-19 10:50:51,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:50:51,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:50:51,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:50:51,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:50:51,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:50:51,435 INFO L87 Difference]: Start difference. First operand 2506 states and 3288 transitions. Second operand has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:50:51,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:50:51,599 INFO L93 Difference]: Finished difference Result 5232 states and 6894 transitions. [2022-07-19 10:50:51,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:50:51,599 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 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 532 [2022-07-19 10:50:51,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:50:51,603 INFO L225 Difference]: With dead ends: 5232 [2022-07-19 10:50:51,604 INFO L226 Difference]: Without dead ends: 2734 [2022-07-19 10:50:51,606 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-19 10:50:51,607 INFO L413 NwaCegarLoop]: 176 mSDtfsCounter, 11 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:50:51,608 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 262 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:50:51,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2734 states. [2022-07-19 10:50:51,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2734 to 2722. [2022-07-19 10:50:51,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2722 states, 2721 states have (on average 1.298787210584344) internal successors, (3534), 2721 states have internal predecessors, (3534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:50:51,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2722 states to 2722 states and 3534 transitions. [2022-07-19 10:50:51,680 INFO L78 Accepts]: Start accepts. Automaton has 2722 states and 3534 transitions. Word has length 532 [2022-07-19 10:50:51,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:50:51,681 INFO L495 AbstractCegarLoop]: Abstraction has 2722 states and 3534 transitions. [2022-07-19 10:50:51,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:50:51,681 INFO L276 IsEmpty]: Start isEmpty. Operand 2722 states and 3534 transitions. [2022-07-19 10:50:51,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 599 [2022-07-19 10:50:51,687 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:50:51,687 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] [2022-07-19 10:50:51,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-07-19 10:50:51,688 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:50:51,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:50:51,688 INFO L85 PathProgramCache]: Analyzing trace with hash -1835374162, now seen corresponding path program 1 times [2022-07-19 10:50:51,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:50:51,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647891255] [2022-07-19 10:50:51,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:50:51,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:50:51,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:50:51,783 INFO L134 CoverageAnalysis]: Checked inductivity of 4010 backedges. 2316 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2022-07-19 10:50:51,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:50:51,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647891255] [2022-07-19 10:50:51,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647891255] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:50:51,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [878495427] [2022-07-19 10:50:51,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:50:51,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:50:51,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:50:51,785 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-19 10:50:51,807 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-19 10:50:51,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:50:51,956 INFO L263 TraceCheckSpWp]: Trace formula consists of 913 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-19 10:50:51,960 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:50:52,055 INFO L134 CoverageAnalysis]: Checked inductivity of 4010 backedges. 2316 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2022-07-19 10:50:52,055 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:50:52,130 INFO L134 CoverageAnalysis]: Checked inductivity of 4010 backedges. 2316 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2022-07-19 10:50:52,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [878495427] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:50:52,130 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 10:50:52,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2022-07-19 10:50:52,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177908562] [2022-07-19 10:50:52,131 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 10:50:52,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-19 10:50:52,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:50:52,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-19 10:50:52,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-07-19 10:50:52,133 INFO L87 Difference]: Start difference. First operand 2722 states and 3534 transitions. Second operand has 8 states, 8 states have (on average 41.375) internal successors, (331), 8 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:50:52,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:50:52,504 INFO L93 Difference]: Finished difference Result 4932 states and 6426 transitions. [2022-07-19 10:50:52,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 10:50:52,505 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 41.375) internal successors, (331), 8 states have internal predecessors, (331), 0 states have call successors, (0), 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 598 [2022-07-19 10:50:52,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:50:52,506 INFO L225 Difference]: With dead ends: 4932 [2022-07-19 10:50:52,506 INFO L226 Difference]: Without dead ends: 0 [2022-07-19 10:50:52,511 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1204 GetRequests, 1195 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-07-19 10:50:52,511 INFO L413 NwaCegarLoop]: 216 mSDtfsCounter, 182 mSDsluCounter, 612 mSDsCounter, 0 mSdLazyCounter, 598 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 828 SdHoareTripleChecker+Invalid, 652 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 598 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-19 10:50:52,512 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 828 Invalid, 652 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 598 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-19 10:50:52,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-19 10:50:52,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-19 10:50:52,512 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-19 10:50:52,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-19 10:50:52,512 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 598 [2022-07-19 10:50:52,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:50:52,513 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-19 10:50:52,513 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 41.375) internal successors, (331), 8 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:50:52,513 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-19 10:50:52,513 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-19 10:50:52,516 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-19 10:50:52,542 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-07-19 10:50:52,731 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,SelfDestructingSolverStorable27 [2022-07-19 10:50:52,733 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-19 10:51:02,064 INFO L899 garLoopResultBuilder]: For program point L531(lines 531 536) no Hoare annotation was computed. [2022-07-19 10:51:02,064 INFO L899 garLoopResultBuilder]: For program point L399(lines 399 405) no Hoare annotation was computed. [2022-07-19 10:51:02,064 INFO L899 garLoopResultBuilder]: For program point L366(lines 366 385) no Hoare annotation was computed. [2022-07-19 10:51:02,064 INFO L895 garLoopResultBuilder]: At program point L598(lines 109 666) the Hoare annotation is: (let ((.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))) (.cse6 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse7 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse8 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse5 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse9 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse12 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (.cse1 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse11 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8448)) (.cse0 (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse10 (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse14 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576)) (.cse13 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse15 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse9 .cse7 .cse8) (and .cse10 .cse11 (= 3 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|)) (and .cse5 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) .cse8 .cse13) (and .cse10 .cse12) (and .cse9 .cse14 .cse15) (and .cse5 .cse14 .cse15) (and .cse13 .cse12) (and .cse9 .cse12) (and .cse1 .cse11) (and (<= 8672 |ULTIMATE.start_ssl3_accept_~s__state~0#1|) .cse0 .cse10) (and .cse14 .cse13 .cse15))) [2022-07-19 10:51:02,065 INFO L899 garLoopResultBuilder]: For program point L565(lines 565 569) no Hoare annotation was computed. [2022-07-19 10:51:02,065 INFO L899 garLoopResultBuilder]: For program point L499(lines 499 503) no Hoare annotation was computed. [2022-07-19 10:51:02,065 INFO L899 garLoopResultBuilder]: For program point L367(lines 367 371) no Hoare annotation was computed. [2022-07-19 10:51:02,065 INFO L899 garLoopResultBuilder]: For program point L367-2(lines 366 383) no Hoare annotation was computed. [2022-07-19 10:51:02,065 INFO L899 garLoopResultBuilder]: For program point L202(lines 202 605) no Hoare annotation was computed. [2022-07-19 10:51:02,065 INFO L899 garLoopResultBuilder]: For program point L169(lines 169 616) no Hoare annotation was computed. [2022-07-19 10:51:02,065 INFO L899 garLoopResultBuilder]: For program point L136(lines 136 627) no Hoare annotation was computed. [2022-07-19 10:51:02,066 INFO L899 garLoopResultBuilder]: For program point L467(lines 467 471) no Hoare annotation was computed. [2022-07-19 10:51:02,066 INFO L899 garLoopResultBuilder]: For program point L335-1(lines 335 344) no Hoare annotation was computed. [2022-07-19 10:51:02,066 INFO L902 garLoopResultBuilder]: At program point L667(lines 108 668) the Hoare annotation is: true [2022-07-19 10:51:02,066 INFO L899 garLoopResultBuilder]: For program point L205(lines 205 604) no Hoare annotation was computed. [2022-07-19 10:51:02,066 INFO L899 garLoopResultBuilder]: For program point L172(lines 172 615) no Hoare annotation was computed. [2022-07-19 10:51:02,066 INFO L899 garLoopResultBuilder]: For program point L139(lines 139 626) no Hoare annotation was computed. [2022-07-19 10:51:02,066 INFO L899 garLoopResultBuilder]: For program point L239(lines 239 256) no Hoare annotation was computed. [2022-07-19 10:51:02,067 INFO L895 garLoopResultBuilder]: At program point L206(lines 202 605) 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 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse6 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse7 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse8 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse9 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse10 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|)) .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0) .cse10))) [2022-07-19 10:51:02,067 INFO L895 garLoopResultBuilder]: At program point L173(lines 169 616) the Hoare annotation is: (let ((.cse12 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse0 (not (<= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse14 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse15 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse1 (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse2 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.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 (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse9 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse10 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse11 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656))) (.cse13 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse1 .cse2 .cse3 .cse4 .cse14 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse15 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse14 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse15 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13) (and .cse1 (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13))) [2022-07-19 10:51:02,067 INFO L899 garLoopResultBuilder]: For program point L239-2(lines 219 597) no Hoare annotation was computed. [2022-07-19 10:51:02,067 INFO L899 garLoopResultBuilder]: For program point L636(lines 636 664) no Hoare annotation was computed. [2022-07-19 10:51:02,067 INFO L899 garLoopResultBuilder]: For program point L339(lines 339 343) no Hoare annotation was computed. [2022-07-19 10:51:02,068 INFO L899 garLoopResultBuilder]: For program point L637(lines 637 661) no Hoare annotation was computed. [2022-07-19 10:51:02,068 INFO L899 garLoopResultBuilder]: For program point L571(lines 571 575) no Hoare annotation was computed. [2022-07-19 10:51:02,068 INFO L899 garLoopResultBuilder]: For program point L538(lines 538 542) no Hoare annotation was computed. [2022-07-19 10:51:02,068 INFO L899 garLoopResultBuilder]: For program point L571-2(lines 571 575) no Hoare annotation was computed. [2022-07-19 10:51:02,069 INFO L899 garLoopResultBuilder]: For program point L472(lines 472 483) no Hoare annotation was computed. [2022-07-19 10:51:02,069 INFO L899 garLoopResultBuilder]: For program point L538-2(lines 219 597) no Hoare annotation was computed. [2022-07-19 10:51:02,069 INFO L899 garLoopResultBuilder]: For program point L439(lines 439 443) no Hoare annotation was computed. [2022-07-19 10:51:02,069 INFO L895 garLoopResultBuilder]: At program point L373(lines 356 391) the Hoare annotation is: (let ((.cse11 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse0 (not (<= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse13 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse5 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse12 (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))) (.cse14 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse15 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse6 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse7 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse8 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse9 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse16 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656))) (.cse17 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~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 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse11 .cse10) (and .cse12 .cse1 .cse2 .cse3 .cse4 .cse13 .cse14 .cse15 .cse6 .cse7 .cse8 .cse9 .cse16 .cse17 .cse10) (and .cse12 .cse1 .cse2 .cse3 .cse4 .cse14 .cse15 .cse6 .cse7 .cse8 .cse9 .cse16 .cse11 .cse17 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse13 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse12 .cse1 .cse2 .cse3 .cse4 .cse14 .cse5 .cse15 .cse6 .cse7 .cse8 .cse9 .cse16 .cse17 .cse10) (and .cse12 (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse1 .cse2 .cse3 .cse4 .cse14 .cse15 .cse6 .cse7 .cse8 .cse9 .cse16 .cse17 .cse10))) [2022-07-19 10:51:02,069 INFO L899 garLoopResultBuilder]: For program point L241(lines 241 246) no Hoare annotation was computed. [2022-07-19 10:51:02,069 INFO L899 garLoopResultBuilder]: For program point L208(lines 208 603) no Hoare annotation was computed. [2022-07-19 10:51:02,070 INFO L899 garLoopResultBuilder]: For program point L175(lines 175 614) no Hoare annotation was computed. [2022-07-19 10:51:02,070 INFO L899 garLoopResultBuilder]: For program point L142(lines 142 625) no Hoare annotation was computed. [2022-07-19 10:51:02,070 INFO L895 garLoopResultBuilder]: At program point L109-2(lines 109 666) the Hoare annotation is: (let ((.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))) (.cse6 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse7 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse8 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse5 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse9 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse12 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (.cse1 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse11 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8448)) (.cse0 (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse10 (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse14 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576)) (.cse13 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse15 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse9 .cse7 .cse8) (and .cse10 .cse11 (= 3 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|)) (and .cse5 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) .cse8 .cse13) (and .cse10 .cse12) (and .cse9 .cse14 .cse15) (and .cse5 .cse14 .cse15) (and .cse13 .cse12) (and .cse9 .cse12) (and .cse1 .cse11) (and (<= 8672 |ULTIMATE.start_ssl3_accept_~s__state~0#1|) .cse0 .cse10) (and .cse14 .cse13 .cse15))) [2022-07-19 10:51:02,070 INFO L899 garLoopResultBuilder]: For program point L671(lines 671 675) no Hoare annotation was computed. [2022-07-19 10:51:02,070 INFO L899 garLoopResultBuilder]: For program point L638(lines 638 647) no Hoare annotation was computed. [2022-07-19 10:51:02,070 INFO L899 garLoopResultBuilder]: For program point L671-2(lines 671 675) no Hoare annotation was computed. [2022-07-19 10:51:02,070 INFO L899 garLoopResultBuilder]: For program point L638-2(lines 637 659) no Hoare annotation was computed. [2022-07-19 10:51:02,071 INFO L895 garLoopResultBuilder]: At program point L407(lines 398 429) the Hoare annotation is: (let ((.cse5 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse14 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse11 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (.cse13 (not (<= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.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| 8481))) (.cse4 (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 (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse9 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse10 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656))) (.cse15 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.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 .cse12) (and .cse13 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12) (and .cse0 (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse13 .cse0 .cse1 .cse2 .cse3 .cse14 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse14 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse15 .cse11 .cse12) (and .cse13 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse15 .cse12))) [2022-07-19 10:51:02,071 INFO L895 garLoopResultBuilder]: At program point L176(lines 175 614) the Hoare annotation is: (let ((.cse3 (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse1 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse5 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse2 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (.cse6 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse0 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8448)) (.cse4 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse0 .cse2) (and .cse3 .cse0 (= 3 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|)) (and .cse0 .cse4 .cse1) (and .cse5 .cse0 .cse4) (and .cse6 .cse0 .cse2) (and .cse5 .cse0 .cse2) (and .cse6 .cse0 .cse4))) [2022-07-19 10:51:02,071 INFO L895 garLoopResultBuilder]: At program point L143(lines 136 627) the Hoare annotation is: (let ((.cse11 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse0 (not (<= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse13 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse5 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse12 (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))) (.cse14 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse15 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse6 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse7 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse8 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse9 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse16 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656))) (.cse17 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~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 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse11 .cse10) (and .cse12 .cse1 .cse2 .cse3 .cse4 .cse13 .cse14 .cse15 .cse6 .cse7 .cse8 .cse9 .cse16 .cse17 .cse10) (and .cse12 .cse1 .cse2 .cse3 .cse4 .cse14 .cse15 .cse6 .cse7 .cse8 .cse9 .cse16 .cse11 .cse17 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse13 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse12 .cse1 .cse2 .cse3 .cse4 .cse14 .cse5 .cse15 .cse6 .cse7 .cse8 .cse9 .cse16 .cse17 .cse10) (and .cse12 (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse1 .cse2 .cse3 .cse4 .cse14 .cse15 .cse6 .cse7 .cse8 .cse9 .cse16 .cse17 .cse10))) [2022-07-19 10:51:02,071 INFO L899 garLoopResultBuilder]: For program point L110(line 110) no Hoare annotation was computed. [2022-07-19 10:51:02,071 INFO L899 garLoopResultBuilder]: For program point L375(lines 375 379) no Hoare annotation was computed. [2022-07-19 10:51:02,071 INFO L899 garLoopResultBuilder]: For program point L640(lines 640 644) no Hoare annotation was computed. [2022-07-19 10:51:02,072 INFO L899 garLoopResultBuilder]: For program point L409(lines 409 415) no Hoare annotation was computed. [2022-07-19 10:51:02,072 INFO L899 garLoopResultBuilder]: For program point L211(lines 211 602) no Hoare annotation was computed. [2022-07-19 10:51:02,072 INFO L899 garLoopResultBuilder]: For program point L178(lines 178 613) no Hoare annotation was computed. [2022-07-19 10:51:02,072 INFO L899 garLoopResultBuilder]: For program point L145(lines 145 624) no Hoare annotation was computed. [2022-07-19 10:51:02,072 INFO L899 garLoopResultBuilder]: For program point L112(lines 112 635) no Hoare annotation was computed. [2022-07-19 10:51:02,072 INFO L899 garLoopResultBuilder]: For program point L476(lines 476 480) no Hoare annotation was computed. [2022-07-19 10:51:02,072 INFO L895 garLoopResultBuilder]: At program point L212(lines 208 603) the Hoare annotation is: (let ((.cse0 (<= 8672 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (or (and .cse0 (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (and .cse0 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (and .cse0 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (and .cse0 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)))) [2022-07-19 10:51:02,073 INFO L895 garLoopResultBuilder]: At program point L113(lines 112 635) the Hoare annotation is: (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) [2022-07-19 10:51:02,073 INFO L899 garLoopResultBuilder]: For program point L511(lines 511 515) no Hoare annotation was computed. [2022-07-19 10:51:02,073 INFO L899 garLoopResultBuilder]: For program point L511-2(lines 219 597) no Hoare annotation was computed. [2022-07-19 10:51:02,073 INFO L899 garLoopResultBuilder]: For program point L247(lines 247 252) no Hoare annotation was computed. [2022-07-19 10:51:02,073 INFO L899 garLoopResultBuilder]: For program point L214(lines 214 601) no Hoare annotation was computed. [2022-07-19 10:51:02,073 INFO L899 garLoopResultBuilder]: For program point L181(lines 181 612) no Hoare annotation was computed. [2022-07-19 10:51:02,073 INFO L899 garLoopResultBuilder]: For program point L148(lines 148 623) no Hoare annotation was computed. [2022-07-19 10:51:02,073 INFO L899 garLoopResultBuilder]: For program point L115(lines 115 634) no Hoare annotation was computed. [2022-07-19 10:51:02,074 INFO L895 garLoopResultBuilder]: At program point L215(lines 214 601) the Hoare annotation is: (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) [2022-07-19 10:51:02,074 INFO L895 garLoopResultBuilder]: At program point L182(lines 178 613) the Hoare annotation is: (let ((.cse5 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse17 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse16 (< |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656)) (.cse15 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse0 (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse6 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse7 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse8 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse9 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse10 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse11 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse12 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656))) (.cse13 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (.cse14 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse15 .cse13 .cse14) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse8 .cse9 .cse16 .cse10 .cse11 .cse14) (and .cse1 .cse2 .cse3 .cse4 .cse17 .cse8 .cse9 .cse16 .cse10 .cse11 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse17 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse1 .cse2 .cse3 .cse4 .cse8 .cse9 .cse16 .cse10 .cse11 .cse15 .cse14) (and .cse0 (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14))) [2022-07-19 10:51:02,074 INFO L895 garLoopResultBuilder]: At program point L149(lines 145 624) the Hoare annotation is: (let ((.cse6 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse13 (not (<= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse14 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse11 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (.cse0 (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse5 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse7 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse8 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse9 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse10 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656))) (.cse15 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.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 .cse12) (and .cse13 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12) (and .cse13 .cse0 .cse1 .cse2 .cse3 .cse4 .cse14 .cse5 .cse7 .cse8 .cse9 .cse10 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse15 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse14 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 (< |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576) .cse5 .cse7 .cse8 .cse9 .cse10 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576) .cse15 .cse12))) [2022-07-19 10:51:02,074 INFO L899 garLoopResultBuilder]: For program point L83(lines 83 91) no Hoare annotation was computed. [2022-07-19 10:51:02,074 INFO L899 garLoopResultBuilder]: For program point L282(lines 282 286) no Hoare annotation was computed. [2022-07-19 10:51:02,074 INFO L899 garLoopResultBuilder]: For program point L316(lines 316 320) no Hoare annotation was computed. [2022-07-19 10:51:02,075 INFO L899 garLoopResultBuilder]: For program point L316-2(lines 219 597) no Hoare annotation was computed. [2022-07-19 10:51:02,075 INFO L899 garLoopResultBuilder]: For program point L184(lines 184 611) no Hoare annotation was computed. [2022-07-19 10:51:02,075 INFO L899 garLoopResultBuilder]: For program point L151(lines 151 622) no Hoare annotation was computed. [2022-07-19 10:51:02,075 INFO L899 garLoopResultBuilder]: For program point L118(lines 118 633) no Hoare annotation was computed. [2022-07-19 10:51:02,075 INFO L899 garLoopResultBuilder]: For program point L581(lines 581 591) no Hoare annotation was computed. [2022-07-19 10:51:02,075 INFO L899 garLoopResultBuilder]: For program point L581-1(lines 581 591) no Hoare annotation was computed. [2022-07-19 10:51:02,075 INFO L899 garLoopResultBuilder]: For program point L449-1(lines 449 461) no Hoare annotation was computed. [2022-07-19 10:51:02,076 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-19 10:51:02,076 INFO L895 garLoopResultBuilder]: At program point L218(lines 217 600) the Hoare annotation is: (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) [2022-07-19 10:51:02,076 INFO L899 garLoopResultBuilder]: For program point L86(lines 86 90) no Hoare annotation was computed. [2022-07-19 10:51:02,076 INFO L899 garLoopResultBuilder]: For program point L86-2(lines 83 91) no Hoare annotation was computed. [2022-07-19 10:51:02,076 INFO L895 garLoopResultBuilder]: At program point L417(lines 408 428) the Hoare annotation is: (let ((.cse5 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse14 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse11 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (.cse13 (not (<= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.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| 8481))) (.cse4 (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 (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse9 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse10 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656))) (.cse15 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.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 .cse12) (and .cse13 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12) (and .cse0 (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse13 .cse0 .cse1 .cse2 .cse3 .cse14 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse14 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse15 .cse11 .cse12) (and .cse13 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse15 .cse12))) [2022-07-19 10:51:02,076 INFO L899 garLoopResultBuilder]: For program point L351(lines 351 355) no Hoare annotation was computed. [2022-07-19 10:51:02,076 INFO L899 garLoopResultBuilder]: For program point L351-2(lines 219 597) no Hoare annotation was computed. [2022-07-19 10:51:02,077 INFO L902 garLoopResultBuilder]: At program point L682(lines 74 684) the Hoare annotation is: true [2022-07-19 10:51:02,077 INFO L899 garLoopResultBuilder]: For program point L649(lines 649 655) no Hoare annotation was computed. [2022-07-19 10:51:02,077 INFO L899 garLoopResultBuilder]: For program point L550(lines 550 555) no Hoare annotation was computed. [2022-07-19 10:51:02,077 INFO L899 garLoopResultBuilder]: For program point L187(lines 187 610) no Hoare annotation was computed. [2022-07-19 10:51:02,077 INFO L899 garLoopResultBuilder]: For program point L154(lines 154 621) no Hoare annotation was computed. [2022-07-19 10:51:02,077 INFO L899 garLoopResultBuilder]: For program point L121(lines 121 632) no Hoare annotation was computed. [2022-07-19 10:51:02,077 INFO L902 garLoopResultBuilder]: At program point L683(lines 19 685) the Hoare annotation is: true [2022-07-19 10:51:02,077 INFO L899 garLoopResultBuilder]: For program point L584(lines 584 588) no Hoare annotation was computed. [2022-07-19 10:51:02,078 INFO L899 garLoopResultBuilder]: For program point L452(lines 452 457) no Hoare annotation was computed. [2022-07-19 10:51:02,078 INFO L895 garLoopResultBuilder]: At program point L188(lines 184 611) the Hoare annotation is: (let ((.cse5 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse17 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse16 (< |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656)) (.cse15 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse0 (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse6 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse7 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse8 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse9 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse10 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse11 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse12 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656))) (.cse13 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (.cse14 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse15 .cse13 .cse14) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse8 .cse9 .cse16 .cse10 .cse11 .cse14) (and .cse1 .cse2 .cse3 .cse4 .cse17 .cse8 .cse9 .cse16 .cse10 .cse11 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse17 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse1 .cse2 .cse3 .cse4 .cse8 .cse9 .cse16 .cse10 .cse11 .cse15 .cse14) (and .cse0 (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14))) [2022-07-19 10:51:02,078 INFO L895 garLoopResultBuilder]: At program point L155(lines 151 622) the Hoare annotation is: (let ((.cse11 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse0 (not (<= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse13 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse5 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse12 (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))) (.cse14 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse15 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse6 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse7 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse8 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse9 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse16 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656))) (.cse17 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~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 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse11 .cse10) (and .cse12 .cse1 .cse2 .cse3 .cse4 .cse13 .cse14 .cse15 .cse6 .cse7 .cse8 .cse9 .cse16 .cse17 .cse10) (and .cse12 .cse1 .cse2 .cse3 .cse4 .cse14 .cse15 .cse6 .cse7 .cse8 .cse9 .cse16 .cse11 .cse17 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse13 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse12 .cse1 .cse2 .cse3 .cse4 .cse14 .cse5 .cse15 .cse6 .cse7 .cse8 .cse9 .cse16 .cse17 .cse10) (and .cse12 (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse1 .cse2 .cse3 .cse4 .cse14 .cse15 .cse6 .cse7 .cse8 .cse9 .cse16 .cse17 .cse10))) [2022-07-19 10:51:02,078 INFO L899 garLoopResultBuilder]: For program point L420(lines 420 424) no Hoare annotation was computed. [2022-07-19 10:51:02,078 INFO L895 garLoopResultBuilder]: At program point L222(lines 115 634) the Hoare annotation is: (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) [2022-07-19 10:51:02,078 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-19 10:51:02,079 INFO L899 garLoopResultBuilder]: For program point L190(lines 190 609) no Hoare annotation was computed. [2022-07-19 10:51:02,079 INFO L899 garLoopResultBuilder]: For program point L157(lines 157 620) no Hoare annotation was computed. [2022-07-19 10:51:02,079 INFO L899 garLoopResultBuilder]: For program point L124(lines 124 631) no Hoare annotation was computed. [2022-07-19 10:51:02,079 INFO L899 garLoopResultBuilder]: For program point L521(lines 521 525) no Hoare annotation was computed. [2022-07-19 10:51:02,079 INFO L899 garLoopResultBuilder]: For program point L488(lines 488 492) no Hoare annotation was computed. [2022-07-19 10:51:02,079 INFO L899 garLoopResultBuilder]: For program point L521-2(lines 521 525) no Hoare annotation was computed. [2022-07-19 10:51:02,079 INFO L899 garLoopResultBuilder]: For program point L93(lines 93 101) no Hoare annotation was computed. [2022-07-19 10:51:02,080 INFO L899 garLoopResultBuilder]: For program point L93-1(lines 74 684) no Hoare annotation was computed. [2022-07-19 10:51:02,080 INFO L899 garLoopResultBuilder]: For program point L193(lines 193 608) no Hoare annotation was computed. [2022-07-19 10:51:02,080 INFO L899 garLoopResultBuilder]: For program point L160(lines 160 619) no Hoare annotation was computed. [2022-07-19 10:51:02,080 INFO L899 garLoopResultBuilder]: For program point L127(lines 127 630) no Hoare annotation was computed. [2022-07-19 10:51:02,080 INFO L899 garLoopResultBuilder]: For program point L94(lines 94 98) no Hoare annotation was computed. [2022-07-19 10:51:02,080 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-19 10:51:02,080 INFO L899 garLoopResultBuilder]: For program point L359(lines 359 390) no Hoare annotation was computed. [2022-07-19 10:51:02,080 INFO L899 garLoopResultBuilder]: For program point L326(lines 326 330) no Hoare annotation was computed. [2022-07-19 10:51:02,080 INFO L899 garLoopResultBuilder]: For program point L326-2(lines 326 330) no Hoare annotation was computed. [2022-07-19 10:51:02,081 INFO L899 garLoopResultBuilder]: For program point L227(lines 227 231) no Hoare annotation was computed. [2022-07-19 10:51:02,081 INFO L895 garLoopResultBuilder]: At program point L194(lines 190 609) the Hoare annotation is: (let ((.cse5 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse17 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse16 (< |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656)) (.cse15 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse0 (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse6 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse7 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse8 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse9 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse10 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse11 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse12 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656))) (.cse13 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (.cse14 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse15 .cse13 .cse14) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse8 .cse9 .cse16 .cse10 .cse11 .cse14) (and .cse1 .cse2 .cse3 .cse4 .cse17 .cse8 .cse9 .cse16 .cse10 .cse11 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse17 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse1 .cse2 .cse3 .cse4 .cse8 .cse9 .cse16 .cse10 .cse11 .cse15 .cse14) (and .cse0 (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14))) [2022-07-19 10:51:02,081 INFO L895 garLoopResultBuilder]: At program point L161(lines 157 620) the Hoare annotation is: (let ((.cse11 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse0 (not (<= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse13 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse5 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse12 (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))) (.cse14 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse15 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse6 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse7 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse8 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse9 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse16 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656))) (.cse17 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~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 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse11 .cse10) (and .cse12 .cse1 .cse2 .cse3 .cse4 .cse13 .cse14 .cse15 .cse6 .cse7 .cse8 .cse9 .cse16 .cse17 .cse10) (and .cse12 .cse1 .cse2 .cse3 .cse4 .cse14 .cse15 .cse6 .cse7 .cse8 .cse9 .cse16 .cse11 .cse17 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse13 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse12 .cse1 .cse2 .cse3 .cse4 .cse14 .cse5 .cse15 .cse6 .cse7 .cse8 .cse9 .cse16 .cse17 .cse10) (and .cse12 (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse1 .cse2 .cse3 .cse4 .cse14 .cse15 .cse6 .cse7 .cse8 .cse9 .cse16 .cse17 .cse10))) [2022-07-19 10:51:02,081 INFO L899 garLoopResultBuilder]: For program point L227-2(lines 219 597) no Hoare annotation was computed. [2022-07-19 10:51:02,081 INFO L899 garLoopResultBuilder]: For program point L196(lines 196 607) no Hoare annotation was computed. [2022-07-19 10:51:02,081 INFO L899 garLoopResultBuilder]: For program point L163(lines 163 618) no Hoare annotation was computed. [2022-07-19 10:51:02,082 INFO L899 garLoopResultBuilder]: For program point L130(lines 130 629) no Hoare annotation was computed. [2022-07-19 10:51:02,082 INFO L899 garLoopResultBuilder]: For program point L560(lines 560 564) no Hoare annotation was computed. [2022-07-19 10:51:02,082 INFO L899 garLoopResultBuilder]: For program point L362(lines 362 389) no Hoare annotation was computed. [2022-07-19 10:51:02,082 INFO L899 garLoopResultBuilder]: For program point L362-1(lines 362 389) no Hoare annotation was computed. [2022-07-19 10:51:02,082 INFO L895 garLoopResultBuilder]: At program point L131(lines 127 630) the Hoare annotation is: (let ((.cse14 (< |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) (.cse15 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576)) (.cse10 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse16 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.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))) (.cse13 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse5 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse6 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse7 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse8 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse9 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656))) (.cse11 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (.cse12 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse13 .cse14 .cse5 .cse6 .cse7 .cse8 .cse9 .cse15 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse14 .cse16 .cse5 .cse6 .cse7 .cse8 .cse9 .cse15 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse14 .cse5 .cse6 .cse7 .cse8 .cse9 .cse15 .cse10 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse16 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse13 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12))) [2022-07-19 10:51:02,082 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-19 10:51:02,083 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 678) no Hoare annotation was computed. [2022-07-19 10:51:02,083 INFO L895 garLoopResultBuilder]: At program point L561(lines 74 684) the Hoare annotation is: false [2022-07-19 10:51:02,083 INFO L899 garLoopResultBuilder]: For program point L363(lines 363 386) no Hoare annotation was computed. [2022-07-19 10:51:02,083 INFO L899 garLoopResultBuilder]: For program point L264(lines 264 276) no Hoare annotation was computed. [2022-07-19 10:51:02,083 INFO L899 garLoopResultBuilder]: For program point L265(lines 265 270) no Hoare annotation was computed. [2022-07-19 10:51:02,083 INFO L899 garLoopResultBuilder]: For program point L199(lines 199 606) no Hoare annotation was computed. [2022-07-19 10:51:02,083 INFO L899 garLoopResultBuilder]: For program point L166(lines 166 617) no Hoare annotation was computed. [2022-07-19 10:51:02,083 INFO L899 garLoopResultBuilder]: For program point L133(lines 133 628) no Hoare annotation was computed. [2022-07-19 10:51:02,084 INFO L902 garLoopResultBuilder]: At program point L695(lines 686 697) the Hoare annotation is: true [2022-07-19 10:51:02,084 INFO L899 garLoopResultBuilder]: For program point L398(lines 398 429) no Hoare annotation was computed. [2022-07-19 10:51:02,084 INFO L899 garLoopResultBuilder]: For program point L299(lines 299 303) no Hoare annotation was computed. [2022-07-19 10:51:02,084 INFO L899 garLoopResultBuilder]: For program point L299-2(lines 219 597) no Hoare annotation was computed. [2022-07-19 10:51:02,084 INFO L895 garLoopResultBuilder]: At program point L200(lines 196 607) 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 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse9 (< |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656)) (.cse6 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse7 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse8 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) .cse0 .cse1 .cse2 .cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) .cse4 .cse5 .cse6 .cse7 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656)) (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|)) .cse8) (and .cse0 .cse1 .cse2 .cse3 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse4 .cse5 .cse9 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse3 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1) .cse4 .cse5 .cse9 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse9 .cse6 .cse7 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0) .cse8))) [2022-07-19 10:51:02,084 INFO L895 garLoopResultBuilder]: At program point L167(lines 163 618) the Hoare annotation is: (let ((.cse5 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse14 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse11 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (.cse13 (not (<= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.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| 8481))) (.cse4 (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 (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse9 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse10 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656))) (.cse15 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.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 .cse12) (and .cse13 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12) (and .cse0 (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse13 .cse0 .cse1 .cse2 .cse3 .cse14 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse14 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse15 .cse11 .cse12) (and .cse13 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse15 .cse12))) [2022-07-19 10:51:02,085 INFO L895 garLoopResultBuilder]: At program point L134(lines 133 628) the Hoare annotation is: (and (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656)) (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) [2022-07-19 10:51:02,087 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] [2022-07-19 10:51:02,089 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-19 10:51:02,141 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.07 10:51:02 BoogieIcfgContainer [2022-07-19 10:51:02,141 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-19 10:51:02,141 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-19 10:51:02,141 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-19 10:51:02,142 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-19 10:51:02,142 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 10:50:43" (3/4) ... [2022-07-19 10:51:02,144 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-19 10:51:02,163 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2022-07-19 10:51:02,164 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-07-19 10:51:02,165 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-07-19 10:51:02,165 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-19 10:51:02,264 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-19 10:51:02,265 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-19 10:51:02,265 INFO L158 Benchmark]: Toolchain (without parser) took 20256.37ms. Allocated memory was 90.2MB in the beginning and 281.0MB in the end (delta: 190.8MB). Free memory was 67.2MB in the beginning and 182.2MB in the end (delta: -115.0MB). Peak memory consumption was 75.9MB. Max. memory is 16.1GB. [2022-07-19 10:51:02,265 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 90.2MB. Free memory was 65.6MB in the beginning and 65.6MB in the end (delta: 44.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 10:51:02,266 INFO L158 Benchmark]: CACSL2BoogieTranslator took 362.88ms. Allocated memory is still 90.2MB. Free memory was 67.0MB in the beginning and 51.9MB in the end (delta: 15.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-19 10:51:02,266 INFO L158 Benchmark]: Boogie Procedure Inliner took 72.09ms. Allocated memory is still 90.2MB. Free memory was 51.9MB in the beginning and 48.9MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-19 10:51:02,266 INFO L158 Benchmark]: Boogie Preprocessor took 38.94ms. Allocated memory is still 90.2MB. Free memory was 48.9MB in the beginning and 46.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-19 10:51:02,268 INFO L158 Benchmark]: RCFGBuilder took 799.38ms. Allocated memory was 90.2MB in the beginning and 111.1MB in the end (delta: 21.0MB). Free memory was 46.8MB in the beginning and 68.0MB in the end (delta: -21.2MB). Peak memory consumption was 19.2MB. Max. memory is 16.1GB. [2022-07-19 10:51:02,269 INFO L158 Benchmark]: TraceAbstraction took 18849.35ms. Allocated memory was 111.1MB in the beginning and 281.0MB in the end (delta: 169.9MB). Free memory was 67.4MB in the beginning and 190.6MB in the end (delta: -123.3MB). Peak memory consumption was 157.8MB. Max. memory is 16.1GB. [2022-07-19 10:51:02,270 INFO L158 Benchmark]: Witness Printer took 123.37ms. Allocated memory is still 281.0MB. Free memory was 190.6MB in the beginning and 182.2MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-19 10:51:02,277 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 90.2MB. Free memory was 65.6MB in the beginning and 65.6MB in the end (delta: 44.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 362.88ms. Allocated memory is still 90.2MB. Free memory was 67.0MB in the beginning and 51.9MB in the end (delta: 15.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 72.09ms. Allocated memory is still 90.2MB. Free memory was 51.9MB in the beginning and 48.9MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.94ms. Allocated memory is still 90.2MB. Free memory was 48.9MB in the beginning and 46.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 799.38ms. Allocated memory was 90.2MB in the beginning and 111.1MB in the end (delta: 21.0MB). Free memory was 46.8MB in the beginning and 68.0MB in the end (delta: -21.2MB). Peak memory consumption was 19.2MB. Max. memory is 16.1GB. * TraceAbstraction took 18849.35ms. Allocated memory was 111.1MB in the beginning and 281.0MB in the end (delta: 169.9MB). Free memory was 67.4MB in the beginning and 190.6MB in the end (delta: -123.3MB). Peak memory consumption was 157.8MB. Max. memory is 16.1GB. * Witness Printer took 123.37ms. Allocated memory is still 281.0MB. Free memory was 190.6MB in the beginning and 182.2MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 678]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 138 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 18.7s, OverallIterations: 28, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 4.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 9.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3196 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3196 mSDsluCounter, 7357 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2594 mSDsCounter, 742 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3121 IncrementalHoareTripleChecker+Invalid, 3863 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 742 mSolverCounterUnsat, 4763 mSDtfsCounter, 3121 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2729 GetRequests, 2686 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2722occurred in iteration=27, InterpolantAutomatonStates: 94, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 28 MinimizatonAttempts, 2382 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 29 LocationsWithAnnotation, 29 PreInvPairs, 394 NumberOfFragments, 5780 HoareAnnotationTreeSize, 29 FomulaSimplifications, 12075 FormulaSimplificationTreeSizeReduction, 1.9s HoareSimplificationTime, 29 FomulaSimplificationsInter, 34394 FormulaSimplificationTreeSizeReductionInter, 7.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 6662 NumberOfCodeBlocks, 6662 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 7598 ConstructedInterpolants, 0 QuantifiedInterpolants, 10810 SizeOfPredicates, 2 NumberOfNonLiveVariables, 2763 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 32 InterpolantComputations, 26 PerfectInterpolantSequences, 29100/29256 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: 74]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 196]: Loop Invariant Derived loop invariant: (((((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) || ((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(8497 == s__state)) && !(8496 == s__state)) && s__state < 8656) && !(8544 == s__state)) && !(s__state == 8480)) && !(8560 == s__state))) || ((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && blastFlag == 1) && !(8497 == s__state)) && !(8496 == s__state)) && s__state < 8656) && !(8544 == s__state)) && !(s__state == 8480)) && !(8560 == s__state))) || ((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(8497 == s__state)) && !(8496 == s__state)) && s__state < 8656) && !(8544 == s__state)) && !(s__state == 8480)) && blastFlag == 0) && !(8560 == s__state)) - InvariantResult [Line: 74]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 108]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 208]: Loop Invariant Derived loop invariant: (((8672 <= s__state && 3 == blastFlag) || (8672 <= s__state && blastFlag == 1)) || ((8672 <= s__state && 2 == blastFlag) && !(0 == s__hit))) || (8672 <= s__state && blastFlag == 0) - InvariantResult [Line: 408]: Loop Invariant Derived loop invariant: (((((((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8657)) && blastFlag == 1) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(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)) && !(8496 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(8560 == s__state))) || ((((((((((((!(8673 == s__state) && 3 == blastFlag) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state))) || ((((((((((((!(8576 <= s__state) && !(8673 == s__state)) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && 2 == blastFlag) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(8560 == s__state))) || ((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && 2 == blastFlag) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state))) || ((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && blastFlag == 0) && !(0 == s__hit)) && !(8560 == s__state))) || ((((((((((((!(8576 <= s__state) && !(8673 == s__state)) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && blastFlag == 0) && !(8560 == s__state)) - InvariantResult [Line: 217]: Loop Invariant Derived loop invariant: !(s__state == 8672) - InvariantResult [Line: 127]: Loop Invariant Derived loop invariant: (((((((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8656)) && blastFlag == 0) && !(0 == s__hit)) && !(8560 == s__state)) || ((((((((((((!(8673 == s__state) && 3 == blastFlag) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state))) || ((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && 2 == blastFlag) && s__state < 8576) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8656)) && s__s3__tmp__next_state___0 <= 8576) && !(8560 == s__state))) || ((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && s__state < 8576) && blastFlag == 1) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8656)) && s__s3__tmp__next_state___0 <= 8576) && !(8560 == s__state))) || ((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && s__state < 8576) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8656)) && s__s3__tmp__next_state___0 <= 8576) && blastFlag == 0) && !(8560 == s__state))) || ((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8657)) && blastFlag == 1) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state))) || ((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && 2 == blastFlag) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 112]: Loop Invariant Derived loop invariant: !(s__state == 8672) - InvariantResult [Line: 175]: Loop Invariant Derived loop invariant: ((((((((s__state <= 8448 && blastFlag == 0) && !(0 == s__hit)) || ((3 == blastFlag && s__state <= 8448) && !(0 == s__hit))) || ((3 == blastFlag && s__state <= 8448) && 3 == s__s3__tmp__next_state___0)) || ((s__state <= 8448 && s__s3__tmp__next_state___0 <= 8576) && blastFlag == 0)) || ((2 == blastFlag && s__state <= 8448) && s__s3__tmp__next_state___0 <= 8576)) || ((blastFlag == 1 && s__state <= 8448) && !(0 == s__hit))) || ((2 == blastFlag && s__state <= 8448) && !(0 == s__hit))) || ((blastFlag == 1 && s__state <= 8448) && s__s3__tmp__next_state___0 <= 8576) - InvariantResult [Line: 157]: Loop Invariant Derived loop invariant: (((((((((((((((!(8576 <= s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && blastFlag == 1) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(8560 == s__state)) || ((((((((((!(8576 <= s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && blastFlag == 0) && !(8560 == s__state))) || ((((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state))) || ((((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && blastFlag == 0) && !(0 == s__hit)) && !(8560 == s__state))) || ((((((((((!(8576 <= s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(8560 == s__state))) || ((((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && blastFlag == 1) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state))) || ((((((((((((((!(8673 == s__state) && 3 == blastFlag) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) - InvariantResult [Line: 398]: Loop Invariant Derived loop invariant: (((((((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8657)) && blastFlag == 1) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(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)) && !(8496 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(8560 == s__state))) || ((((((((((((!(8673 == s__state) && 3 == blastFlag) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state))) || ((((((((((((!(8576 <= s__state) && !(8673 == s__state)) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && 2 == blastFlag) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(8560 == s__state))) || ((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && 2 == blastFlag) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state))) || ((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && blastFlag == 0) && !(0 == s__hit)) && !(8560 == s__state))) || ((((((((((((!(8576 <= s__state) && !(8673 == s__state)) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && blastFlag == 0) && !(8560 == s__state)) - InvariantResult [Line: 109]: Loop Invariant Derived loop invariant: ((((((((((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(s__state == 8480)) || ((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && blastFlag == 1) && !(8497 == s__state)) && !(s__state == 8480))) || ((3 == blastFlag && s__state <= 8448) && 3 == s__s3__tmp__next_state___0)) || (2 == blastFlag && !(0 == s__hit))) || (((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(8497 == s__state)) && !(8496 == s__state)) && !(s__state == 8480)) && blastFlag == 0)) || (3 == blastFlag && !(0 == s__hit))) || ((blastFlag == 1 && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576)) || ((2 == blastFlag && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576)) || (blastFlag == 0 && !(0 == s__hit))) || (blastFlag == 1 && !(0 == s__hit))) || (!(8448 == s__state) && s__state <= 8448)) || ((8672 <= s__state && !(8673 == s__state)) && 3 == blastFlag)) || ((s__s3__tmp__next_state___0 <= 8576 && blastFlag == 0) && s__state <= 8576) - InvariantResult [Line: 151]: Loop Invariant Derived loop invariant: (((((((((((((((!(8576 <= s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && blastFlag == 1) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(8560 == s__state)) || ((((((((((!(8576 <= s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && blastFlag == 0) && !(8560 == s__state))) || ((((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state))) || ((((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && blastFlag == 0) && !(0 == s__hit)) && !(8560 == s__state))) || ((((((((((!(8576 <= s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(8560 == s__state))) || ((((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && blastFlag == 1) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state))) || ((((((((((((((!(8673 == s__state) && 3 == blastFlag) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) - InvariantResult [Line: 184]: Loop Invariant Derived loop invariant: (((((((((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) || ((((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && blastFlag == 0) && !(0 == s__hit)) && !(8560 == s__state))) || ((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(8497 == s__state)) && !(8496 == s__state)) && s__state < 8656) && !(8544 == s__state)) && !(s__state == 8480)) && !(8560 == s__state))) || ((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && blastFlag == 1) && !(8497 == s__state)) && !(8496 == s__state)) && s__state < 8656) && !(8544 == s__state)) && !(s__state == 8480)) && !(8560 == s__state))) || ((((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && blastFlag == 1) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state))) || ((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(8497 == s__state)) && !(8496 == s__state)) && s__state < 8656) && !(8544 == s__state)) && !(s__state == 8480)) && blastFlag == 0) && !(8560 == s__state))) || ((((((((((((((!(8673 == s__state) && 3 == blastFlag) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) - InvariantResult [Line: 115]: Loop Invariant Derived loop invariant: !(s__state == 8672) - InvariantResult [Line: 356]: Loop Invariant Derived loop invariant: (((((((((((((((!(8576 <= s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && blastFlag == 1) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(8560 == s__state)) || ((((((((((!(8576 <= s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && blastFlag == 0) && !(8560 == s__state))) || ((((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state))) || ((((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && blastFlag == 0) && !(0 == s__hit)) && !(8560 == s__state))) || ((((((((((!(8576 <= s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(8560 == s__state))) || ((((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && blastFlag == 1) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state))) || ((((((((((((((!(8673 == s__state) && 3 == blastFlag) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) - InvariantResult [Line: 133]: Loop Invariant Derived loop invariant: (((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(8560 == s__state) - InvariantResult [Line: 163]: Loop Invariant Derived loop invariant: (((((((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8657)) && blastFlag == 1) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(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)) && !(8496 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(8560 == s__state))) || ((((((((((((!(8673 == s__state) && 3 == blastFlag) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state))) || ((((((((((((!(8576 <= s__state) && !(8673 == s__state)) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && 2 == blastFlag) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(8560 == s__state))) || ((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && 2 == blastFlag) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state))) || ((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && blastFlag == 0) && !(0 == s__hit)) && !(8560 == s__state))) || ((((((((((((!(8576 <= s__state) && !(8673 == s__state)) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && blastFlag == 0) && !(8560 == s__state)) - InvariantResult [Line: 169]: Loop Invariant Derived loop invariant: (((((((((((((((((!(8576 <= s__state) && !(8673 == s__state)) && !(8448 == s__state)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && blastFlag == 0) || ((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && blastFlag == 0) && !(0 == s__hit))) || ((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit))) || ((((((((((((!(8576 <= s__state) && !(8673 == s__state)) && !(8448 == s__state)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && blastFlag == 1) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656))) || ((((((((((((!(8576 <= s__state) && !(8673 == s__state)) && !(8448 == s__state)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656))) || ((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && blastFlag == 1) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit))) || ((((((((((((!(8673 == s__state) && 3 == blastFlag) && !(8448 == s__state)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) - InvariantResult [Line: 145]: Loop Invariant Derived loop invariant: (((((((((((((((((!(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)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(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)) && !(s__state == 8480)) && !(s__state == 8656)) && !(8560 == s__state))) || ((((((((((((!(8576 <= s__state) && !(8673 == s__state)) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(s__state == 8657)) && !(s__state == 8672)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(8560 == s__state))) || ((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && blastFlag == 0) && !(0 == s__hit)) && !(8560 == s__state))) || ((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(s__state == 8657)) && !(s__state == 8672)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state))) || ((((((((((((!(8673 == s__state) && 3 == blastFlag) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state))) || (((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && s__state < 8576) && !(s__state == 8657)) && !(s__state == 8672)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && s__s3__tmp__next_state___0 <= 8576) && blastFlag == 0) && !(8560 == s__state)) - InvariantResult [Line: 109]: Loop Invariant Derived loop invariant: ((((((((((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(s__state == 8480)) || ((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && blastFlag == 1) && !(8497 == s__state)) && !(s__state == 8480))) || ((3 == blastFlag && s__state <= 8448) && 3 == s__s3__tmp__next_state___0)) || (2 == blastFlag && !(0 == s__hit))) || (((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(8497 == s__state)) && !(8496 == s__state)) && !(s__state == 8480)) && blastFlag == 0)) || (3 == blastFlag && !(0 == s__hit))) || ((blastFlag == 1 && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576)) || ((2 == blastFlag && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576)) || (blastFlag == 0 && !(0 == s__hit))) || (blastFlag == 1 && !(0 == s__hit))) || (!(8448 == s__state) && s__state <= 8448)) || ((8672 <= s__state && !(8673 == s__state)) && 3 == blastFlag)) || ((s__s3__tmp__next_state___0 <= 8576 && blastFlag == 0) && s__state <= 8576) - InvariantResult [Line: 686]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 190]: Loop Invariant Derived loop invariant: (((((((((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) || ((((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && blastFlag == 0) && !(0 == s__hit)) && !(8560 == s__state))) || ((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(8497 == s__state)) && !(8496 == s__state)) && s__state < 8656) && !(8544 == s__state)) && !(s__state == 8480)) && !(8560 == s__state))) || ((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && blastFlag == 1) && !(8497 == s__state)) && !(8496 == s__state)) && s__state < 8656) && !(8544 == s__state)) && !(s__state == 8480)) && !(8560 == s__state))) || ((((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && blastFlag == 1) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state))) || ((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(8497 == s__state)) && !(8496 == s__state)) && s__state < 8656) && !(8544 == s__state)) && !(s__state == 8480)) && blastFlag == 0) && !(8560 == s__state))) || ((((((((((((((!(8673 == s__state) && 3 == blastFlag) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) - InvariantResult [Line: 136]: Loop Invariant Derived loop invariant: (((((((((((((((!(8576 <= s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && blastFlag == 1) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(8560 == s__state)) || ((((((((((!(8576 <= s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && blastFlag == 0) && !(8560 == s__state))) || ((((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state))) || ((((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && blastFlag == 0) && !(0 == s__hit)) && !(8560 == s__state))) || ((((((((((!(8576 <= s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(8560 == s__state))) || ((((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && blastFlag == 1) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state))) || ((((((((((((((!(8673 == s__state) && 3 == blastFlag) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) - InvariantResult [Line: 214]: Loop Invariant Derived loop invariant: !(s__state == 8672) - InvariantResult [Line: 178]: Loop Invariant Derived loop invariant: (((((((((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) || ((((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && blastFlag == 0) && !(0 == s__hit)) && !(8560 == s__state))) || ((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(8497 == s__state)) && !(8496 == s__state)) && s__state < 8656) && !(8544 == s__state)) && !(s__state == 8480)) && !(8560 == s__state))) || ((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && blastFlag == 1) && !(8497 == s__state)) && !(8496 == s__state)) && s__state < 8656) && !(8544 == s__state)) && !(s__state == 8480)) && !(8560 == s__state))) || ((((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && blastFlag == 1) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state))) || ((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(8497 == s__state)) && !(8496 == s__state)) && s__state < 8656) && !(8544 == s__state)) && !(s__state == 8480)) && blastFlag == 0) && !(8560 == s__state))) || ((((((((((((((!(8673 == s__state) && 3 == blastFlag) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) - InvariantResult [Line: 202]: Loop Invariant Derived loop invariant: (((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && blastFlag == 1) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(8560 == s__state)) || (((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(8560 == s__state))) || ((((((((((((!(8673 == s__state) && 3 == blastFlag) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(0 == s__hit)) && !(8560 == s__state))) || (((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && blastFlag == 0) && !(8560 == s__state)) RESULT: Ultimate proved your program to be correct! [2022-07-19 10:51:02,335 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