./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 b5317dae 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-?-b5317da-m [2023-02-16 00:42:27,237 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-16 00:42:27,239 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-16 00:42:27,271 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-16 00:42:27,271 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-16 00:42:27,274 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-16 00:42:27,275 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-16 00:42:27,277 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-16 00:42:27,280 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-16 00:42:27,282 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-16 00:42:27,282 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-16 00:42:27,283 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-16 00:42:27,283 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-16 00:42:27,284 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-16 00:42:27,285 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-16 00:42:27,285 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-16 00:42:27,286 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-16 00:42:27,286 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-16 00:42:27,287 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-16 00:42:27,288 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-16 00:42:27,289 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-16 00:42:27,290 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-16 00:42:27,290 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-16 00:42:27,291 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-16 00:42:27,299 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-16 00:42:27,302 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-16 00:42:27,303 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-16 00:42:27,303 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-16 00:42:27,304 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-16 00:42:27,305 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-16 00:42:27,306 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-16 00:42:27,306 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-16 00:42:27,307 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-16 00:42:27,308 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-16 00:42:27,308 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-16 00:42:27,309 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-16 00:42:27,309 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-16 00:42:27,310 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-16 00:42:27,310 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-16 00:42:27,311 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-16 00:42:27,312 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-16 00:42:27,313 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-16 00:42:27,333 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-16 00:42:27,337 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-16 00:42:27,338 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-16 00:42:27,338 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-16 00:42:27,339 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-16 00:42:27,339 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-16 00:42:27,340 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-16 00:42:27,340 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-16 00:42:27,340 INFO L138 SettingsManager]: * Use SBE=true [2023-02-16 00:42:27,340 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-16 00:42:27,340 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-16 00:42:27,341 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-16 00:42:27,341 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-16 00:42:27,341 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-16 00:42:27,341 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-16 00:42:27,341 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-16 00:42:27,341 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-16 00:42:27,341 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-16 00:42:27,342 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-16 00:42:27,342 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-16 00:42:27,343 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-16 00:42:27,346 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-16 00:42:27,346 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-16 00:42:27,347 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-16 00:42:27,347 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 00:42:27,347 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-16 00:42:27,347 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-16 00:42:27,347 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-16 00:42:27,348 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-16 00:42:27,348 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-16 00:42:27,348 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-16 00:42:27,348 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-16 00:42:27,348 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-16 00:42:27,349 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-16 00:42:27,349 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-16 00:42:27,349 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-16 00:42:27,574 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-16 00:42:27,594 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-16 00:42:27,596 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-16 00:42:27,597 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-16 00:42:27,598 INFO L275 PluginConnector]: CDTParser initialized [2023-02-16 00:42:27,598 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-16 00:42:28,599 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-16 00:42:28,784 INFO L351 CDTParser]: Found 1 translation units. [2023-02-16 00:42:28,786 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/s3_clnt_3.BV.c.cil-1a.c [2023-02-16 00:42:28,799 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76620e744/6edf2010df1b4f3f9a6b5609abfbeb07/FLAG63b142bc0 [2023-02-16 00:42:28,809 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76620e744/6edf2010df1b4f3f9a6b5609abfbeb07 [2023-02-16 00:42:28,811 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-16 00:42:28,812 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-16 00:42:28,813 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-16 00:42:28,813 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-16 00:42:28,815 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-16 00:42:28,815 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 12:42:28" (1/1) ... [2023-02-16 00:42:28,816 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b6bb82c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:42:28, skipping insertion in model container [2023-02-16 00:42:28,816 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 12:42:28" (1/1) ... [2023-02-16 00:42:28,821 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-16 00:42:28,843 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-16 00:42:28,958 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-16 00:42:28,963 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 00:42:28,975 INFO L203 MainTranslator]: Completed pre-run [2023-02-16 00:42:29,011 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-16 00:42:29,012 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 00:42:29,021 INFO L208 MainTranslator]: Completed translation [2023-02-16 00:42:29,021 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:42:29 WrapperNode [2023-02-16 00:42:29,021 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-16 00:42:29,022 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-16 00:42:29,022 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-16 00:42:29,022 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-16 00:42:29,026 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:42:29" (1/1) ... [2023-02-16 00:42:29,034 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:42:29" (1/1) ... [2023-02-16 00:42:29,056 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 497 [2023-02-16 00:42:29,057 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-16 00:42:29,057 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-16 00:42:29,057 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-16 00:42:29,057 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-16 00:42:29,063 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:42:29" (1/1) ... [2023-02-16 00:42:29,063 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:42:29" (1/1) ... [2023-02-16 00:42:29,078 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:42:29" (1/1) ... [2023-02-16 00:42:29,078 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:42:29" (1/1) ... [2023-02-16 00:42:29,083 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:42:29" (1/1) ... [2023-02-16 00:42:29,093 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:42:29" (1/1) ... [2023-02-16 00:42:29,094 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:42:29" (1/1) ... [2023-02-16 00:42:29,095 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:42:29" (1/1) ... [2023-02-16 00:42:29,097 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-16 00:42:29,102 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-16 00:42:29,102 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-16 00:42:29,103 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-16 00:42:29,103 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:42:29" (1/1) ... [2023-02-16 00:42:29,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 00:42:29,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:42:29,130 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-16 00:42:29,132 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-16 00:42:29,175 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-16 00:42:29,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-16 00:42:29,175 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-16 00:42:29,175 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-16 00:42:29,246 INFO L235 CfgBuilder]: Building ICFG [2023-02-16 00:42:29,248 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-16 00:42:29,271 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-02-16 00:42:29,614 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2023-02-16 00:42:29,615 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2023-02-16 00:42:29,615 INFO L276 CfgBuilder]: Performing block encoding [2023-02-16 00:42:29,620 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-16 00:42:29,620 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2023-02-16 00:42:29,621 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 12:42:29 BoogieIcfgContainer [2023-02-16 00:42:29,621 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-16 00:42:29,623 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-16 00:42:29,623 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-16 00:42:29,625 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-16 00:42:29,625 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.02 12:42:28" (1/3) ... [2023-02-16 00:42:29,625 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33526bb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 12:42:29, skipping insertion in model container [2023-02-16 00:42:29,625 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:42:29" (2/3) ... [2023-02-16 00:42:29,626 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33526bb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 12:42:29, skipping insertion in model container [2023-02-16 00:42:29,626 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 12:42:29" (3/3) ... [2023-02-16 00:42:29,626 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_clnt_3.BV.c.cil-1a.c [2023-02-16 00:42:29,637 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-16 00:42:29,637 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-16 00:42:29,669 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-16 00:42:29,674 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;@27d7d29d, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-16 00:42:29,674 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-16 00:42:29,677 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-16 00:42:29,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-16 00:42:29,682 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:42:29,682 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-16 00:42:29,682 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:42:29,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:42:29,686 INFO L85 PathProgramCache]: Analyzing trace with hash 260022937, now seen corresponding path program 1 times [2023-02-16 00:42:29,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:42:29,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771851483] [2023-02-16 00:42:29,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:42:29,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:42:29,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:42:29,826 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-16 00:42:29,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:42:29,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771851483] [2023-02-16 00:42:29,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771851483] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 00:42:29,827 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 00:42:29,827 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 00:42:29,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765749118] [2023-02-16 00:42:29,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 00:42:29,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 00:42:29,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:42:29,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 00:42:29,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 00:42:29,850 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-16 00:42:29,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:42:29,981 INFO L93 Difference]: Finished difference Result 259 states and 443 transitions. [2023-02-16 00:42:29,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 00:42:29,983 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-16 00:42:29,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:42:29,989 INFO L225 Difference]: With dead ends: 259 [2023-02-16 00:42:29,990 INFO L226 Difference]: Without dead ends: 119 [2023-02-16 00:42:29,992 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-16 00:42:29,995 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-16 00:42:29,996 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-16 00:42:30,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2023-02-16 00:42:30,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2023-02-16 00:42:30,020 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-16 00:42:30,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 181 transitions. [2023-02-16 00:42:30,022 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 181 transitions. Word has length 25 [2023-02-16 00:42:30,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:42:30,022 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 181 transitions. [2023-02-16 00:42:30,022 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-16 00:42:30,022 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 181 transitions. [2023-02-16 00:42:30,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-02-16 00:42:30,023 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:42:30,023 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-16 00:42:30,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-16 00:42:30,024 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:42:30,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:42:30,024 INFO L85 PathProgramCache]: Analyzing trace with hash 693672153, now seen corresponding path program 1 times [2023-02-16 00:42:30,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:42:30,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527800000] [2023-02-16 00:42:30,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:42:30,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:42:30,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:42:30,086 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-16 00:42:30,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:42:30,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527800000] [2023-02-16 00:42:30,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527800000] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 00:42:30,087 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 00:42:30,087 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 00:42:30,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672061647] [2023-02-16 00:42:30,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 00:42:30,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 00:42:30,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:42:30,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 00:42:30,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 00:42:30,089 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-16 00:42:30,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:42:30,174 INFO L93 Difference]: Finished difference Result 245 states and 376 transitions. [2023-02-16 00:42:30,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 00:42:30,174 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-16 00:42:30,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:42:30,175 INFO L225 Difference]: With dead ends: 245 [2023-02-16 00:42:30,175 INFO L226 Difference]: Without dead ends: 137 [2023-02-16 00:42:30,176 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-16 00:42:30,177 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-16 00:42:30,177 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-16 00:42:30,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2023-02-16 00:42:30,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 134. [2023-02-16 00:42:30,183 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-16 00:42:30,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 201 transitions. [2023-02-16 00:42:30,184 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 201 transitions. Word has length 37 [2023-02-16 00:42:30,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:42:30,185 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 201 transitions. [2023-02-16 00:42:30,185 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-16 00:42:30,185 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 201 transitions. [2023-02-16 00:42:30,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-02-16 00:42:30,186 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:42:30,186 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-16 00:42:30,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-16 00:42:30,187 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:42:30,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:42:30,187 INFO L85 PathProgramCache]: Analyzing trace with hash -2014075552, now seen corresponding path program 1 times [2023-02-16 00:42:30,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:42:30,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832827309] [2023-02-16 00:42:30,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:42:30,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:42:30,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:42:30,255 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-16 00:42:30,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:42:30,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832827309] [2023-02-16 00:42:30,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832827309] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 00:42:30,256 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 00:42:30,256 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 00:42:30,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315517624] [2023-02-16 00:42:30,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 00:42:30,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 00:42:30,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:42:30,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 00:42:30,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 00:42:30,258 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-16 00:42:30,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:42:30,272 INFO L93 Difference]: Finished difference Result 283 states and 420 transitions. [2023-02-16 00:42:30,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 00:42:30,273 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-16 00:42:30,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:42:30,274 INFO L225 Difference]: With dead ends: 283 [2023-02-16 00:42:30,274 INFO L226 Difference]: Without dead ends: 160 [2023-02-16 00:42:30,274 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-16 00:42:30,275 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-16 00:42:30,276 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-16 00:42:30,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2023-02-16 00:42:30,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2023-02-16 00:42:30,282 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-16 00:42:30,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 234 transitions. [2023-02-16 00:42:30,283 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 234 transitions. Word has length 51 [2023-02-16 00:42:30,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:42:30,283 INFO L495 AbstractCegarLoop]: Abstraction has 160 states and 234 transitions. [2023-02-16 00:42:30,283 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-16 00:42:30,284 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 234 transitions. [2023-02-16 00:42:30,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-02-16 00:42:30,285 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:42:30,285 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-16 00:42:30,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-16 00:42:30,285 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:42:30,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:42:30,286 INFO L85 PathProgramCache]: Analyzing trace with hash -1880062046, now seen corresponding path program 1 times [2023-02-16 00:42:30,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:42:30,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30354410] [2023-02-16 00:42:30,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:42:30,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:42:30,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:42:30,358 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-16 00:42:30,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:42:30,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30354410] [2023-02-16 00:42:30,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30354410] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 00:42:30,359 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 00:42:30,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 00:42:30,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220931446] [2023-02-16 00:42:30,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 00:42:30,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 00:42:30,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:42:30,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 00:42:30,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 00:42:30,361 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-16 00:42:30,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:42:30,442 INFO L93 Difference]: Finished difference Result 304 states and 455 transitions. [2023-02-16 00:42:30,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 00:42:30,443 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-16 00:42:30,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:42:30,444 INFO L225 Difference]: With dead ends: 304 [2023-02-16 00:42:30,444 INFO L226 Difference]: Without dead ends: 181 [2023-02-16 00:42:30,445 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-16 00:42:30,445 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-16 00:42:30,446 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-16 00:42:30,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2023-02-16 00:42:30,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 177. [2023-02-16 00:42:30,452 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-16 00:42:30,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 256 transitions. [2023-02-16 00:42:30,453 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 256 transitions. Word has length 51 [2023-02-16 00:42:30,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:42:30,453 INFO L495 AbstractCegarLoop]: Abstraction has 177 states and 256 transitions. [2023-02-16 00:42:30,453 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-16 00:42:30,453 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 256 transitions. [2023-02-16 00:42:30,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-02-16 00:42:30,455 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:42:30,455 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-16 00:42:30,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-16 00:42:30,468 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:42:30,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:42:30,469 INFO L85 PathProgramCache]: Analyzing trace with hash 1552359252, now seen corresponding path program 1 times [2023-02-16 00:42:30,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:42:30,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557584175] [2023-02-16 00:42:30,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:42:30,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:42:30,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:42:30,557 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-16 00:42:30,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:42:30,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557584175] [2023-02-16 00:42:30,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557584175] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 00:42:30,558 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 00:42:30,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 00:42:30,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716436217] [2023-02-16 00:42:30,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 00:42:30,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 00:42:30,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:42:30,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 00:42:30,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 00:42:30,560 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-16 00:42:30,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:42:30,582 INFO L93 Difference]: Finished difference Result 454 states and 668 transitions. [2023-02-16 00:42:30,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 00:42:30,583 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-16 00:42:30,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:42:30,584 INFO L225 Difference]: With dead ends: 454 [2023-02-16 00:42:30,584 INFO L226 Difference]: Without dead ends: 314 [2023-02-16 00:42:30,585 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-16 00:42:30,585 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-16 00:42:30,586 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-16 00:42:30,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2023-02-16 00:42:30,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 314. [2023-02-16 00:42:30,593 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-16 00:42:30,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 455 transitions. [2023-02-16 00:42:30,594 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 455 transitions. Word has length 70 [2023-02-16 00:42:30,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:42:30,595 INFO L495 AbstractCegarLoop]: Abstraction has 314 states and 455 transitions. [2023-02-16 00:42:30,595 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-16 00:42:30,595 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 455 transitions. [2023-02-16 00:42:30,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-02-16 00:42:30,599 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:42:30,599 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-16 00:42:30,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-16 00:42:30,600 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:42:30,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:42:30,600 INFO L85 PathProgramCache]: Analyzing trace with hash -1693805076, now seen corresponding path program 1 times [2023-02-16 00:42:30,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:42:30,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853928830] [2023-02-16 00:42:30,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:42:30,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:42:30,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:42:30,650 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-16 00:42:30,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:42:30,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853928830] [2023-02-16 00:42:30,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853928830] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 00:42:30,651 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 00:42:30,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 00:42:30,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273165712] [2023-02-16 00:42:30,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 00:42:30,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 00:42:30,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:42:30,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 00:42:30,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 00:42:30,654 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-16 00:42:30,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:42:30,670 INFO L93 Difference]: Finished difference Result 612 states and 889 transitions. [2023-02-16 00:42:30,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 00:42:30,671 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-16 00:42:30,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:42:30,679 INFO L225 Difference]: With dead ends: 612 [2023-02-16 00:42:30,679 INFO L226 Difference]: Without dead ends: 335 [2023-02-16 00:42:30,680 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-16 00:42:30,683 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-16 00:42:30,685 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-16 00:42:30,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2023-02-16 00:42:30,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 335. [2023-02-16 00:42:30,694 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-16 00:42:30,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 482 transitions. [2023-02-16 00:42:30,695 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 482 transitions. Word has length 71 [2023-02-16 00:42:30,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:42:30,696 INFO L495 AbstractCegarLoop]: Abstraction has 335 states and 482 transitions. [2023-02-16 00:42:30,696 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-16 00:42:30,696 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 482 transitions. [2023-02-16 00:42:30,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2023-02-16 00:42:30,697 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:42:30,698 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-16 00:42:30,698 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-02-16 00:42:30,698 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:42:30,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:42:30,699 INFO L85 PathProgramCache]: Analyzing trace with hash -294414028, now seen corresponding path program 1 times [2023-02-16 00:42:30,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:42:30,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941876542] [2023-02-16 00:42:30,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:42:30,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:42:30,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:42:30,783 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-16 00:42:30,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:42:30,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941876542] [2023-02-16 00:42:30,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941876542] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 00:42:30,784 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 00:42:30,784 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 00:42:30,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937240026] [2023-02-16 00:42:30,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 00:42:30,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 00:42:30,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:42:30,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 00:42:30,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 00:42:30,785 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-16 00:42:30,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:42:30,871 INFO L93 Difference]: Finished difference Result 681 states and 998 transitions. [2023-02-16 00:42:30,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 00:42:30,872 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-16 00:42:30,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:42:30,874 INFO L225 Difference]: With dead ends: 681 [2023-02-16 00:42:30,874 INFO L226 Difference]: Without dead ends: 383 [2023-02-16 00:42:30,874 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-16 00:42:30,875 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-16 00:42:30,875 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-16 00:42:30,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2023-02-16 00:42:30,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 377. [2023-02-16 00:42:30,884 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-16 00:42:30,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 534 transitions. [2023-02-16 00:42:30,885 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 534 transitions. Word has length 88 [2023-02-16 00:42:30,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:42:30,886 INFO L495 AbstractCegarLoop]: Abstraction has 377 states and 534 transitions. [2023-02-16 00:42:30,886 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-16 00:42:30,886 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 534 transitions. [2023-02-16 00:42:30,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-02-16 00:42:30,889 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:42:30,889 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-16 00:42:30,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-02-16 00:42:30,889 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:42:30,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:42:30,890 INFO L85 PathProgramCache]: Analyzing trace with hash 1264349868, now seen corresponding path program 1 times [2023-02-16 00:42:30,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:42:30,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25658525] [2023-02-16 00:42:30,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:42:30,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:42:30,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:42:30,953 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-16 00:42:30,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:42:30,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25658525] [2023-02-16 00:42:30,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25658525] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 00:42:30,954 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 00:42:30,954 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 00:42:30,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835358040] [2023-02-16 00:42:30,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 00:42:30,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 00:42:30,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:42:30,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 00:42:30,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 00:42:30,955 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-16 00:42:30,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:42:30,983 INFO L93 Difference]: Finished difference Result 538 states and 767 transitions. [2023-02-16 00:42:30,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 00:42:30,983 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-16 00:42:30,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:42:30,985 INFO L225 Difference]: With dead ends: 538 [2023-02-16 00:42:30,985 INFO L226 Difference]: Without dead ends: 536 [2023-02-16 00:42:30,986 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-16 00:42:30,987 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-16 00:42:30,989 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-16 00:42:30,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2023-02-16 00:42:30,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 536. [2023-02-16 00:42:30,998 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-16 00:42:30,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 765 transitions. [2023-02-16 00:42:30,999 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 765 transitions. Word has length 108 [2023-02-16 00:42:30,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:42:30,999 INFO L495 AbstractCegarLoop]: Abstraction has 536 states and 765 transitions. [2023-02-16 00:42:30,999 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-16 00:42:31,001 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 765 transitions. [2023-02-16 00:42:31,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2023-02-16 00:42:31,003 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:42:31,003 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-16 00:42:31,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-02-16 00:42:31,004 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:42:31,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:42:31,005 INFO L85 PathProgramCache]: Analyzing trace with hash 1514969078, now seen corresponding path program 1 times [2023-02-16 00:42:31,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:42:31,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858165798] [2023-02-16 00:42:31,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:42:31,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:42:31,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:42:31,061 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-16 00:42:31,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:42:31,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858165798] [2023-02-16 00:42:31,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858165798] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 00:42:31,061 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 00:42:31,061 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 00:42:31,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802439717] [2023-02-16 00:42:31,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 00:42:31,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 00:42:31,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:42:31,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 00:42:31,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 00:42:31,063 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-16 00:42:31,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:42:31,191 INFO L93 Difference]: Finished difference Result 1185 states and 1745 transitions. [2023-02-16 00:42:31,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 00:42:31,191 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-16 00:42:31,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:42:31,193 INFO L225 Difference]: With dead ends: 1185 [2023-02-16 00:42:31,193 INFO L226 Difference]: Without dead ends: 683 [2023-02-16 00:42:31,194 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-16 00:42:31,194 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-16 00:42:31,194 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-16 00:42:31,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2023-02-16 00:42:31,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 659. [2023-02-16 00:42:31,204 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-16 00:42:31,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 963 transitions. [2023-02-16 00:42:31,205 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 963 transitions. Word has length 128 [2023-02-16 00:42:31,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:42:31,205 INFO L495 AbstractCegarLoop]: Abstraction has 659 states and 963 transitions. [2023-02-16 00:42:31,205 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-16 00:42:31,206 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 963 transitions. [2023-02-16 00:42:31,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2023-02-16 00:42:31,207 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:42:31,207 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-16 00:42:31,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-02-16 00:42:31,207 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:42:31,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:42:31,208 INFO L85 PathProgramCache]: Analyzing trace with hash -219869315, now seen corresponding path program 1 times [2023-02-16 00:42:31,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:42:31,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306865485] [2023-02-16 00:42:31,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:42:31,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:42:31,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:42:31,247 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-16 00:42:31,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:42:31,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306865485] [2023-02-16 00:42:31,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306865485] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 00:42:31,247 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 00:42:31,248 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 00:42:31,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511688128] [2023-02-16 00:42:31,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 00:42:31,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 00:42:31,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:42:31,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 00:42:31,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 00:42:31,249 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-16 00:42:31,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:42:31,360 INFO L93 Difference]: Finished difference Result 1559 states and 2344 transitions. [2023-02-16 00:42:31,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 00:42:31,360 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-16 00:42:31,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:42:31,363 INFO L225 Difference]: With dead ends: 1559 [2023-02-16 00:42:31,363 INFO L226 Difference]: Without dead ends: 886 [2023-02-16 00:42:31,363 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-16 00:42:31,364 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-16 00:42:31,364 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-16 00:42:31,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2023-02-16 00:42:31,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 848. [2023-02-16 00:42:31,376 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-16 00:42:31,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 848 states to 848 states and 1215 transitions. [2023-02-16 00:42:31,378 INFO L78 Accepts]: Start accepts. Automaton has 848 states and 1215 transitions. Word has length 154 [2023-02-16 00:42:31,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:42:31,379 INFO L495 AbstractCegarLoop]: Abstraction has 848 states and 1215 transitions. [2023-02-16 00:42:31,379 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-16 00:42:31,379 INFO L276 IsEmpty]: Start isEmpty. Operand 848 states and 1215 transitions. [2023-02-16 00:42:31,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2023-02-16 00:42:31,380 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:42:31,380 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-16 00:42:31,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-02-16 00:42:31,381 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:42:31,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:42:31,381 INFO L85 PathProgramCache]: Analyzing trace with hash 1855970287, now seen corresponding path program 1 times [2023-02-16 00:42:31,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:42:31,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073405655] [2023-02-16 00:42:31,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:42:31,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:42:31,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:42:31,422 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-16 00:42:31,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:42:31,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073405655] [2023-02-16 00:42:31,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073405655] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 00:42:31,423 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 00:42:31,423 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 00:42:31,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450507438] [2023-02-16 00:42:31,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 00:42:31,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 00:42:31,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:42:31,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 00:42:31,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 00:42:31,424 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-16 00:42:31,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:42:31,535 INFO L93 Difference]: Finished difference Result 1815 states and 2621 transitions. [2023-02-16 00:42:31,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 00:42:31,536 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-16 00:42:31,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:42:31,538 INFO L225 Difference]: With dead ends: 1815 [2023-02-16 00:42:31,538 INFO L226 Difference]: Without dead ends: 959 [2023-02-16 00:42:31,539 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-16 00:42:31,540 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-16 00:42:31,540 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-16 00:42:31,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2023-02-16 00:42:31,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 923. [2023-02-16 00:42:31,567 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-16 00:42:31,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1311 transitions. [2023-02-16 00:42:31,569 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1311 transitions. Word has length 175 [2023-02-16 00:42:31,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:42:31,570 INFO L495 AbstractCegarLoop]: Abstraction has 923 states and 1311 transitions. [2023-02-16 00:42:31,570 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-16 00:42:31,570 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1311 transitions. [2023-02-16 00:42:31,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2023-02-16 00:42:31,571 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:42:31,572 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-16 00:42:31,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-02-16 00:42:31,572 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:42:31,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:42:31,572 INFO L85 PathProgramCache]: Analyzing trace with hash -150572132, now seen corresponding path program 1 times [2023-02-16 00:42:31,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:42:31,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126870025] [2023-02-16 00:42:31,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:42:31,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:42:31,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:42:31,623 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-16 00:42:31,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:42:31,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126870025] [2023-02-16 00:42:31,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126870025] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 00:42:31,623 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 00:42:31,623 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 00:42:31,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179669242] [2023-02-16 00:42:31,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 00:42:31,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 00:42:31,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:42:31,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 00:42:31,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 00:42:31,625 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-16 00:42:31,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:42:31,743 INFO L93 Difference]: Finished difference Result 1965 states and 2810 transitions. [2023-02-16 00:42:31,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 00:42:31,743 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-16 00:42:31,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:42:31,746 INFO L225 Difference]: With dead ends: 1965 [2023-02-16 00:42:31,746 INFO L226 Difference]: Without dead ends: 1040 [2023-02-16 00:42:31,747 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-16 00:42:31,748 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-16 00:42:31,748 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-16 00:42:31,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1040 states. [2023-02-16 00:42:31,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1040 to 1007. [2023-02-16 00:42:31,763 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-16 00:42:31,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1007 states to 1007 states and 1422 transitions. [2023-02-16 00:42:31,765 INFO L78 Accepts]: Start accepts. Automaton has 1007 states and 1422 transitions. Word has length 199 [2023-02-16 00:42:31,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:42:31,765 INFO L495 AbstractCegarLoop]: Abstraction has 1007 states and 1422 transitions. [2023-02-16 00:42:31,766 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-16 00:42:31,766 INFO L276 IsEmpty]: Start isEmpty. Operand 1007 states and 1422 transitions. [2023-02-16 00:42:31,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2023-02-16 00:42:31,767 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:42:31,767 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-16 00:42:31,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-02-16 00:42:31,768 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:42:31,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:42:31,768 INFO L85 PathProgramCache]: Analyzing trace with hash -643198306, now seen corresponding path program 1 times [2023-02-16 00:42:31,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:42:31,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047908044] [2023-02-16 00:42:31,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:42:31,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:42:31,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:42:31,821 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-16 00:42:31,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:42:31,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047908044] [2023-02-16 00:42:31,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047908044] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 00:42:31,822 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 00:42:31,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 00:42:31,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716131774] [2023-02-16 00:42:31,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 00:42:31,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 00:42:31,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:42:31,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 00:42:31,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 00:42:31,823 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-16 00:42:31,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:42:31,964 INFO L93 Difference]: Finished difference Result 2133 states and 3035 transitions. [2023-02-16 00:42:31,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 00:42:31,964 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-16 00:42:31,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:42:31,967 INFO L225 Difference]: With dead ends: 2133 [2023-02-16 00:42:31,967 INFO L226 Difference]: Without dead ends: 1136 [2023-02-16 00:42:31,968 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-16 00:42:31,969 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-16 00:42:31,969 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-16 00:42:31,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1136 states. [2023-02-16 00:42:31,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1136 to 1100. [2023-02-16 00:42:31,990 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-16 00:42:31,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1100 states to 1100 states and 1554 transitions. [2023-02-16 00:42:31,992 INFO L78 Accepts]: Start accepts. Automaton has 1100 states and 1554 transitions. Word has length 199 [2023-02-16 00:42:31,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:42:31,993 INFO L495 AbstractCegarLoop]: Abstraction has 1100 states and 1554 transitions. [2023-02-16 00:42:31,993 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-16 00:42:31,993 INFO L276 IsEmpty]: Start isEmpty. Operand 1100 states and 1554 transitions. [2023-02-16 00:42:31,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2023-02-16 00:42:31,995 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:42:31,995 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-16 00:42:31,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-02-16 00:42:31,996 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:42:31,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:42:31,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1155189252, now seen corresponding path program 1 times [2023-02-16 00:42:31,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:42:31,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356006933] [2023-02-16 00:42:31,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:42:31,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:42:32,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:42:32,064 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-16 00:42:32,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:42:32,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356006933] [2023-02-16 00:42:32,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356006933] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 00:42:32,065 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 00:42:32,065 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 00:42:32,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734201317] [2023-02-16 00:42:32,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 00:42:32,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 00:42:32,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:42:32,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 00:42:32,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 00:42:32,067 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-16 00:42:32,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:42:32,097 INFO L93 Difference]: Finished difference Result 3223 states and 4561 transitions. [2023-02-16 00:42:32,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 00:42:32,098 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-16 00:42:32,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:42:32,103 INFO L225 Difference]: With dead ends: 3223 [2023-02-16 00:42:32,103 INFO L226 Difference]: Without dead ends: 2160 [2023-02-16 00:42:32,104 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 00:42:32,105 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-16 00:42:32,106 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-16 00:42:32,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2160 states. [2023-02-16 00:42:32,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2160 to 2158. [2023-02-16 00:42:32,145 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-16 00:42:32,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2158 states to 2158 states and 3052 transitions. [2023-02-16 00:42:32,150 INFO L78 Accepts]: Start accepts. Automaton has 2158 states and 3052 transitions. Word has length 229 [2023-02-16 00:42:32,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:42:32,150 INFO L495 AbstractCegarLoop]: Abstraction has 2158 states and 3052 transitions. [2023-02-16 00:42:32,150 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-16 00:42:32,150 INFO L276 IsEmpty]: Start isEmpty. Operand 2158 states and 3052 transitions. [2023-02-16 00:42:32,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2023-02-16 00:42:32,153 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:42:32,153 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-16 00:42:32,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-02-16 00:42:32,153 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:42:32,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:42:32,154 INFO L85 PathProgramCache]: Analyzing trace with hash -1647815426, now seen corresponding path program 1 times [2023-02-16 00:42:32,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:42:32,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641497020] [2023-02-16 00:42:32,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:42:32,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:42:32,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:42:32,215 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-16 00:42:32,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:42:32,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641497020] [2023-02-16 00:42:32,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641497020] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 00:42:32,216 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 00:42:32,216 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 00:42:32,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583568115] [2023-02-16 00:42:32,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 00:42:32,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 00:42:32,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:42:32,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 00:42:32,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 00:42:32,218 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-16 00:42:32,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:42:32,360 INFO L93 Difference]: Finished difference Result 4585 states and 6523 transitions. [2023-02-16 00:42:32,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 00:42:32,360 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-16 00:42:32,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:42:32,366 INFO L225 Difference]: With dead ends: 4585 [2023-02-16 00:42:32,366 INFO L226 Difference]: Without dead ends: 2434 [2023-02-16 00:42:32,369 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 00:42:32,369 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-16 00:42:32,370 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-16 00:42:32,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2434 states. [2023-02-16 00:42:32,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2434 to 2368. [2023-02-16 00:42:32,412 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-16 00:42:32,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2368 states to 2368 states and 3364 transitions. [2023-02-16 00:42:32,417 INFO L78 Accepts]: Start accepts. Automaton has 2368 states and 3364 transitions. Word has length 229 [2023-02-16 00:42:32,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:42:32,417 INFO L495 AbstractCegarLoop]: Abstraction has 2368 states and 3364 transitions. [2023-02-16 00:42:32,417 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-16 00:42:32,418 INFO L276 IsEmpty]: Start isEmpty. Operand 2368 states and 3364 transitions. [2023-02-16 00:42:32,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2023-02-16 00:42:32,420 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:42:32,421 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-16 00:42:32,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-02-16 00:42:32,421 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:42:32,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:42:32,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1130835859, now seen corresponding path program 1 times [2023-02-16 00:42:32,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:42:32,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131226404] [2023-02-16 00:42:32,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:42:32,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:42:32,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:42:32,475 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-16 00:42:32,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:42:32,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131226404] [2023-02-16 00:42:32,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131226404] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 00:42:32,476 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 00:42:32,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 00:42:32,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919660009] [2023-02-16 00:42:32,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 00:42:32,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 00:42:32,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:42:32,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 00:42:32,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 00:42:32,477 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-16 00:42:32,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:42:32,625 INFO L93 Difference]: Finished difference Result 4765 states and 6757 transitions. [2023-02-16 00:42:32,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 00:42:32,625 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-16 00:42:32,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:42:32,631 INFO L225 Difference]: With dead ends: 4765 [2023-02-16 00:42:32,631 INFO L226 Difference]: Without dead ends: 2416 [2023-02-16 00:42:32,632 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-16 00:42:32,633 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-16 00:42:32,633 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-16 00:42:32,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2416 states. [2023-02-16 00:42:32,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2416 to 2350. [2023-02-16 00:42:32,672 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-16 00:42:32,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2350 states to 2350 states and 3310 transitions. [2023-02-16 00:42:32,676 INFO L78 Accepts]: Start accepts. Automaton has 2350 states and 3310 transitions. Word has length 264 [2023-02-16 00:42:32,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:42:32,677 INFO L495 AbstractCegarLoop]: Abstraction has 2350 states and 3310 transitions. [2023-02-16 00:42:32,677 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-16 00:42:32,677 INFO L276 IsEmpty]: Start isEmpty. Operand 2350 states and 3310 transitions. [2023-02-16 00:42:32,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2023-02-16 00:42:32,680 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:42:32,680 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-16 00:42:32,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-02-16 00:42:32,680 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:42:32,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:42:32,681 INFO L85 PathProgramCache]: Analyzing trace with hash 1187214557, now seen corresponding path program 1 times [2023-02-16 00:42:32,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:42:32,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281404122] [2023-02-16 00:42:32,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:42:32,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:42:32,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:42:32,754 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-16 00:42:32,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:42:32,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281404122] [2023-02-16 00:42:32,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281404122] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 00:42:32,755 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 00:42:32,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 00:42:32,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220836775] [2023-02-16 00:42:32,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 00:42:32,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 00:42:32,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:42:32,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 00:42:32,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 00:42:32,756 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-16 00:42:32,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:42:32,823 INFO L93 Difference]: Finished difference Result 6951 states and 9784 transitions. [2023-02-16 00:42:32,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 00:42:32,824 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-16 00:42:32,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:42:32,835 INFO L225 Difference]: With dead ends: 6951 [2023-02-16 00:42:32,835 INFO L226 Difference]: Without dead ends: 4638 [2023-02-16 00:42:32,837 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-16 00:42:32,838 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-16 00:42:32,838 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-16 00:42:32,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4638 states. [2023-02-16 00:42:32,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4638 to 4636. [2023-02-16 00:42:32,941 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-16 00:42:32,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4636 states to 4636 states and 6504 transitions. [2023-02-16 00:42:32,950 INFO L78 Accepts]: Start accepts. Automaton has 4636 states and 6504 transitions. Word has length 274 [2023-02-16 00:42:32,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:42:32,950 INFO L495 AbstractCegarLoop]: Abstraction has 4636 states and 6504 transitions. [2023-02-16 00:42:32,951 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-16 00:42:32,951 INFO L276 IsEmpty]: Start isEmpty. Operand 4636 states and 6504 transitions. [2023-02-16 00:42:32,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2023-02-16 00:42:32,956 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:42:32,956 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-16 00:42:32,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-02-16 00:42:32,956 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:42:32,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:42:32,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1412043949, now seen corresponding path program 1 times [2023-02-16 00:42:32,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:42:32,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065390858] [2023-02-16 00:42:32,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:42:32,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:42:32,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:42:33,042 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-16 00:42:33,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:42:33,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065390858] [2023-02-16 00:42:33,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065390858] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 00:42:33,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [428525588] [2023-02-16 00:42:33,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:42:33,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:42:33,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:42:33,045 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-16 00:42:33,046 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-16 00:42:33,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:42:33,168 INFO L263 TraceCheckSpWp]: Trace formula consists of 525 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-16 00:42:33,181 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:42:33,268 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-16 00:42:33,269 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 00:42:33,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [428525588] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 00:42:33,269 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-16 00:42:33,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2023-02-16 00:42:33,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156389500] [2023-02-16 00:42:33,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 00:42:33,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 00:42:33,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:42:33,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 00:42:33,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-16 00:42:33,281 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-16 00:42:33,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:42:33,496 INFO L93 Difference]: Finished difference Result 9314 states and 13055 transitions. [2023-02-16 00:42:33,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 00:42:33,496 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-16 00:42:33,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:42:33,508 INFO L225 Difference]: With dead ends: 9314 [2023-02-16 00:42:33,508 INFO L226 Difference]: Without dead ends: 4744 [2023-02-16 00:42:33,512 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-16 00:42:33,513 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-16 00:42:33,513 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-16 00:42:33,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4744 states. [2023-02-16 00:42:33,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4744 to 4636. [2023-02-16 00:42:33,605 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-16 00:42:33,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4636 states to 4636 states and 6396 transitions. [2023-02-16 00:42:33,617 INFO L78 Accepts]: Start accepts. Automaton has 4636 states and 6396 transitions. Word has length 274 [2023-02-16 00:42:33,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:42:33,618 INFO L495 AbstractCegarLoop]: Abstraction has 4636 states and 6396 transitions. [2023-02-16 00:42:33,618 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-16 00:42:33,618 INFO L276 IsEmpty]: Start isEmpty. Operand 4636 states and 6396 transitions. [2023-02-16 00:42:33,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2023-02-16 00:42:33,624 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:42:33,624 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-16 00:42:33,635 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-02-16 00:42:33,829 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-16 00:42:33,829 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:42:33,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:42:33,830 INFO L85 PathProgramCache]: Analyzing trace with hash -1677895817, now seen corresponding path program 1 times [2023-02-16 00:42:33,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:42:33,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937074456] [2023-02-16 00:42:33,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:42:33,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:42:33,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:42:33,944 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-16 00:42:33,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:42:33,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937074456] [2023-02-16 00:42:33,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937074456] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 00:42:33,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1941369992] [2023-02-16 00:42:33,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:42:33,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:42:33,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:42:33,946 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-16 00:42:33,993 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-16 00:42:34,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:42:34,107 INFO L263 TraceCheckSpWp]: Trace formula consists of 579 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-16 00:42:34,113 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:42:34,140 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-16 00:42:34,140 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 00:42:34,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1941369992] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 00:42:34,140 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-16 00:42:34,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2023-02-16 00:42:34,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373158945] [2023-02-16 00:42:34,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 00:42:34,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 00:42:34,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:42:34,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 00:42:34,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-16 00:42:34,142 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-16 00:42:34,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:42:34,302 INFO L93 Difference]: Finished difference Result 9800 states and 13409 transitions. [2023-02-16 00:42:34,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 00:42:34,302 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-16 00:42:34,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:42:34,324 INFO L225 Difference]: With dead ends: 9800 [2023-02-16 00:42:34,324 INFO L226 Difference]: Without dead ends: 5230 [2023-02-16 00:42:34,328 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-16 00:42:34,329 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-16 00:42:34,329 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-16 00:42:34,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5230 states. [2023-02-16 00:42:34,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5230 to 4810. [2023-02-16 00:42:34,460 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-16 00:42:34,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4810 states to 4810 states and 6630 transitions. [2023-02-16 00:42:34,468 INFO L78 Accepts]: Start accepts. Automaton has 4810 states and 6630 transitions. Word has length 301 [2023-02-16 00:42:34,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:42:34,469 INFO L495 AbstractCegarLoop]: Abstraction has 4810 states and 6630 transitions. [2023-02-16 00:42:34,469 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-16 00:42:34,469 INFO L276 IsEmpty]: Start isEmpty. Operand 4810 states and 6630 transitions. [2023-02-16 00:42:34,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2023-02-16 00:42:34,474 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:42:34,474 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-16 00:42:34,495 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-16 00:42:34,680 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-16 00:42:34,680 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:42:34,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:42:34,681 INFO L85 PathProgramCache]: Analyzing trace with hash -1606168447, now seen corresponding path program 1 times [2023-02-16 00:42:34,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:42:34,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803310645] [2023-02-16 00:42:34,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:42:34,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:42:34,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:42:34,759 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-16 00:42:34,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:42:34,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803310645] [2023-02-16 00:42:34,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803310645] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 00:42:34,760 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 00:42:34,760 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 00:42:34,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532387709] [2023-02-16 00:42:34,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 00:42:34,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 00:42:34,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:42:34,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 00:42:34,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 00:42:34,761 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-16 00:42:34,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:42:34,897 INFO L93 Difference]: Finished difference Result 9878 states and 13499 transitions. [2023-02-16 00:42:34,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 00:42:34,897 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-16 00:42:34,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:42:34,903 INFO L225 Difference]: With dead ends: 9878 [2023-02-16 00:42:34,903 INFO L226 Difference]: Without dead ends: 4630 [2023-02-16 00:42:34,907 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 00:42:34,908 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-16 00:42:34,908 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-16 00:42:34,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4630 states. [2023-02-16 00:42:35,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4630 to 4612. [2023-02-16 00:42:35,013 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-16 00:42:35,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4612 states to 4612 states and 6336 transitions. [2023-02-16 00:42:35,020 INFO L78 Accepts]: Start accepts. Automaton has 4612 states and 6336 transitions. Word has length 302 [2023-02-16 00:42:35,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:42:35,021 INFO L495 AbstractCegarLoop]: Abstraction has 4612 states and 6336 transitions. [2023-02-16 00:42:35,021 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-16 00:42:35,021 INFO L276 IsEmpty]: Start isEmpty. Operand 4612 states and 6336 transitions. [2023-02-16 00:42:35,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2023-02-16 00:42:35,026 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:42:35,027 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-16 00:42:35,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-02-16 00:42:35,027 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:42:35,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:42:35,028 INFO L85 PathProgramCache]: Analyzing trace with hash -1919616935, now seen corresponding path program 1 times [2023-02-16 00:42:35,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:42:35,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821232715] [2023-02-16 00:42:35,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:42:35,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:42:35,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:42:35,119 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-16 00:42:35,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:42:35,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821232715] [2023-02-16 00:42:35,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821232715] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 00:42:35,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1471002271] [2023-02-16 00:42:35,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:42:35,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:42:35,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:42:35,134 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-16 00:42:35,135 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-16 00:42:35,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:42:35,237 INFO L263 TraceCheckSpWp]: Trace formula consists of 567 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-16 00:42:35,240 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:42:35,518 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-16 00:42:35,519 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 00:42:35,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1471002271] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 00:42:35,519 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-16 00:42:35,519 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2023-02-16 00:42:35,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536635360] [2023-02-16 00:42:35,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 00:42:35,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 00:42:35,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:42:35,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 00:42:35,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-16 00:42:35,520 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-16 00:42:35,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:42:35,610 INFO L93 Difference]: Finished difference Result 6921 states and 9490 transitions. [2023-02-16 00:42:35,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 00:42:35,611 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-16 00:42:35,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:42:35,616 INFO L225 Difference]: With dead ends: 6921 [2023-02-16 00:42:35,624 INFO L226 Difference]: Without dead ends: 4614 [2023-02-16 00:42:35,629 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-16 00:42:35,630 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-16 00:42:35,630 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-16 00:42:35,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4614 states. [2023-02-16 00:42:35,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4614 to 4600. [2023-02-16 00:42:35,744 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-16 00:42:35,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4600 states to 4600 states and 6300 transitions. [2023-02-16 00:42:35,752 INFO L78 Accepts]: Start accepts. Automaton has 4600 states and 6300 transitions. Word has length 312 [2023-02-16 00:42:35,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:42:35,753 INFO L495 AbstractCegarLoop]: Abstraction has 4600 states and 6300 transitions. [2023-02-16 00:42:35,753 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-16 00:42:35,753 INFO L276 IsEmpty]: Start isEmpty. Operand 4600 states and 6300 transitions. [2023-02-16 00:42:35,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2023-02-16 00:42:35,759 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:42:35,760 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-16 00:42:35,765 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-02-16 00:42:35,964 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-16 00:42:35,965 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:42:35,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:42:35,965 INFO L85 PathProgramCache]: Analyzing trace with hash -1627037657, now seen corresponding path program 1 times [2023-02-16 00:42:35,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:42:35,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524280677] [2023-02-16 00:42:35,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:42:35,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:42:35,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:42:36,081 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-16 00:42:36,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:42:36,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524280677] [2023-02-16 00:42:36,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524280677] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 00:42:36,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [65602326] [2023-02-16 00:42:36,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:42:36,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:42:36,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:42:36,083 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-16 00:42:36,085 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-16 00:42:36,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:42:36,186 INFO L263 TraceCheckSpWp]: Trace formula consists of 568 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-16 00:42:36,189 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:42:36,261 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-16 00:42:36,262 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 00:42:36,336 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-16 00:42:36,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [65602326] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 00:42:36,337 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 00:42:36,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2023-02-16 00:42:36,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466749356] [2023-02-16 00:42:36,337 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 00:42:36,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-16 00:42:36,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:42:36,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-16 00:42:36,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2023-02-16 00:42:36,339 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-16 00:42:36,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:42:36,772 INFO L93 Difference]: Finished difference Result 7227 states and 9988 transitions. [2023-02-16 00:42:36,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-16 00:42:36,772 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-16 00:42:36,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:42:36,778 INFO L225 Difference]: With dead ends: 7227 [2023-02-16 00:42:36,778 INFO L226 Difference]: Without dead ends: 4722 [2023-02-16 00:42:36,781 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 630 GetRequests, 618 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2023-02-16 00:42:36,781 INFO L413 NwaCegarLoop]: 280 mSDtfsCounter, 439 mSDsluCounter, 974 mSDsCounter, 0 mSdLazyCounter, 605 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.3s IncrementalHoareTripleChecker+Time [2023-02-16 00:42:36,782 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.3s Time] [2023-02-16 00:42:36,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4722 states. [2023-02-16 00:42:36,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4722 to 4600. [2023-02-16 00:42:36,849 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-16 00:42:36,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4600 states to 4600 states and 6288 transitions. [2023-02-16 00:42:36,854 INFO L78 Accepts]: Start accepts. Automaton has 4600 states and 6288 transitions. Word has length 312 [2023-02-16 00:42:36,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:42:36,856 INFO L495 AbstractCegarLoop]: Abstraction has 4600 states and 6288 transitions. [2023-02-16 00:42:36,856 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-16 00:42:36,857 INFO L276 IsEmpty]: Start isEmpty. Operand 4600 states and 6288 transitions. [2023-02-16 00:42:36,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2023-02-16 00:42:36,862 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:42:36,862 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-16 00:42:36,868 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-16 00:42:37,068 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-16 00:42:37,068 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:42:37,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:42:37,069 INFO L85 PathProgramCache]: Analyzing trace with hash 1184629009, now seen corresponding path program 1 times [2023-02-16 00:42:37,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:42:37,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355017669] [2023-02-16 00:42:37,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:42:37,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:42:37,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:42:37,157 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-16 00:42:37,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:42:37,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355017669] [2023-02-16 00:42:37,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355017669] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 00:42:37,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1136906693] [2023-02-16 00:42:37,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:42:37,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:42:37,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:42:37,159 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-16 00:42:37,161 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-16 00:42:37,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:42:37,256 INFO L263 TraceCheckSpWp]: Trace formula consists of 566 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-16 00:42:37,262 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:42:37,322 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-16 00:42:37,322 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 00:42:37,391 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-16 00:42:37,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1136906693] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 00:42:37,391 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 00:42:37,391 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 10 [2023-02-16 00:42:37,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837009311] [2023-02-16 00:42:37,392 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 00:42:37,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-16 00:42:37,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:42:37,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-16 00:42:37,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-02-16 00:42:37,393 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-16 00:42:37,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:42:37,821 INFO L93 Difference]: Finished difference Result 6005 states and 8260 transitions. [2023-02-16 00:42:37,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-16 00:42:37,822 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-16 00:42:37,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:42:37,825 INFO L225 Difference]: With dead ends: 6005 [2023-02-16 00:42:37,825 INFO L226 Difference]: Without dead ends: 2350 [2023-02-16 00:42:37,828 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-16 00:42:37,828 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.3s IncrementalHoareTripleChecker+Time [2023-02-16 00:42:37,828 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.3s Time] [2023-02-16 00:42:37,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2350 states. [2023-02-16 00:42:37,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2350 to 2284. [2023-02-16 00:42:37,892 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-16 00:42:37,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2284 states to 2284 states and 3117 transitions. [2023-02-16 00:42:37,895 INFO L78 Accepts]: Start accepts. Automaton has 2284 states and 3117 transitions. Word has length 313 [2023-02-16 00:42:37,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:42:37,895 INFO L495 AbstractCegarLoop]: Abstraction has 2284 states and 3117 transitions. [2023-02-16 00:42:37,895 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-16 00:42:37,896 INFO L276 IsEmpty]: Start isEmpty. Operand 2284 states and 3117 transitions. [2023-02-16 00:42:37,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2023-02-16 00:42:37,899 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:42:37,899 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-16 00:42:37,905 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-02-16 00:42:38,105 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-16 00:42:38,105 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:42:38,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:42:38,106 INFO L85 PathProgramCache]: Analyzing trace with hash -2094731103, now seen corresponding path program 1 times [2023-02-16 00:42:38,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:42:38,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127680990] [2023-02-16 00:42:38,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:42:38,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:42:38,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:42:38,182 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-16 00:42:38,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:42:38,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127680990] [2023-02-16 00:42:38,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127680990] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 00:42:38,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1066235189] [2023-02-16 00:42:38,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:42:38,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:42:38,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:42:38,184 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-16 00:42:38,186 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-16 00:42:38,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:42:38,278 INFO L263 TraceCheckSpWp]: Trace formula consists of 574 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-16 00:42:38,280 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:42:38,325 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-16 00:42:38,325 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 00:42:38,376 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-16 00:42:38,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1066235189] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 00:42:38,376 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 00:42:38,376 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2023-02-16 00:42:38,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706927355] [2023-02-16 00:42:38,377 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 00:42:38,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-16 00:42:38,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:42:38,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-16 00:42:38,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-16 00:42:38,378 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-16 00:42:38,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:42:38,703 INFO L93 Difference]: Finished difference Result 5795 states and 8022 transitions. [2023-02-16 00:42:38,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-16 00:42:38,703 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-16 00:42:38,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:42:38,712 INFO L225 Difference]: With dead ends: 5795 [2023-02-16 00:42:38,712 INFO L226 Difference]: Without dead ends: 3380 [2023-02-16 00:42:38,716 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-16 00:42:38,717 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-16 00:42:38,717 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-16 00:42:38,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3380 states. [2023-02-16 00:42:38,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3380 to 2481. [2023-02-16 00:42:38,758 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-16 00:42:38,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2481 states to 2481 states and 3410 transitions. [2023-02-16 00:42:38,761 INFO L78 Accepts]: Start accepts. Automaton has 2481 states and 3410 transitions. Word has length 314 [2023-02-16 00:42:38,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:42:38,761 INFO L495 AbstractCegarLoop]: Abstraction has 2481 states and 3410 transitions. [2023-02-16 00:42:38,761 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-16 00:42:38,762 INFO L276 IsEmpty]: Start isEmpty. Operand 2481 states and 3410 transitions. [2023-02-16 00:42:38,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2023-02-16 00:42:38,766 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:42:38,766 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-16 00:42:38,771 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-16 00:42:38,971 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-16 00:42:38,972 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:42:38,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:42:38,973 INFO L85 PathProgramCache]: Analyzing trace with hash 90171258, now seen corresponding path program 1 times [2023-02-16 00:42:38,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:42:38,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357220158] [2023-02-16 00:42:38,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:42:38,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:42:38,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:42:39,045 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-16 00:42:39,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:42:39,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357220158] [2023-02-16 00:42:39,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357220158] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 00:42:39,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [363654453] [2023-02-16 00:42:39,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:42:39,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:42:39,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:42:39,047 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-16 00:42:39,090 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-16 00:42:39,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:42:39,165 INFO L263 TraceCheckSpWp]: Trace formula consists of 632 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-16 00:42:39,168 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:42:39,207 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-16 00:42:39,207 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 00:42:39,251 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-16 00:42:39,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [363654453] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 00:42:39,252 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 00:42:39,252 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2023-02-16 00:42:39,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768274949] [2023-02-16 00:42:39,252 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 00:42:39,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-16 00:42:39,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:42:39,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-16 00:42:39,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-16 00:42:39,254 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-16 00:42:39,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:42:39,415 INFO L93 Difference]: Finished difference Result 3536 states and 4811 transitions. [2023-02-16 00:42:39,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-16 00:42:39,416 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-16 00:42:39,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:42:39,416 INFO L225 Difference]: With dead ends: 3536 [2023-02-16 00:42:39,416 INFO L226 Difference]: Without dead ends: 0 [2023-02-16 00:42:39,418 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-16 00:42:39,419 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-16 00:42:39,422 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-16 00:42:39,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-02-16 00:42:39,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-02-16 00:42:39,422 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-16 00:42:39,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-02-16 00:42:39,423 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 340 [2023-02-16 00:42:39,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:42:39,423 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-02-16 00:42:39,423 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-16 00:42:39,423 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-02-16 00:42:39,423 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-02-16 00:42:39,425 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-02-16 00:42:39,431 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-16 00:42:39,631 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-16 00:42:39,633 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-02-16 00:42:41,935 INFO L899 garLoopResultBuilder]: For program point L367(lines 367 371) no Hoare annotation was computed. [2023-02-16 00:42:41,935 INFO L899 garLoopResultBuilder]: For program point L235(lines 235 252) no Hoare annotation was computed. [2023-02-16 00:42:41,935 INFO L899 garLoopResultBuilder]: For program point L202(lines 202 551) no Hoare annotation was computed. [2023-02-16 00:42:41,935 INFO L899 garLoopResultBuilder]: For program point L169(lines 169 562) no Hoare annotation was computed. [2023-02-16 00:42:41,935 INFO L899 garLoopResultBuilder]: For program point L235-2(lines 213 545) no Hoare annotation was computed. [2023-02-16 00:42:41,935 INFO L899 garLoopResultBuilder]: For program point L136(lines 136 573) no Hoare annotation was computed. [2023-02-16 00:42:41,935 INFO L899 garLoopResultBuilder]: For program point L501-1(lines 501 513) no Hoare annotation was computed. [2023-02-16 00:42:41,936 INFO L899 garLoopResultBuilder]: For program point L435(lines 435 439) no Hoare annotation was computed. [2023-02-16 00:42:41,936 INFO L899 garLoopResultBuilder]: For program point L237(lines 237 242) no Hoare annotation was computed. [2023-02-16 00:42:41,936 INFO L899 garLoopResultBuilder]: For program point L205(lines 205 550) no Hoare annotation was computed. [2023-02-16 00:42:41,936 INFO L899 garLoopResultBuilder]: For program point L172(lines 172 561) no Hoare annotation was computed. [2023-02-16 00:42:41,936 INFO L899 garLoopResultBuilder]: For program point L139(lines 139 572) no Hoare annotation was computed. [2023-02-16 00:42:41,936 INFO L899 garLoopResultBuilder]: For program point L536(lines 536 540) no Hoare annotation was computed. [2023-02-16 00:42:41,936 INFO L899 garLoopResultBuilder]: For program point L504(lines 504 509) no Hoare annotation was computed. [2023-02-16 00:42:41,936 INFO L899 garLoopResultBuilder]: For program point L471(lines 471 482) no Hoare annotation was computed. [2023-02-16 00:42:41,936 INFO L899 garLoopResultBuilder]: For program point L471-1(lines 471 482) no Hoare annotation was computed. [2023-02-16 00:42:41,936 INFO L899 garLoopResultBuilder]: For program point L273(lines 273 277) no Hoare annotation was computed. [2023-02-16 00:42:41,936 INFO L899 garLoopResultBuilder]: For program point L273-2(lines 213 545) no Hoare annotation was computed. [2023-02-16 00:42:41,936 INFO L895 garLoopResultBuilder]: At program point ssl3_connect_switch_1_4433#1(lines 151 568) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 4)) (.cse1 (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4448)) (.cse2 (<= 4432 |ULTIMATE.start_ssl3_connect_~s__state~0#1|))) (or (and (= 0 |ULTIMATE.start_ssl3_connect_~s__hit~0#1|) .cse0 .cse1 .cse2 (= |ULTIMATE.start_ssl3_connect_~ag_Z~0#1| 48)) (and .cse0 .cse1 .cse2 (<= |ULTIMATE.start_ssl3_connect_~ag_Y~0#1| 208) (not (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0))))) [2023-02-16 00:42:41,936 INFO L899 garLoopResultBuilder]: For program point L406(lines 406 410) no Hoare annotation was computed. [2023-02-16 00:42:41,936 INFO L899 garLoopResultBuilder]: For program point L340(lines 340 344) no Hoare annotation was computed. [2023-02-16 00:42:41,937 INFO L899 garLoopResultBuilder]: For program point L340-2(lines 213 545) no Hoare annotation was computed. [2023-02-16 00:42:41,937 INFO L899 garLoopResultBuilder]: For program point L208(lines 208 549) no Hoare annotation was computed. [2023-02-16 00:42:41,937 INFO L899 garLoopResultBuilder]: For program point L175(lines 175 560) no Hoare annotation was computed. [2023-02-16 00:42:41,937 INFO L899 garLoopResultBuilder]: For program point L142(lines 142 571) no Hoare annotation was computed. [2023-02-16 00:42:41,937 INFO L895 garLoopResultBuilder]: At program point L109-1(lines 109 612) the Hoare annotation is: (let ((.cse14 (= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4368)) (.cse1 (= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 12292)) (.cse2 (= 0 |ULTIMATE.start_ssl3_connect_~blastFlag~0#1|)) (.cse4 (<= |ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1| 4560)) (.cse12 (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4352)) (.cse13 (<= 4352 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (.cse6 (<= 4560 |ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1|)) (.cse15 (= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4384)) (.cse16 (= 1 |ULTIMATE.start_ssl3_connect_~blastFlag~0#1|)) (.cse9 (= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 2)) (.cse10 (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4528)) (.cse11 (<= 4432 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (.cse0 (= 0 |ULTIMATE.start_ssl3_connect_~s__hit~0#1|)) (.cse3 (= |ULTIMATE.start_ssl3_connect_~ag_Z~0#1| 48)) (.cse5 (<= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 4)) (.cse17 (= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4416)) (.cse7 (<= |ULTIMATE.start_ssl3_connect_~ag_Y~0#1| 208)) (.cse8 (not (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0)))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse4 .cse5 (<= 4560 |ULTIMATE.start_ssl3_connect_~s__state~0#1|) .cse6 (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4560) .cse3) (and .cse7 .cse8 .cse9) (and .cse10 .cse5 .cse11 .cse7 .cse8) (and (= |ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1| 3) .cse5 .cse12 .cse7 .cse13 .cse8) (and .cse14 .cse2 .cse7 .cse8) (= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 3) (and .cse15 .cse16 .cse7 .cse8) (and .cse0 .cse14 .cse2 .cse3) (and .cse0 (= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 48) .cse3) (and .cse1 .cse2 .cse7 .cse8) (and .cse0 .cse4 .cse5 .cse12 .cse13 .cse6 .cse3) (and .cse0 .cse15 .cse16 .cse3) (and .cse0 .cse9 .cse3) (and .cse0 .cse10 .cse5 .cse11 .cse3) (and .cse0 .cse5 .cse17 .cse3) (and .cse5 .cse17 .cse7 .cse8))) [2023-02-16 00:42:41,937 INFO L899 garLoopResultBuilder]: For program point L473(lines 473 479) no Hoare annotation was computed. [2023-02-16 00:42:41,937 INFO L899 garLoopResultBuilder]: For program point L110(line 110) no Hoare annotation was computed. [2023-02-16 00:42:41,937 INFO L895 garLoopResultBuilder]: At program point ssl3_connect_switch_1_4417#1(lines 145 570) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 4)) (.cse1 (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4432))) (or (and .cse0 (<= |ULTIMATE.start_ssl3_connect_~ag_Y~0#1| 208) .cse1 (<= 4352 |ULTIMATE.start_ssl3_connect_~s__state~0#1|) (not (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0))) (and (= 0 |ULTIMATE.start_ssl3_connect_~s__hit~0#1|) (not (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4384)) .cse0 .cse1 (= |ULTIMATE.start_ssl3_connect_~ag_Z~0#1| 48)))) [2023-02-16 00:42:41,937 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(lines 632 642) the Hoare annotation is: true [2023-02-16 00:42:41,937 INFO L902 garLoopResultBuilder]: At program point ssl3_connect_returnLabel#1(lines 18 631) the Hoare annotation is: true [2023-02-16 00:42:41,937 INFO L899 garLoopResultBuilder]: For program point L243(lines 243 248) no Hoare annotation was computed. [2023-02-16 00:42:41,937 INFO L899 garLoopResultBuilder]: For program point L310(lines 310 314) no Hoare annotation was computed. [2023-02-16 00:42:41,938 INFO L899 garLoopResultBuilder]: For program point L310-2(lines 310 314) no Hoare annotation was computed. [2023-02-16 00:42:41,938 INFO L899 garLoopResultBuilder]: For program point L178(lines 178 559) no Hoare annotation was computed. [2023-02-16 00:42:41,938 INFO L899 garLoopResultBuilder]: For program point L145(lines 145 570) no Hoare annotation was computed. [2023-02-16 00:42:41,938 INFO L899 garLoopResultBuilder]: For program point L112(lines 112 581) no Hoare annotation was computed. [2023-02-16 00:42:41,938 INFO L899 garLoopResultBuilder]: For program point L443(lines 443 447) no Hoare annotation was computed. [2023-02-16 00:42:41,938 INFO L899 garLoopResultBuilder]: For program point L443-2(lines 213 545) no Hoare annotation was computed. [2023-02-16 00:42:41,938 INFO L899 garLoopResultBuilder]: For program point L311(line 311) no Hoare annotation was computed. [2023-02-16 00:42:41,938 INFO L899 garLoopResultBuilder]: For program point L311-2(line 311) no Hoare annotation was computed. [2023-02-16 00:42:41,938 INFO L899 garLoopResultBuilder]: For program point L311-4(line 311) no Hoare annotation was computed. [2023-02-16 00:42:41,938 INFO L895 garLoopResultBuilder]: At program point ssl3_connect_switch_1_4481#1(lines 175 560) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4512)) (.cse1 (<= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 4)) (.cse2 (<= 4432 |ULTIMATE.start_ssl3_connect_~s__state~0#1|))) (or (and (= 0 |ULTIMATE.start_ssl3_connect_~s__hit~0#1|) .cse0 .cse1 .cse2 (= |ULTIMATE.start_ssl3_connect_~ag_Z~0#1| 48)) (and .cse0 .cse1 .cse2 (<= |ULTIMATE.start_ssl3_connect_~ag_Y~0#1| 208) (not (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0))))) [2023-02-16 00:42:41,938 INFO L899 garLoopResultBuilder]: For program point L378(lines 378 382) no Hoare annotation was computed. [2023-02-16 00:42:41,938 INFO L895 garLoopResultBuilder]: At program point ssl3_connect_switch_1_4513#1(lines 187 556) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4528)) (.cse1 (<= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 4)) (.cse2 (<= 4432 |ULTIMATE.start_ssl3_connect_~s__state~0#1|))) (or (and .cse0 .cse1 .cse2 (<= |ULTIMATE.start_ssl3_connect_~ag_Y~0#1| 208) (not (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0))) (and (= 0 |ULTIMATE.start_ssl3_connect_~s__hit~0#1|) .cse0 .cse1 .cse2 (= |ULTIMATE.start_ssl3_connect_~ag_Z~0#1| 48)))) [2023-02-16 00:42:41,938 INFO L899 garLoopResultBuilder]: For program point L412(lines 412 417) no Hoare annotation was computed. [2023-02-16 00:42:41,938 INFO L899 garLoopResultBuilder]: For program point L412-2(lines 412 417) no Hoare annotation was computed. [2023-02-16 00:42:41,938 INFO L899 garLoopResultBuilder]: For program point L313(line 313) no Hoare annotation was computed. [2023-02-16 00:42:41,938 INFO L902 garLoopResultBuilder]: At program point ssl3_connect_switch_1_default#1(lines 211 548) the Hoare annotation is: true [2023-02-16 00:42:41,939 INFO L899 garLoopResultBuilder]: For program point L313-2(line 313) no Hoare annotation was computed. [2023-02-16 00:42:41,939 INFO L899 garLoopResultBuilder]: For program point L181(lines 181 558) no Hoare annotation was computed. [2023-02-16 00:42:41,939 INFO L899 garLoopResultBuilder]: For program point L313-4(line 313) no Hoare annotation was computed. [2023-02-16 00:42:41,939 INFO L899 garLoopResultBuilder]: For program point L148(lines 148 569) no Hoare annotation was computed. [2023-02-16 00:42:41,939 INFO L899 garLoopResultBuilder]: For program point L115(lines 115 580) no Hoare annotation was computed. [2023-02-16 00:42:41,939 INFO L895 garLoopResultBuilder]: At program point ssl3_connect_ERROR#1(lines 76 630) the Hoare annotation is: false [2023-02-16 00:42:41,939 INFO L899 garLoopResultBuilder]: For program point L84(lines 84 92) no Hoare annotation was computed. [2023-02-16 00:42:41,939 INFO L895 garLoopResultBuilder]: At program point ssl3_connect_switch_1_4449#1(lines 157 566) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4464)) (.cse1 (<= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 4)) (.cse2 (<= 4432 |ULTIMATE.start_ssl3_connect_~s__state~0#1|))) (or (and (= 0 |ULTIMATE.start_ssl3_connect_~s__hit~0#1|) .cse0 .cse1 .cse2 (= |ULTIMATE.start_ssl3_connect_~ag_Z~0#1| 48)) (and .cse0 .cse1 .cse2 (<= |ULTIMATE.start_ssl3_connect_~ag_Y~0#1| 208) (not (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0))))) [2023-02-16 00:42:41,939 INFO L902 garLoopResultBuilder]: At program point L613(lines 76 630) the Hoare annotation is: true [2023-02-16 00:42:41,939 INFO L899 garLoopResultBuilder]: For program point L184(lines 184 557) no Hoare annotation was computed. [2023-02-16 00:42:41,939 INFO L895 garLoopResultBuilder]: At program point ssl3_connect_switch_1_12292#1(lines 112 581) the Hoare annotation is: (let ((.cse2 (= 0 |ULTIMATE.start_ssl3_connect_~blastFlag~0#1|)) (.cse4 (<= |ULTIMATE.start_ssl3_connect_~ag_Y~0#1| 208)) (.cse5 (not (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0))) (.cse0 (= 0 |ULTIMATE.start_ssl3_connect_~s__hit~0#1|)) (.cse1 (= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 12292)) (.cse6 (= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 2)) (.cse3 (= |ULTIMATE.start_ssl3_connect_~ag_Z~0#1| 48))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse1 .cse2 .cse4 .cse5) (and .cse1 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse6 .cse3))) [2023-02-16 00:42:41,939 INFO L899 garLoopResultBuilder]: For program point L151(lines 151 568) no Hoare annotation was computed. [2023-02-16 00:42:41,939 INFO L899 garLoopResultBuilder]: For program point L118(lines 118 579) no Hoare annotation was computed. [2023-02-16 00:42:41,939 INFO L895 garLoopResultBuilder]: At program point ssl3_connect_switch_1_4497#1(lines 181 558) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4512)) (.cse1 (<= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 4)) (.cse2 (<= 4432 |ULTIMATE.start_ssl3_connect_~s__state~0#1|))) (or (and (= 0 |ULTIMATE.start_ssl3_connect_~s__hit~0#1|) .cse0 .cse1 .cse2 (= |ULTIMATE.start_ssl3_connect_~ag_Z~0#1| 48)) (and .cse0 .cse1 .cse2 (<= |ULTIMATE.start_ssl3_connect_~ag_Y~0#1| 208) (not (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0))))) [2023-02-16 00:42:41,940 INFO L899 garLoopResultBuilder]: For program point L383(lines 383 387) no Hoare annotation was computed. [2023-02-16 00:42:41,940 INFO L899 garLoopResultBuilder]: For program point L383-2(lines 383 387) no Hoare annotation was computed. [2023-02-16 00:42:41,940 INFO L895 garLoopResultBuilder]: At program point L218(lines 115 580) the Hoare annotation is: (let ((.cse2 (= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 2)) (.cse0 (<= |ULTIMATE.start_ssl3_connect_~ag_Y~0#1| 208)) (.cse1 (not (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0))) (.cse3 (= 0 |ULTIMATE.start_ssl3_connect_~s__hit~0#1|)) (.cse5 (= 0 |ULTIMATE.start_ssl3_connect_~blastFlag~0#1|)) (.cse6 (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4352)) (.cse4 (= |ULTIMATE.start_ssl3_connect_~ag_Z~0#1| 48))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse2 .cse4) (and .cse5 .cse6 .cse0 .cse1) (and .cse3 .cse5 .cse6 .cse4))) [2023-02-16 00:42:41,940 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_~ag_Y~0#1| 208) (= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 2)) (and (= 0 |ULTIMATE.start_ssl3_connect_~s__hit~0#1|) .cse0))) [2023-02-16 00:42:41,940 INFO L899 garLoopResultBuilder]: For program point L582(lines 582 610) no Hoare annotation was computed. [2023-02-16 00:42:41,940 INFO L899 garLoopResultBuilder]: For program point L87(lines 87 91) no Hoare annotation was computed. [2023-02-16 00:42:41,940 INFO L899 garLoopResultBuilder]: For program point L87-2(lines 84 92) no Hoare annotation was computed. [2023-02-16 00:42:41,940 INFO L899 garLoopResultBuilder]: For program point L583(lines 583 607) no Hoare annotation was computed. [2023-02-16 00:42:41,940 INFO L899 garLoopResultBuilder]: For program point L517-1(lines 213 545) no Hoare annotation was computed. [2023-02-16 00:42:41,940 INFO L899 garLoopResultBuilder]: For program point L352(lines 352 357) no Hoare annotation was computed. [2023-02-16 00:42:41,940 INFO L899 garLoopResultBuilder]: For program point L286(lines 286 290) no Hoare annotation was computed. [2023-02-16 00:42:41,940 INFO L899 garLoopResultBuilder]: For program point L319-1(lines 319 333) no Hoare annotation was computed. [2023-02-16 00:42:41,940 INFO L899 garLoopResultBuilder]: For program point L187(lines 187 556) no Hoare annotation was computed. [2023-02-16 00:42:41,940 INFO L899 garLoopResultBuilder]: For program point L154(lines 154 567) no Hoare annotation was computed. [2023-02-16 00:42:41,952 INFO L899 garLoopResultBuilder]: For program point L121(lines 121 578) no Hoare annotation was computed. [2023-02-16 00:42:41,952 INFO L899 garLoopResultBuilder]: For program point L617(lines 617 621) no Hoare annotation was computed. [2023-02-16 00:42:41,953 INFO L899 garLoopResultBuilder]: For program point L584(lines 584 593) no Hoare annotation was computed. [2023-02-16 00:42:41,953 INFO L899 garLoopResultBuilder]: For program point L617-2(lines 617 621) no Hoare annotation was computed. [2023-02-16 00:42:41,953 INFO L899 garLoopResultBuilder]: For program point L584-2(lines 583 605) no Hoare annotation was computed. [2023-02-16 00:42:41,954 INFO L895 garLoopResultBuilder]: At program point ssl3_connect_switch_1_4529#1(lines 193 554) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 4)) (.cse1 (<= 4432 |ULTIMATE.start_ssl3_connect_~s__state~0#1|))) (or (and .cse0 .cse1 (<= |ULTIMATE.start_ssl3_connect_~ag_Y~0#1| 208) (not (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0))) (and (= 0 |ULTIMATE.start_ssl3_connect_~s__hit~0#1|) .cse0 .cse1 (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4560) (= |ULTIMATE.start_ssl3_connect_~ag_Z~0#1| 48)))) [2023-02-16 00:42:41,954 INFO L899 garLoopResultBuilder]: For program point L586(lines 586 590) no Hoare annotation was computed. [2023-02-16 00:42:41,954 INFO L899 garLoopResultBuilder]: For program point L454(lines 454 459) no Hoare annotation was computed. [2023-02-16 00:42:41,954 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-02-16 00:42:41,954 INFO L899 garLoopResultBuilder]: For program point L223(lines 223 227) no Hoare annotation was computed. [2023-02-16 00:42:41,954 INFO L899 garLoopResultBuilder]: For program point L190(lines 190 555) no Hoare annotation was computed. [2023-02-16 00:42:41,954 INFO L899 garLoopResultBuilder]: For program point L157(lines 157 566) no Hoare annotation was computed. [2023-02-16 00:42:41,954 INFO L899 garLoopResultBuilder]: For program point L223-2(lines 213 545) no Hoare annotation was computed. [2023-02-16 00:42:41,955 INFO L899 garLoopResultBuilder]: For program point L124(lines 124 577) no Hoare annotation was computed. [2023-02-16 00:42:41,955 INFO L895 garLoopResultBuilder]: At program point ssl3_connect_switch_1_4385#1(lines 133 574) the Hoare annotation is: (let ((.cse2 (<= |ULTIMATE.start_ssl3_connect_~ag_Y~0#1| 208)) (.cse4 (not (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0))) (.cse5 (= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 2)) (.cse0 (not (<= 4400 |ULTIMATE.start_ssl3_connect_~s__state~0#1|))) (.cse6 (= 0 |ULTIMATE.start_ssl3_connect_~s__hit~0#1|)) (.cse1 (= 1 |ULTIMATE.start_ssl3_connect_~blastFlag~0#1|)) (.cse3 (<= 4352 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (.cse7 (= |ULTIMATE.start_ssl3_connect_~ag_Z~0#1| 48))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse6 .cse3 .cse5 .cse7) (and .cse0 .cse6 .cse1 .cse3 .cse7))) [2023-02-16 00:42:41,955 INFO L895 garLoopResultBuilder]: At program point $Ultimate##192(lines 501 513) the Hoare annotation is: (let ((.cse3 (= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 2)) (.cse0 (= 0 |ULTIMATE.start_ssl3_connect_~s__hit~0#1|)) (.cse4 (= |ULTIMATE.start_ssl3_connect_~ag_Z~0#1| 48)) (.cse7 (<= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 4)) (.cse1 (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4352)) (.cse5 (<= |ULTIMATE.start_ssl3_connect_~ag_Y~0#1| 208)) (.cse2 (<= 4352 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (.cse6 (not (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse5 .cse2 .cse6 .cse3) (and .cse0 (<= |ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1| 4560) .cse7 .cse1 .cse2 (<= 4560 |ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1|) .cse4) (and (= |ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1| 3) .cse7 .cse1 .cse5 .cse2 .cse6))) [2023-02-16 00:42:41,955 INFO L899 garLoopResultBuilder]: For program point L488(lines 488 492) no Hoare annotation was computed. [2023-02-16 00:42:41,955 INFO L902 garLoopResultBuilder]: At program point $Ultimate##197(lines 517 521) the Hoare annotation is: true [2023-02-16 00:42:41,955 INFO L899 garLoopResultBuilder]: For program point L323(lines 323 327) no Hoare annotation was computed. [2023-02-16 00:42:41,955 INFO L899 garLoopResultBuilder]: For program point L323-2(lines 321 333) no Hoare annotation was computed. [2023-02-16 00:42:41,955 INFO L899 garLoopResultBuilder]: For program point L522-1(lines 522 526) no Hoare annotation was computed. [2023-02-16 00:42:41,956 INFO L899 garLoopResultBuilder]: For program point L423(lines 423 427) no Hoare annotation was computed. [2023-02-16 00:42:41,956 INFO L895 garLoopResultBuilder]: At program point ssl3_connect_switch_1_4369#1(lines 127 576) the Hoare annotation is: (let ((.cse4 (= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 2)) (.cse5 (= 0 |ULTIMATE.start_ssl3_connect_~s__hit~0#1|)) (.cse6 (= |ULTIMATE.start_ssl3_connect_~ag_Z~0#1| 48)) (.cse0 (not (<= 4400 |ULTIMATE.start_ssl3_connect_~s__state~0#1|))) (.cse7 (= 0 |ULTIMATE.start_ssl3_connect_~blastFlag~0#1|)) (.cse1 (<= |ULTIMATE.start_ssl3_connect_~ag_Y~0#1| 208)) (.cse2 (<= 4352 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (.cse3 (not (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse5 .cse2 .cse4 .cse6) (and .cse0 .cse5 .cse7 .cse2 .cse6) (and .cse0 .cse7 .cse1 .cse2 .cse3))) [2023-02-16 00:42:41,956 INFO L895 garLoopResultBuilder]: At program point $Ultimate##137(lines 319 333) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4432)) (.cse1 (= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 2))) (or (and (= 0 |ULTIMATE.start_ssl3_connect_~s__hit~0#1|) (not (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4384)) .cse0 .cse1 (= |ULTIMATE.start_ssl3_connect_~ag_Z~0#1| 48)) (and (<= |ULTIMATE.start_ssl3_connect_~ag_Y~0#1| 208) .cse0 (<= 4352 |ULTIMATE.start_ssl3_connect_~s__state~0#1|) (not (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0)) .cse1))) [2023-02-16 00:42:41,956 INFO L899 garLoopResultBuilder]: For program point L259(lines 259 264) no Hoare annotation was computed. [2023-02-16 00:42:41,956 INFO L899 garLoopResultBuilder]: For program point L193(lines 193 554) no Hoare annotation was computed. [2023-02-16 00:42:41,956 INFO L899 garLoopResultBuilder]: For program point L160(lines 160 565) no Hoare annotation was computed. [2023-02-16 00:42:41,956 INFO L899 garLoopResultBuilder]: For program point L127(lines 127 576) no Hoare annotation was computed. [2023-02-16 00:42:41,956 INFO L899 garLoopResultBuilder]: For program point L94(lines 94 102) no Hoare annotation was computed. [2023-02-16 00:42:41,957 INFO L899 garLoopResultBuilder]: For program point L94-1(lines 76 630) no Hoare annotation was computed. [2023-02-16 00:42:41,957 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-02-16 00:42:41,957 INFO L895 garLoopResultBuilder]: At program point ssl3_connect_switch_1_4467#1(lines 163 564) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4480)) (.cse1 (<= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 4)) (.cse2 (<= 4432 |ULTIMATE.start_ssl3_connect_~s__state~0#1|))) (or (and .cse0 .cse1 .cse2 (<= |ULTIMATE.start_ssl3_connect_~ag_Y~0#1| 208) (not (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0))) (and (= 0 |ULTIMATE.start_ssl3_connect_~s__hit~0#1|) .cse0 .cse1 .cse2 (= |ULTIMATE.start_ssl3_connect_~ag_Z~0#1| 48)))) [2023-02-16 00:42:41,957 INFO L899 garLoopResultBuilder]: For program point L95(lines 95 99) no Hoare annotation was computed. [2023-02-16 00:42:41,957 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-02-16 00:42:41,957 INFO L899 garLoopResultBuilder]: For program point L493(lines 493 497) no Hoare annotation was computed. [2023-02-16 00:42:41,957 INFO L899 garLoopResultBuilder]: For program point L493-2(lines 493 497) no Hoare annotation was computed. [2023-02-16 00:42:41,957 INFO L899 garLoopResultBuilder]: For program point L295(lines 295 303) no Hoare annotation was computed. [2023-02-16 00:42:41,958 INFO L899 garLoopResultBuilder]: For program point L196(lines 196 553) no Hoare annotation was computed. [2023-02-16 00:42:41,958 INFO L899 garLoopResultBuilder]: For program point L163(lines 163 564) no Hoare annotation was computed. [2023-02-16 00:42:41,958 INFO L899 garLoopResultBuilder]: For program point L130(lines 130 575) no Hoare annotation was computed. [2023-02-16 00:42:41,959 INFO L895 garLoopResultBuilder]: At program point $Ultimate##209(lines 582 610) the Hoare annotation is: (let ((.cse12 (= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4368)) (.cse13 (= 0 |ULTIMATE.start_ssl3_connect_~blastFlag~0#1|)) (.cse1 (<= |ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1| 4560)) (.cse10 (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4352)) (.cse11 (<= 4352 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (.cse3 (<= 4560 |ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1|)) (.cse14 (= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4384)) (.cse15 (= 1 |ULTIMATE.start_ssl3_connect_~blastFlag~0#1|)) (.cse7 (= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 2)) (.cse8 (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4528)) (.cse9 (<= 4432 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (.cse0 (= 0 |ULTIMATE.start_ssl3_connect_~s__hit~0#1|)) (.cse4 (= |ULTIMATE.start_ssl3_connect_~ag_Z~0#1| 48)) (.cse2 (<= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 4)) (.cse16 (= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4416)) (.cse5 (<= |ULTIMATE.start_ssl3_connect_~ag_Y~0#1| 208)) (.cse6 (not (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0)))) (or (and .cse0 .cse1 .cse2 (<= 4560 |ULTIMATE.start_ssl3_connect_~s__state~0#1|) .cse3 (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4560) .cse4) (and .cse5 .cse6 .cse7) (and .cse8 .cse2 .cse9 .cse5 .cse6) (and (= |ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1| 3) .cse2 .cse10 .cse5 .cse11 .cse6) (and .cse12 .cse13 .cse5 .cse6) (= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 3) (and .cse14 .cse15 .cse5 .cse6) (and .cse0 .cse12 .cse13 .cse4) (and .cse0 (= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 48) .cse4) (and .cse0 .cse1 .cse2 .cse10 .cse11 .cse3 .cse4) (and .cse0 .cse14 .cse15 .cse4) (and .cse0 .cse7 .cse4) (and .cse0 .cse8 .cse2 .cse9 .cse4) (and .cse0 .cse2 .cse16 .cse4) (and .cse2 .cse16 .cse5 .cse6))) [2023-02-16 00:42:41,959 INFO L899 garLoopResultBuilder]: For program point L395(lines 395 399) no Hoare annotation was computed. [2023-02-16 00:42:41,959 INFO L899 garLoopResultBuilder]: For program point L362(lines 362 366) no Hoare annotation was computed. [2023-02-16 00:42:41,959 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-02-16 00:42:41,959 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 624) no Hoare annotation was computed. [2023-02-16 00:42:41,959 INFO L902 garLoopResultBuilder]: At program point L628(lines 76 630) the Hoare annotation is: true [2023-02-16 00:42:41,959 INFO L899 garLoopResultBuilder]: For program point L595(lines 595 601) no Hoare annotation was computed. [2023-02-16 00:42:41,959 INFO L899 garLoopResultBuilder]: For program point L529(lines 529 533) no Hoare annotation was computed. [2023-02-16 00:42:41,960 INFO L899 garLoopResultBuilder]: For program point L529-2(lines 529 533) no Hoare annotation was computed. [2023-02-16 00:42:41,960 INFO L899 garLoopResultBuilder]: For program point L298(lines 298 302) no Hoare annotation was computed. [2023-02-16 00:42:41,960 INFO L899 garLoopResultBuilder]: For program point L298-2(lines 213 545) no Hoare annotation was computed. [2023-02-16 00:42:41,961 INFO L899 garLoopResultBuilder]: For program point L199(lines 199 552) no Hoare annotation was computed. [2023-02-16 00:42:41,961 INFO L899 garLoopResultBuilder]: For program point L166(lines 166 563) no Hoare annotation was computed. [2023-02-16 00:42:41,961 INFO L899 garLoopResultBuilder]: For program point L133(lines 133 574) no Hoare annotation was computed. [2023-02-16 00:42:41,961 INFO L899 garLoopResultBuilder]: For program point L464(lines 464 468) no Hoare annotation was computed. [2023-02-16 00:42:41,964 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-16 00:42:41,965 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-16 00:42:41,994 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.02 12:42:41 BoogieIcfgContainer [2023-02-16 00:42:41,994 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-16 00:42:41,995 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-16 00:42:41,995 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-16 00:42:41,995 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-16 00:42:41,995 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 12:42:29" (3/4) ... [2023-02-16 00:42:41,997 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-02-16 00:42:42,012 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2023-02-16 00:42:42,013 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2023-02-16 00:42:42,013 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2023-02-16 00:42:42,013 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-02-16 00:42:42,080 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-16 00:42:42,081 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-16 00:42:42,081 INFO L158 Benchmark]: Toolchain (without parser) took 13269.10ms. Allocated memory was 136.3MB in the beginning and 761.3MB in the end (delta: 625.0MB). Free memory was 105.1MB in the beginning and 623.2MB in the end (delta: -518.1MB). Peak memory consumption was 109.8MB. Max. memory is 16.1GB. [2023-02-16 00:42:42,081 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 96.5MB. Free memory is still 48.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-16 00:42:42,081 INFO L158 Benchmark]: CACSL2BoogieTranslator took 208.57ms. Allocated memory is still 136.3MB. Free memory was 105.1MB in the beginning and 90.2MB in the end (delta: 14.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-02-16 00:42:42,082 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.94ms. Allocated memory is still 136.3MB. Free memory was 90.2MB in the beginning and 87.3MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-02-16 00:42:42,082 INFO L158 Benchmark]: Boogie Preprocessor took 44.66ms. Allocated memory is still 136.3MB. Free memory was 87.3MB in the beginning and 85.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-16 00:42:42,082 INFO L158 Benchmark]: RCFGBuilder took 518.99ms. Allocated memory is still 136.3MB. Free memory was 84.7MB in the beginning and 103.7MB in the end (delta: -18.9MB). Peak memory consumption was 37.6MB. Max. memory is 16.1GB. [2023-02-16 00:42:42,084 INFO L158 Benchmark]: TraceAbstraction took 12372.00ms. Allocated memory was 136.3MB in the beginning and 761.3MB in the end (delta: 625.0MB). Free memory was 103.0MB in the beginning and 630.5MB in the end (delta: -527.5MB). Peak memory consumption was 309.2MB. Max. memory is 16.1GB. [2023-02-16 00:42:42,084 INFO L158 Benchmark]: Witness Printer took 85.87ms. Allocated memory is still 761.3MB. Free memory was 630.5MB in the beginning and 623.2MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-02-16 00:42:42,090 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.13ms. Allocated memory is still 96.5MB. Free memory is still 48.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 208.57ms. Allocated memory is still 136.3MB. Free memory was 105.1MB in the beginning and 90.2MB in the end (delta: 14.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.94ms. Allocated memory is still 136.3MB. Free memory was 90.2MB in the beginning and 87.3MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.66ms. Allocated memory is still 136.3MB. Free memory was 87.3MB in the beginning and 85.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 518.99ms. Allocated memory is still 136.3MB. Free memory was 84.7MB in the beginning and 103.7MB in the end (delta: -18.9MB). Peak memory consumption was 37.6MB. Max. memory is 16.1GB. * TraceAbstraction took 12372.00ms. Allocated memory was 136.3MB in the beginning and 761.3MB in the end (delta: 625.0MB). Free memory was 103.0MB in the beginning and 630.5MB in the end (delta: -527.5MB). Peak memory consumption was 309.2MB. Max. memory is 16.1GB. * Witness Printer took 85.87ms. Allocated memory is still 761.3MB. Free memory was 630.5MB in the beginning and 623.2MB 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: 12.3s, OverallIterations: 25, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 3.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2709 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2709 mSDsluCounter, 9568 SdHoareTripleChecker+Invalid, 1.9s 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.1s 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.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.2s 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: ((((((!(4400 <= s__state) && ag_Y <= 208) && 4352 <= s__state) && !(s__hit == 0)) && blastFlag == 2) || ((((!(4400 <= s__state) && 0 == s__hit) && 4352 <= s__state) && blastFlag == 2) && ag_Z == 48)) || ((((!(4400 <= s__state) && 0 == s__hit) && 0 == blastFlag) && 4352 <= s__state) && ag_Z == 48)) || ((((!(4400 <= s__state) && 0 == blastFlag) && ag_Y <= 208) && 4352 <= s__state) && !(s__hit == 0)) - InvariantResult [Line: 151]: Loop Invariant Derived loop invariant: ((((0 == s__hit && blastFlag <= 4) && s__state <= 4448) && 4432 <= s__state) && ag_Z == 48) || ((((blastFlag <= 4 && s__state <= 4448) && 4432 <= s__state) && ag_Y <= 208) && !(s__hit == 0)) - InvariantResult [Line: 133]: Loop Invariant Derived loop invariant: ((((((!(4400 <= s__state) && 1 == blastFlag) && ag_Y <= 208) && 4352 <= s__state) && !(s__hit == 0)) || ((((!(4400 <= s__state) && ag_Y <= 208) && 4352 <= s__state) && !(s__hit == 0)) && blastFlag == 2)) || ((((!(4400 <= s__state) && 0 == s__hit) && 4352 <= s__state) && blastFlag == 2) && ag_Z == 48)) || ((((!(4400 <= s__state) && 0 == s__hit) && 1 == blastFlag) && 4352 <= s__state) && ag_Z == 48) - InvariantResult [Line: 112]: Loop Invariant Derived loop invariant: (((((0 == s__hit && s__state == 12292) && 0 == blastFlag) && ag_Z == 48) || (((s__state == 12292 && 0 == blastFlag) && ag_Y <= 208) && !(s__hit == 0))) || (((s__state == 12292 && ag_Y <= 208) && !(s__hit == 0)) && blastFlag == 2)) || (((0 == s__hit && s__state == 12292) && blastFlag == 2) && ag_Z == 48) - InvariantResult [Line: 501]: Loop Invariant Derived loop invariant: ((((((0 == s__hit && s__state <= 4352) && 4352 <= s__state) && blastFlag == 2) && ag_Z == 48) || ((((s__state <= 4352 && ag_Y <= 208) && 4352 <= s__state) && !(s__hit == 0)) && blastFlag == 2)) || ((((((0 == s__hit && s__s3__tmp__next_state___0 <= 4560) && blastFlag <= 4) && s__state <= 4352) && 4352 <= s__state) && 4560 <= s__s3__tmp__next_state___0) && ag_Z == 48)) || (((((s__s3__tmp__next_state___0 == 3 && blastFlag <= 4) && s__state <= 4352) && ag_Y <= 208) && 4352 <= s__state) && !(s__hit == 0)) - InvariantResult [Line: 109]: Loop Invariant Derived loop invariant: ((((((((((((((((((0 == s__hit && s__state == 12292) && 0 == blastFlag) && ag_Z == 48) || ((((((0 == s__hit && s__s3__tmp__next_state___0 <= 4560) && blastFlag <= 4) && 4560 <= s__state) && 4560 <= s__s3__tmp__next_state___0) && s__state <= 4560) && ag_Z == 48)) || ((ag_Y <= 208 && !(s__hit == 0)) && blastFlag == 2)) || ((((s__state <= 4528 && blastFlag <= 4) && 4432 <= s__state) && ag_Y <= 208) && !(s__hit == 0))) || (((((s__s3__tmp__next_state___0 == 3 && blastFlag <= 4) && s__state <= 4352) && ag_Y <= 208) && 4352 <= s__state) && !(s__hit == 0))) || (((s__state == 4368 && 0 == blastFlag) && ag_Y <= 208) && !(s__hit == 0))) || s__state == 3) || (((s__state == 4384 && 1 == blastFlag) && ag_Y <= 208) && !(s__hit == 0))) || (((0 == s__hit && s__state == 4368) && 0 == blastFlag) && ag_Z == 48)) || ((0 == s__hit && s__state == 48) && ag_Z == 48)) || (((s__state == 12292 && 0 == blastFlag) && ag_Y <= 208) && !(s__hit == 0))) || ((((((0 == s__hit && s__s3__tmp__next_state___0 <= 4560) && blastFlag <= 4) && s__state <= 4352) && 4352 <= s__state) && 4560 <= s__s3__tmp__next_state___0) && ag_Z == 48)) || (((0 == s__hit && s__state == 4384) && 1 == blastFlag) && ag_Z == 48)) || ((0 == s__hit && blastFlag == 2) && ag_Z == 48)) || ((((0 == s__hit && s__state <= 4528) && blastFlag <= 4) && 4432 <= s__state) && ag_Z == 48)) || (((0 == s__hit && blastFlag <= 4) && s__state == 4416) && ag_Z == 48)) || (((blastFlag <= 4 && s__state == 4416) && ag_Y <= 208) && !(s__hit == 0)) - InvariantResult [Line: 76]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 157]: Loop Invariant Derived loop invariant: ((((0 == s__hit && s__state <= 4464) && blastFlag <= 4) && 4432 <= s__state) && ag_Z == 48) || ((((s__state <= 4464 && blastFlag <= 4) && 4432 <= s__state) && ag_Y <= 208) && !(s__hit == 0)) - InvariantResult [Line: 18]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 163]: Loop Invariant Derived loop invariant: ((((s__state <= 4480 && blastFlag <= 4) && 4432 <= s__state) && ag_Y <= 208) && !(s__hit == 0)) || ((((0 == s__hit && s__state <= 4480) && blastFlag <= 4) && 4432 <= s__state) && ag_Z == 48) - InvariantResult [Line: 115]: Loop Invariant Derived loop invariant: ((((ag_Y <= 208 && !(s__hit == 0)) && blastFlag == 2) || ((0 == s__hit && blastFlag == 2) && ag_Z == 48)) || (((0 == blastFlag && s__state <= 4352) && ag_Y <= 208) && !(s__hit == 0))) || (((0 == s__hit && 0 == blastFlag) && s__state <= 4352) && ag_Z == 48) - InvariantResult [Line: 193]: Loop Invariant Derived loop invariant: (((blastFlag <= 4 && 4432 <= s__state) && ag_Y <= 208) && !(s__hit == 0)) || ((((0 == s__hit && blastFlag <= 4) && 4432 <= s__state) && s__state <= 4560) && ag_Z == 48) - InvariantResult [Line: 145]: Loop Invariant Derived loop invariant: ((((blastFlag <= 4 && ag_Y <= 208) && s__state <= 4432) && 4352 <= s__state) && !(s__hit == 0)) || ((((0 == s__hit && !(s__state <= 4384)) && blastFlag <= 4) && s__state <= 4432) && ag_Z == 48) - InvariantResult [Line: 76]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 187]: Loop Invariant Derived loop invariant: ((((s__state <= 4528 && blastFlag <= 4) && 4432 <= s__state) && ag_Y <= 208) && !(s__hit == 0)) || ((((0 == s__hit && s__state <= 4528) && blastFlag <= 4) && 4432 <= s__state) && ag_Z == 48) - InvariantResult [Line: 582]: Loop Invariant Derived loop invariant: (((((((((((((((((((0 == s__hit && s__s3__tmp__next_state___0 <= 4560) && blastFlag <= 4) && 4560 <= s__state) && 4560 <= s__s3__tmp__next_state___0) && s__state <= 4560) && ag_Z == 48) || ((ag_Y <= 208 && !(s__hit == 0)) && blastFlag == 2)) || ((((s__state <= 4528 && blastFlag <= 4) && 4432 <= s__state) && ag_Y <= 208) && !(s__hit == 0))) || (((((s__s3__tmp__next_state___0 == 3 && blastFlag <= 4) && s__state <= 4352) && ag_Y <= 208) && 4352 <= s__state) && !(s__hit == 0))) || (((s__state == 4368 && 0 == blastFlag) && ag_Y <= 208) && !(s__hit == 0))) || s__state == 3) || (((s__state == 4384 && 1 == blastFlag) && ag_Y <= 208) && !(s__hit == 0))) || (((0 == s__hit && s__state == 4368) && 0 == blastFlag) && ag_Z == 48)) || ((0 == s__hit && s__state == 48) && ag_Z == 48)) || ((((((0 == s__hit && s__s3__tmp__next_state___0 <= 4560) && blastFlag <= 4) && s__state <= 4352) && 4352 <= s__state) && 4560 <= s__s3__tmp__next_state___0) && ag_Z == 48)) || (((0 == s__hit && s__state == 4384) && 1 == blastFlag) && ag_Z == 48)) || ((0 == s__hit && blastFlag == 2) && ag_Z == 48)) || ((((0 == s__hit && s__state <= 4528) && blastFlag <= 4) && 4432 <= s__state) && ag_Z == 48)) || (((0 == s__hit && blastFlag <= 4) && s__state == 4416) && ag_Z == 48)) || (((blastFlag <= 4 && s__state == 4416) && ag_Y <= 208) && !(s__hit == 0)) - InvariantResult [Line: 632]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 181]: Loop Invariant Derived loop invariant: ((((0 == s__hit && s__state <= 4512) && blastFlag <= 4) && 4432 <= s__state) && ag_Z == 48) || ((((s__state <= 4512 && blastFlag <= 4) && 4432 <= s__state) && ag_Y <= 208) && !(s__hit == 0)) - InvariantResult [Line: 517]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 319]: Loop Invariant Derived loop invariant: ((((0 == s__hit && !(s__state <= 4384)) && s__state <= 4432) && blastFlag == 2) && ag_Z == 48) || ((((ag_Y <= 208 && s__state <= 4432) && 4352 <= s__state) && !(s__hit == 0)) && blastFlag == 2) - InvariantResult [Line: 199]: Loop Invariant Derived loop invariant: ((4432 <= s__state && ag_Y <= 208) && blastFlag == 2) || (0 == s__hit && 4432 <= s__state) - InvariantResult [Line: 175]: Loop Invariant Derived loop invariant: ((((0 == s__hit && s__state <= 4512) && blastFlag <= 4) && 4432 <= s__state) && ag_Z == 48) || ((((s__state <= 4512 && blastFlag <= 4) && 4432 <= s__state) && ag_Y <= 208) && !(s__hit == 0)) - 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-16 00:42:42,117 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