./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 f4b24e32 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-?-f4b24e3 [2022-07-13 11:25:45,535 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 11:25:45,537 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 11:25:45,571 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 11:25:45,571 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 11:25:45,572 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 11:25:45,573 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 11:25:45,574 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 11:25:45,575 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 11:25:45,575 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 11:25:45,576 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 11:25:45,579 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 11:25:45,579 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 11:25:45,584 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 11:25:45,585 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 11:25:45,586 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 11:25:45,587 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 11:25:45,589 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 11:25:45,591 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 11:25:45,596 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 11:25:45,598 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 11:25:45,599 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 11:25:45,599 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 11:25:45,602 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 11:25:45,603 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 11:25:45,606 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 11:25:45,606 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 11:25:45,606 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 11:25:45,607 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 11:25:45,608 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 11:25:45,608 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 11:25:45,609 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 11:25:45,610 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 11:25:45,610 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 11:25:45,611 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 11:25:45,611 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 11:25:45,612 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 11:25:45,612 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 11:25:45,612 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 11:25:45,612 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 11:25:45,613 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 11:25:45,614 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 11:25:45,615 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-13 11:25:45,639 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 11:25:45,639 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 11:25:45,639 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 11:25:45,640 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 11:25:45,640 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 11:25:45,640 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 11:25:45,641 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 11:25:45,641 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 11:25:45,641 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 11:25:45,642 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 11:25:45,642 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 11:25:45,642 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 11:25:45,642 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 11:25:45,642 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 11:25:45,643 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 11:25:45,643 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 11:25:45,643 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 11:25:45,643 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 11:25:45,643 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 11:25:45,645 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 11:25:45,645 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 11:25:45,645 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 11:25:45,645 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 11:25:45,645 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 11:25:45,645 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 11:25:45,646 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 11:25:45,646 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 11:25:45,646 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 11:25:45,646 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 11:25:45,646 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 11:25:45,646 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 11:25:45,647 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 11:25:45,647 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 11:25:45,647 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-13 11:25:45,813 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 11:25:45,831 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 11:25:45,833 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 11:25:45,833 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 11:25:45,834 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 11:25:45,835 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-13 11:25:45,874 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44b81e9cc/98c7390eaf354b0395576c6738465353/FLAGed12569cc [2022-07-13 11:25:46,309 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 11:25:46,310 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/s3_srvr_3a_alt.BV.c.cil.c [2022-07-13 11:25:46,322 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44b81e9cc/98c7390eaf354b0395576c6738465353/FLAGed12569cc [2022-07-13 11:25:46,330 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44b81e9cc/98c7390eaf354b0395576c6738465353 [2022-07-13 11:25:46,331 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 11:25:46,332 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 11:25:46,333 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 11:25:46,333 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 11:25:46,335 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 11:25:46,335 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 11:25:46" (1/1) ... [2022-07-13 11:25:46,336 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1dded83c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:25:46, skipping insertion in model container [2022-07-13 11:25:46,336 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 11:25:46" (1/1) ... [2022-07-13 11:25:46,340 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 11:25:46,370 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 11:25:46,528 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-13 11:25:46,533 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 11:25:46,543 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 11:25:46,597 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-13 11:25:46,607 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 11:25:46,614 INFO L208 MainTranslator]: Completed translation [2022-07-13 11:25:46,622 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:25:46 WrapperNode [2022-07-13 11:25:46,622 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 11:25:46,623 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 11:25:46,624 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 11:25:46,624 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 11:25:46,628 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:25:46" (1/1) ... [2022-07-13 11:25:46,634 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:25:46" (1/1) ... [2022-07-13 11:25:46,657 INFO L137 Inliner]: procedures = 15, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 522 [2022-07-13 11:25:46,658 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 11:25:46,658 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 11:25:46,658 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 11:25:46,658 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 11:25:46,664 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:25:46" (1/1) ... [2022-07-13 11:25:46,664 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:25:46" (1/1) ... [2022-07-13 11:25:46,666 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:25:46" (1/1) ... [2022-07-13 11:25:46,666 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:25:46" (1/1) ... [2022-07-13 11:25:46,672 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:25:46" (1/1) ... [2022-07-13 11:25:46,675 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:25:46" (1/1) ... [2022-07-13 11:25:46,677 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:25:46" (1/1) ... [2022-07-13 11:25:46,679 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 11:25:46,680 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 11:25:46,680 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 11:25:46,680 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 11:25:46,680 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:25:46" (1/1) ... [2022-07-13 11:25:46,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 11:25:46,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:25:46,703 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-13 11:25:46,753 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-13 11:25:46,760 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 11:25:46,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 11:25:46,760 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 11:25:46,760 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 11:25:46,811 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 11:25:46,812 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 11:25:46,822 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-13 11:25:47,293 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2022-07-13 11:25:47,293 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2022-07-13 11:25:47,293 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 11:25:47,303 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 11:25:47,303 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-13 11:25:47,305 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 11:25:47 BoogieIcfgContainer [2022-07-13 11:25:47,305 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 11:25:47,307 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 11:25:47,307 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 11:25:47,309 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 11:25:47,309 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 11:25:46" (1/3) ... [2022-07-13 11:25:47,310 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60b080bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 11:25:47, skipping insertion in model container [2022-07-13 11:25:47,310 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:25:46" (2/3) ... [2022-07-13 11:25:47,310 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60b080bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 11:25:47, skipping insertion in model container [2022-07-13 11:25:47,310 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 11:25:47" (3/3) ... [2022-07-13 11:25:47,311 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr_3a_alt.BV.c.cil.c [2022-07-13 11:25:47,322 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 11:25:47,322 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 11:25:47,377 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 11:25:47,389 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@25f098a5, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2e08a721 [2022-07-13 11:25:47,394 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 11:25:47,398 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-13 11:25:47,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-13 11:25:47,405 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:25:47,411 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-13 11:25:47,411 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:25:47,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:25:47,415 INFO L85 PathProgramCache]: Analyzing trace with hash 1632003015, now seen corresponding path program 1 times [2022-07-13 11:25:47,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:25:47,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175603410] [2022-07-13 11:25:47,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:25:47,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:25:47,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:25:47,660 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-13 11:25:47,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:25:47,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175603410] [2022-07-13 11:25:47,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175603410] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:25:47,662 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:25:47,673 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:25:47,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922910408] [2022-07-13 11:25:47,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:25:47,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:25:47,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:25:47,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:25:47,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:25:47,703 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-13 11:25:47,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:25:47,888 INFO L93 Difference]: Finished difference Result 317 states and 547 transitions. [2022-07-13 11:25:47,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:25:47,890 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-13 11:25:47,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:25:47,897 INFO L225 Difference]: With dead ends: 317 [2022-07-13 11:25:47,897 INFO L226 Difference]: Without dead ends: 161 [2022-07-13 11:25:47,899 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:25:47,901 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.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:25:47,902 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.1s Time] [2022-07-13 11:25:47,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2022-07-13 11:25:47,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 156. [2022-07-13 11:25:47,929 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-13 11:25:47,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 248 transitions. [2022-07-13 11:25:47,931 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 248 transitions. Word has length 44 [2022-07-13 11:25:47,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:25:47,931 INFO L495 AbstractCegarLoop]: Abstraction has 156 states and 248 transitions. [2022-07-13 11:25:47,932 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-13 11:25:47,932 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 248 transitions. [2022-07-13 11:25:47,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-13 11:25:47,933 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:25:47,933 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-13 11:25:47,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 11:25:47,934 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:25:47,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:25:47,934 INFO L85 PathProgramCache]: Analyzing trace with hash -954579415, now seen corresponding path program 1 times [2022-07-13 11:25:47,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:25:47,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418526943] [2022-07-13 11:25:47,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:25:47,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:25:47,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:25:47,976 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-13 11:25:47,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:25:47,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418526943] [2022-07-13 11:25:47,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418526943] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:25:47,977 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:25:47,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:25:47,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90234896] [2022-07-13 11:25:47,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:25:47,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:25:47,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:25:47,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:25:47,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:25:47,979 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-13 11:25:48,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:25:48,080 INFO L93 Difference]: Finished difference Result 352 states and 565 transitions. [2022-07-13 11:25:48,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:25:48,081 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-13 11:25:48,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:25:48,082 INFO L225 Difference]: With dead ends: 352 [2022-07-13 11:25:48,082 INFO L226 Difference]: Without dead ends: 202 [2022-07-13 11:25:48,083 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-13 11:25:48,084 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-13 11:25:48,084 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-13 11:25:48,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2022-07-13 11:25:48,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 197. [2022-07-13 11:25:48,092 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-13 11:25:48,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 320 transitions. [2022-07-13 11:25:48,092 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 320 transitions. Word has length 45 [2022-07-13 11:25:48,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:25:48,093 INFO L495 AbstractCegarLoop]: Abstraction has 197 states and 320 transitions. [2022-07-13 11:25:48,093 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-13 11:25:48,093 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 320 transitions. [2022-07-13 11:25:48,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-07-13 11:25:48,095 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:25:48,095 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-13 11:25:48,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-13 11:25:48,095 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:25:48,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:25:48,096 INFO L85 PathProgramCache]: Analyzing trace with hash -420309214, now seen corresponding path program 1 times [2022-07-13 11:25:48,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:25:48,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782374873] [2022-07-13 11:25:48,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:25:48,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:25:48,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:25:48,133 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-13 11:25:48,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:25:48,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782374873] [2022-07-13 11:25:48,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782374873] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:25:48,134 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:25:48,134 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:25:48,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467722924] [2022-07-13 11:25:48,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:25:48,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:25:48,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:25:48,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:25:48,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:25:48,136 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-13 11:25:48,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:25:48,224 INFO L93 Difference]: Finished difference Result 417 states and 681 transitions. [2022-07-13 11:25:48,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:25:48,224 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-13 11:25:48,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:25:48,225 INFO L225 Difference]: With dead ends: 417 [2022-07-13 11:25:48,226 INFO L226 Difference]: Without dead ends: 228 [2022-07-13 11:25:48,226 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-13 11:25:48,227 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-13 11:25:48,227 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-13 11:25:48,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2022-07-13 11:25:48,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 228. [2022-07-13 11:25:48,242 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-13 11:25:48,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 371 transitions. [2022-07-13 11:25:48,243 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 371 transitions. Word has length 72 [2022-07-13 11:25:48,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:25:48,243 INFO L495 AbstractCegarLoop]: Abstraction has 228 states and 371 transitions. [2022-07-13 11:25:48,244 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-13 11:25:48,244 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 371 transitions. [2022-07-13 11:25:48,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-07-13 11:25:48,245 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:25:48,246 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-13 11:25:48,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-13 11:25:48,246 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:25:48,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:25:48,246 INFO L85 PathProgramCache]: Analyzing trace with hash -1606429448, now seen corresponding path program 1 times [2022-07-13 11:25:48,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:25:48,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448937365] [2022-07-13 11:25:48,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:25:48,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:25:48,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:25:48,279 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-13 11:25:48,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:25:48,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448937365] [2022-07-13 11:25:48,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448937365] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:25:48,280 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:25:48,280 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:25:48,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409264214] [2022-07-13 11:25:48,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:25:48,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:25:48,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:25:48,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:25:48,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:25:48,281 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-13 11:25:48,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:25:48,347 INFO L93 Difference]: Finished difference Result 450 states and 732 transitions. [2022-07-13 11:25:48,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:25:48,347 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-13 11:25:48,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:25:48,348 INFO L225 Difference]: With dead ends: 450 [2022-07-13 11:25:48,348 INFO L226 Difference]: Without dead ends: 230 [2022-07-13 11:25:48,349 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-13 11:25:48,350 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 138 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-13 11:25:48,350 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-13 11:25:48,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2022-07-13 11:25:48,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 228. [2022-07-13 11:25:48,356 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-13 11:25:48,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 368 transitions. [2022-07-13 11:25:48,356 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 368 transitions. Word has length 84 [2022-07-13 11:25:48,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:25:48,357 INFO L495 AbstractCegarLoop]: Abstraction has 228 states and 368 transitions. [2022-07-13 11:25:48,357 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-13 11:25:48,357 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 368 transitions. [2022-07-13 11:25:48,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-07-13 11:25:48,359 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:25:48,359 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-13 11:25:48,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-13 11:25:48,359 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:25:48,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:25:48,359 INFO L85 PathProgramCache]: Analyzing trace with hash -1610778141, now seen corresponding path program 1 times [2022-07-13 11:25:48,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:25:48,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741579928] [2022-07-13 11:25:48,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:25:48,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:25:48,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:25:48,393 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-13 11:25:48,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:25:48,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741579928] [2022-07-13 11:25:48,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741579928] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:25:48,393 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:25:48,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:25:48,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368551560] [2022-07-13 11:25:48,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:25:48,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:25:48,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:25:48,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:25:48,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:25:48,395 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-13 11:25:48,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:25:48,494 INFO L93 Difference]: Finished difference Result 494 states and 800 transitions. [2022-07-13 11:25:48,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:25:48,495 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-13 11:25:48,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:25:48,496 INFO L225 Difference]: With dead ends: 494 [2022-07-13 11:25:48,496 INFO L226 Difference]: Without dead ends: 274 [2022-07-13 11:25:48,497 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:25:48,497 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-13 11:25:48,498 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-13 11:25:48,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2022-07-13 11:25:48,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 270. [2022-07-13 11:25:48,503 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-13 11:25:48,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 437 transitions. [2022-07-13 11:25:48,504 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 437 transitions. Word has length 84 [2022-07-13 11:25:48,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:25:48,504 INFO L495 AbstractCegarLoop]: Abstraction has 270 states and 437 transitions. [2022-07-13 11:25:48,504 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-13 11:25:48,504 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 437 transitions. [2022-07-13 11:25:48,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-07-13 11:25:48,505 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:25:48,505 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-13 11:25:48,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-13 11:25:48,506 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:25:48,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:25:48,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1470428767, now seen corresponding path program 1 times [2022-07-13 11:25:48,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:25:48,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534189047] [2022-07-13 11:25:48,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:25:48,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:25:48,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:25:48,532 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-13 11:25:48,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:25:48,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534189047] [2022-07-13 11:25:48,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534189047] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:25:48,533 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:25:48,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:25:48,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980131163] [2022-07-13 11:25:48,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:25:48,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:25:48,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:25:48,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:25:48,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:25:48,534 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-13 11:25:48,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:25:48,598 INFO L93 Difference]: Finished difference Result 534 states and 864 transitions. [2022-07-13 11:25:48,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:25:48,598 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-13 11:25:48,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:25:48,599 INFO L225 Difference]: With dead ends: 534 [2022-07-13 11:25:48,599 INFO L226 Difference]: Without dead ends: 272 [2022-07-13 11:25:48,600 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:25:48,600 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 136 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-13 11:25:48,601 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-13 11:25:48,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2022-07-13 11:25:48,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 270. [2022-07-13 11:25:48,605 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-13 11:25:48,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 433 transitions. [2022-07-13 11:25:48,606 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 433 transitions. Word has length 85 [2022-07-13 11:25:48,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:25:48,606 INFO L495 AbstractCegarLoop]: Abstraction has 270 states and 433 transitions. [2022-07-13 11:25:48,606 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-13 11:25:48,607 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 433 transitions. [2022-07-13 11:25:48,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-07-13 11:25:48,607 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:25:48,607 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-13 11:25:48,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-13 11:25:48,608 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:25:48,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:25:48,608 INFO L85 PathProgramCache]: Analyzing trace with hash -564791579, now seen corresponding path program 1 times [2022-07-13 11:25:48,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:25:48,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570210961] [2022-07-13 11:25:48,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:25:48,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:25:48,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:25:48,636 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-13 11:25:48,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:25:48,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570210961] [2022-07-13 11:25:48,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570210961] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:25:48,636 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:25:48,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:25:48,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346230706] [2022-07-13 11:25:48,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:25:48,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:25:48,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:25:48,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:25:48,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:25:48,638 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-13 11:25:48,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:25:48,738 INFO L93 Difference]: Finished difference Result 536 states and 859 transitions. [2022-07-13 11:25:48,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:25:48,739 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-13 11:25:48,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:25:48,740 INFO L225 Difference]: With dead ends: 536 [2022-07-13 11:25:48,740 INFO L226 Difference]: Without dead ends: 272 [2022-07-13 11:25:48,740 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-13 11:25:48,741 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-13 11:25:48,741 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-13 11:25:48,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2022-07-13 11:25:48,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 268. [2022-07-13 11:25:48,746 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-13 11:25:48,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 428 transitions. [2022-07-13 11:25:48,747 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 428 transitions. Word has length 85 [2022-07-13 11:25:48,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:25:48,747 INFO L495 AbstractCegarLoop]: Abstraction has 268 states and 428 transitions. [2022-07-13 11:25:48,747 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-13 11:25:48,748 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 428 transitions. [2022-07-13 11:25:48,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-07-13 11:25:48,748 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:25:48,748 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-13 11:25:48,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-13 11:25:48,749 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:25:48,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:25:48,749 INFO L85 PathProgramCache]: Analyzing trace with hash 183697243, now seen corresponding path program 1 times [2022-07-13 11:25:48,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:25:48,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517595978] [2022-07-13 11:25:48,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:25:48,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:25:48,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:25:48,793 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-13 11:25:48,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:25:48,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517595978] [2022-07-13 11:25:48,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517595978] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:25:48,794 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:25:48,794 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:25:48,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932795771] [2022-07-13 11:25:48,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:25:48,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:25:48,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:25:48,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:25:48,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:25:48,796 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-13 11:25:48,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:25:48,885 INFO L93 Difference]: Finished difference Result 559 states and 893 transitions. [2022-07-13 11:25:48,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:25:48,886 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-13 11:25:48,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:25:48,887 INFO L225 Difference]: With dead ends: 559 [2022-07-13 11:25:48,887 INFO L226 Difference]: Without dead ends: 299 [2022-07-13 11:25:48,888 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-13 11:25:48,888 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-13 11:25:48,888 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-13 11:25:48,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2022-07-13 11:25:48,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 297. [2022-07-13 11:25:48,893 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-13 11:25:48,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 471 transitions. [2022-07-13 11:25:48,894 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 471 transitions. Word has length 98 [2022-07-13 11:25:48,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:25:48,895 INFO L495 AbstractCegarLoop]: Abstraction has 297 states and 471 transitions. [2022-07-13 11:25:48,895 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-13 11:25:48,895 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 471 transitions. [2022-07-13 11:25:48,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-07-13 11:25:48,896 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:25:48,896 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-13 11:25:48,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-13 11:25:48,896 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:25:48,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:25:48,896 INFO L85 PathProgramCache]: Analyzing trace with hash 156444990, now seen corresponding path program 1 times [2022-07-13 11:25:48,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:25:48,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330343376] [2022-07-13 11:25:48,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:25:48,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:25:48,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:25:48,919 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-13 11:25:48,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:25:48,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330343376] [2022-07-13 11:25:48,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330343376] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:25:48,920 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:25:48,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:25:48,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344153812] [2022-07-13 11:25:48,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:25:48,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:25:48,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:25:48,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:25:48,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:25:48,921 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-13 11:25:49,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:25:49,003 INFO L93 Difference]: Finished difference Result 620 states and 985 transitions. [2022-07-13 11:25:49,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:25:49,003 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-13 11:25:49,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:25:49,004 INFO L225 Difference]: With dead ends: 620 [2022-07-13 11:25:49,004 INFO L226 Difference]: Without dead ends: 331 [2022-07-13 11:25:49,005 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-13 11:25:49,005 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-13 11:25:49,005 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-13 11:25:49,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2022-07-13 11:25:49,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 324. [2022-07-13 11:25:49,011 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-13 11:25:49,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 509 transitions. [2022-07-13 11:25:49,012 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 509 transitions. Word has length 99 [2022-07-13 11:25:49,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:25:49,012 INFO L495 AbstractCegarLoop]: Abstraction has 324 states and 509 transitions. [2022-07-13 11:25:49,012 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-13 11:25:49,012 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 509 transitions. [2022-07-13 11:25:49,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-07-13 11:25:49,013 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:25:49,013 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-13 11:25:49,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-13 11:25:49,014 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:25:49,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:25:49,014 INFO L85 PathProgramCache]: Analyzing trace with hash -2130209566, now seen corresponding path program 1 times [2022-07-13 11:25:49,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:25:49,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604375877] [2022-07-13 11:25:49,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:25:49,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:25:49,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:25:49,033 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-13 11:25:49,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:25:49,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604375877] [2022-07-13 11:25:49,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604375877] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:25:49,034 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:25:49,034 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:25:49,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341935933] [2022-07-13 11:25:49,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:25:49,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:25:49,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:25:49,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:25:49,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:25:49,035 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-13 11:25:49,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:25:49,118 INFO L93 Difference]: Finished difference Result 642 states and 1008 transitions. [2022-07-13 11:25:49,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:25:49,119 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-13 11:25:49,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:25:49,120 INFO L225 Difference]: With dead ends: 642 [2022-07-13 11:25:49,120 INFO L226 Difference]: Without dead ends: 326 [2022-07-13 11:25:49,120 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:25:49,121 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-13 11:25:49,121 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-13 11:25:49,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2022-07-13 11:25:49,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 324. [2022-07-13 11:25:49,126 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-13 11:25:49,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 505 transitions. [2022-07-13 11:25:49,127 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 505 transitions. Word has length 99 [2022-07-13 11:25:49,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:25:49,128 INFO L495 AbstractCegarLoop]: Abstraction has 324 states and 505 transitions. [2022-07-13 11:25:49,128 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-13 11:25:49,128 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 505 transitions. [2022-07-13 11:25:49,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-07-13 11:25:49,128 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:25:49,129 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-13 11:25:49,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-13 11:25:49,129 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:25:49,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:25:49,129 INFO L85 PathProgramCache]: Analyzing trace with hash -417318601, now seen corresponding path program 1 times [2022-07-13 11:25:49,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:25:49,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010276913] [2022-07-13 11:25:49,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:25:49,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:25:49,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:25:49,148 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-13 11:25:49,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:25:49,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010276913] [2022-07-13 11:25:49,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010276913] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:25:49,149 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:25:49,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:25:49,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19894030] [2022-07-13 11:25:49,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:25:49,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:25:49,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:25:49,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:25:49,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:25:49,150 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-13 11:25:49,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:25:49,233 INFO L93 Difference]: Finished difference Result 647 states and 1010 transitions. [2022-07-13 11:25:49,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:25:49,233 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-13 11:25:49,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:25:49,234 INFO L225 Difference]: With dead ends: 647 [2022-07-13 11:25:49,234 INFO L226 Difference]: Without dead ends: 331 [2022-07-13 11:25:49,235 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-13 11:25:49,235 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-13 11:25:49,236 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-13 11:25:49,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2022-07-13 11:25:49,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 324. [2022-07-13 11:25:49,241 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-13 11:25:49,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 500 transitions. [2022-07-13 11:25:49,242 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 500 transitions. Word has length 100 [2022-07-13 11:25:49,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:25:49,242 INFO L495 AbstractCegarLoop]: Abstraction has 324 states and 500 transitions. [2022-07-13 11:25:49,242 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-13 11:25:49,242 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 500 transitions. [2022-07-13 11:25:49,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-07-13 11:25:49,243 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:25:49,243 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-13 11:25:49,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-13 11:25:49,243 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:25:49,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:25:49,244 INFO L85 PathProgramCache]: Analyzing trace with hash -1321281040, now seen corresponding path program 1 times [2022-07-13 11:25:49,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:25:49,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420246497] [2022-07-13 11:25:49,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:25:49,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:25:49,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:25:49,261 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-13 11:25:49,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:25:49,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420246497] [2022-07-13 11:25:49,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420246497] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:25:49,262 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:25:49,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:25:49,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376465336] [2022-07-13 11:25:49,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:25:49,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:25:49,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:25:49,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:25:49,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:25:49,263 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-13 11:25:49,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:25:49,335 INFO L93 Difference]: Finished difference Result 665 states and 1025 transitions. [2022-07-13 11:25:49,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:25:49,335 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-13 11:25:49,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:25:49,336 INFO L225 Difference]: With dead ends: 665 [2022-07-13 11:25:49,336 INFO L226 Difference]: Without dead ends: 349 [2022-07-13 11:25:49,337 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-13 11:25:49,337 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 130 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-13 11:25:49,338 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-13 11:25:49,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2022-07-13 11:25:49,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 345. [2022-07-13 11:25:49,343 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-13 11:25:49,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 525 transitions. [2022-07-13 11:25:49,344 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 525 transitions. Word has length 105 [2022-07-13 11:25:49,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:25:49,344 INFO L495 AbstractCegarLoop]: Abstraction has 345 states and 525 transitions. [2022-07-13 11:25:49,344 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-13 11:25:49,344 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 525 transitions. [2022-07-13 11:25:49,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-07-13 11:25:49,345 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:25:49,345 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-13 11:25:49,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-13 11:25:49,346 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:25:49,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:25:49,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1276596489, now seen corresponding path program 1 times [2022-07-13 11:25:49,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:25:49,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792320324] [2022-07-13 11:25:49,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:25:49,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:25:49,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:25:49,369 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-13 11:25:49,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:25:49,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792320324] [2022-07-13 11:25:49,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792320324] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:25:49,370 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:25:49,370 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:25:49,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514955837] [2022-07-13 11:25:49,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:25:49,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:25:49,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:25:49,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:25:49,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:25:49,371 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-13 11:25:49,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:25:49,444 INFO L93 Difference]: Finished difference Result 686 states and 1044 transitions. [2022-07-13 11:25:49,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:25:49,445 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-13 11:25:49,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:25:49,446 INFO L225 Difference]: With dead ends: 686 [2022-07-13 11:25:49,446 INFO L226 Difference]: Without dead ends: 349 [2022-07-13 11:25:49,446 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-13 11:25:49,447 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 129 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-13 11:25:49,447 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-13 11:25:49,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2022-07-13 11:25:49,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 345. [2022-07-13 11:25:49,452 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-13 11:25:49,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 519 transitions. [2022-07-13 11:25:49,453 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 519 transitions. Word has length 106 [2022-07-13 11:25:49,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:25:49,453 INFO L495 AbstractCegarLoop]: Abstraction has 345 states and 519 transitions. [2022-07-13 11:25:49,453 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-13 11:25:49,454 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 519 transitions. [2022-07-13 11:25:49,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-07-13 11:25:49,454 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:25:49,454 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-13 11:25:49,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-13 11:25:49,455 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:25:49,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:25:49,455 INFO L85 PathProgramCache]: Analyzing trace with hash -687746511, now seen corresponding path program 1 times [2022-07-13 11:25:49,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:25:49,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021355225] [2022-07-13 11:25:49,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:25:49,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:25:49,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:25:49,475 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-13 11:25:49,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:25:49,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021355225] [2022-07-13 11:25:49,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021355225] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:25:49,476 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:25:49,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:25:49,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120229708] [2022-07-13 11:25:49,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:25:49,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:25:49,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:25:49,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:25:49,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:25:49,477 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-13 11:25:49,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:25:49,500 INFO L93 Difference]: Finished difference Result 973 states and 1467 transitions. [2022-07-13 11:25:49,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:25:49,500 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-13 11:25:49,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:25:49,502 INFO L225 Difference]: With dead ends: 973 [2022-07-13 11:25:49,502 INFO L226 Difference]: Without dead ends: 636 [2022-07-13 11:25:49,502 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:25:49,503 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-13 11:25:49,503 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-13 11:25:49,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2022-07-13 11:25:49,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 636. [2022-07-13 11:25:49,513 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-13 11:25:49,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 955 transitions. [2022-07-13 11:25:49,514 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 955 transitions. Word has length 121 [2022-07-13 11:25:49,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:25:49,515 INFO L495 AbstractCegarLoop]: Abstraction has 636 states and 955 transitions. [2022-07-13 11:25:49,515 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-13 11:25:49,515 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 955 transitions. [2022-07-13 11:25:49,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-07-13 11:25:49,516 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:25:49,516 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-13 11:25:49,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-13 11:25:49,516 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:25:49,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:25:49,517 INFO L85 PathProgramCache]: Analyzing trace with hash 209646767, now seen corresponding path program 1 times [2022-07-13 11:25:49,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:25:49,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758685702] [2022-07-13 11:25:49,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:25:49,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:25:49,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:25:49,537 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-13 11:25:49,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:25:49,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758685702] [2022-07-13 11:25:49,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758685702] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:25:49,538 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:25:49,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:25:49,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044636052] [2022-07-13 11:25:49,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:25:49,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:25:49,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:25:49,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:25:49,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:25:49,539 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-13 11:25:49,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:25:49,565 INFO L93 Difference]: Finished difference Result 1595 states and 2399 transitions. [2022-07-13 11:25:49,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:25:49,566 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-13 11:25:49,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:25:49,568 INFO L225 Difference]: With dead ends: 1595 [2022-07-13 11:25:49,568 INFO L226 Difference]: Without dead ends: 967 [2022-07-13 11:25:49,569 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-13 11:25:49,569 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-13 11:25:49,569 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-13 11:25:49,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 967 states. [2022-07-13 11:25:49,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 967 to 967. [2022-07-13 11:25:49,584 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-13 11:25:49,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 967 states to 967 states and 1451 transitions. [2022-07-13 11:25:49,586 INFO L78 Accepts]: Start accepts. Automaton has 967 states and 1451 transitions. Word has length 121 [2022-07-13 11:25:49,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:25:49,586 INFO L495 AbstractCegarLoop]: Abstraction has 967 states and 1451 transitions. [2022-07-13 11:25:49,586 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-13 11:25:49,586 INFO L276 IsEmpty]: Start isEmpty. Operand 967 states and 1451 transitions. [2022-07-13 11:25:49,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-07-13 11:25:49,587 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:25:49,588 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-13 11:25:49,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-13 11:25:49,588 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:25:49,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:25:49,588 INFO L85 PathProgramCache]: Analyzing trace with hash 1728089839, now seen corresponding path program 1 times [2022-07-13 11:25:49,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:25:49,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744576304] [2022-07-13 11:25:49,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:25:49,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:25:49,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:25:49,605 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-13 11:25:49,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:25:49,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744576304] [2022-07-13 11:25:49,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744576304] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:25:49,605 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:25:49,605 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:25:49,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655896951] [2022-07-13 11:25:49,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:25:49,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:25:49,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:25:49,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:25:49,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:25:49,607 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-13 11:25:49,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:25:49,645 INFO L93 Difference]: Finished difference Result 2257 states and 3391 transitions. [2022-07-13 11:25:49,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:25:49,645 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-13 11:25:49,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:25:49,649 INFO L225 Difference]: With dead ends: 2257 [2022-07-13 11:25:49,649 INFO L226 Difference]: Without dead ends: 1298 [2022-07-13 11:25:49,650 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-13 11:25:49,650 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-13 11:25:49,650 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-13 11:25:49,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1298 states. [2022-07-13 11:25:49,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1298 to 1298. [2022-07-13 11:25:49,672 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-13 11:25:49,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1298 states to 1298 states and 1947 transitions. [2022-07-13 11:25:49,675 INFO L78 Accepts]: Start accepts. Automaton has 1298 states and 1947 transitions. Word has length 121 [2022-07-13 11:25:49,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:25:49,675 INFO L495 AbstractCegarLoop]: Abstraction has 1298 states and 1947 transitions. [2022-07-13 11:25:49,675 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-13 11:25:49,676 INFO L276 IsEmpty]: Start isEmpty. Operand 1298 states and 1947 transitions. [2022-07-13 11:25:49,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-07-13 11:25:49,677 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:25:49,677 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-13 11:25:49,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-13 11:25:49,677 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:25:49,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:25:49,678 INFO L85 PathProgramCache]: Analyzing trace with hash -305304207, now seen corresponding path program 1 times [2022-07-13 11:25:49,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:25:49,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068242993] [2022-07-13 11:25:49,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:25:49,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:25:49,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:25:49,695 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-13 11:25:49,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:25:49,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068242993] [2022-07-13 11:25:49,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068242993] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:25:49,695 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:25:49,695 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:25:49,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410048196] [2022-07-13 11:25:49,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:25:49,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:25:49,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:25:49,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:25:49,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:25:49,697 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-13 11:25:49,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:25:49,731 INFO L93 Difference]: Finished difference Result 2901 states and 4356 transitions. [2022-07-13 11:25:49,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:25:49,731 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-13 11:25:49,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:25:49,735 INFO L225 Difference]: With dead ends: 2901 [2022-07-13 11:25:49,735 INFO L226 Difference]: Without dead ends: 1611 [2022-07-13 11:25:49,737 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-13 11:25:49,737 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-13 11:25:49,737 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-13 11:25:49,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1611 states. [2022-07-13 11:25:49,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1611 to 1611. [2022-07-13 11:25:49,761 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-13 11:25:49,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1611 states to 1611 states and 2416 transitions. [2022-07-13 11:25:49,764 INFO L78 Accepts]: Start accepts. Automaton has 1611 states and 2416 transitions. Word has length 121 [2022-07-13 11:25:49,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:25:49,765 INFO L495 AbstractCegarLoop]: Abstraction has 1611 states and 2416 transitions. [2022-07-13 11:25:49,765 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-13 11:25:49,765 INFO L276 IsEmpty]: Start isEmpty. Operand 1611 states and 2416 transitions. [2022-07-13 11:25:49,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2022-07-13 11:25:49,767 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:25:49,768 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-13 11:25:49,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-13 11:25:49,768 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:25:49,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:25:49,768 INFO L85 PathProgramCache]: Analyzing trace with hash 230274424, now seen corresponding path program 1 times [2022-07-13 11:25:49,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:25:49,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950550772] [2022-07-13 11:25:49,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:25:49,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:25:49,778 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-13 11:25:49,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [766397953] [2022-07-13 11:25:49,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:25:49,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:25:49,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:25:49,780 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-13 11:25:49,814 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-13 11:25:49,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:25:49,860 INFO L263 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 11:25:49,865 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:25:49,913 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-13 11:25:49,913 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 11:25:49,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:25:49,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950550772] [2022-07-13 11:25:49,913 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-13 11:25:49,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [766397953] [2022-07-13 11:25:49,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [766397953] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:25:49,914 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:25:49,914 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:25:49,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443119509] [2022-07-13 11:25:49,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:25:49,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:25:49,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:25:49,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:25:49,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:25:49,915 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-13 11:25:50,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:25:50,049 INFO L93 Difference]: Finished difference Result 3214 states and 4820 transitions. [2022-07-13 11:25:50,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:25:50,050 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-13 11:25:50,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:25:50,054 INFO L225 Difference]: With dead ends: 3214 [2022-07-13 11:25:50,054 INFO L226 Difference]: Without dead ends: 1611 [2022-07-13 11:25:50,055 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-13 11:25:50,055 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-13 11:25:50,056 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-13 11:25:50,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1611 states. [2022-07-13 11:25:50,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1611 to 1611. [2022-07-13 11:25:50,081 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-13 11:25:50,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1611 states to 1611 states and 2352 transitions. [2022-07-13 11:25:50,084 INFO L78 Accepts]: Start accepts. Automaton has 1611 states and 2352 transitions. Word has length 199 [2022-07-13 11:25:50,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:25:50,085 INFO L495 AbstractCegarLoop]: Abstraction has 1611 states and 2352 transitions. [2022-07-13 11:25:50,085 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-13 11:25:50,085 INFO L276 IsEmpty]: Start isEmpty. Operand 1611 states and 2352 transitions. [2022-07-13 11:25:50,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2022-07-13 11:25:50,088 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:25:50,088 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-13 11:25:50,122 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-13 11:25:50,304 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-13 11:25:50,305 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:25:50,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:25:50,305 INFO L85 PathProgramCache]: Analyzing trace with hash 1759452965, now seen corresponding path program 1 times [2022-07-13 11:25:50,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:25:50,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692273717] [2022-07-13 11:25:50,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:25:50,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:25:50,316 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-13 11:25:50,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1830903753] [2022-07-13 11:25:50,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:25:50,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:25:50,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:25:50,318 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-13 11:25:50,351 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-13 11:25:50,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:25:50,398 INFO L263 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 11:25:50,401 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:25:50,472 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-13 11:25:50,472 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 11:25:50,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:25:50,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692273717] [2022-07-13 11:25:50,472 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-13 11:25:50,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1830903753] [2022-07-13 11:25:50,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1830903753] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:25:50,473 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:25:50,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:25:50,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156490476] [2022-07-13 11:25:50,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:25:50,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:25:50,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:25:50,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:25:50,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:25:50,474 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-13 11:25:50,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:25:50,588 INFO L93 Difference]: Finished difference Result 3409 states and 4987 transitions. [2022-07-13 11:25:50,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:25:50,588 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-13 11:25:50,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:25:50,592 INFO L225 Difference]: With dead ends: 3409 [2022-07-13 11:25:50,592 INFO L226 Difference]: Without dead ends: 1602 [2022-07-13 11:25:50,594 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-13 11:25:50,594 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-13 11:25:50,594 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-13 11:25:50,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1602 states. [2022-07-13 11:25:50,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1602 to 1602. [2022-07-13 11:25:50,617 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-13 11:25:50,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1602 states to 1602 states and 2265 transitions. [2022-07-13 11:25:50,620 INFO L78 Accepts]: Start accepts. Automaton has 1602 states and 2265 transitions. Word has length 241 [2022-07-13 11:25:50,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:25:50,620 INFO L495 AbstractCegarLoop]: Abstraction has 1602 states and 2265 transitions. [2022-07-13 11:25:50,620 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-13 11:25:50,620 INFO L276 IsEmpty]: Start isEmpty. Operand 1602 states and 2265 transitions. [2022-07-13 11:25:50,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2022-07-13 11:25:50,623 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:25:50,623 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-13 11:25:50,655 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-13 11:25:50,840 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-13 11:25:50,840 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:25:50,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:25:50,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1622703552, now seen corresponding path program 1 times [2022-07-13 11:25:50,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:25:50,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344993060] [2022-07-13 11:25:50,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:25:50,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:25:50,851 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-13 11:25:50,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1093790579] [2022-07-13 11:25:50,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:25:50,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:25:50,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:25:50,853 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-13 11:25:50,854 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-13 11:25:50,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:25:50,929 INFO L263 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 11:25:50,946 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:25:51,072 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-13 11:25:51,072 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 11:25:51,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:25:51,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344993060] [2022-07-13 11:25:51,073 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-13 11:25:51,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1093790579] [2022-07-13 11:25:51,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1093790579] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:25:51,073 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:25:51,073 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:25:51,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594685322] [2022-07-13 11:25:51,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:25:51,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:25:51,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:25:51,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:25:51,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:25:51,075 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-13 11:25:51,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:25:51,150 INFO L93 Difference]: Finished difference Result 4698 states and 6639 transitions. [2022-07-13 11:25:51,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:25:51,150 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-13 11:25:51,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:25:51,159 INFO L225 Difference]: With dead ends: 4698 [2022-07-13 11:25:51,168 INFO L226 Difference]: Without dead ends: 1885 [2022-07-13 11:25:51,171 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-13 11:25:51,171 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-13 11:25:51,172 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-13 11:25:51,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1885 states. [2022-07-13 11:25:51,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1885 to 1883. [2022-07-13 11:25:51,233 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-13 11:25:51,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1883 states to 1883 states and 2646 transitions. [2022-07-13 11:25:51,236 INFO L78 Accepts]: Start accepts. Automaton has 1883 states and 2646 transitions. Word has length 269 [2022-07-13 11:25:51,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:25:51,237 INFO L495 AbstractCegarLoop]: Abstraction has 1883 states and 2646 transitions. [2022-07-13 11:25:51,237 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-13 11:25:51,237 INFO L276 IsEmpty]: Start isEmpty. Operand 1883 states and 2646 transitions. [2022-07-13 11:25:51,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2022-07-13 11:25:51,240 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:25:51,240 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-13 11:25:51,272 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-13 11:25:51,455 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-13 11:25:51,455 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:25:51,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:25:51,456 INFO L85 PathProgramCache]: Analyzing trace with hash -1812515673, now seen corresponding path program 1 times [2022-07-13 11:25:51,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:25:51,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259517854] [2022-07-13 11:25:51,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:25:51,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:25:51,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:25:51,499 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-13 11:25:51,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:25:51,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259517854] [2022-07-13 11:25:51,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259517854] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:25:51,500 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:25:51,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:25:51,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304970018] [2022-07-13 11:25:51,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:25:51,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:25:51,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:25:51,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:25:51,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:25:51,501 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-13 11:25:51,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:25:51,591 INFO L93 Difference]: Finished difference Result 3868 states and 5432 transitions. [2022-07-13 11:25:51,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:25:51,592 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-13 11:25:51,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:25:51,596 INFO L225 Difference]: With dead ends: 3868 [2022-07-13 11:25:51,596 INFO L226 Difference]: Without dead ends: 1993 [2022-07-13 11:25:51,598 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:25:51,598 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-13 11:25:51,598 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-13 11:25:51,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1993 states. [2022-07-13 11:25:51,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1993 to 1975. [2022-07-13 11:25:51,645 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-13 11:25:51,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1975 states to 1975 states and 2758 transitions. [2022-07-13 11:25:51,649 INFO L78 Accepts]: Start accepts. Automaton has 1975 states and 2758 transitions. Word has length 307 [2022-07-13 11:25:51,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:25:51,649 INFO L495 AbstractCegarLoop]: Abstraction has 1975 states and 2758 transitions. [2022-07-13 11:25:51,649 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-13 11:25:51,649 INFO L276 IsEmpty]: Start isEmpty. Operand 1975 states and 2758 transitions. [2022-07-13 11:25:51,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2022-07-13 11:25:51,653 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:25:51,653 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-13 11:25:51,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-13 11:25:51,653 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:25:51,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:25:51,654 INFO L85 PathProgramCache]: Analyzing trace with hash 493001237, now seen corresponding path program 1 times [2022-07-13 11:25:51,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:25:51,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571653663] [2022-07-13 11:25:51,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:25:51,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:25:51,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:25:51,692 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-13 11:25:51,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:25:51,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571653663] [2022-07-13 11:25:51,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571653663] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:25:51,693 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:25:51,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:25:51,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584703926] [2022-07-13 11:25:51,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:25:51,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:25:51,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:25:51,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:25:51,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:25:51,695 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-13 11:25:51,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:25:51,790 INFO L93 Difference]: Finished difference Result 4164 states and 5840 transitions. [2022-07-13 11:25:51,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:25:51,790 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-13 11:25:51,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:25:51,795 INFO L225 Difference]: With dead ends: 4164 [2022-07-13 11:25:51,795 INFO L226 Difference]: Without dead ends: 2197 [2022-07-13 11:25:51,797 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-13 11:25:51,798 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-13 11:25:51,798 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-13 11:25:51,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2197 states. [2022-07-13 11:25:51,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2197 to 2125. [2022-07-13 11:25:51,832 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-13 11:25:51,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2125 states to 2125 states and 2938 transitions. [2022-07-13 11:25:51,835 INFO L78 Accepts]: Start accepts. Automaton has 2125 states and 2938 transitions. Word has length 327 [2022-07-13 11:25:51,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:25:51,835 INFO L495 AbstractCegarLoop]: Abstraction has 2125 states and 2938 transitions. [2022-07-13 11:25:51,836 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-13 11:25:51,836 INFO L276 IsEmpty]: Start isEmpty. Operand 2125 states and 2938 transitions. [2022-07-13 11:25:51,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2022-07-13 11:25:51,840 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:25:51,840 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-13 11:25:51,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-13 11:25:51,840 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:25:51,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:25:51,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1757399063, now seen corresponding path program 1 times [2022-07-13 11:25:51,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:25:51,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327753874] [2022-07-13 11:25:51,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:25:51,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:25:51,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:25:51,891 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-13 11:25:51,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:25:51,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327753874] [2022-07-13 11:25:51,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327753874] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:25:51,891 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:25:51,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:25:51,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302455356] [2022-07-13 11:25:51,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:25:51,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:25:51,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:25:51,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:25:51,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:25:51,894 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-13 11:25:52,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:25:52,007 INFO L93 Difference]: Finished difference Result 4284 states and 5936 transitions. [2022-07-13 11:25:52,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:25:52,007 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-13 11:25:52,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:25:52,012 INFO L225 Difference]: With dead ends: 4284 [2022-07-13 11:25:52,012 INFO L226 Difference]: Without dead ends: 2167 [2022-07-13 11:25:52,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-13 11:25:52,015 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-13 11:25:52,016 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-13 11:25:52,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2167 states. [2022-07-13 11:25:52,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2167 to 2125. [2022-07-13 11:25:52,053 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-13 11:25:52,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2125 states to 2125 states and 2890 transitions. [2022-07-13 11:25:52,057 INFO L78 Accepts]: Start accepts. Automaton has 2125 states and 2890 transitions. Word has length 353 [2022-07-13 11:25:52,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:25:52,057 INFO L495 AbstractCegarLoop]: Abstraction has 2125 states and 2890 transitions. [2022-07-13 11:25:52,057 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-13 11:25:52,057 INFO L276 IsEmpty]: Start isEmpty. Operand 2125 states and 2890 transitions. [2022-07-13 11:25:52,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2022-07-13 11:25:52,062 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:25:52,062 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-13 11:25:52,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-13 11:25:52,062 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:25:52,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:25:52,063 INFO L85 PathProgramCache]: Analyzing trace with hash -1876884711, now seen corresponding path program 1 times [2022-07-13 11:25:52,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:25:52,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409768368] [2022-07-13 11:25:52,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:25:52,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:25:52,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:25:52,117 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-13 11:25:52,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:25:52,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409768368] [2022-07-13 11:25:52,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409768368] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:25:52,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1628340045] [2022-07-13 11:25:52,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:25:52,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:25:52,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:25:52,119 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-13 11:25:52,143 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-13 11:25:52,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:25:52,228 INFO L263 TraceCheckSpWp]: Trace formula consists of 599 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 11:25:52,231 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:25:52,322 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-13 11:25:52,322 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:25:52,391 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-13 11:25:52,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1628340045] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:25:52,391 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:25:52,391 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-07-13 11:25:52,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43075115] [2022-07-13 11:25:52,392 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:25:52,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 11:25:52,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:25:52,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 11:25:52,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-13 11:25:52,393 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-13 11:25:52,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:25:52,825 INFO L93 Difference]: Finished difference Result 6740 states and 9173 transitions. [2022-07-13 11:25:52,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 11:25:52,826 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-13 11:25:52,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:25:52,835 INFO L225 Difference]: With dead ends: 6740 [2022-07-13 11:25:52,835 INFO L226 Difference]: Without dead ends: 4466 [2022-07-13 11:25:52,837 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-13 11:25:52,838 INFO L413 NwaCegarLoop]: 192 mSDtfsCounter, 661 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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-13 11:25:52,838 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-13 11:25:52,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4466 states. [2022-07-13 11:25:52,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4466 to 2302. [2022-07-13 11:25:52,890 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-13 11:25:52,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2302 states to 2302 states and 3102 transitions. [2022-07-13 11:25:52,892 INFO L78 Accepts]: Start accepts. Automaton has 2302 states and 3102 transitions. Word has length 370 [2022-07-13 11:25:52,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:25:52,893 INFO L495 AbstractCegarLoop]: Abstraction has 2302 states and 3102 transitions. [2022-07-13 11:25:52,893 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-13 11:25:52,893 INFO L276 IsEmpty]: Start isEmpty. Operand 2302 states and 3102 transitions. [2022-07-13 11:25:52,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 439 [2022-07-13 11:25:52,898 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:25:52,898 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-13 11:25:52,916 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-07-13 11:25:53,115 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-13 11:25:53,115 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:25:53,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:25:53,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1628763683, now seen corresponding path program 1 times [2022-07-13 11:25:53,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:25:53,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362803705] [2022-07-13 11:25:53,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:25:53,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:25:53,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:25:53,161 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-13 11:25:53,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:25:53,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362803705] [2022-07-13 11:25:53,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362803705] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:25:53,162 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:25:53,162 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:25:53,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222335521] [2022-07-13 11:25:53,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:25:53,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:25:53,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:25:53,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:25:53,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:25:53,163 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-13 11:25:53,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:25:53,263 INFO L93 Difference]: Finished difference Result 4608 states and 6204 transitions. [2022-07-13 11:25:53,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:25:53,263 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-13 11:25:53,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:25:53,280 INFO L225 Difference]: With dead ends: 4608 [2022-07-13 11:25:53,280 INFO L226 Difference]: Without dead ends: 2314 [2022-07-13 11:25:53,283 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-13 11:25:53,283 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-13 11:25:53,286 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-13 11:25:53,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2314 states. [2022-07-13 11:25:53,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2314 to 2302. [2022-07-13 11:25:53,357 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-13 11:25:53,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2302 states to 2302 states and 3054 transitions. [2022-07-13 11:25:53,361 INFO L78 Accepts]: Start accepts. Automaton has 2302 states and 3054 transitions. Word has length 438 [2022-07-13 11:25:53,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:25:53,361 INFO L495 AbstractCegarLoop]: Abstraction has 2302 states and 3054 transitions. [2022-07-13 11:25:53,361 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-13 11:25:53,361 INFO L276 IsEmpty]: Start isEmpty. Operand 2302 states and 3054 transitions. [2022-07-13 11:25:53,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 471 [2022-07-13 11:25:53,367 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:25:53,369 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-13 11:25:53,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-13 11:25:53,369 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:25:53,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:25:53,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1752367566, now seen corresponding path program 1 times [2022-07-13 11:25:53,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:25:53,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127595943] [2022-07-13 11:25:53,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:25:53,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:25:53,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:25:53,418 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-13 11:25:53,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:25:53,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127595943] [2022-07-13 11:25:53,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127595943] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:25:53,418 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:25:53,419 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:25:53,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244840257] [2022-07-13 11:25:53,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:25:53,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:25:53,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:25:53,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:25:53,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:25:53,421 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-13 11:25:53,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:25:53,522 INFO L93 Difference]: Finished difference Result 4812 states and 6402 transitions. [2022-07-13 11:25:53,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:25:53,523 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-13 11:25:53,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:25:53,527 INFO L225 Difference]: With dead ends: 4812 [2022-07-13 11:25:53,527 INFO L226 Difference]: Without dead ends: 2518 [2022-07-13 11:25:53,529 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:25:53,530 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-13 11:25:53,531 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-13 11:25:53,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2518 states. [2022-07-13 11:25:53,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2518 to 2506. [2022-07-13 11:25:53,571 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-13 11:25:53,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2506 states to 2506 states and 3288 transitions. [2022-07-13 11:25:53,574 INFO L78 Accepts]: Start accepts. Automaton has 2506 states and 3288 transitions. Word has length 470 [2022-07-13 11:25:53,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:25:53,574 INFO L495 AbstractCegarLoop]: Abstraction has 2506 states and 3288 transitions. [2022-07-13 11:25:53,574 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-13 11:25:53,575 INFO L276 IsEmpty]: Start isEmpty. Operand 2506 states and 3288 transitions. [2022-07-13 11:25:53,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 533 [2022-07-13 11:25:53,578 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:25:53,579 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-13 11:25:53,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-07-13 11:25:53,579 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:25:53,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:25:53,579 INFO L85 PathProgramCache]: Analyzing trace with hash -742298620, now seen corresponding path program 1 times [2022-07-13 11:25:53,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:25:53,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375964734] [2022-07-13 11:25:53,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:25:53,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:25:53,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:25:53,633 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-13 11:25:53,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:25:53,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375964734] [2022-07-13 11:25:53,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375964734] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:25:53,634 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:25:53,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:25:53,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260957892] [2022-07-13 11:25:53,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:25:53,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:25:53,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:25:53,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:25:53,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:25:53,635 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-13 11:25:53,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:25:53,746 INFO L93 Difference]: Finished difference Result 5232 states and 6894 transitions. [2022-07-13 11:25:53,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:25:53,746 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-13 11:25:53,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:25:53,749 INFO L225 Difference]: With dead ends: 5232 [2022-07-13 11:25:53,749 INFO L226 Difference]: Without dead ends: 2734 [2022-07-13 11:25:53,751 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-13 11:25:53,752 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-13 11:25:53,752 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-13 11:25:53,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2734 states. [2022-07-13 11:25:53,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2734 to 2722. [2022-07-13 11:25:53,790 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-13 11:25:53,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2722 states to 2722 states and 3534 transitions. [2022-07-13 11:25:53,792 INFO L78 Accepts]: Start accepts. Automaton has 2722 states and 3534 transitions. Word has length 532 [2022-07-13 11:25:53,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:25:53,793 INFO L495 AbstractCegarLoop]: Abstraction has 2722 states and 3534 transitions. [2022-07-13 11:25:53,793 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-13 11:25:53,793 INFO L276 IsEmpty]: Start isEmpty. Operand 2722 states and 3534 transitions. [2022-07-13 11:25:53,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 599 [2022-07-13 11:25:53,798 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:25:53,798 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-13 11:25:53,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-07-13 11:25:53,798 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:25:53,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:25:53,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1835374162, now seen corresponding path program 1 times [2022-07-13 11:25:53,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:25:53,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426893754] [2022-07-13 11:25:53,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:25:53,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:25:53,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:25:53,885 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-13 11:25:53,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:25:53,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426893754] [2022-07-13 11:25:53,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426893754] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:25:53,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1653302521] [2022-07-13 11:25:53,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:25:53,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:25:53,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:25:53,887 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-13 11:25:53,904 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-13 11:25:54,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:25:54,033 INFO L263 TraceCheckSpWp]: Trace formula consists of 913 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 11:25:54,037 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:25:54,101 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-13 11:25:54,101 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:25:54,167 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-13 11:25:54,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1653302521] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:25:54,167 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:25:54,168 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2022-07-13 11:25:54,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461039174] [2022-07-13 11:25:54,168 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:25:54,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 11:25:54,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:25:54,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 11:25:54,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-07-13 11:25:54,169 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-13 11:25:54,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:25:54,460 INFO L93 Difference]: Finished difference Result 4932 states and 6426 transitions. [2022-07-13 11:25:54,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 11:25:54,461 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-13 11:25:54,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:25:54,461 INFO L225 Difference]: With dead ends: 4932 [2022-07-13 11:25:54,461 INFO L226 Difference]: Without dead ends: 0 [2022-07-13 11:25:54,465 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-13 11:25:54,465 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.2s IncrementalHoareTripleChecker+Time [2022-07-13 11:25:54,465 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.2s Time] [2022-07-13 11:25:54,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-13 11:25:54,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-13 11:25:54,466 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-13 11:25:54,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-13 11:25:54,466 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 598 [2022-07-13 11:25:54,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:25:54,466 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-13 11:25:54,466 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-13 11:25:54,467 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-13 11:25:54,467 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-13 11:25:54,468 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-13 11:25:54,487 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-13 11:25:54,685 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-13 11:25:54,687 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-13 11:26:02,059 INFO L899 garLoopResultBuilder]: For program point L531(lines 531 536) no Hoare annotation was computed. [2022-07-13 11:26:02,059 INFO L899 garLoopResultBuilder]: For program point L399(lines 399 405) no Hoare annotation was computed. [2022-07-13 11:26:02,059 INFO L899 garLoopResultBuilder]: For program point L366(lines 366 385) no Hoare annotation was computed. [2022-07-13 11:26:02,059 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-13 11:26:02,059 INFO L899 garLoopResultBuilder]: For program point L565(lines 565 569) no Hoare annotation was computed. [2022-07-13 11:26:02,059 INFO L899 garLoopResultBuilder]: For program point L499(lines 499 503) no Hoare annotation was computed. [2022-07-13 11:26:02,059 INFO L899 garLoopResultBuilder]: For program point L367(lines 367 371) no Hoare annotation was computed. [2022-07-13 11:26:02,059 INFO L899 garLoopResultBuilder]: For program point L367-2(lines 366 383) no Hoare annotation was computed. [2022-07-13 11:26:02,059 INFO L899 garLoopResultBuilder]: For program point L202(lines 202 605) no Hoare annotation was computed. [2022-07-13 11:26:02,059 INFO L899 garLoopResultBuilder]: For program point L169(lines 169 616) no Hoare annotation was computed. [2022-07-13 11:26:02,059 INFO L899 garLoopResultBuilder]: For program point L136(lines 136 627) no Hoare annotation was computed. [2022-07-13 11:26:02,059 INFO L899 garLoopResultBuilder]: For program point L467(lines 467 471) no Hoare annotation was computed. [2022-07-13 11:26:02,059 INFO L899 garLoopResultBuilder]: For program point L335-1(lines 335 344) no Hoare annotation was computed. [2022-07-13 11:26:02,059 INFO L902 garLoopResultBuilder]: At program point L667(lines 108 668) the Hoare annotation is: true [2022-07-13 11:26:02,060 INFO L899 garLoopResultBuilder]: For program point L205(lines 205 604) no Hoare annotation was computed. [2022-07-13 11:26:02,060 INFO L899 garLoopResultBuilder]: For program point L172(lines 172 615) no Hoare annotation was computed. [2022-07-13 11:26:02,060 INFO L899 garLoopResultBuilder]: For program point L139(lines 139 626) no Hoare annotation was computed. [2022-07-13 11:26:02,061 INFO L899 garLoopResultBuilder]: For program point L239(lines 239 256) no Hoare annotation was computed. [2022-07-13 11:26:02,061 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-13 11:26:02,061 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-13 11:26:02,061 INFO L899 garLoopResultBuilder]: For program point L239-2(lines 219 597) no Hoare annotation was computed. [2022-07-13 11:26:02,061 INFO L899 garLoopResultBuilder]: For program point L636(lines 636 664) no Hoare annotation was computed. [2022-07-13 11:26:02,061 INFO L899 garLoopResultBuilder]: For program point L339(lines 339 343) no Hoare annotation was computed. [2022-07-13 11:26:02,061 INFO L899 garLoopResultBuilder]: For program point L637(lines 637 661) no Hoare annotation was computed. [2022-07-13 11:26:02,061 INFO L899 garLoopResultBuilder]: For program point L571(lines 571 575) no Hoare annotation was computed. [2022-07-13 11:26:02,061 INFO L899 garLoopResultBuilder]: For program point L538(lines 538 542) no Hoare annotation was computed. [2022-07-13 11:26:02,061 INFO L899 garLoopResultBuilder]: For program point L571-2(lines 571 575) no Hoare annotation was computed. [2022-07-13 11:26:02,062 INFO L899 garLoopResultBuilder]: For program point L472(lines 472 483) no Hoare annotation was computed. [2022-07-13 11:26:02,062 INFO L899 garLoopResultBuilder]: For program point L538-2(lines 219 597) no Hoare annotation was computed. [2022-07-13 11:26:02,062 INFO L899 garLoopResultBuilder]: For program point L439(lines 439 443) no Hoare annotation was computed. [2022-07-13 11:26:02,062 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-13 11:26:02,062 INFO L899 garLoopResultBuilder]: For program point L241(lines 241 246) no Hoare annotation was computed. [2022-07-13 11:26:02,062 INFO L899 garLoopResultBuilder]: For program point L208(lines 208 603) no Hoare annotation was computed. [2022-07-13 11:26:02,062 INFO L899 garLoopResultBuilder]: For program point L175(lines 175 614) no Hoare annotation was computed. [2022-07-13 11:26:02,062 INFO L899 garLoopResultBuilder]: For program point L142(lines 142 625) no Hoare annotation was computed. [2022-07-13 11:26:02,062 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-13 11:26:02,062 INFO L899 garLoopResultBuilder]: For program point L671(lines 671 675) no Hoare annotation was computed. [2022-07-13 11:26:02,062 INFO L899 garLoopResultBuilder]: For program point L638(lines 638 647) no Hoare annotation was computed. [2022-07-13 11:26:02,062 INFO L899 garLoopResultBuilder]: For program point L671-2(lines 671 675) no Hoare annotation was computed. [2022-07-13 11:26:02,062 INFO L899 garLoopResultBuilder]: For program point L638-2(lines 637 659) no Hoare annotation was computed. [2022-07-13 11:26:02,062 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-13 11:26:02,062 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-13 11:26:02,062 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-13 11:26:02,062 INFO L899 garLoopResultBuilder]: For program point L110(line 110) no Hoare annotation was computed. [2022-07-13 11:26:02,062 INFO L899 garLoopResultBuilder]: For program point L375(lines 375 379) no Hoare annotation was computed. [2022-07-13 11:26:02,063 INFO L899 garLoopResultBuilder]: For program point L640(lines 640 644) no Hoare annotation was computed. [2022-07-13 11:26:02,063 INFO L899 garLoopResultBuilder]: For program point L409(lines 409 415) no Hoare annotation was computed. [2022-07-13 11:26:02,063 INFO L899 garLoopResultBuilder]: For program point L211(lines 211 602) no Hoare annotation was computed. [2022-07-13 11:26:02,063 INFO L899 garLoopResultBuilder]: For program point L178(lines 178 613) no Hoare annotation was computed. [2022-07-13 11:26:02,063 INFO L899 garLoopResultBuilder]: For program point L145(lines 145 624) no Hoare annotation was computed. [2022-07-13 11:26:02,063 INFO L899 garLoopResultBuilder]: For program point L112(lines 112 635) no Hoare annotation was computed. [2022-07-13 11:26:02,063 INFO L899 garLoopResultBuilder]: For program point L476(lines 476 480) no Hoare annotation was computed. [2022-07-13 11:26:02,063 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-13 11:26:02,063 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-13 11:26:02,063 INFO L899 garLoopResultBuilder]: For program point L511(lines 511 515) no Hoare annotation was computed. [2022-07-13 11:26:02,063 INFO L899 garLoopResultBuilder]: For program point L511-2(lines 219 597) no Hoare annotation was computed. [2022-07-13 11:26:02,063 INFO L899 garLoopResultBuilder]: For program point L247(lines 247 252) no Hoare annotation was computed. [2022-07-13 11:26:02,063 INFO L899 garLoopResultBuilder]: For program point L214(lines 214 601) no Hoare annotation was computed. [2022-07-13 11:26:02,063 INFO L899 garLoopResultBuilder]: For program point L181(lines 181 612) no Hoare annotation was computed. [2022-07-13 11:26:02,063 INFO L899 garLoopResultBuilder]: For program point L148(lines 148 623) no Hoare annotation was computed. [2022-07-13 11:26:02,063 INFO L899 garLoopResultBuilder]: For program point L115(lines 115 634) no Hoare annotation was computed. [2022-07-13 11:26:02,063 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-13 11:26:02,063 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-13 11:26:02,063 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-13 11:26:02,063 INFO L899 garLoopResultBuilder]: For program point L83(lines 83 91) no Hoare annotation was computed. [2022-07-13 11:26:02,063 INFO L899 garLoopResultBuilder]: For program point L282(lines 282 286) no Hoare annotation was computed. [2022-07-13 11:26:02,064 INFO L899 garLoopResultBuilder]: For program point L316(lines 316 320) no Hoare annotation was computed. [2022-07-13 11:26:02,064 INFO L899 garLoopResultBuilder]: For program point L316-2(lines 219 597) no Hoare annotation was computed. [2022-07-13 11:26:02,064 INFO L899 garLoopResultBuilder]: For program point L184(lines 184 611) no Hoare annotation was computed. [2022-07-13 11:26:02,064 INFO L899 garLoopResultBuilder]: For program point L151(lines 151 622) no Hoare annotation was computed. [2022-07-13 11:26:02,064 INFO L899 garLoopResultBuilder]: For program point L118(lines 118 633) no Hoare annotation was computed. [2022-07-13 11:26:02,064 INFO L899 garLoopResultBuilder]: For program point L581(lines 581 591) no Hoare annotation was computed. [2022-07-13 11:26:02,064 INFO L899 garLoopResultBuilder]: For program point L581-1(lines 581 591) no Hoare annotation was computed. [2022-07-13 11:26:02,064 INFO L899 garLoopResultBuilder]: For program point L449-1(lines 449 461) no Hoare annotation was computed. [2022-07-13 11:26:02,064 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-13 11:26:02,064 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-13 11:26:02,064 INFO L899 garLoopResultBuilder]: For program point L86(lines 86 90) no Hoare annotation was computed. [2022-07-13 11:26:02,064 INFO L899 garLoopResultBuilder]: For program point L86-2(lines 83 91) no Hoare annotation was computed. [2022-07-13 11:26:02,064 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-13 11:26:02,064 INFO L899 garLoopResultBuilder]: For program point L351(lines 351 355) no Hoare annotation was computed. [2022-07-13 11:26:02,064 INFO L899 garLoopResultBuilder]: For program point L351-2(lines 219 597) no Hoare annotation was computed. [2022-07-13 11:26:02,064 INFO L902 garLoopResultBuilder]: At program point L682(lines 74 684) the Hoare annotation is: true [2022-07-13 11:26:02,064 INFO L899 garLoopResultBuilder]: For program point L649(lines 649 655) no Hoare annotation was computed. [2022-07-13 11:26:02,064 INFO L899 garLoopResultBuilder]: For program point L550(lines 550 555) no Hoare annotation was computed. [2022-07-13 11:26:02,064 INFO L899 garLoopResultBuilder]: For program point L187(lines 187 610) no Hoare annotation was computed. [2022-07-13 11:26:02,064 INFO L899 garLoopResultBuilder]: For program point L154(lines 154 621) no Hoare annotation was computed. [2022-07-13 11:26:02,064 INFO L899 garLoopResultBuilder]: For program point L121(lines 121 632) no Hoare annotation was computed. [2022-07-13 11:26:02,064 INFO L902 garLoopResultBuilder]: At program point L683(lines 19 685) the Hoare annotation is: true [2022-07-13 11:26:02,064 INFO L899 garLoopResultBuilder]: For program point L584(lines 584 588) no Hoare annotation was computed. [2022-07-13 11:26:02,064 INFO L899 garLoopResultBuilder]: For program point L452(lines 452 457) no Hoare annotation was computed. [2022-07-13 11:26:02,065 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-13 11:26:02,065 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-13 11:26:02,065 INFO L899 garLoopResultBuilder]: For program point L420(lines 420 424) no Hoare annotation was computed. [2022-07-13 11:26:02,065 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-13 11:26:02,065 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-13 11:26:02,065 INFO L899 garLoopResultBuilder]: For program point L190(lines 190 609) no Hoare annotation was computed. [2022-07-13 11:26:02,065 INFO L899 garLoopResultBuilder]: For program point L157(lines 157 620) no Hoare annotation was computed. [2022-07-13 11:26:02,065 INFO L899 garLoopResultBuilder]: For program point L124(lines 124 631) no Hoare annotation was computed. [2022-07-13 11:26:02,065 INFO L899 garLoopResultBuilder]: For program point L521(lines 521 525) no Hoare annotation was computed. [2022-07-13 11:26:02,065 INFO L899 garLoopResultBuilder]: For program point L488(lines 488 492) no Hoare annotation was computed. [2022-07-13 11:26:02,065 INFO L899 garLoopResultBuilder]: For program point L521-2(lines 521 525) no Hoare annotation was computed. [2022-07-13 11:26:02,065 INFO L899 garLoopResultBuilder]: For program point L93(lines 93 101) no Hoare annotation was computed. [2022-07-13 11:26:02,065 INFO L899 garLoopResultBuilder]: For program point L93-1(lines 74 684) no Hoare annotation was computed. [2022-07-13 11:26:02,065 INFO L899 garLoopResultBuilder]: For program point L193(lines 193 608) no Hoare annotation was computed. [2022-07-13 11:26:02,065 INFO L899 garLoopResultBuilder]: For program point L160(lines 160 619) no Hoare annotation was computed. [2022-07-13 11:26:02,065 INFO L899 garLoopResultBuilder]: For program point L127(lines 127 630) no Hoare annotation was computed. [2022-07-13 11:26:02,065 INFO L899 garLoopResultBuilder]: For program point L94(lines 94 98) no Hoare annotation was computed. [2022-07-13 11:26:02,065 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-13 11:26:02,065 INFO L899 garLoopResultBuilder]: For program point L359(lines 359 390) no Hoare annotation was computed. [2022-07-13 11:26:02,065 INFO L899 garLoopResultBuilder]: For program point L326(lines 326 330) no Hoare annotation was computed. [2022-07-13 11:26:02,065 INFO L899 garLoopResultBuilder]: For program point L326-2(lines 326 330) no Hoare annotation was computed. [2022-07-13 11:26:02,065 INFO L899 garLoopResultBuilder]: For program point L227(lines 227 231) no Hoare annotation was computed. [2022-07-13 11:26:02,066 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-13 11:26:02,066 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-13 11:26:02,066 INFO L899 garLoopResultBuilder]: For program point L227-2(lines 219 597) no Hoare annotation was computed. [2022-07-13 11:26:02,066 INFO L899 garLoopResultBuilder]: For program point L196(lines 196 607) no Hoare annotation was computed. [2022-07-13 11:26:02,066 INFO L899 garLoopResultBuilder]: For program point L163(lines 163 618) no Hoare annotation was computed. [2022-07-13 11:26:02,066 INFO L899 garLoopResultBuilder]: For program point L130(lines 130 629) no Hoare annotation was computed. [2022-07-13 11:26:02,066 INFO L899 garLoopResultBuilder]: For program point L560(lines 560 564) no Hoare annotation was computed. [2022-07-13 11:26:02,066 INFO L899 garLoopResultBuilder]: For program point L362(lines 362 389) no Hoare annotation was computed. [2022-07-13 11:26:02,066 INFO L899 garLoopResultBuilder]: For program point L362-1(lines 362 389) no Hoare annotation was computed. [2022-07-13 11:26:02,066 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-13 11:26:02,066 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-13 11:26:02,066 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 678) no Hoare annotation was computed. [2022-07-13 11:26:02,066 INFO L895 garLoopResultBuilder]: At program point L561(lines 74 684) the Hoare annotation is: false [2022-07-13 11:26:02,066 INFO L899 garLoopResultBuilder]: For program point L363(lines 363 386) no Hoare annotation was computed. [2022-07-13 11:26:02,066 INFO L899 garLoopResultBuilder]: For program point L264(lines 264 276) no Hoare annotation was computed. [2022-07-13 11:26:02,066 INFO L899 garLoopResultBuilder]: For program point L265(lines 265 270) no Hoare annotation was computed. [2022-07-13 11:26:02,066 INFO L899 garLoopResultBuilder]: For program point L199(lines 199 606) no Hoare annotation was computed. [2022-07-13 11:26:02,066 INFO L899 garLoopResultBuilder]: For program point L166(lines 166 617) no Hoare annotation was computed. [2022-07-13 11:26:02,066 INFO L899 garLoopResultBuilder]: For program point L133(lines 133 628) no Hoare annotation was computed. [2022-07-13 11:26:02,066 INFO L902 garLoopResultBuilder]: At program point L695(lines 686 697) the Hoare annotation is: true [2022-07-13 11:26:02,066 INFO L899 garLoopResultBuilder]: For program point L398(lines 398 429) no Hoare annotation was computed. [2022-07-13 11:26:02,066 INFO L899 garLoopResultBuilder]: For program point L299(lines 299 303) no Hoare annotation was computed. [2022-07-13 11:26:02,067 INFO L899 garLoopResultBuilder]: For program point L299-2(lines 219 597) no Hoare annotation was computed. [2022-07-13 11:26:02,067 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-13 11:26:02,068 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-13 11:26:02,068 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-13 11:26:02,070 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-13 11:26:02,072 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-13 11:26:02,148 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.07 11:26:02 BoogieIcfgContainer [2022-07-13 11:26:02,148 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-13 11:26:02,149 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-13 11:26:02,149 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-13 11:26:02,149 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-13 11:26:02,149 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 11:25:47" (3/4) ... [2022-07-13 11:26:02,151 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-13 11:26:02,161 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2022-07-13 11:26:02,163 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-07-13 11:26:02,163 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-07-13 11:26:02,164 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-13 11:26:02,231 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-13 11:26:02,231 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-13 11:26:02,232 INFO L158 Benchmark]: Toolchain (without parser) took 15899.69ms. Allocated memory was 138.4MB in the beginning and 297.8MB in the end (delta: 159.4MB). Free memory was 115.3MB in the beginning and 168.2MB in the end (delta: -52.9MB). Peak memory consumption was 106.4MB. Max. memory is 16.1GB. [2022-07-13 11:26:02,232 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 138.4MB. Free memory is still 92.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 11:26:02,232 INFO L158 Benchmark]: CACSL2BoogieTranslator took 289.46ms. Allocated memory is still 138.4MB. Free memory was 114.9MB in the beginning and 108.0MB in the end (delta: 6.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-13 11:26:02,232 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.05ms. Allocated memory is still 138.4MB. Free memory was 108.0MB in the beginning and 104.9MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-13 11:26:02,233 INFO L158 Benchmark]: Boogie Preprocessor took 20.93ms. Allocated memory is still 138.4MB. Free memory was 104.9MB in the beginning and 102.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 11:26:02,234 INFO L158 Benchmark]: RCFGBuilder took 625.45ms. Allocated memory is still 138.4MB. Free memory was 102.8MB in the beginning and 71.3MB in the end (delta: 31.5MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2022-07-13 11:26:02,234 INFO L158 Benchmark]: TraceAbstraction took 14841.32ms. Allocated memory was 138.4MB in the beginning and 297.8MB in the end (delta: 159.4MB). Free memory was 70.8MB in the beginning and 176.6MB in the end (delta: -105.7MB). Peak memory consumption was 160.3MB. Max. memory is 16.1GB. [2022-07-13 11:26:02,235 INFO L158 Benchmark]: Witness Printer took 82.76ms. Allocated memory is still 297.8MB. Free memory was 176.6MB in the beginning and 168.2MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-13 11:26:02,241 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.18ms. Allocated memory is still 138.4MB. Free memory is still 92.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 289.46ms. Allocated memory is still 138.4MB. Free memory was 114.9MB in the beginning and 108.0MB in the end (delta: 6.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.05ms. Allocated memory is still 138.4MB. Free memory was 108.0MB in the beginning and 104.9MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 20.93ms. Allocated memory is still 138.4MB. Free memory was 104.9MB in the beginning and 102.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 625.45ms. Allocated memory is still 138.4MB. Free memory was 102.8MB in the beginning and 71.3MB in the end (delta: 31.5MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 14841.32ms. Allocated memory was 138.4MB in the beginning and 297.8MB in the end (delta: 159.4MB). Free memory was 70.8MB in the beginning and 176.6MB in the end (delta: -105.7MB). Peak memory consumption was 160.3MB. Max. memory is 16.1GB. * Witness Printer took 82.76ms. Allocated memory is still 297.8MB. Free memory was 176.6MB in the beginning and 168.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: 14.7s, OverallIterations: 28, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 7.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3196 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3196 mSDsluCounter, 7357 SdHoareTripleChecker+Invalid, 1.7s 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.6s AutomataMinimizationTime, 28 MinimizatonAttempts, 2382 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 29 LocationsWithAnnotation, 29 PreInvPairs, 394 NumberOfFragments, 5780 HoareAnnotationTreeSize, 29 FomulaSimplifications, 12075 FormulaSimplificationTreeSizeReduction, 1.1s HoareSimplificationTime, 29 FomulaSimplificationsInter, 34394 FormulaSimplificationTreeSizeReductionInter, 6.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.2s 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-13 11:26:02,293 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