./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/bitvector/s3_clnt_3.BV.c.cil-1a.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a31fd051 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector/s3_clnt_3.BV.c.cil-1a.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 ae696ef581cbe995636ab4900ea04e2b993d78100fba8db2a87ca7d99c3a6d1e --- Real Ultimate output --- This is Ultimate 0.2.2-?-a31fd05 [2023-02-15 10:22:10,465 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 10:22:10,467 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 10:22:10,504 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 10:22:10,504 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 10:22:10,508 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 10:22:10,509 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 10:22:10,512 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 10:22:10,514 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 10:22:10,520 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 10:22:10,521 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 10:22:10,523 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 10:22:10,523 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 10:22:10,527 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 10:22:10,529 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 10:22:10,530 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 10:22:10,531 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 10:22:10,532 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 10:22:10,534 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 10:22:10,536 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 10:22:10,537 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 10:22:10,538 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 10:22:10,539 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 10:22:10,540 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 10:22:10,545 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 10:22:10,545 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 10:22:10,546 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 10:22:10,547 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 10:22:10,548 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 10:22:10,549 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 10:22:10,550 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 10:22:10,550 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 10:22:10,552 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 10:22:10,552 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 10:22:10,553 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 10:22:10,553 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 10:22:10,554 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 10:22:10,554 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 10:22:10,554 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 10:22:10,555 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 10:22:10,556 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 10:22:10,556 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-15 10:22:10,581 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 10:22:10,581 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 10:22:10,582 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 10:22:10,582 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 10:22:10,583 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 10:22:10,583 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 10:22:10,584 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 10:22:10,584 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 10:22:10,584 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 10:22:10,584 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 10:22:10,585 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 10:22:10,585 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 10:22:10,585 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 10:22:10,585 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 10:22:10,586 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-15 10:22:10,586 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 10:22:10,586 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-15 10:22:10,586 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 10:22:10,586 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-15 10:22:10,587 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 10:22:10,587 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-15 10:22:10,587 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 10:22:10,587 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 10:22:10,587 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 10:22:10,587 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 10:22:10,588 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 10:22:10,588 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 10:22:10,588 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-15 10:22:10,589 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 10:22:10,589 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 10:22:10,589 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 10:22:10,589 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-15 10:22:10,589 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 10:22:10,590 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 10:22:10,590 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 10:22:10,590 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ae696ef581cbe995636ab4900ea04e2b993d78100fba8db2a87ca7d99c3a6d1e [2023-02-15 10:22:10,841 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 10:22:10,859 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 10:22:10,861 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 10:22:10,862 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 10:22:10,863 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 10:22:10,864 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/s3_clnt_3.BV.c.cil-1a.c [2023-02-15 10:22:11,959 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 10:22:12,134 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 10:22:12,134 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/s3_clnt_3.BV.c.cil-1a.c [2023-02-15 10:22:12,142 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87e2e4e3c/03a72926eaa04379a3c26a924f220d22/FLAGf4f309061 [2023-02-15 10:22:12,155 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87e2e4e3c/03a72926eaa04379a3c26a924f220d22 [2023-02-15 10:22:12,157 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 10:22:12,158 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 10:22:12,159 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 10:22:12,159 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 10:22:12,162 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 10:22:12,163 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 10:22:12" (1/1) ... [2023-02-15 10:22:12,164 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69955ce0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:22:12, skipping insertion in model container [2023-02-15 10:22:12,164 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 10:22:12" (1/1) ... [2023-02-15 10:22:12,169 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 10:22:12,199 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 10:22:12,344 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/s3_clnt_3.BV.c.cil-1a.c[37883,37896] [2023-02-15 10:22:12,356 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 10:22:12,364 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 10:22:12,418 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/s3_clnt_3.BV.c.cil-1a.c[37883,37896] [2023-02-15 10:22:12,430 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 10:22:12,439 INFO L208 MainTranslator]: Completed translation [2023-02-15 10:22:12,439 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:22:12 WrapperNode [2023-02-15 10:22:12,439 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 10:22:12,440 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 10:22:12,440 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 10:22:12,440 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 10:22:12,446 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:22:12" (1/1) ... [2023-02-15 10:22:12,457 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:22:12" (1/1) ... [2023-02-15 10:22:12,484 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 497 [2023-02-15 10:22:12,485 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 10:22:12,485 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 10:22:12,485 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 10:22:12,486 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 10:22:12,493 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:22:12" (1/1) ... [2023-02-15 10:22:12,495 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:22:12" (1/1) ... [2023-02-15 10:22:12,499 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:22:12" (1/1) ... [2023-02-15 10:22:12,499 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:22:12" (1/1) ... [2023-02-15 10:22:12,506 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:22:12" (1/1) ... [2023-02-15 10:22:12,511 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:22:12" (1/1) ... [2023-02-15 10:22:12,513 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:22:12" (1/1) ... [2023-02-15 10:22:12,515 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:22:12" (1/1) ... [2023-02-15 10:22:12,518 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 10:22:12,519 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 10:22:12,519 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 10:22:12,519 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 10:22:12,520 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:22:12" (1/1) ... [2023-02-15 10:22:12,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 10:22:12,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:22:12,562 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-15 10:22:12,578 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-15 10:22:12,610 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 10:22:12,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-15 10:22:12,611 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 10:22:12,611 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 10:22:12,704 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 10:22:12,710 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 10:22:12,728 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-02-15 10:22:13,177 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2023-02-15 10:22:13,177 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2023-02-15 10:22:13,177 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 10:22:13,190 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 10:22:13,190 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2023-02-15 10:22:13,194 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:22:13 BoogieIcfgContainer [2023-02-15 10:22:13,194 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 10:22:13,196 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 10:22:13,196 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 10:22:13,199 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 10:22:13,199 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 10:22:12" (1/3) ... [2023-02-15 10:22:13,200 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f6b829e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 10:22:13, skipping insertion in model container [2023-02-15 10:22:13,200 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:22:12" (2/3) ... [2023-02-15 10:22:13,201 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f6b829e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 10:22:13, skipping insertion in model container [2023-02-15 10:22:13,201 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:22:13" (3/3) ... [2023-02-15 10:22:13,202 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_clnt_3.BV.c.cil-1a.c [2023-02-15 10:22:13,217 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 10:22:13,217 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-15 10:22:13,265 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 10:22:13,270 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@513ba4c5, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 10:22:13,271 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-15 10:22:13,274 INFO L276 IsEmpty]: Start isEmpty. Operand has 132 states, 130 states have (on average 1.7307692307692308) internal successors, (225), 131 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:22:13,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-15 10:22:13,280 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:22:13,281 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] [2023-02-15 10:22:13,282 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:22:13,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:22:13,285 INFO L85 PathProgramCache]: Analyzing trace with hash 260022937, now seen corresponding path program 1 times [2023-02-15 10:22:13,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:22:13,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545748837] [2023-02-15 10:22:13,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:22:13,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:22:13,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:22:13,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:22:13,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:22:13,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545748837] [2023-02-15 10:22:13,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545748837] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:22:13,489 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:22:13,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 10:22:13,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542398030] [2023-02-15 10:22:13,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:22:13,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 10:22:13,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:22:13,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 10:22:13,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 10:22:13,533 INFO L87 Difference]: Start difference. First operand has 132 states, 130 states have (on average 1.7307692307692308) internal successors, (225), 131 states have internal predecessors, (225), 0 states have call successors, (0), 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 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:22:13,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:22:13,717 INFO L93 Difference]: Finished difference Result 259 states and 443 transitions. [2023-02-15 10:22:13,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 10:22:13,720 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2023-02-15 10:22:13,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:22:13,729 INFO L225 Difference]: With dead ends: 259 [2023-02-15 10:22:13,730 INFO L226 Difference]: Without dead ends: 119 [2023-02-15 10:22:13,734 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 10:22:13,741 INFO L413 NwaCegarLoop]: 220 mSDtfsCounter, 8 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 10:22:13,742 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 332 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 10:22:13,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2023-02-15 10:22:13,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2023-02-15 10:22:13,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 118 states have (on average 1.5338983050847457) internal successors, (181), 118 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:22:13,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 181 transitions. [2023-02-15 10:22:13,786 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 181 transitions. Word has length 25 [2023-02-15 10:22:13,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:22:13,787 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 181 transitions. [2023-02-15 10:22:13,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:22:13,787 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 181 transitions. [2023-02-15 10:22:13,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-02-15 10:22:13,791 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:22:13,791 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-02-15 10:22:13,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-15 10:22:13,792 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:22:13,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:22:13,793 INFO L85 PathProgramCache]: Analyzing trace with hash 693672153, now seen corresponding path program 1 times [2023-02-15 10:22:13,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:22:13,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11745895] [2023-02-15 10:22:13,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:22:13,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:22:13,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:22:13,936 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:22:13,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:22:13,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11745895] [2023-02-15 10:22:13,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11745895] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:22:13,937 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:22:13,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 10:22:13,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889353079] [2023-02-15 10:22:13,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:22:13,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 10:22:13,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:22:13,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 10:22:13,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 10:22:13,940 INFO L87 Difference]: Start difference. First operand 119 states and 181 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:22:14,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:22:14,060 INFO L93 Difference]: Finished difference Result 245 states and 376 transitions. [2023-02-15 10:22:14,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 10:22:14,060 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2023-02-15 10:22:14,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:22:14,066 INFO L225 Difference]: With dead ends: 245 [2023-02-15 10:22:14,066 INFO L226 Difference]: Without dead ends: 137 [2023-02-15 10:22:14,071 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 10:22:14,073 INFO L413 NwaCegarLoop]: 171 mSDtfsCounter, 13 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 10:22:14,074 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 253 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 10:22:14,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2023-02-15 10:22:14,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 134. [2023-02-15 10:22:14,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 133 states have (on average 1.5112781954887218) internal successors, (201), 133 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:22:14,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 201 transitions. [2023-02-15 10:22:14,089 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 201 transitions. Word has length 37 [2023-02-15 10:22:14,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:22:14,098 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 201 transitions. [2023-02-15 10:22:14,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:22:14,100 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 201 transitions. [2023-02-15 10:22:14,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-02-15 10:22:14,102 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:22:14,102 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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] [2023-02-15 10:22:14,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-15 10:22:14,102 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:22:14,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:22:14,104 INFO L85 PathProgramCache]: Analyzing trace with hash -2014075552, now seen corresponding path program 1 times [2023-02-15 10:22:14,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:22:14,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087499130] [2023-02-15 10:22:14,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:22:14,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:22:14,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:22:14,220 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 10:22:14,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:22:14,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087499130] [2023-02-15 10:22:14,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087499130] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:22:14,221 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:22:14,222 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 10:22:14,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27090989] [2023-02-15 10:22:14,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:22:14,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 10:22:14,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:22:14,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 10:22:14,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 10:22:14,224 INFO L87 Difference]: Start difference. First operand 134 states and 201 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:22:14,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:22:14,245 INFO L93 Difference]: Finished difference Result 283 states and 420 transitions. [2023-02-15 10:22:14,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 10:22:14,245 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 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 51 [2023-02-15 10:22:14,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:22:14,247 INFO L225 Difference]: With dead ends: 283 [2023-02-15 10:22:14,247 INFO L226 Difference]: Without dead ends: 160 [2023-02-15 10:22:14,252 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 10:22:14,257 INFO L413 NwaCegarLoop]: 177 mSDtfsCounter, 21 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 10:22:14,258 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 331 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 10:22:14,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2023-02-15 10:22:14,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2023-02-15 10:22:14,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 159 states have (on average 1.471698113207547) internal successors, (234), 159 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:22:14,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 234 transitions. [2023-02-15 10:22:14,274 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 234 transitions. Word has length 51 [2023-02-15 10:22:14,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:22:14,275 INFO L495 AbstractCegarLoop]: Abstraction has 160 states and 234 transitions. [2023-02-15 10:22:14,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:22:14,275 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 234 transitions. [2023-02-15 10:22:14,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-02-15 10:22:14,282 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:22:14,282 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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] [2023-02-15 10:22:14,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-15 10:22:14,282 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:22:14,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:22:14,283 INFO L85 PathProgramCache]: Analyzing trace with hash -1880062046, now seen corresponding path program 1 times [2023-02-15 10:22:14,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:22:14,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3520689] [2023-02-15 10:22:14,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:22:14,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:22:14,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:22:14,367 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 10:22:14,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:22:14,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3520689] [2023-02-15 10:22:14,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3520689] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:22:14,368 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:22:14,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 10:22:14,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648094490] [2023-02-15 10:22:14,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:22:14,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 10:22:14,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:22:14,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 10:22:14,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 10:22:14,370 INFO L87 Difference]: Start difference. First operand 160 states and 234 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:22:14,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:22:14,479 INFO L93 Difference]: Finished difference Result 304 states and 455 transitions. [2023-02-15 10:22:14,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 10:22:14,481 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 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 51 [2023-02-15 10:22:14,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:22:14,483 INFO L225 Difference]: With dead ends: 304 [2023-02-15 10:22:14,483 INFO L226 Difference]: Without dead ends: 181 [2023-02-15 10:22:14,484 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 10:22:14,489 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 16 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 10:22:14,490 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 266 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 10:22:14,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2023-02-15 10:22:14,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 177. [2023-02-15 10:22:14,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 176 states have (on average 1.4545454545454546) internal successors, (256), 176 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:22:14,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 256 transitions. [2023-02-15 10:22:14,503 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 256 transitions. Word has length 51 [2023-02-15 10:22:14,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:22:14,504 INFO L495 AbstractCegarLoop]: Abstraction has 177 states and 256 transitions. [2023-02-15 10:22:14,504 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:22:14,504 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 256 transitions. [2023-02-15 10:22:14,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-02-15 10:22:14,505 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:22:14,505 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2023-02-15 10:22:14,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-15 10:22:14,506 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:22:14,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:22:14,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1552359252, now seen corresponding path program 1 times [2023-02-15 10:22:14,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:22:14,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732945594] [2023-02-15 10:22:14,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:22:14,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:22:14,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:22:14,605 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-02-15 10:22:14,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:22:14,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732945594] [2023-02-15 10:22:14,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732945594] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:22:14,606 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:22:14,606 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 10:22:14,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101942849] [2023-02-15 10:22:14,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:22:14,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 10:22:14,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:22:14,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 10:22:14,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 10:22:14,608 INFO L87 Difference]: Start difference. First operand 177 states and 256 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) [2023-02-15 10:22:14,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:22:14,635 INFO L93 Difference]: Finished difference Result 454 states and 668 transitions. [2023-02-15 10:22:14,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 10:22:14,636 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 70 [2023-02-15 10:22:14,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:22:14,638 INFO L225 Difference]: With dead ends: 454 [2023-02-15 10:22:14,638 INFO L226 Difference]: Without dead ends: 314 [2023-02-15 10:22:14,639 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 10:22:14,639 INFO L413 NwaCegarLoop]: 214 mSDtfsCounter, 132 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 10:22:14,640 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 379 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 10:22:14,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2023-02-15 10:22:14,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 314. [2023-02-15 10:22:14,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 313 states have (on average 1.4536741214057507) internal successors, (455), 313 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:22:14,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 455 transitions. [2023-02-15 10:22:14,666 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 455 transitions. Word has length 70 [2023-02-15 10:22:14,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:22:14,667 INFO L495 AbstractCegarLoop]: Abstraction has 314 states and 455 transitions. [2023-02-15 10:22:14,667 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) [2023-02-15 10:22:14,668 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 455 transitions. [2023-02-15 10:22:14,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-02-15 10:22:14,670 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:22:14,670 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:22:14,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-15 10:22:14,674 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:22:14,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:22:14,674 INFO L85 PathProgramCache]: Analyzing trace with hash -1693805076, now seen corresponding path program 1 times [2023-02-15 10:22:14,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:22:14,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140675198] [2023-02-15 10:22:14,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:22:14,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:22:14,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:22:14,752 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 10:22:14,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:22:14,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140675198] [2023-02-15 10:22:14,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140675198] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:22:14,752 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:22:14,752 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 10:22:14,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349893840] [2023-02-15 10:22:14,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:22:14,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 10:22:14,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:22:14,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 10:22:14,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 10:22:14,753 INFO L87 Difference]: Start difference. First operand 314 states and 455 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:22:14,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:22:14,775 INFO L93 Difference]: Finished difference Result 612 states and 889 transitions. [2023-02-15 10:22:14,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 10:22:14,776 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 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 71 [2023-02-15 10:22:14,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:22:14,778 INFO L225 Difference]: With dead ends: 612 [2023-02-15 10:22:14,778 INFO L226 Difference]: Without dead ends: 335 [2023-02-15 10:22:14,778 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 10:22:14,780 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 11 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 10:22:14,780 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 361 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 10:22:14,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2023-02-15 10:22:14,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 335. [2023-02-15 10:22:14,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 334 states have (on average 1.4431137724550898) internal successors, (482), 334 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:22:14,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 482 transitions. [2023-02-15 10:22:14,791 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 482 transitions. Word has length 71 [2023-02-15 10:22:14,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:22:14,791 INFO L495 AbstractCegarLoop]: Abstraction has 335 states and 482 transitions. [2023-02-15 10:22:14,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:22:14,792 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 482 transitions. [2023-02-15 10:22:14,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2023-02-15 10:22:14,793 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:22:14,793 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:22:14,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-02-15 10:22:14,793 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:22:14,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:22:14,794 INFO L85 PathProgramCache]: Analyzing trace with hash -294414028, now seen corresponding path program 1 times [2023-02-15 10:22:14,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:22:14,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499736408] [2023-02-15 10:22:14,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:22:14,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:22:14,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:22:14,852 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2023-02-15 10:22:14,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:22:14,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499736408] [2023-02-15 10:22:14,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499736408] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:22:14,863 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:22:14,863 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 10:22:14,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898323950] [2023-02-15 10:22:14,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:22:14,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 10:22:14,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:22:14,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 10:22:14,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 10:22:14,865 INFO L87 Difference]: Start difference. First operand 335 states and 482 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:22:14,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:22:14,973 INFO L93 Difference]: Finished difference Result 681 states and 998 transitions. [2023-02-15 10:22:14,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 10:22:14,974 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2023-02-15 10:22:14,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:22:14,976 INFO L225 Difference]: With dead ends: 681 [2023-02-15 10:22:14,976 INFO L226 Difference]: Without dead ends: 383 [2023-02-15 10:22:14,976 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 10:22:14,977 INFO L413 NwaCegarLoop]: 189 mSDtfsCounter, 12 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 10:22:14,977 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 271 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 10:22:14,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2023-02-15 10:22:14,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 377. [2023-02-15 10:22:14,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 376 states have (on average 1.4202127659574468) internal successors, (534), 376 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:22:14,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 534 transitions. [2023-02-15 10:22:14,987 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 534 transitions. Word has length 88 [2023-02-15 10:22:14,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:22:14,987 INFO L495 AbstractCegarLoop]: Abstraction has 377 states and 534 transitions. [2023-02-15 10:22:14,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:22:14,987 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 534 transitions. [2023-02-15 10:22:14,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-02-15 10:22:14,989 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:22:14,989 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 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] [2023-02-15 10:22:14,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-02-15 10:22:14,989 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:22:14,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:22:14,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1264349868, now seen corresponding path program 1 times [2023-02-15 10:22:14,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:22:14,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340850418] [2023-02-15 10:22:14,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:22:14,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:22:15,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:22:15,040 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2023-02-15 10:22:15,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:22:15,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340850418] [2023-02-15 10:22:15,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340850418] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:22:15,041 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:22:15,041 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 10:22:15,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800836361] [2023-02-15 10:22:15,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:22:15,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 10:22:15,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:22:15,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 10:22:15,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 10:22:15,043 INFO L87 Difference]: Start difference. First operand 377 states and 534 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) [2023-02-15 10:22:15,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:22:15,071 INFO L93 Difference]: Finished difference Result 538 states and 767 transitions. [2023-02-15 10:22:15,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 10:22:15,071 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 108 [2023-02-15 10:22:15,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:22:15,074 INFO L225 Difference]: With dead ends: 538 [2023-02-15 10:22:15,074 INFO L226 Difference]: Without dead ends: 536 [2023-02-15 10:22:15,074 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 10:22:15,075 INFO L413 NwaCegarLoop]: 167 mSDtfsCounter, 148 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 10:22:15,075 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 321 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 10:22:15,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2023-02-15 10:22:15,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 536. [2023-02-15 10:22:15,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 535 states have (on average 1.4299065420560748) internal successors, (765), 535 states have internal predecessors, (765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:22:15,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 765 transitions. [2023-02-15 10:22:15,088 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 765 transitions. Word has length 108 [2023-02-15 10:22:15,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:22:15,088 INFO L495 AbstractCegarLoop]: Abstraction has 536 states and 765 transitions. [2023-02-15 10:22:15,089 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) [2023-02-15 10:22:15,089 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 765 transitions. [2023-02-15 10:22:15,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2023-02-15 10:22:15,090 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:22:15,090 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:22:15,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-02-15 10:22:15,091 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:22:15,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:22:15,091 INFO L85 PathProgramCache]: Analyzing trace with hash 1514969078, now seen corresponding path program 1 times [2023-02-15 10:22:15,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:22:15,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919945031] [2023-02-15 10:22:15,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:22:15,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:22:15,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:22:15,142 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 123 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2023-02-15 10:22:15,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:22:15,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919945031] [2023-02-15 10:22:15,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919945031] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:22:15,143 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:22:15,143 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 10:22:15,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401773092] [2023-02-15 10:22:15,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:22:15,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 10:22:15,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:22:15,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 10:22:15,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 10:22:15,144 INFO L87 Difference]: Start difference. First operand 536 states and 765 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:22:15,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:22:15,285 INFO L93 Difference]: Finished difference Result 1185 states and 1745 transitions. [2023-02-15 10:22:15,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 10:22:15,285 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 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 128 [2023-02-15 10:22:15,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:22:15,288 INFO L225 Difference]: With dead ends: 1185 [2023-02-15 10:22:15,288 INFO L226 Difference]: Without dead ends: 683 [2023-02-15 10:22:15,289 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 10:22:15,290 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 75 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 10:22:15,290 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 246 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 10:22:15,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2023-02-15 10:22:15,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 659. [2023-02-15 10:22:15,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 659 states, 658 states have (on average 1.4635258358662615) internal successors, (963), 658 states have internal predecessors, (963), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:22:15,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 963 transitions. [2023-02-15 10:22:15,305 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 963 transitions. Word has length 128 [2023-02-15 10:22:15,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:22:15,306 INFO L495 AbstractCegarLoop]: Abstraction has 659 states and 963 transitions. [2023-02-15 10:22:15,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:22:15,306 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 963 transitions. [2023-02-15 10:22:15,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2023-02-15 10:22:15,308 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:22:15,308 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 7, 7, 7, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:22:15,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-02-15 10:22:15,309 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:22:15,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:22:15,309 INFO L85 PathProgramCache]: Analyzing trace with hash -219869315, now seen corresponding path program 1 times [2023-02-15 10:22:15,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:22:15,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119039773] [2023-02-15 10:22:15,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:22:15,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:22:15,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:22:15,377 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 203 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-02-15 10:22:15,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:22:15,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119039773] [2023-02-15 10:22:15,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119039773] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:22:15,378 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:22:15,378 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 10:22:15,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741206289] [2023-02-15 10:22:15,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:22:15,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 10:22:15,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:22:15,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 10:22:15,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 10:22:15,380 INFO L87 Difference]: Start difference. First operand 659 states and 963 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:22:15,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:22:15,520 INFO L93 Difference]: Finished difference Result 1559 states and 2344 transitions. [2023-02-15 10:22:15,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 10:22:15,520 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 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 154 [2023-02-15 10:22:15,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:22:15,523 INFO L225 Difference]: With dead ends: 1559 [2023-02-15 10:22:15,524 INFO L226 Difference]: Without dead ends: 886 [2023-02-15 10:22:15,525 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 10:22:15,525 INFO L413 NwaCegarLoop]: 169 mSDtfsCounter, 81 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 10:22:15,526 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 225 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 10:22:15,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2023-02-15 10:22:15,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 848. [2023-02-15 10:22:15,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 848 states, 847 states have (on average 1.4344746162927982) internal successors, (1215), 847 states have internal predecessors, (1215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:22:15,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 848 states to 848 states and 1215 transitions. [2023-02-15 10:22:15,546 INFO L78 Accepts]: Start accepts. Automaton has 848 states and 1215 transitions. Word has length 154 [2023-02-15 10:22:15,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:22:15,547 INFO L495 AbstractCegarLoop]: Abstraction has 848 states and 1215 transitions. [2023-02-15 10:22:15,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:22:15,547 INFO L276 IsEmpty]: Start isEmpty. Operand 848 states and 1215 transitions. [2023-02-15 10:22:15,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2023-02-15 10:22:15,549 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:22:15,550 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 9, 9, 8, 8, 8, 8, 8, 6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:22:15,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-02-15 10:22:15,550 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:22:15,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:22:15,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1855970287, now seen corresponding path program 1 times [2023-02-15 10:22:15,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:22:15,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105692324] [2023-02-15 10:22:15,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:22:15,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:22:15,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:22:15,612 INFO L134 CoverageAnalysis]: Checked inductivity of 417 backedges. 250 proven. 0 refuted. 0 times theorem prover too weak. 167 trivial. 0 not checked. [2023-02-15 10:22:15,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:22:15,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105692324] [2023-02-15 10:22:15,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105692324] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:22:15,613 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:22:15,613 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 10:22:15,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820151990] [2023-02-15 10:22:15,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:22:15,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 10:22:15,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:22:15,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 10:22:15,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 10:22:15,614 INFO L87 Difference]: Start difference. First operand 848 states and 1215 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:22:15,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:22:15,743 INFO L93 Difference]: Finished difference Result 1815 states and 2621 transitions. [2023-02-15 10:22:15,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 10:22:15,744 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 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 175 [2023-02-15 10:22:15,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:22:15,747 INFO L225 Difference]: With dead ends: 1815 [2023-02-15 10:22:15,748 INFO L226 Difference]: Without dead ends: 959 [2023-02-15 10:22:15,749 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 10:22:15,749 INFO L413 NwaCegarLoop]: 169 mSDtfsCounter, 84 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 10:22:15,749 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 221 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 10:22:15,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2023-02-15 10:22:15,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 923. [2023-02-15 10:22:15,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 923 states, 922 states have (on average 1.4219088937093276) internal successors, (1311), 922 states have internal predecessors, (1311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:22:15,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1311 transitions. [2023-02-15 10:22:15,771 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1311 transitions. Word has length 175 [2023-02-15 10:22:15,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:22:15,771 INFO L495 AbstractCegarLoop]: Abstraction has 923 states and 1311 transitions. [2023-02-15 10:22:15,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:22:15,772 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1311 transitions. [2023-02-15 10:22:15,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2023-02-15 10:22:15,774 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:22:15,774 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 9, 9, 9, 9, 9, 7, 7, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:22:15,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-02-15 10:22:15,775 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:22:15,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:22:15,775 INFO L85 PathProgramCache]: Analyzing trace with hash -150572132, now seen corresponding path program 1 times [2023-02-15 10:22:15,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:22:15,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4944074] [2023-02-15 10:22:15,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:22:15,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:22:15,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:22:15,853 INFO L134 CoverageAnalysis]: Checked inductivity of 535 backedges. 295 proven. 0 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2023-02-15 10:22:15,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:22:15,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4944074] [2023-02-15 10:22:15,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4944074] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:22:15,854 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:22:15,854 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 10:22:15,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291484063] [2023-02-15 10:22:15,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:22:15,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 10:22:15,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:22:15,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 10:22:15,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 10:22:15,856 INFO L87 Difference]: Start difference. First operand 923 states and 1311 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:22:15,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:22:15,995 INFO L93 Difference]: Finished difference Result 1965 states and 2810 transitions. [2023-02-15 10:22:15,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 10:22:15,995 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 199 [2023-02-15 10:22:15,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:22:15,999 INFO L225 Difference]: With dead ends: 1965 [2023-02-15 10:22:15,999 INFO L226 Difference]: Without dead ends: 1040 [2023-02-15 10:22:16,001 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 10:22:16,001 INFO L413 NwaCegarLoop]: 169 mSDtfsCounter, 85 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 10:22:16,002 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 219 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 10:22:16,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1040 states. [2023-02-15 10:22:16,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1040 to 1007. [2023-02-15 10:22:16,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1007 states, 1006 states have (on average 1.4135188866799204) internal successors, (1422), 1006 states have internal predecessors, (1422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:22:16,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1007 states to 1007 states and 1422 transitions. [2023-02-15 10:22:16,027 INFO L78 Accepts]: Start accepts. Automaton has 1007 states and 1422 transitions. Word has length 199 [2023-02-15 10:22:16,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:22:16,028 INFO L495 AbstractCegarLoop]: Abstraction has 1007 states and 1422 transitions. [2023-02-15 10:22:16,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:22:16,028 INFO L276 IsEmpty]: Start isEmpty. Operand 1007 states and 1422 transitions. [2023-02-15 10:22:16,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2023-02-15 10:22:16,031 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:22:16,031 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 9, 9, 9, 9, 9, 7, 7, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:22:16,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-02-15 10:22:16,031 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:22:16,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:22:16,032 INFO L85 PathProgramCache]: Analyzing trace with hash -643198306, now seen corresponding path program 1 times [2023-02-15 10:22:16,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:22:16,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669483460] [2023-02-15 10:22:16,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:22:16,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:22:16,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:22:16,110 INFO L134 CoverageAnalysis]: Checked inductivity of 535 backedges. 295 proven. 0 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2023-02-15 10:22:16,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:22:16,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669483460] [2023-02-15 10:22:16,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669483460] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:22:16,111 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:22:16,111 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 10:22:16,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195794025] [2023-02-15 10:22:16,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:22:16,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 10:22:16,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:22:16,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 10:22:16,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 10:22:16,113 INFO L87 Difference]: Start difference. First operand 1007 states and 1422 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:22:16,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:22:16,249 INFO L93 Difference]: Finished difference Result 2133 states and 3035 transitions. [2023-02-15 10:22:16,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 10:22:16,250 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 199 [2023-02-15 10:22:16,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:22:16,254 INFO L225 Difference]: With dead ends: 2133 [2023-02-15 10:22:16,254 INFO L226 Difference]: Without dead ends: 1136 [2023-02-15 10:22:16,255 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 10:22:16,256 INFO L413 NwaCegarLoop]: 169 mSDtfsCounter, 87 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 10:22:16,256 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 217 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 10:22:16,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1136 states. [2023-02-15 10:22:16,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1136 to 1100. [2023-02-15 10:22:16,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1100 states, 1099 states have (on average 1.414012738853503) internal successors, (1554), 1099 states have internal predecessors, (1554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:22:16,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1100 states to 1100 states and 1554 transitions. [2023-02-15 10:22:16,284 INFO L78 Accepts]: Start accepts. Automaton has 1100 states and 1554 transitions. Word has length 199 [2023-02-15 10:22:16,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:22:16,284 INFO L495 AbstractCegarLoop]: Abstraction has 1100 states and 1554 transitions. [2023-02-15 10:22:16,284 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:22:16,285 INFO L276 IsEmpty]: Start isEmpty. Operand 1100 states and 1554 transitions. [2023-02-15 10:22:16,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2023-02-15 10:22:16,287 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:22:16,287 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 10, 10, 10, 10, 10, 8, 8, 6, 6, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:22:16,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-02-15 10:22:16,288 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:22:16,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:22:16,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1155189252, now seen corresponding path program 1 times [2023-02-15 10:22:16,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:22:16,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282893901] [2023-02-15 10:22:16,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:22:16,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:22:16,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:22:16,398 INFO L134 CoverageAnalysis]: Checked inductivity of 673 backedges. 418 proven. 0 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2023-02-15 10:22:16,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:22:16,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282893901] [2023-02-15 10:22:16,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282893901] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:22:16,399 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:22:16,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 10:22:16,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921504754] [2023-02-15 10:22:16,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:22:16,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 10:22:16,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:22:16,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 10:22:16,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 10:22:16,401 INFO L87 Difference]: Start difference. First operand 1100 states and 1554 transitions. Second operand has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:22:16,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:22:16,446 INFO L93 Difference]: Finished difference Result 3223 states and 4561 transitions. [2023-02-15 10:22:16,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 10:22:16,447 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 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 229 [2023-02-15 10:22:16,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:22:16,454 INFO L225 Difference]: With dead ends: 3223 [2023-02-15 10:22:16,454 INFO L226 Difference]: Without dead ends: 2160 [2023-02-15 10:22:16,456 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 10:22:16,457 INFO L413 NwaCegarLoop]: 335 mSDtfsCounter, 134 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 10:22:16,457 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 508 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 10:22:16,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2160 states. [2023-02-15 10:22:16,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2160 to 2158. [2023-02-15 10:22:16,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2158 states, 2157 states have (on average 1.4149281409364858) internal successors, (3052), 2157 states have internal predecessors, (3052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:22:16,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2158 states to 2158 states and 3052 transitions. [2023-02-15 10:22:16,512 INFO L78 Accepts]: Start accepts. Automaton has 2158 states and 3052 transitions. Word has length 229 [2023-02-15 10:22:16,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:22:16,512 INFO L495 AbstractCegarLoop]: Abstraction has 2158 states and 3052 transitions. [2023-02-15 10:22:16,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:22:16,513 INFO L276 IsEmpty]: Start isEmpty. Operand 2158 states and 3052 transitions. [2023-02-15 10:22:16,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2023-02-15 10:22:16,516 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:22:16,516 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 10, 10, 10, 10, 10, 8, 8, 6, 6, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:22:16,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-02-15 10:22:16,517 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:22:16,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:22:16,517 INFO L85 PathProgramCache]: Analyzing trace with hash -1647815426, now seen corresponding path program 1 times [2023-02-15 10:22:16,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:22:16,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246308313] [2023-02-15 10:22:16,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:22:16,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:22:16,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:22:16,600 INFO L134 CoverageAnalysis]: Checked inductivity of 673 backedges. 340 proven. 0 refuted. 0 times theorem prover too weak. 333 trivial. 0 not checked. [2023-02-15 10:22:16,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:22:16,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246308313] [2023-02-15 10:22:16,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246308313] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:22:16,601 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:22:16,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 10:22:16,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100523827] [2023-02-15 10:22:16,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:22:16,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 10:22:16,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:22:16,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 10:22:16,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 10:22:16,604 INFO L87 Difference]: Start difference. First operand 2158 states and 3052 transitions. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:22:16,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:22:16,771 INFO L93 Difference]: Finished difference Result 4585 states and 6523 transitions. [2023-02-15 10:22:16,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 10:22:16,771 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 229 [2023-02-15 10:22:16,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:22:16,779 INFO L225 Difference]: With dead ends: 4585 [2023-02-15 10:22:16,779 INFO L226 Difference]: Without dead ends: 2434 [2023-02-15 10:22:16,783 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 10:22:16,784 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 90 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 10:22:16,784 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 211 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 10:22:16,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2434 states. [2023-02-15 10:22:16,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2434 to 2368. [2023-02-15 10:22:16,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2368 states, 2367 states have (on average 1.42120828052387) internal successors, (3364), 2367 states have internal predecessors, (3364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:22:16,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2368 states to 2368 states and 3364 transitions. [2023-02-15 10:22:16,849 INFO L78 Accepts]: Start accepts. Automaton has 2368 states and 3364 transitions. Word has length 229 [2023-02-15 10:22:16,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:22:16,849 INFO L495 AbstractCegarLoop]: Abstraction has 2368 states and 3364 transitions. [2023-02-15 10:22:16,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:22:16,850 INFO L276 IsEmpty]: Start isEmpty. Operand 2368 states and 3364 transitions. [2023-02-15 10:22:16,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2023-02-15 10:22:16,854 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:22:16,854 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 11, 11, 11, 11, 11, 9, 9, 7, 7, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:22:16,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-02-15 10:22:16,855 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:22:16,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:22:16,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1130835859, now seen corresponding path program 1 times [2023-02-15 10:22:16,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:22:16,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726963036] [2023-02-15 10:22:16,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:22:16,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:22:16,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:22:16,937 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 385 proven. 0 refuted. 0 times theorem prover too weak. 452 trivial. 0 not checked. [2023-02-15 10:22:16,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:22:16,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726963036] [2023-02-15 10:22:16,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726963036] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:22:16,939 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:22:16,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 10:22:16,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444214476] [2023-02-15 10:22:16,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:22:16,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 10:22:16,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:22:16,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 10:22:16,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 10:22:16,941 INFO L87 Difference]: Start difference. First operand 2368 states and 3364 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:22:17,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:22:17,097 INFO L93 Difference]: Finished difference Result 4765 states and 6757 transitions. [2023-02-15 10:22:17,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 10:22:17,098 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 264 [2023-02-15 10:22:17,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:22:17,106 INFO L225 Difference]: With dead ends: 4765 [2023-02-15 10:22:17,106 INFO L226 Difference]: Without dead ends: 2416 [2023-02-15 10:22:17,108 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 10:22:17,110 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 93 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 10:22:17,111 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 206 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 10:22:17,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2416 states. [2023-02-15 10:22:17,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2416 to 2350. [2023-02-15 10:22:17,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2350 states, 2349 states have (on average 1.4091102596849723) internal successors, (3310), 2349 states have internal predecessors, (3310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:22:17,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2350 states to 2350 states and 3310 transitions. [2023-02-15 10:22:17,198 INFO L78 Accepts]: Start accepts. Automaton has 2350 states and 3310 transitions. Word has length 264 [2023-02-15 10:22:17,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:22:17,198 INFO L495 AbstractCegarLoop]: Abstraction has 2350 states and 3310 transitions. [2023-02-15 10:22:17,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:22:17,199 INFO L276 IsEmpty]: Start isEmpty. Operand 2350 states and 3310 transitions. [2023-02-15 10:22:17,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2023-02-15 10:22:17,203 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:22:17,204 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 10, 10, 8, 8, 7, 7, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:22:17,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-02-15 10:22:17,204 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:22:17,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:22:17,205 INFO L85 PathProgramCache]: Analyzing trace with hash 1187214557, now seen corresponding path program 1 times [2023-02-15 10:22:17,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:22:17,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700192252] [2023-02-15 10:22:17,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:22:17,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:22:17,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:22:17,306 INFO L134 CoverageAnalysis]: Checked inductivity of 844 backedges. 263 proven. 0 refuted. 0 times theorem prover too weak. 581 trivial. 0 not checked. [2023-02-15 10:22:17,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:22:17,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700192252] [2023-02-15 10:22:17,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700192252] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:22:17,307 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:22:17,307 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 10:22:17,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229913751] [2023-02-15 10:22:17,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:22:17,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 10:22:17,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:22:17,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 10:22:17,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 10:22:17,309 INFO L87 Difference]: Start difference. First operand 2350 states and 3310 transitions. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:22:17,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:22:17,402 INFO L93 Difference]: Finished difference Result 6951 states and 9784 transitions. [2023-02-15 10:22:17,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 10:22:17,403 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 274 [2023-02-15 10:22:17,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:22:17,446 INFO L225 Difference]: With dead ends: 6951 [2023-02-15 10:22:17,447 INFO L226 Difference]: Without dead ends: 4638 [2023-02-15 10:22:17,450 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 10:22:17,451 INFO L413 NwaCegarLoop]: 178 mSDtfsCounter, 72 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 10:22:17,451 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 340 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 10:22:17,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4638 states. [2023-02-15 10:22:17,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4638 to 4636. [2023-02-15 10:22:17,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4636 states, 4635 states have (on average 1.4032362459546925) internal successors, (6504), 4635 states have internal predecessors, (6504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:22:17,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4636 states to 4636 states and 6504 transitions. [2023-02-15 10:22:17,610 INFO L78 Accepts]: Start accepts. Automaton has 4636 states and 6504 transitions. Word has length 274 [2023-02-15 10:22:17,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:22:17,610 INFO L495 AbstractCegarLoop]: Abstraction has 4636 states and 6504 transitions. [2023-02-15 10:22:17,611 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:22:17,611 INFO L276 IsEmpty]: Start isEmpty. Operand 4636 states and 6504 transitions. [2023-02-15 10:22:17,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2023-02-15 10:22:17,619 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:22:17,619 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 10, 10, 8, 8, 7, 7, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:22:17,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-02-15 10:22:17,619 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:22:17,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:22:17,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1412043949, now seen corresponding path program 1 times [2023-02-15 10:22:17,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:22:17,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800762079] [2023-02-15 10:22:17,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:22:17,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:22:17,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:22:17,740 INFO L134 CoverageAnalysis]: Checked inductivity of 842 backedges. 315 proven. 25 refuted. 0 times theorem prover too weak. 502 trivial. 0 not checked. [2023-02-15 10:22:17,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:22:17,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800762079] [2023-02-15 10:22:17,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800762079] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:22:17,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1197813249] [2023-02-15 10:22:17,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:22:17,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:22:17,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:22:17,749 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 10:22:17,756 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-15 10:22:17,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:22:17,924 INFO L263 TraceCheckSpWp]: Trace formula consists of 525 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-15 10:22:17,950 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:22:18,057 INFO L134 CoverageAnalysis]: Checked inductivity of 842 backedges. 273 proven. 0 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2023-02-15 10:22:18,057 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 10:22:18,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1197813249] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:22:18,058 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 10:22:18,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2023-02-15 10:22:18,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734940855] [2023-02-15 10:22:18,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:22:18,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 10:22:18,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:22:18,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 10:22:18,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-15 10:22:18,060 INFO L87 Difference]: Start difference. First operand 4636 states and 6504 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:22:18,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:22:18,315 INFO L93 Difference]: Finished difference Result 9314 states and 13055 transitions. [2023-02-15 10:22:18,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 10:22:18,316 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 274 [2023-02-15 10:22:18,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:22:18,333 INFO L225 Difference]: With dead ends: 9314 [2023-02-15 10:22:18,333 INFO L226 Difference]: Without dead ends: 4744 [2023-02-15 10:22:18,339 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 274 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-15 10:22:18,341 INFO L413 NwaCegarLoop]: 190 mSDtfsCounter, 48 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 10:22:18,341 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 265 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 10:22:18,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4744 states. [2023-02-15 10:22:18,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4744 to 4636. [2023-02-15 10:22:18,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4636 states, 4635 states have (on average 1.3799352750809062) internal successors, (6396), 4635 states have internal predecessors, (6396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:22:18,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4636 states to 4636 states and 6396 transitions. [2023-02-15 10:22:18,491 INFO L78 Accepts]: Start accepts. Automaton has 4636 states and 6396 transitions. Word has length 274 [2023-02-15 10:22:18,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:22:18,491 INFO L495 AbstractCegarLoop]: Abstraction has 4636 states and 6396 transitions. [2023-02-15 10:22:18,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:22:18,492 INFO L276 IsEmpty]: Start isEmpty. Operand 4636 states and 6396 transitions. [2023-02-15 10:22:18,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2023-02-15 10:22:18,524 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:22:18,525 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 12, 12, 12, 10, 10, 8, 8, 7, 7, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:22:18,535 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-02-15 10:22:18,732 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 [2023-02-15 10:22:18,732 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:22:18,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:22:18,733 INFO L85 PathProgramCache]: Analyzing trace with hash -1677895817, now seen corresponding path program 1 times [2023-02-15 10:22:18,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:22:18,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593834217] [2023-02-15 10:22:18,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:22:18,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:22:18,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:22:18,865 INFO L134 CoverageAnalysis]: Checked inductivity of 1052 backedges. 382 proven. 25 refuted. 0 times theorem prover too weak. 645 trivial. 0 not checked. [2023-02-15 10:22:18,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:22:18,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593834217] [2023-02-15 10:22:18,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593834217] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:22:18,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1723973353] [2023-02-15 10:22:18,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:22:18,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:22:18,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:22:18,868 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 10:22:18,897 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-15 10:22:19,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:22:19,006 INFO L263 TraceCheckSpWp]: Trace formula consists of 579 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-15 10:22:19,018 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:22:19,054 INFO L134 CoverageAnalysis]: Checked inductivity of 1052 backedges. 451 proven. 0 refuted. 0 times theorem prover too weak. 601 trivial. 0 not checked. [2023-02-15 10:22:19,054 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 10:22:19,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1723973353] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:22:19,055 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 10:22:19,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2023-02-15 10:22:19,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841167436] [2023-02-15 10:22:19,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:22:19,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 10:22:19,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:22:19,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 10:22:19,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-15 10:22:19,057 INFO L87 Difference]: Start difference. First operand 4636 states and 6396 transitions. Second operand has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:22:19,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:22:19,274 INFO L93 Difference]: Finished difference Result 9800 states and 13409 transitions. [2023-02-15 10:22:19,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 10:22:19,275 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 301 [2023-02-15 10:22:19,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:22:19,302 INFO L225 Difference]: With dead ends: 9800 [2023-02-15 10:22:19,303 INFO L226 Difference]: Without dead ends: 5230 [2023-02-15 10:22:19,307 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 301 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-15 10:22:19,308 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 106 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 10:22:19,308 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 201 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 10:22:19,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5230 states. [2023-02-15 10:22:19,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5230 to 4810. [2023-02-15 10:22:19,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4810 states, 4809 states have (on average 1.3786650031191516) internal successors, (6630), 4809 states have internal predecessors, (6630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:22:19,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4810 states to 4810 states and 6630 transitions. [2023-02-15 10:22:19,451 INFO L78 Accepts]: Start accepts. Automaton has 4810 states and 6630 transitions. Word has length 301 [2023-02-15 10:22:19,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:22:19,452 INFO L495 AbstractCegarLoop]: Abstraction has 4810 states and 6630 transitions. [2023-02-15 10:22:19,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:22:19,453 INFO L276 IsEmpty]: Start isEmpty. Operand 4810 states and 6630 transitions. [2023-02-15 10:22:19,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2023-02-15 10:22:19,461 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:22:19,461 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 12, 12, 12, 10, 10, 8, 8, 7, 7, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:22:19,471 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-15 10:22:19,668 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 [2023-02-15 10:22:19,668 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:22:19,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:22:19,669 INFO L85 PathProgramCache]: Analyzing trace with hash -1606168447, now seen corresponding path program 1 times [2023-02-15 10:22:19,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:22:19,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423751913] [2023-02-15 10:22:19,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:22:19,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:22:19,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:22:19,781 INFO L134 CoverageAnalysis]: Checked inductivity of 1054 backedges. 453 proven. 0 refuted. 0 times theorem prover too weak. 601 trivial. 0 not checked. [2023-02-15 10:22:19,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:22:19,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423751913] [2023-02-15 10:22:19,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423751913] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:22:19,782 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:22:19,782 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 10:22:19,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981593936] [2023-02-15 10:22:19,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:22:19,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 10:22:19,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:22:19,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 10:22:19,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 10:22:19,784 INFO L87 Difference]: Start difference. First operand 4810 states and 6630 transitions. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:22:20,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:22:20,014 INFO L93 Difference]: Finished difference Result 9878 states and 13499 transitions. [2023-02-15 10:22:20,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 10:22:20,015 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 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 302 [2023-02-15 10:22:20,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:22:20,024 INFO L225 Difference]: With dead ends: 9878 [2023-02-15 10:22:20,025 INFO L226 Difference]: Without dead ends: 4630 [2023-02-15 10:22:20,031 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 10:22:20,031 INFO L413 NwaCegarLoop]: 191 mSDtfsCounter, 39 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 10:22:20,032 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 273 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 10:22:20,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4630 states. [2023-02-15 10:22:20,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4630 to 4612. [2023-02-15 10:22:20,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4612 states, 4611 states have (on average 1.3741054001301236) internal successors, (6336), 4611 states have internal predecessors, (6336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:22:20,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4612 states to 4612 states and 6336 transitions. [2023-02-15 10:22:20,165 INFO L78 Accepts]: Start accepts. Automaton has 4612 states and 6336 transitions. Word has length 302 [2023-02-15 10:22:20,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:22:20,166 INFO L495 AbstractCegarLoop]: Abstraction has 4612 states and 6336 transitions. [2023-02-15 10:22:20,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:22:20,166 INFO L276 IsEmpty]: Start isEmpty. Operand 4612 states and 6336 transitions. [2023-02-15 10:22:20,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2023-02-15 10:22:20,174 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:22:20,175 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 12, 11, 11, 9, 9, 8, 8, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:22:20,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-02-15 10:22:20,175 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:22:20,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:22:20,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1919616935, now seen corresponding path program 1 times [2023-02-15 10:22:20,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:22:20,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180671570] [2023-02-15 10:22:20,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:22:20,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:22:20,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:22:20,319 INFO L134 CoverageAnalysis]: Checked inductivity of 1053 backedges. 354 proven. 25 refuted. 0 times theorem prover too weak. 674 trivial. 0 not checked. [2023-02-15 10:22:20,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:22:20,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180671570] [2023-02-15 10:22:20,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180671570] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:22:20,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1575492493] [2023-02-15 10:22:20,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:22:20,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:22:20,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:22:20,321 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 10:22:20,336 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-15 10:22:20,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:22:20,448 INFO L263 TraceCheckSpWp]: Trace formula consists of 567 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-15 10:22:20,452 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:22:20,748 INFO L134 CoverageAnalysis]: Checked inductivity of 1053 backedges. 178 proven. 0 refuted. 0 times theorem prover too weak. 875 trivial. 0 not checked. [2023-02-15 10:22:20,749 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 10:22:20,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1575492493] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:22:20,749 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 10:22:20,749 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2023-02-15 10:22:20,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898088923] [2023-02-15 10:22:20,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:22:20,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 10:22:20,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:22:20,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 10:22:20,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-15 10:22:20,753 INFO L87 Difference]: Start difference. First operand 4612 states and 6336 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:22:20,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:22:20,851 INFO L93 Difference]: Finished difference Result 6921 states and 9490 transitions. [2023-02-15 10:22:20,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 10:22:20,852 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 312 [2023-02-15 10:22:20,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:22:20,861 INFO L225 Difference]: With dead ends: 6921 [2023-02-15 10:22:20,861 INFO L226 Difference]: Without dead ends: 4614 [2023-02-15 10:22:20,865 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 312 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-15 10:22:20,866 INFO L413 NwaCegarLoop]: 315 mSDtfsCounter, 57 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 10:22:20,866 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 478 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 10:22:20,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4614 states. [2023-02-15 10:22:20,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4614 to 4600. [2023-02-15 10:22:20,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4600 states, 4599 states have (on average 1.36986301369863) internal successors, (6300), 4599 states have internal predecessors, (6300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:22:20,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4600 states to 4600 states and 6300 transitions. [2023-02-15 10:22:20,992 INFO L78 Accepts]: Start accepts. Automaton has 4600 states and 6300 transitions. Word has length 312 [2023-02-15 10:22:20,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:22:20,993 INFO L495 AbstractCegarLoop]: Abstraction has 4600 states and 6300 transitions. [2023-02-15 10:22:20,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:22:20,993 INFO L276 IsEmpty]: Start isEmpty. Operand 4600 states and 6300 transitions. [2023-02-15 10:22:21,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2023-02-15 10:22:21,002 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:22:21,002 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 12, 11, 11, 9, 9, 8, 8, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:22:21,009 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-15 10:22:21,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:22:21,209 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:22:21,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:22:21,210 INFO L85 PathProgramCache]: Analyzing trace with hash -1627037657, now seen corresponding path program 1 times [2023-02-15 10:22:21,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:22:21,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251981765] [2023-02-15 10:22:21,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:22:21,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:22:21,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:22:21,382 INFO L134 CoverageAnalysis]: Checked inductivity of 1055 backedges. 356 proven. 25 refuted. 0 times theorem prover too weak. 674 trivial. 0 not checked. [2023-02-15 10:22:21,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:22:21,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251981765] [2023-02-15 10:22:21,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251981765] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:22:21,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [631899296] [2023-02-15 10:22:21,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:22:21,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:22:21,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:22:21,385 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 10:22:21,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-15 10:22:21,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:22:21,523 INFO L263 TraceCheckSpWp]: Trace formula consists of 568 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-15 10:22:21,526 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:22:21,609 INFO L134 CoverageAnalysis]: Checked inductivity of 1055 backedges. 356 proven. 25 refuted. 0 times theorem prover too weak. 674 trivial. 0 not checked. [2023-02-15 10:22:21,610 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:22:21,705 INFO L134 CoverageAnalysis]: Checked inductivity of 1055 backedges. 356 proven. 25 refuted. 0 times theorem prover too weak. 674 trivial. 0 not checked. [2023-02-15 10:22:21,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [631899296] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 10:22:21,706 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 10:22:21,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2023-02-15 10:22:21,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425157410] [2023-02-15 10:22:21,707 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 10:22:21,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-15 10:22:21,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:22:21,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-15 10:22:21,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2023-02-15 10:22:21,709 INFO L87 Difference]: Start difference. First operand 4600 states and 6300 transitions. Second operand has 11 states, 11 states have (on average 20.818181818181817) internal successors, (229), 11 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:22:22,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:22:22,232 INFO L93 Difference]: Finished difference Result 7227 states and 9988 transitions. [2023-02-15 10:22:22,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 10:22:22,233 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 20.818181818181817) internal successors, (229), 11 states have internal predecessors, (229), 0 states have call successors, (0), 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 312 [2023-02-15 10:22:22,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:22:22,241 INFO L225 Difference]: With dead ends: 7227 [2023-02-15 10:22:22,241 INFO L226 Difference]: Without dead ends: 4722 [2023-02-15 10:22:22,245 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 630 GetRequests, 618 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2023-02-15 10:22:22,246 INFO L413 NwaCegarLoop]: 280 mSDtfsCounter, 439 mSDsluCounter, 974 mSDsCounter, 0 mSdLazyCounter, 605 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 439 SdHoareTripleChecker+Valid, 1254 SdHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 605 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-15 10:22:22,246 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [439 Valid, 1254 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 605 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-15 10:22:22,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4722 states. [2023-02-15 10:22:22,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4722 to 4600. [2023-02-15 10:22:22,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4600 states, 4599 states have (on average 1.3672537508153946) internal successors, (6288), 4599 states have internal predecessors, (6288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:22:22,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4600 states to 4600 states and 6288 transitions. [2023-02-15 10:22:22,366 INFO L78 Accepts]: Start accepts. Automaton has 4600 states and 6288 transitions. Word has length 312 [2023-02-15 10:22:22,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:22:22,366 INFO L495 AbstractCegarLoop]: Abstraction has 4600 states and 6288 transitions. [2023-02-15 10:22:22,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 20.818181818181817) internal successors, (229), 11 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:22:22,367 INFO L276 IsEmpty]: Start isEmpty. Operand 4600 states and 6288 transitions. [2023-02-15 10:22:22,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2023-02-15 10:22:22,375 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:22:22,376 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 12, 11, 11, 9, 9, 8, 8, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:22:22,382 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-02-15 10:22:22,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:22:22,583 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:22:22,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:22:22,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1184629009, now seen corresponding path program 1 times [2023-02-15 10:22:22,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:22:22,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76065068] [2023-02-15 10:22:22,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:22:22,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:22:22,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:22:22,716 INFO L134 CoverageAnalysis]: Checked inductivity of 1055 backedges. 474 proven. 12 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2023-02-15 10:22:22,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:22:22,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76065068] [2023-02-15 10:22:22,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76065068] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:22:22,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1919592113] [2023-02-15 10:22:22,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:22:22,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:22:22,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:22:22,718 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 10:22:22,747 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-15 10:22:22,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:22:22,854 INFO L263 TraceCheckSpWp]: Trace formula consists of 566 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-15 10:22:22,858 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:22:22,936 INFO L134 CoverageAnalysis]: Checked inductivity of 1055 backedges. 356 proven. 25 refuted. 0 times theorem prover too weak. 674 trivial. 0 not checked. [2023-02-15 10:22:22,936 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:22:23,043 INFO L134 CoverageAnalysis]: Checked inductivity of 1055 backedges. 356 proven. 25 refuted. 0 times theorem prover too weak. 674 trivial. 0 not checked. [2023-02-15 10:22:23,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1919592113] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 10:22:23,043 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 10:22:23,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 10 [2023-02-15 10:22:23,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925290319] [2023-02-15 10:22:23,044 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 10:22:23,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-15 10:22:23,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:22:23,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-15 10:22:23,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-02-15 10:22:23,046 INFO L87 Difference]: Start difference. First operand 4600 states and 6288 transitions. Second operand has 10 states, 10 states have (on average 32.2) internal successors, (322), 10 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:22:23,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:22:23,608 INFO L93 Difference]: Finished difference Result 6005 states and 8260 transitions. [2023-02-15 10:22:23,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 10:22:23,609 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 32.2) internal successors, (322), 10 states have internal predecessors, (322), 0 states have call successors, (0), 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 313 [2023-02-15 10:22:23,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:22:23,613 INFO L225 Difference]: With dead ends: 6005 [2023-02-15 10:22:23,613 INFO L226 Difference]: Without dead ends: 2350 [2023-02-15 10:22:23,618 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 637 GetRequests, 624 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2023-02-15 10:22:23,619 INFO L413 NwaCegarLoop]: 172 mSDtfsCounter, 494 mSDsluCounter, 806 mSDsCounter, 0 mSdLazyCounter, 727 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 494 SdHoareTripleChecker+Valid, 978 SdHoareTripleChecker+Invalid, 787 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 727 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-15 10:22:23,619 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [494 Valid, 978 Invalid, 787 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 727 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-15 10:22:23,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2350 states. [2023-02-15 10:22:23,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2350 to 2284. [2023-02-15 10:22:23,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2284 states, 2283 states have (on average 1.3653088042049935) internal successors, (3117), 2283 states have internal predecessors, (3117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:22:23,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2284 states to 2284 states and 3117 transitions. [2023-02-15 10:22:23,693 INFO L78 Accepts]: Start accepts. Automaton has 2284 states and 3117 transitions. Word has length 313 [2023-02-15 10:22:23,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:22:23,693 INFO L495 AbstractCegarLoop]: Abstraction has 2284 states and 3117 transitions. [2023-02-15 10:22:23,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 32.2) internal successors, (322), 10 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:22:23,694 INFO L276 IsEmpty]: Start isEmpty. Operand 2284 states and 3117 transitions. [2023-02-15 10:22:23,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2023-02-15 10:22:23,699 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:22:23,699 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 12, 11, 11, 9, 9, 8, 8, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:22:23,706 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-02-15 10:22:23,906 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,SelfDestructingSolverStorable22 [2023-02-15 10:22:23,906 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:22:23,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:22:23,906 INFO L85 PathProgramCache]: Analyzing trace with hash -2094731103, now seen corresponding path program 1 times [2023-02-15 10:22:23,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:22:23,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931690308] [2023-02-15 10:22:23,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:22:23,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:22:23,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:22:24,028 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 475 proven. 12 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2023-02-15 10:22:24,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:22:24,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931690308] [2023-02-15 10:22:24,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931690308] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:22:24,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1891337374] [2023-02-15 10:22:24,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:22:24,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:22:24,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:22:24,031 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 10:22:24,034 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-02-15 10:22:24,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:22:24,151 INFO L263 TraceCheckSpWp]: Trace formula consists of 574 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-15 10:22:24,156 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:22:24,216 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 475 proven. 12 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2023-02-15 10:22:24,216 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:22:24,281 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 475 proven. 12 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2023-02-15 10:22:24,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1891337374] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 10:22:24,282 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 10:22:24,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2023-02-15 10:22:24,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882986805] [2023-02-15 10:22:24,282 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 10:22:24,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 10:22:24,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:22:24,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 10:22:24,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-15 10:22:24,284 INFO L87 Difference]: Start difference. First operand 2284 states and 3117 transitions. Second operand has 6 states, 6 states have (on average 37.666666666666664) internal successors, (226), 6 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:22:24,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:22:24,653 INFO L93 Difference]: Finished difference Result 5795 states and 8022 transitions. [2023-02-15 10:22:24,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 10:22:24,653 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 37.666666666666664) internal successors, (226), 6 states have internal predecessors, (226), 0 states have call successors, (0), 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 314 [2023-02-15 10:22:24,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:22:24,659 INFO L225 Difference]: With dead ends: 5795 [2023-02-15 10:22:24,659 INFO L226 Difference]: Without dead ends: 3380 [2023-02-15 10:22:24,661 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 634 GetRequests, 628 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2023-02-15 10:22:24,662 INFO L413 NwaCegarLoop]: 346 mSDtfsCounter, 249 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 454 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 846 SdHoareTripleChecker+Invalid, 521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 10:22:24,663 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 846 Invalid, 521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 454 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 10:22:24,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3380 states. [2023-02-15 10:22:24,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3380 to 2481. [2023-02-15 10:22:24,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2481 states, 2480 states have (on average 1.375) internal successors, (3410), 2480 states have internal predecessors, (3410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:22:24,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2481 states to 2481 states and 3410 transitions. [2023-02-15 10:22:24,728 INFO L78 Accepts]: Start accepts. Automaton has 2481 states and 3410 transitions. Word has length 314 [2023-02-15 10:22:24,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:22:24,729 INFO L495 AbstractCegarLoop]: Abstraction has 2481 states and 3410 transitions. [2023-02-15 10:22:24,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 37.666666666666664) internal successors, (226), 6 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:22:24,729 INFO L276 IsEmpty]: Start isEmpty. Operand 2481 states and 3410 transitions. [2023-02-15 10:22:24,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2023-02-15 10:22:24,735 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:22:24,737 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 14, 14, 13, 13, 13, 13, 13, 11, 11, 9, 9, 8, 8, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:22:24,745 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-02-15 10:22:24,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:22:24,944 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:22:24,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:22:24,945 INFO L85 PathProgramCache]: Analyzing trace with hash 90171258, now seen corresponding path program 1 times [2023-02-15 10:22:24,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:22:24,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75318395] [2023-02-15 10:22:24,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:22:24,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:22:24,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:22:25,058 INFO L134 CoverageAnalysis]: Checked inductivity of 1258 backedges. 652 proven. 5 refuted. 0 times theorem prover too weak. 601 trivial. 0 not checked. [2023-02-15 10:22:25,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:22:25,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75318395] [2023-02-15 10:22:25,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75318395] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:22:25,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [555682648] [2023-02-15 10:22:25,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:22:25,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:22:25,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:22:25,061 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 10:22:25,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-02-15 10:22:25,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:22:25,192 INFO L263 TraceCheckSpWp]: Trace formula consists of 632 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-15 10:22:25,195 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:22:25,248 INFO L134 CoverageAnalysis]: Checked inductivity of 1258 backedges. 652 proven. 5 refuted. 0 times theorem prover too weak. 601 trivial. 0 not checked. [2023-02-15 10:22:25,248 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:22:25,303 INFO L134 CoverageAnalysis]: Checked inductivity of 1258 backedges. 652 proven. 5 refuted. 0 times theorem prover too weak. 601 trivial. 0 not checked. [2023-02-15 10:22:25,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [555682648] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 10:22:25,303 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 10:22:25,303 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2023-02-15 10:22:25,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229648163] [2023-02-15 10:22:25,304 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 10:22:25,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 10:22:25,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:22:25,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 10:22:25,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-15 10:22:25,305 INFO L87 Difference]: Start difference. First operand 2481 states and 3410 transitions. Second operand has 6 states, 6 states have (on average 37.5) internal successors, (225), 6 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:22:25,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:22:25,481 INFO L93 Difference]: Finished difference Result 3536 states and 4811 transitions. [2023-02-15 10:22:25,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 10:22:25,482 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 37.5) internal successors, (225), 6 states have internal predecessors, (225), 0 states have call successors, (0), 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 340 [2023-02-15 10:22:25,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:22:25,483 INFO L225 Difference]: With dead ends: 3536 [2023-02-15 10:22:25,483 INFO L226 Difference]: Without dead ends: 0 [2023-02-15 10:22:25,486 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 684 GetRequests, 679 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-02-15 10:22:25,489 INFO L413 NwaCegarLoop]: 159 mSDtfsCounter, 115 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 10:22:25,490 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 366 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 10:22:25,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-02-15 10:22:25,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-02-15 10:22:25,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:22:25,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-02-15 10:22:25,491 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 340 [2023-02-15 10:22:25,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:22:25,491 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-02-15 10:22:25,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 37.5) internal successors, (225), 6 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:22:25,491 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-02-15 10:22:25,492 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-02-15 10:22:25,494 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-02-15 10:22:25,503 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-02-15 10:22:25,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:22:25,703 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-02-15 10:22:28,529 INFO L899 garLoopResultBuilder]: For program point L367(lines 367 371) no Hoare annotation was computed. [2023-02-15 10:22:28,529 INFO L899 garLoopResultBuilder]: For program point L235(lines 235 252) no Hoare annotation was computed. [2023-02-15 10:22:28,529 INFO L899 garLoopResultBuilder]: For program point L202(lines 202 551) no Hoare annotation was computed. [2023-02-15 10:22:28,529 INFO L899 garLoopResultBuilder]: For program point L169(lines 169 562) no Hoare annotation was computed. [2023-02-15 10:22:28,529 INFO L899 garLoopResultBuilder]: For program point L235-2(lines 213 545) no Hoare annotation was computed. [2023-02-15 10:22:28,529 INFO L899 garLoopResultBuilder]: For program point L136(lines 136 573) no Hoare annotation was computed. [2023-02-15 10:22:28,529 INFO L899 garLoopResultBuilder]: For program point L501-1(lines 501 513) no Hoare annotation was computed. [2023-02-15 10:22:28,530 INFO L899 garLoopResultBuilder]: For program point L435(lines 435 439) no Hoare annotation was computed. [2023-02-15 10:22:28,530 INFO L899 garLoopResultBuilder]: For program point L237(lines 237 242) no Hoare annotation was computed. [2023-02-15 10:22:28,530 INFO L899 garLoopResultBuilder]: For program point L205(lines 205 550) no Hoare annotation was computed. [2023-02-15 10:22:28,530 INFO L899 garLoopResultBuilder]: For program point L172(lines 172 561) no Hoare annotation was computed. [2023-02-15 10:22:28,530 INFO L899 garLoopResultBuilder]: For program point L139(lines 139 572) no Hoare annotation was computed. [2023-02-15 10:22:28,530 INFO L899 garLoopResultBuilder]: For program point L536(lines 536 540) no Hoare annotation was computed. [2023-02-15 10:22:28,530 INFO L899 garLoopResultBuilder]: For program point L504(lines 504 509) no Hoare annotation was computed. [2023-02-15 10:22:28,530 INFO L899 garLoopResultBuilder]: For program point L471(lines 471 482) no Hoare annotation was computed. [2023-02-15 10:22:28,530 INFO L899 garLoopResultBuilder]: For program point L471-1(lines 471 482) no Hoare annotation was computed. [2023-02-15 10:22:28,530 INFO L899 garLoopResultBuilder]: For program point L273(lines 273 277) no Hoare annotation was computed. [2023-02-15 10:22:28,530 INFO L899 garLoopResultBuilder]: For program point L273-2(lines 213 545) no Hoare annotation was computed. [2023-02-15 10:22:28,531 INFO L895 garLoopResultBuilder]: At program point ssl3_connect_switch_1_4433#1(lines 151 568) the Hoare annotation is: (let ((.cse0 (<= 4432 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (.cse2 (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4448)) (.cse1 (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0)) (.cse3 (<= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 4))) (or (and .cse0 .cse1 (= 48 |ULTIMATE.start_ssl3_connect_~ag_Z~0#1|) .cse2 .cse3) (and .cse0 (<= |ULTIMATE.start_ssl3_connect_~ag_Y~0#1| 208) .cse2 (not .cse1) .cse3))) [2023-02-15 10:22:28,531 INFO L899 garLoopResultBuilder]: For program point L406(lines 406 410) no Hoare annotation was computed. [2023-02-15 10:22:28,531 INFO L899 garLoopResultBuilder]: For program point L340(lines 340 344) no Hoare annotation was computed. [2023-02-15 10:22:28,531 INFO L899 garLoopResultBuilder]: For program point L340-2(lines 213 545) no Hoare annotation was computed. [2023-02-15 10:22:28,531 INFO L899 garLoopResultBuilder]: For program point L208(lines 208 549) no Hoare annotation was computed. [2023-02-15 10:22:28,531 INFO L899 garLoopResultBuilder]: For program point L175(lines 175 560) no Hoare annotation was computed. [2023-02-15 10:22:28,531 INFO L899 garLoopResultBuilder]: For program point L142(lines 142 571) no Hoare annotation was computed. [2023-02-15 10:22:28,531 INFO L895 garLoopResultBuilder]: At program point L109-1(lines 109 612) the Hoare annotation is: (let ((.cse4 (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0))) (let ((.cse2 (= 4416 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (.cse11 (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4352)) (.cse12 (<= 4352 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (.cse14 (= 4384 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (.cse15 (= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 1)) (.cse9 (= 12292 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (.cse5 (= 2 |ULTIMATE.start_ssl3_connect_~blastFlag~0#1|)) (.cse7 (= 4368 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (.cse8 (= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 0)) (.cse16 (<= 4432 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (.cse0 (<= |ULTIMATE.start_ssl3_connect_~ag_Y~0#1| 208)) (.cse1 (not .cse4)) (.cse17 (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4528)) (.cse10 (<= |ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1| 4560)) (.cse6 (= 48 |ULTIMATE.start_ssl3_connect_~ag_Z~0#1|)) (.cse3 (<= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 4)) (.cse13 (<= 4560 |ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1|))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6) (and .cse4 .cse6 .cse2 .cse3) (and .cse7 .cse0 .cse1 .cse8) (and .cse4 .cse6 .cse9 .cse8) (and .cse4 .cse10 .cse11 .cse6 .cse12 .cse3 .cse13) (and .cse0 .cse14 .cse15 .cse1) (and (= 3 |ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1|) .cse0 .cse11 .cse1 .cse12 .cse3) (and .cse4 .cse14 .cse15 .cse6) (and .cse0 .cse1 .cse9 .cse8) (and .cse0 .cse5 .cse1) (and .cse4 .cse7 .cse6 .cse8) (and .cse16 .cse4 .cse6 .cse17 .cse3) (= 3 |ULTIMATE.start_ssl3_connect_~s__state~0#1|) (and .cse16 .cse0 .cse1 .cse17 .cse3) (and .cse4 .cse6 (= 48 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (and .cse4 .cse10 .cse6 (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4560) (<= 4560 |ULTIMATE.start_ssl3_connect_~s__state~0#1|) .cse3 .cse13)))) [2023-02-15 10:22:28,531 INFO L899 garLoopResultBuilder]: For program point L473(lines 473 479) no Hoare annotation was computed. [2023-02-15 10:22:28,532 INFO L899 garLoopResultBuilder]: For program point L110(line 110) no Hoare annotation was computed. [2023-02-15 10:22:28,532 INFO L895 garLoopResultBuilder]: At program point ssl3_connect_switch_1_4417#1(lines 145 570) the Hoare annotation is: (let ((.cse1 (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0)) (.cse0 (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4432)) (.cse2 (<= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 4))) (or (and .cse0 (<= |ULTIMATE.start_ssl3_connect_~ag_Y~0#1| 208) (not .cse1) (<= 4352 |ULTIMATE.start_ssl3_connect_~s__state~0#1|) .cse2) (and .cse1 .cse0 (not (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4384)) (= 48 |ULTIMATE.start_ssl3_connect_~ag_Z~0#1|) .cse2))) [2023-02-15 10:22:28,532 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(lines 632 642) the Hoare annotation is: true [2023-02-15 10:22:28,532 INFO L902 garLoopResultBuilder]: At program point ssl3_connect_returnLabel#1(lines 18 631) the Hoare annotation is: true [2023-02-15 10:22:28,533 INFO L899 garLoopResultBuilder]: For program point L243(lines 243 248) no Hoare annotation was computed. [2023-02-15 10:22:28,533 INFO L899 garLoopResultBuilder]: For program point L310(lines 310 314) no Hoare annotation was computed. [2023-02-15 10:22:28,533 INFO L899 garLoopResultBuilder]: For program point L310-2(lines 310 314) no Hoare annotation was computed. [2023-02-15 10:22:28,533 INFO L899 garLoopResultBuilder]: For program point L178(lines 178 559) no Hoare annotation was computed. [2023-02-15 10:22:28,533 INFO L899 garLoopResultBuilder]: For program point L145(lines 145 570) no Hoare annotation was computed. [2023-02-15 10:22:28,533 INFO L899 garLoopResultBuilder]: For program point L112(lines 112 581) no Hoare annotation was computed. [2023-02-15 10:22:28,533 INFO L899 garLoopResultBuilder]: For program point L443(lines 443 447) no Hoare annotation was computed. [2023-02-15 10:22:28,533 INFO L899 garLoopResultBuilder]: For program point L443-2(lines 213 545) no Hoare annotation was computed. [2023-02-15 10:22:28,534 INFO L899 garLoopResultBuilder]: For program point L311(line 311) no Hoare annotation was computed. [2023-02-15 10:22:28,534 INFO L899 garLoopResultBuilder]: For program point L311-2(line 311) no Hoare annotation was computed. [2023-02-15 10:22:28,534 INFO L899 garLoopResultBuilder]: For program point L311-4(line 311) no Hoare annotation was computed. [2023-02-15 10:22:28,534 INFO L895 garLoopResultBuilder]: At program point ssl3_connect_switch_1_4481#1(lines 175 560) the Hoare annotation is: (let ((.cse0 (<= 4432 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (.cse1 (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0)) (.cse2 (<= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 4)) (.cse3 (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4512))) (or (and .cse0 (<= |ULTIMATE.start_ssl3_connect_~ag_Y~0#1| 208) (not .cse1) .cse2 .cse3) (and .cse0 .cse1 (= 48 |ULTIMATE.start_ssl3_connect_~ag_Z~0#1|) .cse2 .cse3))) [2023-02-15 10:22:28,534 INFO L899 garLoopResultBuilder]: For program point L378(lines 378 382) no Hoare annotation was computed. [2023-02-15 10:22:28,534 INFO L895 garLoopResultBuilder]: At program point ssl3_connect_switch_1_4513#1(lines 187 556) the Hoare annotation is: (let ((.cse0 (<= 4432 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (.cse1 (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0)) (.cse2 (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4528)) (.cse3 (<= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 4))) (or (and .cse0 .cse1 (= 48 |ULTIMATE.start_ssl3_connect_~ag_Z~0#1|) .cse2 .cse3) (and .cse0 (<= |ULTIMATE.start_ssl3_connect_~ag_Y~0#1| 208) (not .cse1) .cse2 .cse3))) [2023-02-15 10:22:28,535 INFO L899 garLoopResultBuilder]: For program point L412(lines 412 417) no Hoare annotation was computed. [2023-02-15 10:22:28,535 INFO L899 garLoopResultBuilder]: For program point L412-2(lines 412 417) no Hoare annotation was computed. [2023-02-15 10:22:28,535 INFO L899 garLoopResultBuilder]: For program point L313(line 313) no Hoare annotation was computed. [2023-02-15 10:22:28,535 INFO L902 garLoopResultBuilder]: At program point ssl3_connect_switch_1_default#1(lines 211 548) the Hoare annotation is: true [2023-02-15 10:22:28,535 INFO L899 garLoopResultBuilder]: For program point L313-2(line 313) no Hoare annotation was computed. [2023-02-15 10:22:28,535 INFO L899 garLoopResultBuilder]: For program point L181(lines 181 558) no Hoare annotation was computed. [2023-02-15 10:22:28,535 INFO L899 garLoopResultBuilder]: For program point L313-4(line 313) no Hoare annotation was computed. [2023-02-15 10:22:28,535 INFO L899 garLoopResultBuilder]: For program point L148(lines 148 569) no Hoare annotation was computed. [2023-02-15 10:22:28,536 INFO L899 garLoopResultBuilder]: For program point L115(lines 115 580) no Hoare annotation was computed. [2023-02-15 10:22:28,536 INFO L895 garLoopResultBuilder]: At program point ssl3_connect_ERROR#1(lines 76 630) the Hoare annotation is: false [2023-02-15 10:22:28,536 INFO L899 garLoopResultBuilder]: For program point L84(lines 84 92) no Hoare annotation was computed. [2023-02-15 10:22:28,536 INFO L895 garLoopResultBuilder]: At program point ssl3_connect_switch_1_4449#1(lines 157 566) the Hoare annotation is: (let ((.cse0 (<= 4432 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (.cse1 (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0)) (.cse2 (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4464)) (.cse3 (<= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 4))) (or (and .cse0 .cse1 (= 48 |ULTIMATE.start_ssl3_connect_~ag_Z~0#1|) .cse2 .cse3) (and .cse0 (<= |ULTIMATE.start_ssl3_connect_~ag_Y~0#1| 208) (not .cse1) .cse2 .cse3))) [2023-02-15 10:22:28,536 INFO L902 garLoopResultBuilder]: At program point L613(lines 76 630) the Hoare annotation is: true [2023-02-15 10:22:28,536 INFO L899 garLoopResultBuilder]: For program point L184(lines 184 557) no Hoare annotation was computed. [2023-02-15 10:22:28,536 INFO L895 garLoopResultBuilder]: At program point ssl3_connect_switch_1_12292#1(lines 112 581) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0))) (let ((.cse4 (<= |ULTIMATE.start_ssl3_connect_~ag_Y~0#1| 208)) (.cse6 (not .cse0)) (.cse3 (= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 0)) (.cse5 (= 2 |ULTIMATE.start_ssl3_connect_~blastFlag~0#1|)) (.cse1 (= 48 |ULTIMATE.start_ssl3_connect_~ag_Z~0#1|)) (.cse2 (= 12292 |ULTIMATE.start_ssl3_connect_~s__state~0#1|))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6 .cse2) (and .cse4 .cse6 .cse2 .cse3) (and .cse0 .cse5 .cse1 .cse2)))) [2023-02-15 10:22:28,537 INFO L899 garLoopResultBuilder]: For program point L151(lines 151 568) no Hoare annotation was computed. [2023-02-15 10:22:28,537 INFO L899 garLoopResultBuilder]: For program point L118(lines 118 579) no Hoare annotation was computed. [2023-02-15 10:22:28,537 INFO L895 garLoopResultBuilder]: At program point ssl3_connect_switch_1_4497#1(lines 181 558) the Hoare annotation is: (let ((.cse0 (<= 4432 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (.cse1 (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0)) (.cse2 (<= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 4)) (.cse3 (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4512))) (or (and .cse0 (<= |ULTIMATE.start_ssl3_connect_~ag_Y~0#1| 208) (not .cse1) .cse2 .cse3) (and .cse0 .cse1 (= 48 |ULTIMATE.start_ssl3_connect_~ag_Z~0#1|) .cse2 .cse3))) [2023-02-15 10:22:28,537 INFO L899 garLoopResultBuilder]: For program point L383(lines 383 387) no Hoare annotation was computed. [2023-02-15 10:22:28,537 INFO L899 garLoopResultBuilder]: For program point L383-2(lines 383 387) no Hoare annotation was computed. [2023-02-15 10:22:28,537 INFO L895 garLoopResultBuilder]: At program point L218(lines 115 580) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0))) (let ((.cse4 (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4352)) (.cse2 (= 48 |ULTIMATE.start_ssl3_connect_~ag_Z~0#1|)) (.cse6 (= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 0)) (.cse3 (<= |ULTIMATE.start_ssl3_connect_~ag_Y~0#1| 208)) (.cse1 (= 2 |ULTIMATE.start_ssl3_connect_~blastFlag~0#1|)) (.cse5 (not .cse0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse4 .cse2 .cse6) (and .cse3 .cse1 .cse5)))) [2023-02-15 10:22:28,538 INFO L895 garLoopResultBuilder]: At program point ssl3_connect_switch_1_4561#1(lines 199 552) the Hoare annotation is: (let ((.cse0 (<= 4432 |ULTIMATE.start_ssl3_connect_~s__state~0#1|))) (or (and .cse0 (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0)) (and .cse0 (<= |ULTIMATE.start_ssl3_connect_~ag_Y~0#1| 208) (= 2 |ULTIMATE.start_ssl3_connect_~blastFlag~0#1|)))) [2023-02-15 10:22:28,538 INFO L899 garLoopResultBuilder]: For program point L582(lines 582 610) no Hoare annotation was computed. [2023-02-15 10:22:28,538 INFO L899 garLoopResultBuilder]: For program point L87(lines 87 91) no Hoare annotation was computed. [2023-02-15 10:22:28,538 INFO L899 garLoopResultBuilder]: For program point L87-2(lines 84 92) no Hoare annotation was computed. [2023-02-15 10:22:28,538 INFO L899 garLoopResultBuilder]: For program point L583(lines 583 607) no Hoare annotation was computed. [2023-02-15 10:22:28,538 INFO L899 garLoopResultBuilder]: For program point L517-1(lines 213 545) no Hoare annotation was computed. [2023-02-15 10:22:28,538 INFO L899 garLoopResultBuilder]: For program point L352(lines 352 357) no Hoare annotation was computed. [2023-02-15 10:22:28,538 INFO L899 garLoopResultBuilder]: For program point L286(lines 286 290) no Hoare annotation was computed. [2023-02-15 10:22:28,539 INFO L899 garLoopResultBuilder]: For program point L319-1(lines 319 333) no Hoare annotation was computed. [2023-02-15 10:22:28,539 INFO L899 garLoopResultBuilder]: For program point L187(lines 187 556) no Hoare annotation was computed. [2023-02-15 10:22:28,539 INFO L899 garLoopResultBuilder]: For program point L154(lines 154 567) no Hoare annotation was computed. [2023-02-15 10:22:28,539 INFO L899 garLoopResultBuilder]: For program point L121(lines 121 578) no Hoare annotation was computed. [2023-02-15 10:22:28,539 INFO L899 garLoopResultBuilder]: For program point L617(lines 617 621) no Hoare annotation was computed. [2023-02-15 10:22:28,539 INFO L899 garLoopResultBuilder]: For program point L584(lines 584 593) no Hoare annotation was computed. [2023-02-15 10:22:28,539 INFO L899 garLoopResultBuilder]: For program point L617-2(lines 617 621) no Hoare annotation was computed. [2023-02-15 10:22:28,539 INFO L899 garLoopResultBuilder]: For program point L584-2(lines 583 605) no Hoare annotation was computed. [2023-02-15 10:22:28,540 INFO L895 garLoopResultBuilder]: At program point ssl3_connect_switch_1_4529#1(lines 193 554) the Hoare annotation is: (let ((.cse0 (<= 4432 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (.cse1 (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0)) (.cse2 (<= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 4))) (or (and .cse0 .cse1 (= 48 |ULTIMATE.start_ssl3_connect_~ag_Z~0#1|) (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4560) .cse2) (and .cse0 (<= |ULTIMATE.start_ssl3_connect_~ag_Y~0#1| 208) (not .cse1) .cse2))) [2023-02-15 10:22:28,540 INFO L899 garLoopResultBuilder]: For program point L586(lines 586 590) no Hoare annotation was computed. [2023-02-15 10:22:28,540 INFO L899 garLoopResultBuilder]: For program point L454(lines 454 459) no Hoare annotation was computed. [2023-02-15 10:22:28,540 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-02-15 10:22:28,540 INFO L899 garLoopResultBuilder]: For program point L223(lines 223 227) no Hoare annotation was computed. [2023-02-15 10:22:28,540 INFO L899 garLoopResultBuilder]: For program point L190(lines 190 555) no Hoare annotation was computed. [2023-02-15 10:22:28,540 INFO L899 garLoopResultBuilder]: For program point L157(lines 157 566) no Hoare annotation was computed. [2023-02-15 10:22:28,541 INFO L899 garLoopResultBuilder]: For program point L223-2(lines 213 545) no Hoare annotation was computed. [2023-02-15 10:22:28,541 INFO L899 garLoopResultBuilder]: For program point L124(lines 124 577) no Hoare annotation was computed. [2023-02-15 10:22:28,541 INFO L895 garLoopResultBuilder]: At program point ssl3_connect_switch_1_4385#1(lines 133 574) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0))) (let ((.cse3 (= 48 |ULTIMATE.start_ssl3_connect_~ag_Z~0#1|)) (.cse5 (= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 1)) (.cse6 (<= |ULTIMATE.start_ssl3_connect_~ag_Y~0#1| 208)) (.cse1 (= 2 |ULTIMATE.start_ssl3_connect_~blastFlag~0#1|)) (.cse2 (not (<= 4400 |ULTIMATE.start_ssl3_connect_~s__state~0#1|))) (.cse7 (not .cse0)) (.cse4 (<= 4352 |ULTIMATE.start_ssl3_connect_~s__state~0#1|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse2 .cse5 .cse3 .cse4) (and .cse6 .cse2 .cse5 .cse7 .cse4) (and .cse6 .cse1 .cse2 .cse7 .cse4)))) [2023-02-15 10:22:28,541 INFO L895 garLoopResultBuilder]: At program point $Ultimate##192(lines 501 513) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0))) (let ((.cse4 (<= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 4)) (.cse2 (= 48 |ULTIMATE.start_ssl3_connect_~ag_Z~0#1|)) (.cse5 (<= |ULTIMATE.start_ssl3_connect_~ag_Y~0#1| 208)) (.cse7 (= 2 |ULTIMATE.start_ssl3_connect_~blastFlag~0#1|)) (.cse1 (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4352)) (.cse6 (not .cse0)) (.cse3 (<= 4352 |ULTIMATE.start_ssl3_connect_~s__state~0#1|))) (or (and .cse0 (<= |ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1| 4560) .cse1 .cse2 .cse3 .cse4 (<= 4560 |ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1|)) (and (= 3 |ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1|) .cse5 .cse1 .cse6 .cse3 .cse4) (and .cse0 .cse7 .cse1 .cse2 .cse3) (and .cse5 .cse7 .cse1 .cse6 .cse3)))) [2023-02-15 10:22:28,541 INFO L899 garLoopResultBuilder]: For program point L488(lines 488 492) no Hoare annotation was computed. [2023-02-15 10:22:28,541 INFO L902 garLoopResultBuilder]: At program point $Ultimate##197(lines 517 521) the Hoare annotation is: true [2023-02-15 10:22:28,542 INFO L899 garLoopResultBuilder]: For program point L323(lines 323 327) no Hoare annotation was computed. [2023-02-15 10:22:28,542 INFO L899 garLoopResultBuilder]: For program point L323-2(lines 321 333) no Hoare annotation was computed. [2023-02-15 10:22:28,542 INFO L899 garLoopResultBuilder]: For program point L522-1(lines 522 526) no Hoare annotation was computed. [2023-02-15 10:22:28,542 INFO L899 garLoopResultBuilder]: For program point L423(lines 423 427) no Hoare annotation was computed. [2023-02-15 10:22:28,542 INFO L895 garLoopResultBuilder]: At program point ssl3_connect_switch_1_4369#1(lines 127 576) the Hoare annotation is: (let ((.cse5 (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0))) (let ((.cse7 (= 48 |ULTIMATE.start_ssl3_connect_~ag_Z~0#1|)) (.cse4 (= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 0)) (.cse0 (<= |ULTIMATE.start_ssl3_connect_~ag_Y~0#1| 208)) (.cse6 (= 2 |ULTIMATE.start_ssl3_connect_~blastFlag~0#1|)) (.cse1 (not (<= 4400 |ULTIMATE.start_ssl3_connect_~s__state~0#1|))) (.cse2 (not .cse5)) (.cse3 (<= 4352 |ULTIMATE.start_ssl3_connect_~s__state~0#1|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse6 .cse1 .cse7 .cse3) (and .cse5 .cse1 .cse7 .cse3 .cse4) (and .cse0 .cse6 .cse1 .cse2 .cse3)))) [2023-02-15 10:22:28,542 INFO L895 garLoopResultBuilder]: At program point $Ultimate##137(lines 319 333) the Hoare annotation is: (let ((.cse1 (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4432)) (.cse2 (= 2 |ULTIMATE.start_ssl3_connect_~blastFlag~0#1|)) (.cse0 (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0))) (or (and .cse0 .cse1 .cse2 (not (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4384)) (= 48 |ULTIMATE.start_ssl3_connect_~ag_Z~0#1|)) (and .cse1 (<= |ULTIMATE.start_ssl3_connect_~ag_Y~0#1| 208) .cse2 (not .cse0) (<= 4352 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)))) [2023-02-15 10:22:28,542 INFO L899 garLoopResultBuilder]: For program point L259(lines 259 264) no Hoare annotation was computed. [2023-02-15 10:22:28,543 INFO L899 garLoopResultBuilder]: For program point L193(lines 193 554) no Hoare annotation was computed. [2023-02-15 10:22:28,543 INFO L899 garLoopResultBuilder]: For program point L160(lines 160 565) no Hoare annotation was computed. [2023-02-15 10:22:28,543 INFO L899 garLoopResultBuilder]: For program point L127(lines 127 576) no Hoare annotation was computed. [2023-02-15 10:22:28,543 INFO L899 garLoopResultBuilder]: For program point L94(lines 94 102) no Hoare annotation was computed. [2023-02-15 10:22:28,543 INFO L899 garLoopResultBuilder]: For program point L94-1(lines 76 630) no Hoare annotation was computed. [2023-02-15 10:22:28,543 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-02-15 10:22:28,543 INFO L895 garLoopResultBuilder]: At program point ssl3_connect_switch_1_4467#1(lines 163 564) the Hoare annotation is: (let ((.cse0 (<= 4432 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (.cse2 (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0)) (.cse1 (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4480)) (.cse3 (<= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 4))) (or (and .cse0 (<= |ULTIMATE.start_ssl3_connect_~ag_Y~0#1| 208) .cse1 (not .cse2) .cse3) (and .cse0 .cse2 .cse1 (= 48 |ULTIMATE.start_ssl3_connect_~ag_Z~0#1|) .cse3))) [2023-02-15 10:22:28,543 INFO L899 garLoopResultBuilder]: For program point L95(lines 95 99) no Hoare annotation was computed. [2023-02-15 10:22:28,544 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-02-15 10:22:28,544 INFO L899 garLoopResultBuilder]: For program point L493(lines 493 497) no Hoare annotation was computed. [2023-02-15 10:22:28,544 INFO L899 garLoopResultBuilder]: For program point L493-2(lines 493 497) no Hoare annotation was computed. [2023-02-15 10:22:28,544 INFO L899 garLoopResultBuilder]: For program point L295(lines 295 303) no Hoare annotation was computed. [2023-02-15 10:22:28,544 INFO L899 garLoopResultBuilder]: For program point L196(lines 196 553) no Hoare annotation was computed. [2023-02-15 10:22:28,544 INFO L899 garLoopResultBuilder]: For program point L163(lines 163 564) no Hoare annotation was computed. [2023-02-15 10:22:28,544 INFO L899 garLoopResultBuilder]: For program point L130(lines 130 575) no Hoare annotation was computed. [2023-02-15 10:22:28,545 INFO L895 garLoopResultBuilder]: At program point $Ultimate##209(lines 582 610) the Hoare annotation is: (let ((.cse4 (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0))) (let ((.cse2 (= 4416 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (.cse10 (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4352)) (.cse11 (<= 4352 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (.cse13 (= 4384 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (.cse14 (= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 1)) (.cse5 (= 2 |ULTIMATE.start_ssl3_connect_~blastFlag~0#1|)) (.cse7 (= 4368 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (.cse8 (= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 0)) (.cse15 (<= 4432 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (.cse0 (<= |ULTIMATE.start_ssl3_connect_~ag_Y~0#1| 208)) (.cse1 (not .cse4)) (.cse16 (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4528)) (.cse9 (<= |ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1| 4560)) (.cse6 (= 48 |ULTIMATE.start_ssl3_connect_~ag_Z~0#1|)) (.cse3 (<= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 4)) (.cse12 (<= 4560 |ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1|))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6) (and .cse4 .cse6 .cse2 .cse3) (and .cse7 .cse0 .cse1 .cse8) (and .cse4 .cse9 .cse10 .cse6 .cse11 .cse3 .cse12) (and .cse0 .cse13 .cse14 .cse1) (and (= 3 |ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1|) .cse0 .cse10 .cse1 .cse11 .cse3) (and .cse4 .cse13 .cse14 .cse6) (and .cse0 .cse5 .cse1) (and .cse4 .cse7 .cse6 .cse8) (and .cse15 .cse4 .cse6 .cse16 .cse3) (= 3 |ULTIMATE.start_ssl3_connect_~s__state~0#1|) (and .cse15 .cse0 .cse1 .cse16 .cse3) (and .cse4 .cse6 (= 48 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (and .cse4 .cse9 .cse6 (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4560) (<= 4560 |ULTIMATE.start_ssl3_connect_~s__state~0#1|) .cse3 .cse12)))) [2023-02-15 10:22:28,545 INFO L899 garLoopResultBuilder]: For program point L395(lines 395 399) no Hoare annotation was computed. [2023-02-15 10:22:28,545 INFO L899 garLoopResultBuilder]: For program point L362(lines 362 366) no Hoare annotation was computed. [2023-02-15 10:22:28,545 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-02-15 10:22:28,545 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 624) no Hoare annotation was computed. [2023-02-15 10:22:28,545 INFO L902 garLoopResultBuilder]: At program point L628(lines 76 630) the Hoare annotation is: true [2023-02-15 10:22:28,546 INFO L899 garLoopResultBuilder]: For program point L595(lines 595 601) no Hoare annotation was computed. [2023-02-15 10:22:28,546 INFO L899 garLoopResultBuilder]: For program point L529(lines 529 533) no Hoare annotation was computed. [2023-02-15 10:22:28,546 INFO L899 garLoopResultBuilder]: For program point L529-2(lines 529 533) no Hoare annotation was computed. [2023-02-15 10:22:28,546 INFO L899 garLoopResultBuilder]: For program point L298(lines 298 302) no Hoare annotation was computed. [2023-02-15 10:22:28,546 INFO L899 garLoopResultBuilder]: For program point L298-2(lines 213 545) no Hoare annotation was computed. [2023-02-15 10:22:28,546 INFO L899 garLoopResultBuilder]: For program point L199(lines 199 552) no Hoare annotation was computed. [2023-02-15 10:22:28,546 INFO L899 garLoopResultBuilder]: For program point L166(lines 166 563) no Hoare annotation was computed. [2023-02-15 10:22:28,546 INFO L899 garLoopResultBuilder]: For program point L133(lines 133 574) no Hoare annotation was computed. [2023-02-15 10:22:28,547 INFO L899 garLoopResultBuilder]: For program point L464(lines 464 468) no Hoare annotation was computed. [2023-02-15 10:22:28,549 INFO L445 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] [2023-02-15 10:22:28,551 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-15 10:22:28,577 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.02 10:22:28 BoogieIcfgContainer [2023-02-15 10:22:28,581 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-15 10:22:28,583 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-15 10:22:28,583 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-15 10:22:28,584 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-15 10:22:28,584 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:22:13" (3/4) ... [2023-02-15 10:22:28,587 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-02-15 10:22:28,607 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2023-02-15 10:22:28,608 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2023-02-15 10:22:28,608 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2023-02-15 10:22:28,609 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-02-15 10:22:28,700 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-15 10:22:28,700 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-15 10:22:28,701 INFO L158 Benchmark]: Toolchain (without parser) took 16542.29ms. Allocated memory was 136.3MB in the beginning and 474.0MB in the end (delta: 337.6MB). Free memory was 91.4MB in the beginning and 171.5MB in the end (delta: -80.1MB). Peak memory consumption was 260.7MB. Max. memory is 16.1GB. [2023-02-15 10:22:28,701 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 136.3MB. Free memory is still 110.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 10:22:28,701 INFO L158 Benchmark]: CACSL2BoogieTranslator took 280.04ms. Allocated memory is still 136.3MB. Free memory was 91.4MB in the beginning and 76.3MB in the end (delta: 15.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-02-15 10:22:28,701 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.96ms. Allocated memory is still 136.3MB. Free memory was 76.3MB in the beginning and 73.3MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-15 10:22:28,701 INFO L158 Benchmark]: Boogie Preprocessor took 32.83ms. Allocated memory is still 136.3MB. Free memory was 73.3MB in the beginning and 71.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-15 10:22:28,702 INFO L158 Benchmark]: RCFGBuilder took 675.77ms. Allocated memory was 136.3MB in the beginning and 172.0MB in the end (delta: 35.7MB). Free memory was 71.2MB in the beginning and 123.7MB in the end (delta: -52.5MB). Peak memory consumption was 26.6MB. Max. memory is 16.1GB. [2023-02-15 10:22:28,704 INFO L158 Benchmark]: TraceAbstraction took 15385.47ms. Allocated memory was 172.0MB in the beginning and 474.0MB in the end (delta: 302.0MB). Free memory was 122.6MB in the beginning and 178.9MB in the end (delta: -56.2MB). Peak memory consumption was 271.8MB. Max. memory is 16.1GB. [2023-02-15 10:22:28,704 INFO L158 Benchmark]: Witness Printer took 116.87ms. Allocated memory is still 474.0MB. Free memory was 178.9MB in the beginning and 171.5MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-02-15 10:22:28,712 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 136.3MB. Free memory is still 110.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 280.04ms. Allocated memory is still 136.3MB. Free memory was 91.4MB in the beginning and 76.3MB in the end (delta: 15.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.96ms. Allocated memory is still 136.3MB. Free memory was 76.3MB in the beginning and 73.3MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.83ms. Allocated memory is still 136.3MB. Free memory was 73.3MB in the beginning and 71.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 675.77ms. Allocated memory was 136.3MB in the beginning and 172.0MB in the end (delta: 35.7MB). Free memory was 71.2MB in the beginning and 123.7MB in the end (delta: -52.5MB). Peak memory consumption was 26.6MB. Max. memory is 16.1GB. * TraceAbstraction took 15385.47ms. Allocated memory was 172.0MB in the beginning and 474.0MB in the end (delta: 302.0MB). Free memory was 122.6MB in the beginning and 178.9MB in the end (delta: -56.2MB). Peak memory consumption was 271.8MB. Max. memory is 16.1GB. * Witness Printer took 116.87ms. Allocated memory is still 474.0MB. Free memory was 178.9MB in the beginning and 171.5MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 624]: 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, 132 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 15.3s, OverallIterations: 25, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 4.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2709 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2709 mSDsluCounter, 9568 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4499 mSDsCounter, 639 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3694 IncrementalHoareTripleChecker+Invalid, 4333 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 639 mSolverCounterUnsat, 5069 mSDtfsCounter, 3694 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3538 GetRequests, 3472 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4810occurred in iteration=19, InterpolantAutomatonStates: 90, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.4s AutomataMinimizationTime, 25 MinimizatonAttempts, 1963 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 24 LocationsWithAnnotation, 24 PreInvPairs, 315 NumberOfFragments, 1105 HoareAnnotationTreeSize, 24 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 24 FomulaSimplificationsInter, 124963 FormulaSimplificationTreeSizeReductionInter, 2.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 6986 NumberOfCodeBlocks, 6986 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 8229 ConstructedInterpolants, 0 QuantifiedInterpolants, 11596 SizeOfPredicates, 10 NumberOfNonLiveVariables, 4011 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 36 InterpolantComputations, 21 PerfectInterpolantSequences, 25321/25584 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: 127]: Loop Invariant Derived loop invariant: ((((((ag_Y <= 208 && !(4400 <= s__state)) && !(s__hit == 0)) && 4352 <= s__state) && blastFlag == 0) || ((((s__hit == 0 && 2 == blastFlag) && !(4400 <= s__state)) && 48 == ag_Z) && 4352 <= s__state)) || ((((s__hit == 0 && !(4400 <= s__state)) && 48 == ag_Z) && 4352 <= s__state) && blastFlag == 0)) || ((((ag_Y <= 208 && 2 == blastFlag) && !(4400 <= s__state)) && !(s__hit == 0)) && 4352 <= s__state) - InvariantResult [Line: 151]: Loop Invariant Derived loop invariant: ((((4432 <= s__state && s__hit == 0) && 48 == ag_Z) && s__state <= 4448) && blastFlag <= 4) || ((((4432 <= s__state && ag_Y <= 208) && s__state <= 4448) && !(s__hit == 0)) && blastFlag <= 4) - InvariantResult [Line: 133]: Loop Invariant Derived loop invariant: ((((((s__hit == 0 && 2 == blastFlag) && !(4400 <= s__state)) && 48 == ag_Z) && 4352 <= s__state) || ((((s__hit == 0 && !(4400 <= s__state)) && blastFlag == 1) && 48 == ag_Z) && 4352 <= s__state)) || ((((ag_Y <= 208 && !(4400 <= s__state)) && blastFlag == 1) && !(s__hit == 0)) && 4352 <= s__state)) || ((((ag_Y <= 208 && 2 == blastFlag) && !(4400 <= s__state)) && !(s__hit == 0)) && 4352 <= s__state) - InvariantResult [Line: 112]: Loop Invariant Derived loop invariant: (((((s__hit == 0 && 48 == ag_Z) && 12292 == s__state) && blastFlag == 0) || (((ag_Y <= 208 && 2 == blastFlag) && !(s__hit == 0)) && 12292 == s__state)) || (((ag_Y <= 208 && !(s__hit == 0)) && 12292 == s__state) && blastFlag == 0)) || (((s__hit == 0 && 2 == blastFlag) && 48 == ag_Z) && 12292 == s__state) - InvariantResult [Line: 501]: Loop Invariant Derived loop invariant: ((((((((s__hit == 0 && s__s3__tmp__next_state___0 <= 4560) && s__state <= 4352) && 48 == ag_Z) && 4352 <= s__state) && blastFlag <= 4) && 4560 <= s__s3__tmp__next_state___0) || (((((3 == s__s3__tmp__next_state___0 && ag_Y <= 208) && s__state <= 4352) && !(s__hit == 0)) && 4352 <= s__state) && blastFlag <= 4)) || ((((s__hit == 0 && 2 == blastFlag) && s__state <= 4352) && 48 == ag_Z) && 4352 <= s__state)) || ((((ag_Y <= 208 && 2 == blastFlag) && s__state <= 4352) && !(s__hit == 0)) && 4352 <= s__state) - InvariantResult [Line: 109]: Loop Invariant Derived loop invariant: ((((((((((((((((((ag_Y <= 208 && !(s__hit == 0)) && 4416 == s__state) && blastFlag <= 4) || ((s__hit == 0 && 2 == blastFlag) && 48 == ag_Z)) || (((s__hit == 0 && 48 == ag_Z) && 4416 == s__state) && blastFlag <= 4)) || (((4368 == s__state && ag_Y <= 208) && !(s__hit == 0)) && blastFlag == 0)) || (((s__hit == 0 && 48 == ag_Z) && 12292 == s__state) && blastFlag == 0)) || ((((((s__hit == 0 && s__s3__tmp__next_state___0 <= 4560) && s__state <= 4352) && 48 == ag_Z) && 4352 <= s__state) && blastFlag <= 4) && 4560 <= s__s3__tmp__next_state___0)) || (((ag_Y <= 208 && 4384 == s__state) && blastFlag == 1) && !(s__hit == 0))) || (((((3 == s__s3__tmp__next_state___0 && ag_Y <= 208) && s__state <= 4352) && !(s__hit == 0)) && 4352 <= s__state) && blastFlag <= 4)) || (((s__hit == 0 && 4384 == s__state) && blastFlag == 1) && 48 == ag_Z)) || (((ag_Y <= 208 && !(s__hit == 0)) && 12292 == s__state) && blastFlag == 0)) || ((ag_Y <= 208 && 2 == blastFlag) && !(s__hit == 0))) || (((s__hit == 0 && 4368 == s__state) && 48 == ag_Z) && blastFlag == 0)) || ((((4432 <= s__state && s__hit == 0) && 48 == ag_Z) && s__state <= 4528) && blastFlag <= 4)) || 3 == s__state) || ((((4432 <= s__state && ag_Y <= 208) && !(s__hit == 0)) && s__state <= 4528) && blastFlag <= 4)) || ((s__hit == 0 && 48 == ag_Z) && 48 == s__state)) || ((((((s__hit == 0 && s__s3__tmp__next_state___0 <= 4560) && 48 == ag_Z) && s__state <= 4560) && 4560 <= s__state) && blastFlag <= 4) && 4560 <= s__s3__tmp__next_state___0) - InvariantResult [Line: 76]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 157]: Loop Invariant Derived loop invariant: ((((4432 <= s__state && s__hit == 0) && 48 == ag_Z) && s__state <= 4464) && blastFlag <= 4) || ((((4432 <= s__state && ag_Y <= 208) && !(s__hit == 0)) && s__state <= 4464) && blastFlag <= 4) - InvariantResult [Line: 18]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 163]: Loop Invariant Derived loop invariant: ((((4432 <= s__state && ag_Y <= 208) && s__state <= 4480) && !(s__hit == 0)) && blastFlag <= 4) || ((((4432 <= s__state && s__hit == 0) && s__state <= 4480) && 48 == ag_Z) && blastFlag <= 4) - InvariantResult [Line: 115]: Loop Invariant Derived loop invariant: ((((s__hit == 0 && 2 == blastFlag) && 48 == ag_Z) || (((ag_Y <= 208 && s__state <= 4352) && !(s__hit == 0)) && blastFlag == 0)) || (((s__hit == 0 && s__state <= 4352) && 48 == ag_Z) && blastFlag == 0)) || ((ag_Y <= 208 && 2 == blastFlag) && !(s__hit == 0)) - InvariantResult [Line: 193]: Loop Invariant Derived loop invariant: ((((4432 <= s__state && s__hit == 0) && 48 == ag_Z) && s__state <= 4560) && blastFlag <= 4) || (((4432 <= s__state && ag_Y <= 208) && !(s__hit == 0)) && blastFlag <= 4) - InvariantResult [Line: 145]: Loop Invariant Derived loop invariant: ((((s__state <= 4432 && ag_Y <= 208) && !(s__hit == 0)) && 4352 <= s__state) && blastFlag <= 4) || ((((s__hit == 0 && s__state <= 4432) && !(s__state <= 4384)) && 48 == ag_Z) && blastFlag <= 4) - InvariantResult [Line: 76]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 187]: Loop Invariant Derived loop invariant: ((((4432 <= s__state && s__hit == 0) && 48 == ag_Z) && s__state <= 4528) && blastFlag <= 4) || ((((4432 <= s__state && ag_Y <= 208) && !(s__hit == 0)) && s__state <= 4528) && blastFlag <= 4) - InvariantResult [Line: 582]: Loop Invariant Derived loop invariant: ((((((((((((((((ag_Y <= 208 && !(s__hit == 0)) && 4416 == s__state) && blastFlag <= 4) || ((s__hit == 0 && 2 == blastFlag) && 48 == ag_Z)) || (((s__hit == 0 && 48 == ag_Z) && 4416 == s__state) && blastFlag <= 4)) || (((4368 == s__state && ag_Y <= 208) && !(s__hit == 0)) && blastFlag == 0)) || ((((((s__hit == 0 && s__s3__tmp__next_state___0 <= 4560) && s__state <= 4352) && 48 == ag_Z) && 4352 <= s__state) && blastFlag <= 4) && 4560 <= s__s3__tmp__next_state___0)) || (((ag_Y <= 208 && 4384 == s__state) && blastFlag == 1) && !(s__hit == 0))) || (((((3 == s__s3__tmp__next_state___0 && ag_Y <= 208) && s__state <= 4352) && !(s__hit == 0)) && 4352 <= s__state) && blastFlag <= 4)) || (((s__hit == 0 && 4384 == s__state) && blastFlag == 1) && 48 == ag_Z)) || ((ag_Y <= 208 && 2 == blastFlag) && !(s__hit == 0))) || (((s__hit == 0 && 4368 == s__state) && 48 == ag_Z) && blastFlag == 0)) || ((((4432 <= s__state && s__hit == 0) && 48 == ag_Z) && s__state <= 4528) && blastFlag <= 4)) || 3 == s__state) || ((((4432 <= s__state && ag_Y <= 208) && !(s__hit == 0)) && s__state <= 4528) && blastFlag <= 4)) || ((s__hit == 0 && 48 == ag_Z) && 48 == s__state)) || ((((((s__hit == 0 && s__s3__tmp__next_state___0 <= 4560) && 48 == ag_Z) && s__state <= 4560) && 4560 <= s__state) && blastFlag <= 4) && 4560 <= s__s3__tmp__next_state___0) - InvariantResult [Line: 632]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 181]: Loop Invariant Derived loop invariant: ((((4432 <= s__state && ag_Y <= 208) && !(s__hit == 0)) && blastFlag <= 4) && s__state <= 4512) || ((((4432 <= s__state && s__hit == 0) && 48 == ag_Z) && blastFlag <= 4) && s__state <= 4512) - InvariantResult [Line: 517]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 319]: Loop Invariant Derived loop invariant: ((((s__hit == 0 && s__state <= 4432) && 2 == blastFlag) && !(s__state <= 4384)) && 48 == ag_Z) || ((((s__state <= 4432 && ag_Y <= 208) && 2 == blastFlag) && !(s__hit == 0)) && 4352 <= s__state) - InvariantResult [Line: 199]: Loop Invariant Derived loop invariant: (4432 <= s__state && s__hit == 0) || ((4432 <= s__state && ag_Y <= 208) && 2 == blastFlag) - InvariantResult [Line: 175]: Loop Invariant Derived loop invariant: ((((4432 <= s__state && ag_Y <= 208) && !(s__hit == 0)) && blastFlag <= 4) && s__state <= 4512) || ((((4432 <= s__state && s__hit == 0) && 48 == ag_Z) && blastFlag <= 4) && s__state <= 4512) - InvariantResult [Line: 76]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 211]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2023-02-15 10:22:28,745 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