./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/openssl-simplified/s3_srvr_4.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 839c364b Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/openssl-simplified/s3_srvr_4.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f559dc59bc463f9a27da280f1f7098996cb99e14cb280bd541f8697a124cb729 --- Real Ultimate output --- This is Ultimate 0.2.2-839c364b5d67a0f615c82cb70ab247790648d4a9-839c364 [2021-12-14 11:44:19,740 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-14 11:44:19,741 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-14 11:44:19,797 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-14 11:44:19,797 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-14 11:44:19,800 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-14 11:44:19,801 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-14 11:44:19,804 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-14 11:44:19,805 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-14 11:44:19,810 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-14 11:44:19,810 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-14 11:44:19,812 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-14 11:44:19,812 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-14 11:44:19,814 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-14 11:44:19,816 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-14 11:44:19,819 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-14 11:44:19,820 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-14 11:44:19,820 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-14 11:44:19,824 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-14 11:44:19,826 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-14 11:44:19,828 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-14 11:44:19,829 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-14 11:44:19,830 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-14 11:44:19,831 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-14 11:44:19,834 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-14 11:44:19,834 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-14 11:44:19,835 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-14 11:44:19,836 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-14 11:44:19,836 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-14 11:44:19,837 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-14 11:44:19,837 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-14 11:44:19,838 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-14 11:44:19,839 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-14 11:44:19,839 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-14 11:44:19,840 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-14 11:44:19,840 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-14 11:44:19,841 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-14 11:44:19,841 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-14 11:44:19,841 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-14 11:44:19,842 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-14 11:44:19,842 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-14 11:44:19,843 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-14 11:44:19,865 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-14 11:44:19,870 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-14 11:44:19,870 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-14 11:44:19,870 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-14 11:44:19,871 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-14 11:44:19,871 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-14 11:44:19,872 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-14 11:44:19,872 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-14 11:44:19,872 INFO L138 SettingsManager]: * Use SBE=true [2021-12-14 11:44:19,872 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-14 11:44:19,872 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-14 11:44:19,872 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-14 11:44:19,873 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-14 11:44:19,873 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-14 11:44:19,873 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-14 11:44:19,873 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-14 11:44:19,873 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-14 11:44:19,873 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-14 11:44:19,874 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-14 11:44:19,874 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-14 11:44:19,874 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-14 11:44:19,874 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-14 11:44:19,874 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-14 11:44:19,874 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-14 11:44:19,874 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 11:44:19,875 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-14 11:44:19,875 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-14 11:44:19,875 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-14 11:44:19,875 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-14 11:44:19,875 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-14 11:44:19,876 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-14 11:44:19,876 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-14 11:44:19,876 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-14 11:44:19,876 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-14 11:44:19,876 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f559dc59bc463f9a27da280f1f7098996cb99e14cb280bd541f8697a124cb729 [2021-12-14 11:44:20,076 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-14 11:44:20,097 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-14 11:44:20,100 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-14 11:44:20,101 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-14 11:44:20,101 INFO L275 PluginConnector]: CDTParser initialized [2021-12-14 11:44:20,102 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/openssl-simplified/s3_srvr_4.cil.c [2021-12-14 11:44:20,152 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10fa90af8/0631096761e047c284ab01ff94d5eefc/FLAG9af4ce198 [2021-12-14 11:44:20,564 INFO L306 CDTParser]: Found 1 translation units. [2021-12-14 11:44:20,564 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl-simplified/s3_srvr_4.cil.c [2021-12-14 11:44:20,577 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10fa90af8/0631096761e047c284ab01ff94d5eefc/FLAG9af4ce198 [2021-12-14 11:44:20,591 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10fa90af8/0631096761e047c284ab01ff94d5eefc [2021-12-14 11:44:20,593 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-14 11:44:20,594 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-14 11:44:20,596 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-14 11:44:20,596 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-14 11:44:20,598 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-14 11:44:20,599 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 11:44:20" (1/1) ... [2021-12-14 11:44:20,600 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@677c65ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:44:20, skipping insertion in model container [2021-12-14 11:44:20,600 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 11:44:20" (1/1) ... [2021-12-14 11:44:20,604 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-14 11:44:20,638 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-14 11:44:20,820 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl-simplified/s3_srvr_4.cil.c[42875,42888] [2021-12-14 11:44:20,825 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 11:44:20,831 INFO L203 MainTranslator]: Completed pre-run [2021-12-14 11:44:20,862 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl-simplified/s3_srvr_4.cil.c[42875,42888] [2021-12-14 11:44:20,864 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 11:44:20,872 INFO L208 MainTranslator]: Completed translation [2021-12-14 11:44:20,873 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:44:20 WrapperNode [2021-12-14 11:44:20,873 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-14 11:44:20,874 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-14 11:44:20,874 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-14 11:44:20,874 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-14 11:44:20,889 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:44:20" (1/1) ... [2021-12-14 11:44:20,895 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:44:20" (1/1) ... [2021-12-14 11:44:20,938 INFO L137 Inliner]: procedures = 15, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 546 [2021-12-14 11:44:20,938 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-14 11:44:20,939 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-14 11:44:20,939 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-14 11:44:20,939 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-14 11:44:20,955 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:44:20" (1/1) ... [2021-12-14 11:44:20,955 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:44:20" (1/1) ... [2021-12-14 11:44:20,971 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:44:20" (1/1) ... [2021-12-14 11:44:20,971 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:44:20" (1/1) ... [2021-12-14 11:44:20,978 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:44:20" (1/1) ... [2021-12-14 11:44:20,989 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:44:20" (1/1) ... [2021-12-14 11:44:20,991 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:44:20" (1/1) ... [2021-12-14 11:44:20,993 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-14 11:44:20,994 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-14 11:44:20,994 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-14 11:44:20,994 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-14 11:44:20,995 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:44:20" (1/1) ... [2021-12-14 11:44:21,000 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 11:44:21,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 11:44:21,025 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) [2021-12-14 11:44:21,027 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 [2021-12-14 11:44:21,051 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-14 11:44:21,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-14 11:44:21,052 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-14 11:44:21,052 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-14 11:44:21,131 INFO L236 CfgBuilder]: Building ICFG [2021-12-14 11:44:21,133 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-14 11:44:21,155 WARN L815 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-12-14 11:44:21,530 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2021-12-14 11:44:21,531 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2021-12-14 11:44:21,531 INFO L277 CfgBuilder]: Performing block encoding [2021-12-14 11:44:21,536 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-14 11:44:21,543 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-14 11:44:21,545 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 11:44:21 BoogieIcfgContainer [2021-12-14 11:44:21,545 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-14 11:44:21,546 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-14 11:44:21,546 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-14 11:44:21,553 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-14 11:44:21,554 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 11:44:20" (1/3) ... [2021-12-14 11:44:21,554 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@302da486 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 11:44:21, skipping insertion in model container [2021-12-14 11:44:21,554 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:44:20" (2/3) ... [2021-12-14 11:44:21,555 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@302da486 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 11:44:21, skipping insertion in model container [2021-12-14 11:44:21,556 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 11:44:21" (3/3) ... [2021-12-14 11:44:21,557 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr_4.cil.c [2021-12-14 11:44:21,560 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-14 11:44:21,560 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-14 11:44:21,591 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-14 11:44:21,602 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-12-14 11:44:21,602 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-14 11:44:21,622 INFO L276 IsEmpty]: Start isEmpty. Operand has 141 states, 139 states have (on average 1.7266187050359711) internal successors, (240), 140 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:44:21,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-12-14 11:44:21,632 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:44:21,633 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:44:21,634 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:44:21,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:44:21,642 INFO L85 PathProgramCache]: Analyzing trace with hash 1632005994, now seen corresponding path program 1 times [2021-12-14 11:44:21,650 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:44:21,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922288178] [2021-12-14 11:44:21,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:44:21,652 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:44:21,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:44:21,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:44:21,837 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:44:21,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922288178] [2021-12-14 11:44:21,838 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922288178] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:44:21,838 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:44:21,838 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 11:44:21,839 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389147492] [2021-12-14 11:44:21,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:44:21,843 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 11:44:21,843 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:44:21,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 11:44:21,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 11:44:21,874 INFO L87 Difference]: Start difference. First operand has 141 states, 139 states have (on average 1.7266187050359711) internal successors, (240), 140 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:44:22,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:44:22,119 INFO L93 Difference]: Finished difference Result 328 states and 564 transitions. [2021-12-14 11:44:22,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 11:44:22,121 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2021-12-14 11:44:22,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:44:22,132 INFO L225 Difference]: With dead ends: 328 [2021-12-14 11:44:22,132 INFO L226 Difference]: Without dead ends: 175 [2021-12-14 11:44:22,135 INFO L932 BasicCegarLoop]: 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 [2021-12-14 11:44:22,139 INFO L933 BasicCegarLoop]: 163 mSDtfsCounter, 170 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 11:44:22,140 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [170 Valid, 190 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 11:44:22,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2021-12-14 11:44:22,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 170. [2021-12-14 11:44:22,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 169 states have (on average 1.6272189349112427) internal successors, (275), 169 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:44:22,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 275 transitions. [2021-12-14 11:44:22,185 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 275 transitions. Word has length 44 [2021-12-14 11:44:22,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:44:22,186 INFO L470 AbstractCegarLoop]: Abstraction has 170 states and 275 transitions. [2021-12-14 11:44:22,186 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:44:22,188 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 275 transitions. [2021-12-14 11:44:22,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-12-14 11:44:22,189 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:44:22,189 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:44:22,190 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-14 11:44:22,190 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:44:22,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:44:22,190 INFO L85 PathProgramCache]: Analyzing trace with hash -954576436, now seen corresponding path program 1 times [2021-12-14 11:44:22,191 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:44:22,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758079271] [2021-12-14 11:44:22,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:44:22,191 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:44:22,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:44:22,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:44:22,279 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:44:22,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758079271] [2021-12-14 11:44:22,279 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758079271] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:44:22,279 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:44:22,280 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 11:44:22,280 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709772695] [2021-12-14 11:44:22,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:44:22,281 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 11:44:22,281 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:44:22,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 11:44:22,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 11:44:22,282 INFO L87 Difference]: Start difference. First operand 170 states and 275 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:44:22,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:44:22,421 INFO L93 Difference]: Finished difference Result 380 states and 624 transitions. [2021-12-14 11:44:22,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 11:44:22,421 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2021-12-14 11:44:22,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:44:22,423 INFO L225 Difference]: With dead ends: 380 [2021-12-14 11:44:22,423 INFO L226 Difference]: Without dead ends: 216 [2021-12-14 11:44:22,424 INFO L932 BasicCegarLoop]: 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 [2021-12-14 11:44:22,425 INFO L933 BasicCegarLoop]: 126 mSDtfsCounter, 129 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 11:44:22,425 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [129 Valid, 142 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 11:44:22,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2021-12-14 11:44:22,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 211. [2021-12-14 11:44:22,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 210 states have (on average 1.6761904761904762) internal successors, (352), 210 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:44:22,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 352 transitions. [2021-12-14 11:44:22,434 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 352 transitions. Word has length 45 [2021-12-14 11:44:22,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:44:22,434 INFO L470 AbstractCegarLoop]: Abstraction has 211 states and 352 transitions. [2021-12-14 11:44:22,434 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:44:22,434 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 352 transitions. [2021-12-14 11:44:22,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-12-14 11:44:22,436 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:44:22,436 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:44:22,436 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-14 11:44:22,437 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:44:22,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:44:22,437 INFO L85 PathProgramCache]: Analyzing trace with hash -1754997851, now seen corresponding path program 1 times [2021-12-14 11:44:22,437 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:44:22,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139619155] [2021-12-14 11:44:22,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:44:22,438 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:44:22,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:44:22,483 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:44:22,484 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:44:22,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139619155] [2021-12-14 11:44:22,484 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139619155] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:44:22,484 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:44:22,484 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 11:44:22,485 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899695393] [2021-12-14 11:44:22,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:44:22,485 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 11:44:22,485 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:44:22,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 11:44:22,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 11:44:22,486 INFO L87 Difference]: Start difference. First operand 211 states and 352 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:44:22,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:44:22,583 INFO L93 Difference]: Finished difference Result 445 states and 750 transitions. [2021-12-14 11:44:22,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 11:44:22,584 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2021-12-14 11:44:22,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:44:22,585 INFO L225 Difference]: With dead ends: 445 [2021-12-14 11:44:22,585 INFO L226 Difference]: Without dead ends: 242 [2021-12-14 11:44:22,586 INFO L932 BasicCegarLoop]: 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 [2021-12-14 11:44:22,587 INFO L933 BasicCegarLoop]: 137 mSDtfsCounter, 136 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 11:44:22,587 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [136 Valid, 155 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 11:44:22,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2021-12-14 11:44:22,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2021-12-14 11:44:22,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 241 states have (on average 1.6929460580912863) internal successors, (408), 241 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:44:22,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 408 transitions. [2021-12-14 11:44:22,595 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 408 transitions. Word has length 72 [2021-12-14 11:44:22,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:44:22,595 INFO L470 AbstractCegarLoop]: Abstraction has 242 states and 408 transitions. [2021-12-14 11:44:22,595 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:44:22,596 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 408 transitions. [2021-12-14 11:44:22,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-12-14 11:44:22,597 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:44:22,598 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:44:22,598 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-14 11:44:22,598 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:44:22,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:44:22,599 INFO L85 PathProgramCache]: Analyzing trace with hash -479038981, now seen corresponding path program 1 times [2021-12-14 11:44:22,599 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:44:22,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106790358] [2021-12-14 11:44:22,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:44:22,599 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:44:22,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:44:22,631 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-12-14 11:44:22,632 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:44:22,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106790358] [2021-12-14 11:44:22,632 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106790358] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:44:22,632 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:44:22,632 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 11:44:22,632 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031145846] [2021-12-14 11:44:22,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:44:22,633 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 11:44:22,633 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:44:22,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 11:44:22,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 11:44:22,634 INFO L87 Difference]: Start difference. First operand 242 states and 408 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:44:22,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:44:22,705 INFO L93 Difference]: Finished difference Result 493 states and 832 transitions. [2021-12-14 11:44:22,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 11:44:22,705 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2021-12-14 11:44:22,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:44:22,707 INFO L225 Difference]: With dead ends: 493 [2021-12-14 11:44:22,707 INFO L226 Difference]: Without dead ends: 259 [2021-12-14 11:44:22,707 INFO L932 BasicCegarLoop]: 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 [2021-12-14 11:44:22,708 INFO L933 BasicCegarLoop]: 137 mSDtfsCounter, 158 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 11:44:22,708 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [158 Valid, 150 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 11:44:22,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2021-12-14 11:44:22,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 257. [2021-12-14 11:44:22,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 256 states have (on average 1.68359375) internal successors, (431), 256 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:44:22,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 431 transitions. [2021-12-14 11:44:22,721 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 431 transitions. Word has length 84 [2021-12-14 11:44:22,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:44:22,721 INFO L470 AbstractCegarLoop]: Abstraction has 257 states and 431 transitions. [2021-12-14 11:44:22,721 INFO L471 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) [2021-12-14 11:44:22,721 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 431 transitions. [2021-12-14 11:44:22,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-12-14 11:44:22,726 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:44:22,726 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:44:22,726 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-14 11:44:22,727 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:44:22,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:44:22,727 INFO L85 PathProgramCache]: Analyzing trace with hash 1816808322, now seen corresponding path program 1 times [2021-12-14 11:44:22,728 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:44:22,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216357520] [2021-12-14 11:44:22,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:44:22,728 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:44:22,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:44:22,764 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:44:22,764 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:44:22,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216357520] [2021-12-14 11:44:22,765 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216357520] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:44:22,765 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:44:22,765 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 11:44:22,765 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840623512] [2021-12-14 11:44:22,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:44:22,765 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 11:44:22,765 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:44:22,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 11:44:22,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 11:44:22,766 INFO L87 Difference]: Start difference. First operand 257 states and 431 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:44:22,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:44:22,863 INFO L93 Difference]: Finished difference Result 553 states and 933 transitions. [2021-12-14 11:44:22,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 11:44:22,866 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2021-12-14 11:44:22,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:44:22,867 INFO L225 Difference]: With dead ends: 553 [2021-12-14 11:44:22,867 INFO L226 Difference]: Without dead ends: 304 [2021-12-14 11:44:22,868 INFO L932 BasicCegarLoop]: 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 [2021-12-14 11:44:22,869 INFO L933 BasicCegarLoop]: 127 mSDtfsCounter, 133 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 11:44:22,869 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [133 Valid, 147 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 11:44:22,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2021-12-14 11:44:22,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 299. [2021-12-14 11:44:22,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 298 states have (on average 1.6946308724832215) internal successors, (505), 298 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:44:22,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 505 transitions. [2021-12-14 11:44:22,876 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 505 transitions. Word has length 84 [2021-12-14 11:44:22,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:44:22,876 INFO L470 AbstractCegarLoop]: Abstraction has 299 states and 505 transitions. [2021-12-14 11:44:22,876 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:44:22,877 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 505 transitions. [2021-12-14 11:44:22,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-12-14 11:44:22,877 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:44:22,877 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:44:22,878 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-14 11:44:22,878 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:44:22,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:44:22,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1697148062, now seen corresponding path program 1 times [2021-12-14 11:44:22,879 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:44:22,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492922257] [2021-12-14 11:44:22,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:44:22,879 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:44:22,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:44:22,916 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-12-14 11:44:22,917 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:44:22,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492922257] [2021-12-14 11:44:22,917 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492922257] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:44:22,917 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:44:22,917 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 11:44:22,918 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186386045] [2021-12-14 11:44:22,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:44:22,919 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 11:44:22,919 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:44:22,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 11:44:22,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 11:44:22,920 INFO L87 Difference]: Start difference. First operand 299 states and 505 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:44:22,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:44:22,998 INFO L93 Difference]: Finished difference Result 592 states and 1000 transitions. [2021-12-14 11:44:22,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 11:44:22,999 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2021-12-14 11:44:22,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:44:23,000 INFO L225 Difference]: With dead ends: 592 [2021-12-14 11:44:23,000 INFO L226 Difference]: Without dead ends: 301 [2021-12-14 11:44:23,001 INFO L932 BasicCegarLoop]: 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 [2021-12-14 11:44:23,002 INFO L933 BasicCegarLoop]: 125 mSDtfsCounter, 157 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 11:44:23,006 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [157 Valid, 138 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 11:44:23,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2021-12-14 11:44:23,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 299. [2021-12-14 11:44:23,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 298 states have (on average 1.6812080536912752) internal successors, (501), 298 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:44:23,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 501 transitions. [2021-12-14 11:44:23,019 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 501 transitions. Word has length 85 [2021-12-14 11:44:23,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:44:23,020 INFO L470 AbstractCegarLoop]: Abstraction has 299 states and 501 transitions. [2021-12-14 11:44:23,020 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:44:23,020 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 501 transitions. [2021-12-14 11:44:23,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-12-14 11:44:23,021 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:44:23,021 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:44:23,021 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-14 11:44:23,021 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:44:23,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:44:23,022 INFO L85 PathProgramCache]: Analyzing trace with hash -1432172412, now seen corresponding path program 1 times [2021-12-14 11:44:23,022 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:44:23,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452244464] [2021-12-14 11:44:23,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:44:23,022 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:44:23,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:44:23,052 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:44:23,052 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:44:23,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452244464] [2021-12-14 11:44:23,053 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452244464] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:44:23,053 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:44:23,053 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 11:44:23,053 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677862170] [2021-12-14 11:44:23,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:44:23,054 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 11:44:23,054 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:44:23,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 11:44:23,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 11:44:23,055 INFO L87 Difference]: Start difference. First operand 299 states and 501 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:44:23,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:44:23,150 INFO L93 Difference]: Finished difference Result 595 states and 997 transitions. [2021-12-14 11:44:23,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 11:44:23,150 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2021-12-14 11:44:23,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:44:23,152 INFO L225 Difference]: With dead ends: 595 [2021-12-14 11:44:23,152 INFO L226 Difference]: Without dead ends: 302 [2021-12-14 11:44:23,152 INFO L932 BasicCegarLoop]: 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 [2021-12-14 11:44:23,153 INFO L933 BasicCegarLoop]: 127 mSDtfsCounter, 130 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 11:44:23,153 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [130 Valid, 145 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 11:44:23,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2021-12-14 11:44:23,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 297. [2021-12-14 11:44:23,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 296 states have (on average 1.6756756756756757) internal successors, (496), 296 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:44:23,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 496 transitions. [2021-12-14 11:44:23,160 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 496 transitions. Word has length 85 [2021-12-14 11:44:23,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:44:23,160 INFO L470 AbstractCegarLoop]: Abstraction has 297 states and 496 transitions. [2021-12-14 11:44:23,160 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:44:23,160 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 496 transitions. [2021-12-14 11:44:23,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-12-14 11:44:23,161 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:44:23,161 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:44:23,161 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-14 11:44:23,162 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:44:23,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:44:23,162 INFO L85 PathProgramCache]: Analyzing trace with hash -1085183485, now seen corresponding path program 1 times [2021-12-14 11:44:23,162 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:44:23,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950865811] [2021-12-14 11:44:23,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:44:23,163 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:44:23,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:44:23,184 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2021-12-14 11:44:23,184 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:44:23,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950865811] [2021-12-14 11:44:23,185 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950865811] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:44:23,185 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:44:23,185 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 11:44:23,185 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328278651] [2021-12-14 11:44:23,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:44:23,186 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 11:44:23,186 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:44:23,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 11:44:23,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 11:44:23,187 INFO L87 Difference]: Start difference. First operand 297 states and 496 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:44:23,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:44:23,246 INFO L93 Difference]: Finished difference Result 595 states and 992 transitions. [2021-12-14 11:44:23,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 11:44:23,246 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2021-12-14 11:44:23,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:44:23,247 INFO L225 Difference]: With dead ends: 595 [2021-12-14 11:44:23,247 INFO L226 Difference]: Without dead ends: 306 [2021-12-14 11:44:23,248 INFO L932 BasicCegarLoop]: 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 [2021-12-14 11:44:23,248 INFO L933 BasicCegarLoop]: 126 mSDtfsCounter, 162 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 11:44:23,249 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [162 Valid, 149 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 11:44:23,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2021-12-14 11:44:23,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 306. [2021-12-14 11:44:23,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 305 states have (on average 1.6459016393442623) internal successors, (502), 305 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:44:23,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 502 transitions. [2021-12-14 11:44:23,260 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 502 transitions. Word has length 97 [2021-12-14 11:44:23,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:44:23,260 INFO L470 AbstractCegarLoop]: Abstraction has 306 states and 502 transitions. [2021-12-14 11:44:23,260 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:44:23,260 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 502 transitions. [2021-12-14 11:44:23,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-12-14 11:44:23,262 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:44:23,262 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:44:23,270 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-14 11:44:23,270 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:44:23,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:44:23,270 INFO L85 PathProgramCache]: Analyzing trace with hash -860132162, now seen corresponding path program 1 times [2021-12-14 11:44:23,271 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:44:23,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387001484] [2021-12-14 11:44:23,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:44:23,271 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:44:23,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:44:23,322 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-12-14 11:44:23,322 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:44:23,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387001484] [2021-12-14 11:44:23,322 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387001484] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:44:23,322 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:44:23,323 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 11:44:23,323 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525857833] [2021-12-14 11:44:23,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:44:23,323 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 11:44:23,323 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:44:23,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 11:44:23,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 11:44:23,324 INFO L87 Difference]: Start difference. First operand 306 states and 502 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:44:23,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:44:23,409 INFO L93 Difference]: Finished difference Result 635 states and 1045 transitions. [2021-12-14 11:44:23,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 11:44:23,409 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2021-12-14 11:44:23,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:44:23,411 INFO L225 Difference]: With dead ends: 635 [2021-12-14 11:44:23,411 INFO L226 Difference]: Without dead ends: 337 [2021-12-14 11:44:23,411 INFO L932 BasicCegarLoop]: 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 [2021-12-14 11:44:23,412 INFO L933 BasicCegarLoop]: 128 mSDtfsCounter, 141 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 11:44:23,412 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [141 Valid, 141 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 11:44:23,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2021-12-14 11:44:23,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 335. [2021-12-14 11:44:23,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 334 states have (on average 1.6437125748502994) internal successors, (549), 334 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:44:23,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 549 transitions. [2021-12-14 11:44:23,420 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 549 transitions. Word has length 98 [2021-12-14 11:44:23,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:44:23,420 INFO L470 AbstractCegarLoop]: Abstraction has 335 states and 549 transitions. [2021-12-14 11:44:23,420 INFO L471 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) [2021-12-14 11:44:23,421 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 549 transitions. [2021-12-14 11:44:23,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-12-14 11:44:23,421 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:44:23,422 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:44:23,422 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-14 11:44:23,422 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:44:23,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:44:23,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1120928325, now seen corresponding path program 1 times [2021-12-14 11:44:23,423 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:44:23,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713829686] [2021-12-14 11:44:23,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:44:23,423 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:44:23,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:44:23,441 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-12-14 11:44:23,442 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:44:23,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713829686] [2021-12-14 11:44:23,442 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713829686] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:44:23,442 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:44:23,442 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 11:44:23,442 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110411249] [2021-12-14 11:44:23,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:44:23,443 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 11:44:23,443 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:44:23,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 11:44:23,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 11:44:23,443 INFO L87 Difference]: Start difference. First operand 335 states and 549 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:44:23,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:44:23,521 INFO L93 Difference]: Finished difference Result 664 states and 1088 transitions. [2021-12-14 11:44:23,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 11:44:23,521 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2021-12-14 11:44:23,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:44:23,522 INFO L225 Difference]: With dead ends: 664 [2021-12-14 11:44:23,523 INFO L226 Difference]: Without dead ends: 337 [2021-12-14 11:44:23,523 INFO L932 BasicCegarLoop]: 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 [2021-12-14 11:44:23,524 INFO L933 BasicCegarLoop]: 128 mSDtfsCounter, 140 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 11:44:23,525 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [140 Valid, 141 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 11:44:23,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2021-12-14 11:44:23,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 335. [2021-12-14 11:44:23,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 334 states have (on average 1.6317365269461077) internal successors, (545), 334 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:44:23,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 545 transitions. [2021-12-14 11:44:23,532 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 545 transitions. Word has length 99 [2021-12-14 11:44:23,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:44:23,533 INFO L470 AbstractCegarLoop]: Abstraction has 335 states and 545 transitions. [2021-12-14 11:44:23,533 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:44:23,533 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 545 transitions. [2021-12-14 11:44:23,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-12-14 11:44:23,534 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:44:23,534 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:44:23,534 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-14 11:44:23,534 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:44:23,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:44:23,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1084775058, now seen corresponding path program 1 times [2021-12-14 11:44:23,535 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:44:23,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981561381] [2021-12-14 11:44:23,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:44:23,535 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:44:23,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:44:23,570 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-12-14 11:44:23,570 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:44:23,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981561381] [2021-12-14 11:44:23,571 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981561381] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:44:23,571 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:44:23,571 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 11:44:23,571 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751506494] [2021-12-14 11:44:23,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:44:23,571 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 11:44:23,571 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:44:23,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 11:44:23,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 11:44:23,572 INFO L87 Difference]: Start difference. First operand 335 states and 545 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:44:23,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:44:23,651 INFO L93 Difference]: Finished difference Result 697 states and 1138 transitions. [2021-12-14 11:44:23,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 11:44:23,651 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2021-12-14 11:44:23,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:44:23,653 INFO L225 Difference]: With dead ends: 697 [2021-12-14 11:44:23,655 INFO L226 Difference]: Without dead ends: 370 [2021-12-14 11:44:23,656 INFO L932 BasicCegarLoop]: 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 [2021-12-14 11:44:23,656 INFO L933 BasicCegarLoop]: 128 mSDtfsCounter, 143 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 11:44:23,656 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [143 Valid, 149 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 11:44:23,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2021-12-14 11:44:23,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 362. [2021-12-14 11:44:23,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 361 states have (on average 1.626038781163435) internal successors, (587), 361 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:44:23,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 587 transitions. [2021-12-14 11:44:23,664 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 587 transitions. Word has length 100 [2021-12-14 11:44:23,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:44:23,665 INFO L470 AbstractCegarLoop]: Abstraction has 362 states and 587 transitions. [2021-12-14 11:44:23,665 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:44:23,665 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 587 transitions. [2021-12-14 11:44:23,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-12-14 11:44:23,666 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:44:23,666 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:44:23,666 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-14 11:44:23,667 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:44:23,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:44:23,667 INFO L85 PathProgramCache]: Analyzing trace with hash -1691577195, now seen corresponding path program 1 times [2021-12-14 11:44:23,667 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:44:23,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605947271] [2021-12-14 11:44:23,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:44:23,668 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:44:23,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:44:23,694 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-12-14 11:44:23,694 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:44:23,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605947271] [2021-12-14 11:44:23,694 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605947271] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:44:23,695 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:44:23,695 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 11:44:23,695 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850789255] [2021-12-14 11:44:23,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:44:23,696 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 11:44:23,696 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:44:23,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 11:44:23,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 11:44:23,696 INFO L87 Difference]: Start difference. First operand 362 states and 587 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:44:23,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:44:23,779 INFO L93 Difference]: Finished difference Result 724 states and 1175 transitions. [2021-12-14 11:44:23,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 11:44:23,779 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2021-12-14 11:44:23,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:44:23,781 INFO L225 Difference]: With dead ends: 724 [2021-12-14 11:44:23,781 INFO L226 Difference]: Without dead ends: 370 [2021-12-14 11:44:23,781 INFO L932 BasicCegarLoop]: 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 [2021-12-14 11:44:23,782 INFO L933 BasicCegarLoop]: 128 mSDtfsCounter, 142 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 11:44:23,782 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [142 Valid, 149 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 11:44:23,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2021-12-14 11:44:23,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 362. [2021-12-14 11:44:23,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 361 states have (on average 1.6121883656509695) internal successors, (582), 361 states have internal predecessors, (582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:44:23,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 582 transitions. [2021-12-14 11:44:23,790 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 582 transitions. Word has length 101 [2021-12-14 11:44:23,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:44:23,791 INFO L470 AbstractCegarLoop]: Abstraction has 362 states and 582 transitions. [2021-12-14 11:44:23,791 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:44:23,791 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 582 transitions. [2021-12-14 11:44:23,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-12-14 11:44:23,792 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:44:23,792 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:44:23,792 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-14 11:44:23,792 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:44:23,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:44:23,793 INFO L85 PathProgramCache]: Analyzing trace with hash -479008336, now seen corresponding path program 1 times [2021-12-14 11:44:23,793 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:44:23,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101509736] [2021-12-14 11:44:23,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:44:23,793 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:44:23,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:44:23,816 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2021-12-14 11:44:23,817 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:44:23,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101509736] [2021-12-14 11:44:23,817 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101509736] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:44:23,817 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:44:23,817 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 11:44:23,817 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092628041] [2021-12-14 11:44:23,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:44:23,818 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 11:44:23,818 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:44:23,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 11:44:23,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 11:44:23,819 INFO L87 Difference]: Start difference. First operand 362 states and 582 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:44:23,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:44:23,890 INFO L93 Difference]: Finished difference Result 741 states and 1193 transitions. [2021-12-14 11:44:23,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 11:44:23,890 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2021-12-14 11:44:23,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:44:23,891 INFO L225 Difference]: With dead ends: 741 [2021-12-14 11:44:23,892 INFO L226 Difference]: Without dead ends: 387 [2021-12-14 11:44:23,892 INFO L932 BasicCegarLoop]: 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 [2021-12-14 11:44:23,893 INFO L933 BasicCegarLoop]: 128 mSDtfsCounter, 149 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 11:44:23,893 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [149 Valid, 144 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 11:44:23,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2021-12-14 11:44:23,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 383. [2021-12-14 11:44:23,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 382 states have (on average 1.5994764397905759) internal successors, (611), 382 states have internal predecessors, (611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:44:23,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 611 transitions. [2021-12-14 11:44:23,903 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 611 transitions. Word has length 105 [2021-12-14 11:44:23,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:44:23,904 INFO L470 AbstractCegarLoop]: Abstraction has 383 states and 611 transitions. [2021-12-14 11:44:23,904 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:44:23,904 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 611 transitions. [2021-12-14 11:44:23,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-12-14 11:44:23,905 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:44:23,905 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:44:23,905 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-14 11:44:23,905 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:44:23,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:44:23,906 INFO L85 PathProgramCache]: Analyzing trace with hash 2118869193, now seen corresponding path program 1 times [2021-12-14 11:44:23,906 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:44:23,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833799532] [2021-12-14 11:44:23,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:44:23,906 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:44:23,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:44:23,931 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2021-12-14 11:44:23,932 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:44:23,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833799532] [2021-12-14 11:44:23,932 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833799532] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:44:23,932 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:44:23,932 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 11:44:23,932 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704620426] [2021-12-14 11:44:23,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:44:23,933 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 11:44:23,933 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:44:23,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 11:44:23,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 11:44:23,934 INFO L87 Difference]: Start difference. First operand 383 states and 611 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:44:24,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:44:24,011 INFO L93 Difference]: Finished difference Result 762 states and 1216 transitions. [2021-12-14 11:44:24,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 11:44:24,011 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2021-12-14 11:44:24,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:44:24,013 INFO L225 Difference]: With dead ends: 762 [2021-12-14 11:44:24,013 INFO L226 Difference]: Without dead ends: 387 [2021-12-14 11:44:24,014 INFO L932 BasicCegarLoop]: 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 [2021-12-14 11:44:24,015 INFO L933 BasicCegarLoop]: 128 mSDtfsCounter, 148 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 11:44:24,015 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [148 Valid, 144 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 11:44:24,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2021-12-14 11:44:24,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 383. [2021-12-14 11:44:24,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 382 states have (on average 1.5837696335078535) internal successors, (605), 382 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:44:24,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 605 transitions. [2021-12-14 11:44:24,025 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 605 transitions. Word has length 106 [2021-12-14 11:44:24,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:44:24,025 INFO L470 AbstractCegarLoop]: Abstraction has 383 states and 605 transitions. [2021-12-14 11:44:24,025 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:44:24,025 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 605 transitions. [2021-12-14 11:44:24,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2021-12-14 11:44:24,026 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:44:24,026 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:44:24,026 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-14 11:44:24,027 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:44:24,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:44:24,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1932137040, now seen corresponding path program 1 times [2021-12-14 11:44:24,027 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:44:24,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357824772] [2021-12-14 11:44:24,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:44:24,028 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:44:24,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:44:24,066 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2021-12-14 11:44:24,066 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:44:24,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357824772] [2021-12-14 11:44:24,066 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357824772] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:44:24,066 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:44:24,066 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 11:44:24,066 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621462700] [2021-12-14 11:44:24,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:44:24,067 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 11:44:24,067 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:44:24,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 11:44:24,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 11:44:24,067 INFO L87 Difference]: Start difference. First operand 383 states and 605 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:44:24,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:44:24,099 INFO L93 Difference]: Finished difference Result 1131 states and 1790 transitions. [2021-12-14 11:44:24,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 11:44:24,100 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 121 [2021-12-14 11:44:24,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:44:24,102 INFO L225 Difference]: With dead ends: 1131 [2021-12-14 11:44:24,102 INFO L226 Difference]: Without dead ends: 756 [2021-12-14 11:44:24,105 INFO L932 BasicCegarLoop]: 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 [2021-12-14 11:44:24,106 INFO L933 BasicCegarLoop]: 358 mSDtfsCounter, 137 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 11:44:24,106 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [137 Valid, 543 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 11:44:24,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states. [2021-12-14 11:44:24,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 756. [2021-12-14 11:44:24,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 756 states, 755 states have (on average 1.5788079470198675) internal successors, (1192), 755 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:44:24,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 756 states to 756 states and 1192 transitions. [2021-12-14 11:44:24,123 INFO L78 Accepts]: Start accepts. Automaton has 756 states and 1192 transitions. Word has length 121 [2021-12-14 11:44:24,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:44:24,124 INFO L470 AbstractCegarLoop]: Abstraction has 756 states and 1192 transitions. [2021-12-14 11:44:24,124 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:44:24,124 INFO L276 IsEmpty]: Start isEmpty. Operand 756 states and 1192 transitions. [2021-12-14 11:44:24,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2021-12-14 11:44:24,125 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:44:24,125 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:44:24,125 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-14 11:44:24,125 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:44:24,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:44:24,126 INFO L85 PathProgramCache]: Analyzing trace with hash -1552830339, now seen corresponding path program 1 times [2021-12-14 11:44:24,126 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:44:24,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592511624] [2021-12-14 11:44:24,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:44:24,126 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:44:24,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:44:24,151 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-12-14 11:44:24,151 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:44:24,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592511624] [2021-12-14 11:44:24,152 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592511624] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:44:24,152 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:44:24,152 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 11:44:24,152 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714391289] [2021-12-14 11:44:24,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:44:24,152 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 11:44:24,153 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:44:24,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 11:44:24,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 11:44:24,153 INFO L87 Difference]: Start difference. First operand 756 states and 1192 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:44:24,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:44:24,184 INFO L93 Difference]: Finished difference Result 1832 states and 2893 transitions. [2021-12-14 11:44:24,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 11:44:24,184 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 122 [2021-12-14 11:44:24,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:44:24,187 INFO L225 Difference]: With dead ends: 1832 [2021-12-14 11:44:24,187 INFO L226 Difference]: Without dead ends: 1084 [2021-12-14 11:44:24,188 INFO L932 BasicCegarLoop]: 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 [2021-12-14 11:44:24,189 INFO L933 BasicCegarLoop]: 358 mSDtfsCounter, 134 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 11:44:24,189 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [134 Valid, 543 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 11:44:24,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1084 states. [2021-12-14 11:44:24,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1084 to 1084. [2021-12-14 11:44:24,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1084 states, 1083 states have (on average 1.5780240073868883) internal successors, (1709), 1083 states have internal predecessors, (1709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:44:24,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1084 states to 1084 states and 1709 transitions. [2021-12-14 11:44:24,213 INFO L78 Accepts]: Start accepts. Automaton has 1084 states and 1709 transitions. Word has length 122 [2021-12-14 11:44:24,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:44:24,213 INFO L470 AbstractCegarLoop]: Abstraction has 1084 states and 1709 transitions. [2021-12-14 11:44:24,213 INFO L471 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) [2021-12-14 11:44:24,213 INFO L276 IsEmpty]: Start isEmpty. Operand 1084 states and 1709 transitions. [2021-12-14 11:44:24,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2021-12-14 11:44:24,215 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:44:24,215 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:44:24,215 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-14 11:44:24,215 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:44:24,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:44:24,216 INFO L85 PathProgramCache]: Analyzing trace with hash 323652479, now seen corresponding path program 1 times [2021-12-14 11:44:24,216 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:44:24,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47918183] [2021-12-14 11:44:24,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:44:24,216 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:44:24,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:44:24,234 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2021-12-14 11:44:24,234 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:44:24,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47918183] [2021-12-14 11:44:24,235 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47918183] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:44:24,235 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:44:24,235 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 11:44:24,235 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539621663] [2021-12-14 11:44:24,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:44:24,235 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 11:44:24,236 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:44:24,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 11:44:24,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 11:44:24,236 INFO L87 Difference]: Start difference. First operand 1084 states and 1709 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:44:24,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:44:24,297 INFO L93 Difference]: Finished difference Result 2529 states and 3993 transitions. [2021-12-14 11:44:24,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 11:44:24,298 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 122 [2021-12-14 11:44:24,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:44:24,303 INFO L225 Difference]: With dead ends: 2529 [2021-12-14 11:44:24,303 INFO L226 Difference]: Without dead ends: 1453 [2021-12-14 11:44:24,307 INFO L932 BasicCegarLoop]: 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 [2021-12-14 11:44:24,307 INFO L933 BasicCegarLoop]: 361 mSDtfsCounter, 155 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 11:44:24,308 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [155 Valid, 546 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 11:44:24,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1453 states. [2021-12-14 11:44:24,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1453 to 1453. [2021-12-14 11:44:24,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1453 states, 1452 states have (on average 1.5778236914600552) internal successors, (2291), 1452 states have internal predecessors, (2291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:44:24,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1453 states to 1453 states and 2291 transitions. [2021-12-14 11:44:24,349 INFO L78 Accepts]: Start accepts. Automaton has 1453 states and 2291 transitions. Word has length 122 [2021-12-14 11:44:24,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:44:24,349 INFO L470 AbstractCegarLoop]: Abstraction has 1453 states and 2291 transitions. [2021-12-14 11:44:24,349 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:44:24,350 INFO L276 IsEmpty]: Start isEmpty. Operand 1453 states and 2291 transitions. [2021-12-14 11:44:24,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2021-12-14 11:44:24,352 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:44:24,352 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:44:24,353 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-14 11:44:24,353 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:44:24,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:44:24,353 INFO L85 PathProgramCache]: Analyzing trace with hash 1712946493, now seen corresponding path program 1 times [2021-12-14 11:44:24,353 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:44:24,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116788251] [2021-12-14 11:44:24,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:44:24,354 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:44:24,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:44:24,373 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2021-12-14 11:44:24,373 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:44:24,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116788251] [2021-12-14 11:44:24,373 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116788251] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:44:24,374 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:44:24,374 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 11:44:24,374 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160650206] [2021-12-14 11:44:24,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:44:24,374 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 11:44:24,374 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:44:24,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 11:44:24,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 11:44:24,375 INFO L87 Difference]: Start difference. First operand 1453 states and 2291 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:44:24,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:44:24,420 INFO L93 Difference]: Finished difference Result 3249 states and 5126 transitions. [2021-12-14 11:44:24,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 11:44:24,420 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 122 [2021-12-14 11:44:24,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:44:24,425 INFO L225 Difference]: With dead ends: 3249 [2021-12-14 11:44:24,426 INFO L226 Difference]: Without dead ends: 1804 [2021-12-14 11:44:24,428 INFO L932 BasicCegarLoop]: 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 [2021-12-14 11:44:24,428 INFO L933 BasicCegarLoop]: 213 mSDtfsCounter, 170 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 11:44:24,428 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [170 Valid, 388 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 11:44:24,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1804 states. [2021-12-14 11:44:24,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1804 to 1804. [2021-12-14 11:44:24,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1804 states, 1803 states have (on average 1.5762617859123682) internal successors, (2842), 1803 states have internal predecessors, (2842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:44:24,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1804 states to 1804 states and 2842 transitions. [2021-12-14 11:44:24,507 INFO L78 Accepts]: Start accepts. Automaton has 1804 states and 2842 transitions. Word has length 122 [2021-12-14 11:44:24,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:44:24,508 INFO L470 AbstractCegarLoop]: Abstraction has 1804 states and 2842 transitions. [2021-12-14 11:44:24,508 INFO L471 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) [2021-12-14 11:44:24,508 INFO L276 IsEmpty]: Start isEmpty. Operand 1804 states and 2842 transitions. [2021-12-14 11:44:24,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2021-12-14 11:44:24,511 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:44:24,511 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:44:24,511 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-12-14 11:44:24,511 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:44:24,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:44:24,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1532697181, now seen corresponding path program 1 times [2021-12-14 11:44:24,512 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:44:24,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562147468] [2021-12-14 11:44:24,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:44:24,512 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:44:24,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:44:24,538 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 256 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2021-12-14 11:44:24,538 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:44:24,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562147468] [2021-12-14 11:44:24,539 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562147468] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:44:24,539 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:44:24,539 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 11:44:24,539 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098960995] [2021-12-14 11:44:24,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:44:24,539 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 11:44:24,540 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:44:24,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 11:44:24,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 11:44:24,540 INFO L87 Difference]: Start difference. First operand 1804 states and 2842 transitions. Second operand has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:44:24,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:44:24,661 INFO L93 Difference]: Finished difference Result 3650 states and 5732 transitions. [2021-12-14 11:44:24,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 11:44:24,661 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 199 [2021-12-14 11:44:24,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:44:24,667 INFO L225 Difference]: With dead ends: 3650 [2021-12-14 11:44:24,667 INFO L226 Difference]: Without dead ends: 1854 [2021-12-14 11:44:24,669 INFO L932 BasicCegarLoop]: 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 [2021-12-14 11:44:24,670 INFO L933 BasicCegarLoop]: 202 mSDtfsCounter, 50 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 11:44:24,670 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 297 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 11:44:24,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1854 states. [2021-12-14 11:44:24,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1854 to 1804. [2021-12-14 11:44:24,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1804 states, 1803 states have (on average 1.5363283416528009) internal successors, (2770), 1803 states have internal predecessors, (2770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:44:24,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1804 states to 1804 states and 2770 transitions. [2021-12-14 11:44:24,737 INFO L78 Accepts]: Start accepts. Automaton has 1804 states and 2770 transitions. Word has length 199 [2021-12-14 11:44:24,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:44:24,738 INFO L470 AbstractCegarLoop]: Abstraction has 1804 states and 2770 transitions. [2021-12-14 11:44:24,738 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:44:24,738 INFO L276 IsEmpty]: Start isEmpty. Operand 1804 states and 2770 transitions. [2021-12-14 11:44:24,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2021-12-14 11:44:24,742 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:44:24,742 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:44:24,742 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-12-14 11:44:24,742 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:44:24,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:44:24,743 INFO L85 PathProgramCache]: Analyzing trace with hash -995291011, now seen corresponding path program 1 times [2021-12-14 11:44:24,743 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:44:24,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150211067] [2021-12-14 11:44:24,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:44:24,743 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:44:24,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:44:24,773 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 257 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2021-12-14 11:44:24,773 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:44:24,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150211067] [2021-12-14 11:44:24,773 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150211067] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:44:24,774 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:44:24,774 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 11:44:24,774 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993619805] [2021-12-14 11:44:24,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:44:24,774 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 11:44:24,775 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:44:24,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 11:44:24,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 11:44:24,775 INFO L87 Difference]: Start difference. First operand 1804 states and 2770 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:44:24,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:44:24,908 INFO L93 Difference]: Finished difference Result 3667 states and 5605 transitions. [2021-12-14 11:44:24,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 11:44:24,909 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 213 [2021-12-14 11:44:24,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:44:24,914 INFO L225 Difference]: With dead ends: 3667 [2021-12-14 11:44:24,914 INFO L226 Difference]: Without dead ends: 1871 [2021-12-14 11:44:24,916 INFO L932 BasicCegarLoop]: 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 [2021-12-14 11:44:24,916 INFO L933 BasicCegarLoop]: 136 mSDtfsCounter, 152 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 11:44:24,917 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [152 Valid, 163 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 11:44:24,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1871 states. [2021-12-14 11:44:24,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1871 to 1804. [2021-12-14 11:44:24,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1804 states, 1803 states have (on average 1.4941763727121464) internal successors, (2694), 1803 states have internal predecessors, (2694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:44:24,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1804 states to 1804 states and 2694 transitions. [2021-12-14 11:44:24,960 INFO L78 Accepts]: Start accepts. Automaton has 1804 states and 2694 transitions. Word has length 213 [2021-12-14 11:44:24,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:44:24,960 INFO L470 AbstractCegarLoop]: Abstraction has 1804 states and 2694 transitions. [2021-12-14 11:44:24,961 INFO L471 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) [2021-12-14 11:44:24,961 INFO L276 IsEmpty]: Start isEmpty. Operand 1804 states and 2694 transitions. [2021-12-14 11:44:24,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2021-12-14 11:44:24,974 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:44:24,974 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:44:24,974 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-12-14 11:44:24,974 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:44:24,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:44:24,975 INFO L85 PathProgramCache]: Analyzing trace with hash -344869126, now seen corresponding path program 1 times [2021-12-14 11:44:24,975 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:44:24,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209435210] [2021-12-14 11:44:24,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:44:24,975 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:44:24,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:44:25,015 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 343 proven. 26 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2021-12-14 11:44:25,015 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:44:25,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209435210] [2021-12-14 11:44:25,015 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209435210] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 11:44:25,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2049357278] [2021-12-14 11:44:25,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:44:25,016 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 11:44:25,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 11:44:25,017 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) [2021-12-14 11:44:25,058 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-14 11:44:25,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:44:25,125 INFO L263 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-14 11:44:25,143 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 11:44:25,534 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 343 proven. 26 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2021-12-14 11:44:25,534 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 11:44:25,855 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 343 proven. 26 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2021-12-14 11:44:25,856 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2049357278] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 11:44:25,856 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 11:44:25,856 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2021-12-14 11:44:25,856 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888807643] [2021-12-14 11:44:25,856 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 11:44:25,857 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 11:44:25,857 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:44:25,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 11:44:25,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-14 11:44:25,857 INFO L87 Difference]: Start difference. First operand 1804 states and 2694 transitions. Second operand has 6 states, 6 states have (on average 39.666666666666664) internal successors, (238), 6 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:44:26,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:44:26,120 INFO L93 Difference]: Finished difference Result 4265 states and 6321 transitions. [2021-12-14 11:44:26,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 11:44:26,121 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 39.666666666666664) internal successors, (238), 6 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 232 [2021-12-14 11:44:26,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:44:26,129 INFO L225 Difference]: With dead ends: 4265 [2021-12-14 11:44:26,129 INFO L226 Difference]: Without dead ends: 2436 [2021-12-14 11:44:26,131 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 469 GetRequests, 463 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2021-12-14 11:44:26,132 INFO L933 BasicCegarLoop]: 236 mSDtfsCounter, 486 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 486 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 11:44:26,132 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [486 Valid, 448 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 11:44:26,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2436 states. [2021-12-14 11:44:26,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2436 to 1604. [2021-12-14 11:44:26,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1604 states, 1603 states have (on average 1.470991890205864) internal successors, (2358), 1603 states have internal predecessors, (2358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:44:26,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1604 states to 1604 states and 2358 transitions. [2021-12-14 11:44:26,174 INFO L78 Accepts]: Start accepts. Automaton has 1604 states and 2358 transitions. Word has length 232 [2021-12-14 11:44:26,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:44:26,174 INFO L470 AbstractCegarLoop]: Abstraction has 1604 states and 2358 transitions. [2021-12-14 11:44:26,174 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 39.666666666666664) internal successors, (238), 6 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:44:26,175 INFO L276 IsEmpty]: Start isEmpty. Operand 1604 states and 2358 transitions. [2021-12-14 11:44:26,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2021-12-14 11:44:26,177 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:44:26,177 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:44:26,197 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-14 11:44:26,395 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2021-12-14 11:44:26,395 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:44:26,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:44:26,395 INFO L85 PathProgramCache]: Analyzing trace with hash -1731638989, now seen corresponding path program 1 times [2021-12-14 11:44:26,395 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:44:26,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491578751] [2021-12-14 11:44:26,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:44:26,396 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:44:26,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:44:26,427 INFO L134 CoverageAnalysis]: Checked inductivity of 526 backedges. 359 proven. 0 refuted. 0 times theorem prover too weak. 167 trivial. 0 not checked. [2021-12-14 11:44:26,427 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:44:26,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491578751] [2021-12-14 11:44:26,427 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491578751] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:44:26,427 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:44:26,427 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 11:44:26,428 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727190571] [2021-12-14 11:44:26,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:44:26,428 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 11:44:26,428 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:44:26,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 11:44:26,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 11:44:26,429 INFO L87 Difference]: Start difference. First operand 1604 states and 2358 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:44:26,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:44:26,542 INFO L93 Difference]: Finished difference Result 3395 states and 5009 transitions. [2021-12-14 11:44:26,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 11:44:26,543 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 241 [2021-12-14 11:44:26,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:44:26,547 INFO L225 Difference]: With dead ends: 3395 [2021-12-14 11:44:26,547 INFO L226 Difference]: Without dead ends: 1679 [2021-12-14 11:44:26,549 INFO L932 BasicCegarLoop]: 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 [2021-12-14 11:44:26,550 INFO L933 BasicCegarLoop]: 186 mSDtfsCounter, 46 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 11:44:26,550 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 270 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 11:44:26,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1679 states. [2021-12-14 11:44:26,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1679 to 1679. [2021-12-14 11:44:26,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1679 states, 1678 states have (on average 1.4439809296781883) internal successors, (2423), 1678 states have internal predecessors, (2423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:44:26,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1679 states to 1679 states and 2423 transitions. [2021-12-14 11:44:26,588 INFO L78 Accepts]: Start accepts. Automaton has 1679 states and 2423 transitions. Word has length 241 [2021-12-14 11:44:26,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:44:26,589 INFO L470 AbstractCegarLoop]: Abstraction has 1679 states and 2423 transitions. [2021-12-14 11:44:26,589 INFO L471 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) [2021-12-14 11:44:26,589 INFO L276 IsEmpty]: Start isEmpty. Operand 1679 states and 2423 transitions. [2021-12-14 11:44:26,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2021-12-14 11:44:26,592 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:44:26,592 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:44:26,592 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-12-14 11:44:26,592 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:44:26,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:44:26,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1272517136, now seen corresponding path program 1 times [2021-12-14 11:44:26,593 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:44:26,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967602013] [2021-12-14 11:44:26,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:44:26,593 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:44:26,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:44:26,626 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 430 proven. 16 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2021-12-14 11:44:26,626 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:44:26,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967602013] [2021-12-14 11:44:26,627 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967602013] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 11:44:26,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2056979346] [2021-12-14 11:44:26,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:44:26,627 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 11:44:26,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 11:44:26,628 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) [2021-12-14 11:44:26,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-14 11:44:26,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:44:26,707 INFO L263 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-14 11:44:26,717 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 11:44:26,959 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 430 proven. 16 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2021-12-14 11:44:26,959 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 11:44:27,207 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 430 proven. 16 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2021-12-14 11:44:27,207 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2056979346] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 11:44:27,207 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 11:44:27,207 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2021-12-14 11:44:27,207 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329304131] [2021-12-14 11:44:27,208 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 11:44:27,208 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 11:44:27,208 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:44:27,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 11:44:27,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-14 11:44:27,209 INFO L87 Difference]: Start difference. First operand 1679 states and 2423 transitions. Second operand has 6 states, 6 states have (on average 34.333333333333336) internal successors, (206), 6 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:44:27,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:44:27,701 INFO L93 Difference]: Finished difference Result 7700 states and 11238 transitions. [2021-12-14 11:44:27,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-14 11:44:27,701 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 34.333333333333336) internal successors, (206), 6 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 253 [2021-12-14 11:44:27,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:44:27,719 INFO L225 Difference]: With dead ends: 7700 [2021-12-14 11:44:27,719 INFO L226 Difference]: Without dead ends: 6029 [2021-12-14 11:44:27,724 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 516 GetRequests, 508 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2021-12-14 11:44:27,725 INFO L933 BasicCegarLoop]: 540 mSDtfsCounter, 438 mSDsluCounter, 646 mSDsCounter, 0 mSdLazyCounter, 739 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 438 SdHoareTripleChecker+Valid, 1186 SdHoareTripleChecker+Invalid, 800 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 739 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-14 11:44:27,725 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [438 Valid, 1186 Invalid, 800 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 739 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-14 11:44:27,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6029 states. [2021-12-14 11:44:27,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6029 to 2357. [2021-12-14 11:44:27,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2357 states, 2356 states have (on average 1.3247028862478778) internal successors, (3121), 2356 states have internal predecessors, (3121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:44:27,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2357 states to 2357 states and 3121 transitions. [2021-12-14 11:44:27,810 INFO L78 Accepts]: Start accepts. Automaton has 2357 states and 3121 transitions. Word has length 253 [2021-12-14 11:44:27,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:44:27,811 INFO L470 AbstractCegarLoop]: Abstraction has 2357 states and 3121 transitions. [2021-12-14 11:44:27,811 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 34.333333333333336) internal successors, (206), 6 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:44:27,811 INFO L276 IsEmpty]: Start isEmpty. Operand 2357 states and 3121 transitions. [2021-12-14 11:44:27,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2021-12-14 11:44:27,815 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:44:27,815 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:44:27,839 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-14 11:44:28,028 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2021-12-14 11:44:28,029 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:44:28,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:44:28,029 INFO L85 PathProgramCache]: Analyzing trace with hash 1561336526, now seen corresponding path program 1 times [2021-12-14 11:44:28,029 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:44:28,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517160323] [2021-12-14 11:44:28,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:44:28,029 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:44:28,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:44:28,059 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 400 proven. 0 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2021-12-14 11:44:28,060 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:44:28,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517160323] [2021-12-14 11:44:28,060 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517160323] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:44:28,060 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:44:28,060 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 11:44:28,060 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196420251] [2021-12-14 11:44:28,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:44:28,061 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 11:44:28,061 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:44:28,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 11:44:28,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 11:44:28,061 INFO L87 Difference]: Start difference. First operand 2357 states and 3121 transitions. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:44:28,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:44:28,133 INFO L93 Difference]: Finished difference Result 6533 states and 8644 transitions. [2021-12-14 11:44:28,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 11:44:28,133 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 253 [2021-12-14 11:44:28,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:44:28,145 INFO L225 Difference]: With dead ends: 6533 [2021-12-14 11:44:28,147 INFO L226 Difference]: Without dead ends: 4184 [2021-12-14 11:44:28,150 INFO L932 BasicCegarLoop]: 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 [2021-12-14 11:44:28,152 INFO L933 BasicCegarLoop]: 333 mSDtfsCounter, 120 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 11:44:28,152 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [120 Valid, 514 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 11:44:28,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4184 states. [2021-12-14 11:44:28,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4184 to 4182. [2021-12-14 11:44:28,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4182 states, 4181 states have (on average 1.3207366658694093) internal successors, (5522), 4181 states have internal predecessors, (5522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:44:28,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4182 states to 4182 states and 5522 transitions. [2021-12-14 11:44:28,261 INFO L78 Accepts]: Start accepts. Automaton has 4182 states and 5522 transitions. Word has length 253 [2021-12-14 11:44:28,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:44:28,261 INFO L470 AbstractCegarLoop]: Abstraction has 4182 states and 5522 transitions. [2021-12-14 11:44:28,261 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:44:28,262 INFO L276 IsEmpty]: Start isEmpty. Operand 4182 states and 5522 transitions. [2021-12-14 11:44:28,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2021-12-14 11:44:28,268 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:44:28,268 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:44:28,268 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-12-14 11:44:28,268 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:44:28,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:44:28,269 INFO L85 PathProgramCache]: Analyzing trace with hash -914284920, now seen corresponding path program 1 times [2021-12-14 11:44:28,269 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:44:28,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327455237] [2021-12-14 11:44:28,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:44:28,269 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:44:28,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:44:28,298 INFO L134 CoverageAnalysis]: Checked inductivity of 580 backedges. 374 proven. 0 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2021-12-14 11:44:28,299 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:44:28,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327455237] [2021-12-14 11:44:28,299 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327455237] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:44:28,299 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:44:28,299 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 11:44:28,299 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629024412] [2021-12-14 11:44:28,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:44:28,300 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 11:44:28,300 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:44:28,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 11:44:28,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 11:44:28,300 INFO L87 Difference]: Start difference. First operand 4182 states and 5522 transitions. Second operand has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:44:28,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:44:28,485 INFO L93 Difference]: Finished difference Result 8584 states and 11340 transitions. [2021-12-14 11:44:28,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 11:44:28,491 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 256 [2021-12-14 11:44:28,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:44:28,509 INFO L225 Difference]: With dead ends: 8584 [2021-12-14 11:44:28,510 INFO L226 Difference]: Without dead ends: 4410 [2021-12-14 11:44:28,514 INFO L932 BasicCegarLoop]: 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 [2021-12-14 11:44:28,515 INFO L933 BasicCegarLoop]: 143 mSDtfsCounter, 137 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 11:44:28,515 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [137 Valid, 166 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 11:44:28,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4410 states. [2021-12-14 11:44:28,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4410 to 4182. [2021-12-14 11:44:28,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4182 states, 4181 states have (on average 1.3035159052858167) internal successors, (5450), 4181 states have internal predecessors, (5450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:44:28,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4182 states to 4182 states and 5450 transitions. [2021-12-14 11:44:28,637 INFO L78 Accepts]: Start accepts. Automaton has 4182 states and 5450 transitions. Word has length 256 [2021-12-14 11:44:28,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:44:28,637 INFO L470 AbstractCegarLoop]: Abstraction has 4182 states and 5450 transitions. [2021-12-14 11:44:28,638 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:44:28,638 INFO L276 IsEmpty]: Start isEmpty. Operand 4182 states and 5450 transitions. [2021-12-14 11:44:28,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2021-12-14 11:44:28,644 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:44:28,644 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:44:28,644 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-12-14 11:44:28,645 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:44:28,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:44:28,645 INFO L85 PathProgramCache]: Analyzing trace with hash 1357789354, now seen corresponding path program 1 times [2021-12-14 11:44:28,645 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:44:28,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246472885] [2021-12-14 11:44:28,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:44:28,645 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:44:28,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:44:28,683 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 300 proven. 0 refuted. 0 times theorem prover too weak. 482 trivial. 0 not checked. [2021-12-14 11:44:28,683 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:44:28,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246472885] [2021-12-14 11:44:28,683 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246472885] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:44:28,683 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:44:28,684 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 11:44:28,684 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353645689] [2021-12-14 11:44:28,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:44:28,684 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 11:44:28,684 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:44:28,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 11:44:28,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 11:44:28,685 INFO L87 Difference]: Start difference. First operand 4182 states and 5450 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:44:28,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:44:28,846 INFO L93 Difference]: Finished difference Result 8488 states and 11054 transitions. [2021-12-14 11:44:28,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 11:44:28,847 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 290 [2021-12-14 11:44:28,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:44:28,854 INFO L225 Difference]: With dead ends: 8488 [2021-12-14 11:44:28,854 INFO L226 Difference]: Without dead ends: 4314 [2021-12-14 11:44:28,859 INFO L932 BasicCegarLoop]: 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 [2021-12-14 11:44:28,860 INFO L933 BasicCegarLoop]: 200 mSDtfsCounter, 13 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 11:44:28,861 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 300 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 11:44:28,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4314 states. [2021-12-14 11:44:28,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4314 to 4274. [2021-12-14 11:44:28,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4274 states, 4273 states have (on average 1.301661596068336) internal successors, (5562), 4273 states have internal predecessors, (5562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:44:28,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4274 states to 4274 states and 5562 transitions. [2021-12-14 11:44:28,963 INFO L78 Accepts]: Start accepts. Automaton has 4274 states and 5562 transitions. Word has length 290 [2021-12-14 11:44:28,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:44:28,963 INFO L470 AbstractCegarLoop]: Abstraction has 4274 states and 5562 transitions. [2021-12-14 11:44:28,963 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:44:28,963 INFO L276 IsEmpty]: Start isEmpty. Operand 4274 states and 5562 transitions. [2021-12-14 11:44:28,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2021-12-14 11:44:28,972 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:44:28,972 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:44:28,973 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-12-14 11:44:28,973 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:44:28,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:44:28,973 INFO L85 PathProgramCache]: Analyzing trace with hash -1702375352, now seen corresponding path program 1 times [2021-12-14 11:44:28,974 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:44:28,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582972164] [2021-12-14 11:44:28,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:44:28,974 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:44:28,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:44:29,007 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 434 proven. 0 refuted. 0 times theorem prover too weak. 499 trivial. 0 not checked. [2021-12-14 11:44:29,007 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:44:29,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582972164] [2021-12-14 11:44:29,007 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582972164] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:44:29,007 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:44:29,008 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 11:44:29,008 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065505514] [2021-12-14 11:44:29,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:44:29,008 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 11:44:29,008 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:44:29,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 11:44:29,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 11:44:29,009 INFO L87 Difference]: Start difference. First operand 4274 states and 5562 transitions. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:44:29,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:44:29,154 INFO L93 Difference]: Finished difference Result 8920 states and 11652 transitions. [2021-12-14 11:44:29,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 11:44:29,155 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 311 [2021-12-14 11:44:29,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:44:29,161 INFO L225 Difference]: With dead ends: 8920 [2021-12-14 11:44:29,161 INFO L226 Difference]: Without dead ends: 4654 [2021-12-14 11:44:29,165 INFO L932 BasicCegarLoop]: 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 [2021-12-14 11:44:29,166 INFO L933 BasicCegarLoop]: 199 mSDtfsCounter, 29 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 11:44:29,167 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 299 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 11:44:29,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4654 states. [2021-12-14 11:44:29,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4654 to 4524. [2021-12-14 11:44:29,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4524 states, 4523 states have (on average 1.2960424497015255) internal successors, (5862), 4523 states have internal predecessors, (5862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:44:29,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4524 states to 4524 states and 5862 transitions. [2021-12-14 11:44:29,248 INFO L78 Accepts]: Start accepts. Automaton has 4524 states and 5862 transitions. Word has length 311 [2021-12-14 11:44:29,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:44:29,248 INFO L470 AbstractCegarLoop]: Abstraction has 4524 states and 5862 transitions. [2021-12-14 11:44:29,248 INFO L471 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) [2021-12-14 11:44:29,249 INFO L276 IsEmpty]: Start isEmpty. Operand 4524 states and 5862 transitions. [2021-12-14 11:44:29,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2021-12-14 11:44:29,255 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:44:29,256 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:44:29,257 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-12-14 11:44:29,257 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:44:29,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:44:29,257 INFO L85 PathProgramCache]: Analyzing trace with hash 602793911, now seen corresponding path program 1 times [2021-12-14 11:44:29,257 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:44:29,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317684436] [2021-12-14 11:44:29,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:44:29,258 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:44:29,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:44:29,295 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 564 proven. 0 refuted. 0 times theorem prover too weak. 404 trivial. 0 not checked. [2021-12-14 11:44:29,295 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:44:29,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317684436] [2021-12-14 11:44:29,295 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317684436] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:44:29,295 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:44:29,296 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 11:44:29,296 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434354624] [2021-12-14 11:44:29,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:44:29,296 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 11:44:29,296 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:44:29,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 11:44:29,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 11:44:29,297 INFO L87 Difference]: Start difference. First operand 4524 states and 5862 transitions. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:44:29,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:44:29,398 INFO L93 Difference]: Finished difference Result 7636 states and 9829 transitions. [2021-12-14 11:44:29,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 11:44:29,398 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 321 [2021-12-14 11:44:29,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:44:29,402 INFO L225 Difference]: With dead ends: 7636 [2021-12-14 11:44:29,402 INFO L226 Difference]: Without dead ends: 2476 [2021-12-14 11:44:29,405 INFO L932 BasicCegarLoop]: 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 [2021-12-14 11:44:29,405 INFO L933 BasicCegarLoop]: 188 mSDtfsCounter, 11 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 11:44:29,405 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 288 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 11:44:29,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2476 states. [2021-12-14 11:44:29,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2476 to 2476. [2021-12-14 11:44:29,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2476 states, 2475 states have (on average 1.2836363636363637) internal successors, (3177), 2475 states have internal predecessors, (3177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:44:29,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2476 states to 2476 states and 3177 transitions. [2021-12-14 11:44:29,446 INFO L78 Accepts]: Start accepts. Automaton has 2476 states and 3177 transitions. Word has length 321 [2021-12-14 11:44:29,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:44:29,446 INFO L470 AbstractCegarLoop]: Abstraction has 2476 states and 3177 transitions. [2021-12-14 11:44:29,447 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:44:29,447 INFO L276 IsEmpty]: Start isEmpty. Operand 2476 states and 3177 transitions. [2021-12-14 11:44:29,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2021-12-14 11:44:29,450 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:44:29,451 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 8, 8, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:44:29,451 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-12-14 11:44:29,451 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:44:29,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:44:29,452 INFO L85 PathProgramCache]: Analyzing trace with hash -616309997, now seen corresponding path program 1 times [2021-12-14 11:44:29,452 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:44:29,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137813516] [2021-12-14 11:44:29,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:44:29,452 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:44:29,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:44:29,484 INFO L134 CoverageAnalysis]: Checked inductivity of 1114 backedges. 580 proven. 0 refuted. 0 times theorem prover too weak. 534 trivial. 0 not checked. [2021-12-14 11:44:29,484 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:44:29,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137813516] [2021-12-14 11:44:29,484 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137813516] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:44:29,484 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:44:29,485 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 11:44:29,485 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299896439] [2021-12-14 11:44:29,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:44:29,485 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 11:44:29,485 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:44:29,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 11:44:29,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 11:44:29,486 INFO L87 Difference]: Start difference. First operand 2476 states and 3177 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:44:29,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:44:29,571 INFO L93 Difference]: Finished difference Result 4984 states and 6407 transitions. [2021-12-14 11:44:29,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 11:44:29,572 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 337 [2021-12-14 11:44:29,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:44:29,575 INFO L225 Difference]: With dead ends: 4984 [2021-12-14 11:44:29,575 INFO L226 Difference]: Without dead ends: 2516 [2021-12-14 11:44:29,578 INFO L932 BasicCegarLoop]: 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 [2021-12-14 11:44:29,579 INFO L933 BasicCegarLoop]: 194 mSDtfsCounter, 19 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 11:44:29,579 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 293 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 11:44:29,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2516 states. [2021-12-14 11:44:29,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2516 to 2476. [2021-12-14 11:44:29,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2476 states, 2475 states have (on average 1.2735353535353535) internal successors, (3152), 2475 states have internal predecessors, (3152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:44:29,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2476 states to 2476 states and 3152 transitions. [2021-12-14 11:44:29,618 INFO L78 Accepts]: Start accepts. Automaton has 2476 states and 3152 transitions. Word has length 337 [2021-12-14 11:44:29,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:44:29,618 INFO L470 AbstractCegarLoop]: Abstraction has 2476 states and 3152 transitions. [2021-12-14 11:44:29,618 INFO L471 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) [2021-12-14 11:44:29,618 INFO L276 IsEmpty]: Start isEmpty. Operand 2476 states and 3152 transitions. [2021-12-14 11:44:29,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2021-12-14 11:44:29,622 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:44:29,622 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 9, 9, 8, 8, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:44:29,622 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-12-14 11:44:29,623 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:44:29,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:44:29,623 INFO L85 PathProgramCache]: Analyzing trace with hash -1063549815, now seen corresponding path program 1 times [2021-12-14 11:44:29,623 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:44:29,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990491723] [2021-12-14 11:44:29,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:44:29,623 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:44:29,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:44:29,667 INFO L134 CoverageAnalysis]: Checked inductivity of 1327 backedges. 738 proven. 0 refuted. 0 times theorem prover too weak. 589 trivial. 0 not checked. [2021-12-14 11:44:29,667 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:44:29,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990491723] [2021-12-14 11:44:29,668 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990491723] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:44:29,668 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:44:29,668 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 11:44:29,668 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973963691] [2021-12-14 11:44:29,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:44:29,668 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 11:44:29,669 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:44:29,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 11:44:29,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 11:44:29,669 INFO L87 Difference]: Start difference. First operand 2476 states and 3152 transitions. Second operand has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:44:29,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:44:29,758 INFO L93 Difference]: Finished difference Result 4954 states and 6302 transitions. [2021-12-14 11:44:29,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 11:44:29,758 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 360 [2021-12-14 11:44:29,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:44:29,762 INFO L225 Difference]: With dead ends: 4954 [2021-12-14 11:44:29,762 INFO L226 Difference]: Without dead ends: 2486 [2021-12-14 11:44:29,764 INFO L932 BasicCegarLoop]: 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 [2021-12-14 11:44:29,765 INFO L933 BasicCegarLoop]: 194 mSDtfsCounter, 11 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 11:44:29,765 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 293 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 11:44:29,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2486 states. [2021-12-14 11:44:29,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2486 to 2476. [2021-12-14 11:44:29,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2476 states, 2475 states have (on average 1.2634343434343434) internal successors, (3127), 2475 states have internal predecessors, (3127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:44:29,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2476 states to 2476 states and 3127 transitions. [2021-12-14 11:44:29,805 INFO L78 Accepts]: Start accepts. Automaton has 2476 states and 3127 transitions. Word has length 360 [2021-12-14 11:44:29,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:44:29,805 INFO L470 AbstractCegarLoop]: Abstraction has 2476 states and 3127 transitions. [2021-12-14 11:44:29,806 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:44:29,806 INFO L276 IsEmpty]: Start isEmpty. Operand 2476 states and 3127 transitions. [2021-12-14 11:44:29,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2021-12-14 11:44:29,809 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:44:29,810 INFO L514 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:44:29,810 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-12-14 11:44:29,810 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:44:29,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:44:29,810 INFO L85 PathProgramCache]: Analyzing trace with hash -2107174257, now seen corresponding path program 1 times [2021-12-14 11:44:29,810 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:44:29,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087661045] [2021-12-14 11:44:29,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:44:29,811 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:44:29,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:44:29,851 INFO L134 CoverageAnalysis]: Checked inductivity of 1588 backedges. 1011 proven. 26 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2021-12-14 11:44:29,851 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:44:29,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087661045] [2021-12-14 11:44:29,852 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087661045] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 11:44:29,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1284306421] [2021-12-14 11:44:29,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:44:29,852 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 11:44:29,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 11:44:29,853 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 11:44:29,854 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-14 11:44:29,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:44:29,954 INFO L263 TraceCheckSpWp]: Trace formula consists of 645 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-14 11:44:29,958 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 11:44:30,466 INFO L134 CoverageAnalysis]: Checked inductivity of 1588 backedges. 773 proven. 0 refuted. 0 times theorem prover too weak. 815 trivial. 0 not checked. [2021-12-14 11:44:30,467 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 11:44:30,467 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1284306421] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:44:30,467 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 11:44:30,467 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2021-12-14 11:44:30,467 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143300309] [2021-12-14 11:44:30,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:44:30,468 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 11:44:30,468 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:44:30,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 11:44:30,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-14 11:44:30,469 INFO L87 Difference]: Start difference. First operand 2476 states and 3127 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:44:30,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:44:30,525 INFO L93 Difference]: Finished difference Result 3068 states and 3883 transitions. [2021-12-14 11:44:30,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 11:44:30,526 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 393 [2021-12-14 11:44:30,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:44:30,530 INFO L225 Difference]: With dead ends: 3068 [2021-12-14 11:44:30,531 INFO L226 Difference]: Without dead ends: 2930 [2021-12-14 11:44:30,532 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 393 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-14 11:44:30,532 INFO L933 BasicCegarLoop]: 309 mSDtfsCounter, 91 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 11:44:30,532 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [91 Valid, 447 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 11:44:30,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2930 states. [2021-12-14 11:44:30,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2930 to 2340. [2021-12-14 11:44:30,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2340 states, 2339 states have (on average 1.27105600684053) internal successors, (2973), 2339 states have internal predecessors, (2973), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:44:30,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2340 states to 2340 states and 2973 transitions. [2021-12-14 11:44:30,576 INFO L78 Accepts]: Start accepts. Automaton has 2340 states and 2973 transitions. Word has length 393 [2021-12-14 11:44:30,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:44:30,577 INFO L470 AbstractCegarLoop]: Abstraction has 2340 states and 2973 transitions. [2021-12-14 11:44:30,577 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:44:30,577 INFO L276 IsEmpty]: Start isEmpty. Operand 2340 states and 2973 transitions. [2021-12-14 11:44:30,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2021-12-14 11:44:30,581 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:44:30,581 INFO L514 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 11, 11, 10, 10, 9, 9, 8, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:44:30,603 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-14 11:44:30,796 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 11:44:30,796 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:44:30,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:44:30,797 INFO L85 PathProgramCache]: Analyzing trace with hash 2021892229, now seen corresponding path program 1 times [2021-12-14 11:44:30,797 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:44:30,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422552064] [2021-12-14 11:44:30,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:44:30,797 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:44:30,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:44:30,854 INFO L134 CoverageAnalysis]: Checked inductivity of 1704 backedges. 1045 proven. 26 refuted. 0 times theorem prover too weak. 633 trivial. 0 not checked. [2021-12-14 11:44:30,855 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:44:30,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422552064] [2021-12-14 11:44:30,855 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422552064] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 11:44:30,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [54456828] [2021-12-14 11:44:30,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:44:30,855 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 11:44:30,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 11:44:30,872 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) [2021-12-14 11:44:30,873 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-14 11:44:31,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:44:31,005 INFO L263 TraceCheckSpWp]: Trace formula consists of 662 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-14 11:44:31,009 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 11:44:31,544 INFO L134 CoverageAnalysis]: Checked inductivity of 1704 backedges. 1045 proven. 26 refuted. 0 times theorem prover too weak. 633 trivial. 0 not checked. [2021-12-14 11:44:31,544 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 11:44:32,076 INFO L134 CoverageAnalysis]: Checked inductivity of 1704 backedges. 1045 proven. 26 refuted. 0 times theorem prover too weak. 633 trivial. 0 not checked. [2021-12-14 11:44:32,077 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [54456828] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 11:44:32,077 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 11:44:32,077 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2021-12-14 11:44:32,077 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332287623] [2021-12-14 11:44:32,078 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 11:44:32,078 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 11:44:32,078 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:44:32,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 11:44:32,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-14 11:44:32,080 INFO L87 Difference]: Start difference. First operand 2340 states and 2973 transitions. Second operand has 6 states, 6 states have (on average 39.666666666666664) internal successors, (238), 6 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:44:32,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:44:32,319 INFO L93 Difference]: Finished difference Result 5609 states and 7131 transitions. [2021-12-14 11:44:32,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 11:44:32,319 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 39.666666666666664) internal successors, (238), 6 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 409 [2021-12-14 11:44:32,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:44:32,324 INFO L225 Difference]: With dead ends: 5609 [2021-12-14 11:44:32,325 INFO L226 Difference]: Without dead ends: 3228 [2021-12-14 11:44:32,328 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 824 GetRequests, 818 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2021-12-14 11:44:32,329 INFO L933 BasicCegarLoop]: 218 mSDtfsCounter, 586 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 586 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 11:44:32,329 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [586 Valid, 397 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 11:44:32,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3228 states. [2021-12-14 11:44:32,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3228 to 2400. [2021-12-14 11:44:32,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2400 states, 2399 states have (on average 1.2705293872446852) internal successors, (3048), 2399 states have internal predecessors, (3048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:44:32,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2400 states to 2400 states and 3048 transitions. [2021-12-14 11:44:32,376 INFO L78 Accepts]: Start accepts. Automaton has 2400 states and 3048 transitions. Word has length 409 [2021-12-14 11:44:32,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:44:32,376 INFO L470 AbstractCegarLoop]: Abstraction has 2400 states and 3048 transitions. [2021-12-14 11:44:32,376 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 39.666666666666664) internal successors, (238), 6 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:44:32,376 INFO L276 IsEmpty]: Start isEmpty. Operand 2400 states and 3048 transitions. [2021-12-14 11:44:32,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 538 [2021-12-14 11:44:32,381 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:44:32,382 INFO L514 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 15, 15, 14, 14, 13, 13, 12, 12, 12, 12, 10, 8, 8, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:44:32,401 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-14 11:44:32,595 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 11:44:32,595 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:44:32,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:44:32,596 INFO L85 PathProgramCache]: Analyzing trace with hash -50523035, now seen corresponding path program 1 times [2021-12-14 11:44:32,596 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:44:32,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641913364] [2021-12-14 11:44:32,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:44:32,596 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:44:32,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:44:32,651 INFO L134 CoverageAnalysis]: Checked inductivity of 3128 backedges. 1661 proven. 0 refuted. 0 times theorem prover too weak. 1467 trivial. 0 not checked. [2021-12-14 11:44:32,651 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:44:32,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641913364] [2021-12-14 11:44:32,652 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641913364] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:44:32,652 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:44:32,652 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 11:44:32,652 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633830245] [2021-12-14 11:44:32,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:44:32,652 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 11:44:32,652 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:44:32,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 11:44:32,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 11:44:32,653 INFO L87 Difference]: Start difference. First operand 2400 states and 3048 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:44:32,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:44:32,741 INFO L93 Difference]: Finished difference Result 4972 states and 6324 transitions. [2021-12-14 11:44:32,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 11:44:32,742 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 537 [2021-12-14 11:44:32,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:44:32,745 INFO L225 Difference]: With dead ends: 4972 [2021-12-14 11:44:32,746 INFO L226 Difference]: Without dead ends: 2580 [2021-12-14 11:44:32,748 INFO L932 BasicCegarLoop]: 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 [2021-12-14 11:44:32,749 INFO L933 BasicCegarLoop]: 191 mSDtfsCounter, 11 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 11:44:32,749 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 290 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 11:44:32,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2580 states. [2021-12-14 11:44:32,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2580 to 2570. [2021-12-14 11:44:32,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2570 states, 2569 states have (on average 1.262358894511483) internal successors, (3243), 2569 states have internal predecessors, (3243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:44:32,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2570 states to 2570 states and 3243 transitions. [2021-12-14 11:44:32,817 INFO L78 Accepts]: Start accepts. Automaton has 2570 states and 3243 transitions. Word has length 537 [2021-12-14 11:44:32,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:44:32,817 INFO L470 AbstractCegarLoop]: Abstraction has 2570 states and 3243 transitions. [2021-12-14 11:44:32,817 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:44:32,817 INFO L276 IsEmpty]: Start isEmpty. Operand 2570 states and 3243 transitions. [2021-12-14 11:44:32,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 600 [2021-12-14 11:44:32,823 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:44:32,823 INFO L514 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 17, 17, 16, 16, 15, 15, 14, 14, 14, 14, 12, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:44:32,823 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-12-14 11:44:32,824 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:44:32,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:44:32,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1600887189, now seen corresponding path program 1 times [2021-12-14 11:44:32,824 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:44:32,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632311373] [2021-12-14 11:44:32,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:44:32,824 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:44:32,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:44:32,885 INFO L134 CoverageAnalysis]: Checked inductivity of 4009 backedges. 2315 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2021-12-14 11:44:32,885 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:44:32,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632311373] [2021-12-14 11:44:32,885 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632311373] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 11:44:32,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2133328399] [2021-12-14 11:44:32,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:44:32,886 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 11:44:32,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 11:44:32,887 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 11:44:32,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-14 11:44:33,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:44:33,017 INFO L263 TraceCheckSpWp]: Trace formula consists of 920 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-14 11:44:33,038 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 11:44:33,612 INFO L134 CoverageAnalysis]: Checked inductivity of 4009 backedges. 2315 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2021-12-14 11:44:33,612 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 11:44:34,229 INFO L134 CoverageAnalysis]: Checked inductivity of 4009 backedges. 2315 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2021-12-14 11:44:34,230 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2133328399] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 11:44:34,230 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 11:44:34,230 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2021-12-14 11:44:34,230 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008184739] [2021-12-14 11:44:34,230 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 11:44:34,231 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-14 11:44:34,231 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:44:34,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-14 11:44:34,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-12-14 11:44:34,232 INFO L87 Difference]: Start difference. First operand 2570 states and 3243 transitions. Second operand has 8 states, 8 states have (on average 41.5) internal successors, (332), 8 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:44:34,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:44:34,443 INFO L93 Difference]: Finished difference Result 4135 states and 5217 transitions. [2021-12-14 11:44:34,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-14 11:44:34,444 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 41.5) internal successors, (332), 8 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 599 [2021-12-14 11:44:34,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:44:34,444 INFO L225 Difference]: With dead ends: 4135 [2021-12-14 11:44:34,444 INFO L226 Difference]: Without dead ends: 0 [2021-12-14 11:44:34,447 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1204 GetRequests, 1196 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-12-14 11:44:34,449 INFO L933 BasicCegarLoop]: 151 mSDtfsCounter, 119 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 11:44:34,450 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [119 Valid, 398 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 11:44:34,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-12-14 11:44:34,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-12-14 11:44:34,450 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) [2021-12-14 11:44:34,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-12-14 11:44:34,451 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 599 [2021-12-14 11:44:34,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:44:34,451 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-14 11:44:34,451 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 41.5) internal successors, (332), 8 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:44:34,451 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-12-14 11:44:34,451 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-12-14 11:44:34,453 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-14 11:44:34,475 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-12-14 11:44:34,663 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2021-12-14 11:44:34,665 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-12-14 11:44:48,483 INFO L858 garLoopResultBuilder]: For program point L531(lines 531 535) no Hoare annotation was computed. [2021-12-14 11:44:48,483 INFO L858 garLoopResultBuilder]: For program point L531-2(lines 531 535) no Hoare annotation was computed. [2021-12-14 11:44:48,483 INFO L858 garLoopResultBuilder]: For program point L399(lines 399 417) no Hoare annotation was computed. [2021-12-14 11:44:48,484 INFO L854 garLoopResultBuilder]: At program point L201(lines 197 562) the Hoare annotation is: (let ((.cse2 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (.cse3 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse0 (<= 8640 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse1 (< |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656))) (or (and (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8640) .cse0 .cse1 .cse2) (and .cse0 .cse1 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (and .cse3 .cse0 .cse1 .cse2) (and (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1) .cse0 .cse1) (and .cse3 .cse0 .cse1 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576)))) [2021-12-14 11:44:48,484 INFO L854 garLoopResultBuilder]: At program point L168(lines 164 573) the Hoare annotation is: (let ((.cse0 (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse4 (< |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) (.cse5 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse6 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse7 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse8 (< 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse9 (not (= 12292 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse10 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse11 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656))) (.cse12 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and .cse0 .cse1 .cse2 .cse3 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|) .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0) .cse12))) [2021-12-14 11:44:48,484 INFO L854 garLoopResultBuilder]: At program point L135(lines 134 583) the Hoare annotation is: (let ((.cse0 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse4 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse5 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8640)) (.cse6 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse7 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse8 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse9 (<= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse10 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8640) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0) .cse10))) [2021-12-14 11:44:48,484 INFO L858 garLoopResultBuilder]: For program point L102(lines 102 104) no Hoare annotation was computed. [2021-12-14 11:44:48,484 INFO L858 garLoopResultBuilder]: For program point L499(lines 499 502) no Hoare annotation was computed. [2021-12-14 11:44:48,484 INFO L858 garLoopResultBuilder]: For program point L400(lines 400 406) no Hoare annotation was computed. [2021-12-14 11:44:48,484 INFO L861 garLoopResultBuilder]: At program point L632(lines 623 634) the Hoare annotation is: true [2021-12-14 11:44:48,485 INFO L858 garLoopResultBuilder]: For program point L203(lines 203 560) no Hoare annotation was computed. [2021-12-14 11:44:48,485 INFO L858 garLoopResultBuilder]: For program point L170(lines 170 571) no Hoare annotation was computed. [2021-12-14 11:44:48,485 INFO L858 garLoopResultBuilder]: For program point L137(lines 137 582) no Hoare annotation was computed. [2021-12-14 11:44:48,485 INFO L858 garLoopResultBuilder]: For program point L600(lines 600 604) no Hoare annotation was computed. [2021-12-14 11:44:48,485 INFO L858 garLoopResultBuilder]: For program point L468(lines 468 470) no Hoare annotation was computed. [2021-12-14 11:44:48,485 INFO L858 garLoopResultBuilder]: For program point L270(lines 270 272) no Hoare annotation was computed. [2021-12-14 11:44:48,485 INFO L858 garLoopResultBuilder]: For program point L237(lines 237 248) no Hoare annotation was computed. [2021-12-14 11:44:48,485 INFO L858 garLoopResultBuilder]: For program point L237-2(lines 219 553) no Hoare annotation was computed. [2021-12-14 11:44:48,485 INFO L858 garLoopResultBuilder]: For program point L304(lines 304 308) no Hoare annotation was computed. [2021-12-14 11:44:48,485 INFO L858 garLoopResultBuilder]: For program point L304-2(lines 304 308) no Hoare annotation was computed. [2021-12-14 11:44:48,486 INFO L858 garLoopResultBuilder]: For program point L437-1(lines 437 445) no Hoare annotation was computed. [2021-12-14 11:44:48,486 INFO L858 garLoopResultBuilder]: For program point L239(lines 239 242) no Hoare annotation was computed. [2021-12-14 11:44:48,486 INFO L858 garLoopResultBuilder]: For program point L206(lines 206 559) no Hoare annotation was computed. [2021-12-14 11:44:48,486 INFO L858 garLoopResultBuilder]: For program point L173(lines 173 570) no Hoare annotation was computed. [2021-12-14 11:44:48,486 INFO L858 garLoopResultBuilder]: For program point L140(lines 140 581) no Hoare annotation was computed. [2021-12-14 11:44:48,486 INFO L858 garLoopResultBuilder]: For program point L504(lines 504 510) no Hoare annotation was computed. [2021-12-14 11:44:48,486 INFO L854 garLoopResultBuilder]: At program point L207(lines 203 560) the Hoare annotation is: (let ((.cse0 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse2 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse4 (<= 8640 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse5 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse7 (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|)) (.cse6 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576) .cse6) (and .cse0 .cse1 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1) .cse3 .cse4 .cse5 .cse7 .cse6) (and .cse0 .cse1 .cse3 .cse4 .cse5 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0) .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not .cse7) .cse6))) [2021-12-14 11:44:48,486 INFO L854 garLoopResultBuilder]: At program point L174(lines 170 571) the Hoare annotation is: (let ((.cse0 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse1 (< |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) (.cse2 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse3 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse4 (< 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (or (and .cse0 .cse1 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1) .cse2 .cse3 .cse4) (and .cse0 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse1 .cse2 .cse3 .cse4 (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)))) [2021-12-14 11:44:48,486 INFO L858 garLoopResultBuilder]: For program point L440(lines 440 443) no Hoare annotation was computed. [2021-12-14 11:44:48,487 INFO L858 garLoopResultBuilder]: For program point L341(lines 341 379) no Hoare annotation was computed. [2021-12-14 11:44:48,487 INFO L858 garLoopResultBuilder]: For program point L209(lines 209 558) no Hoare annotation was computed. [2021-12-14 11:44:48,487 INFO L858 garLoopResultBuilder]: For program point L176(lines 176 569) no Hoare annotation was computed. [2021-12-14 11:44:48,487 INFO L858 garLoopResultBuilder]: For program point L143(lines 143 580) no Hoare annotation was computed. [2021-12-14 11:44:48,487 INFO L854 garLoopResultBuilder]: At program point L110-2(lines 110 609) the Hoare annotation is: (let ((.cse31 (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse26 (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse22 (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (let ((.cse13 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8640)) (.cse24 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse27 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse17 (<= 8640 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse30 (<= 8672 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse29 (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse16 (not .cse22)) (.cse25 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) (.cse9 (< 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse20 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) (.cse18 (< 8496 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|)) (.cse19 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576)) (.cse4 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse14 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8448)) (.cse28 (= 3 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|)) (.cse15 (<= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse12 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse0 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse21 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse5 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse6 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8640)) (.cse7 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse8 (not .cse26)) (.cse11 (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 3)) (.cse10 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse23 (not .cse31))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse11 .cse10 .cse12) (and (<= 8640 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|) .cse13 .cse14 .cse15 .cse16) (and .cse13 .cse17 .cse6 .cse16) (and .cse4 .cse9 .cse18 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse10 .cse15 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse21 (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8512) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse22 .cse23) (and .cse24 .cse4 .cse17 .cse22 .cse25) (and .cse9 .cse18 .cse19 .cse12 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse21 (< |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576) .cse5 .cse10 .cse22 .cse15 .cse19) (and .cse21 .cse22 .cse26) (and .cse21 .cse24 .cse27 .cse17 .cse19 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse11 .cse10) (and .cse13 .cse11) (and .cse14 .cse28 .cse22 .cse15 .cse12) (and .cse4 .cse14 .cse18 .cse15 .cse19) (and .cse24 .cse17 .cse12 .cse25) (and .cse21 .cse24 .cse27 .cse17 .cse16 .cse25) (and .cse29 .cse14 .cse28 .cse22 .cse15) (and .cse21 .cse14 .cse18 .cse22 .cse15 .cse19) (and .cse12 .cse26) (and .cse30 .cse29 .cse19 .cse25) (and .cse30 .cse29 .cse16 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse21 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse22 .cse19 .cse23) (and (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8528) .cse0 .cse1 .cse2 .cse3 .cse21 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse22 .cse23) (and .cse21 .cse9 .cse18 .cse22 .cse19 .cse20) (and .cse21 .cse31 .cse22) (and .cse14 .cse18 .cse15 .cse19 .cse12) (and .cse4 .cse14 .cse28 .cse22 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse10 .cse15 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse21 .cse5 .cse6 .cse7 .cse8 .cse11 .cse10 .cse23)))) [2021-12-14 11:44:48,487 INFO L858 garLoopResultBuilder]: For program point L507(lines 507 509) no Hoare annotation was computed. [2021-12-14 11:44:48,487 INFO L858 garLoopResultBuilder]: For program point L507-2(lines 219 553) no Hoare annotation was computed. [2021-12-14 11:44:48,487 INFO L854 garLoopResultBuilder]: At program point L408(lines 399 417) the Hoare annotation is: (let ((.cse0 (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse4 (< |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) (.cse5 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse6 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse7 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse8 (< 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse9 (not (= 12292 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse10 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse11 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656))) (.cse12 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and .cse0 .cse1 .cse2 .cse3 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|) .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0) .cse12))) [2021-12-14 11:44:48,488 INFO L858 garLoopResultBuilder]: For program point L243(lines 243 246) no Hoare annotation was computed. [2021-12-14 11:44:48,488 INFO L854 garLoopResultBuilder]: At program point L177(lines 176 569) the Hoare annotation is: (let ((.cse6 (< 8496 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|)) (.cse7 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576)) (.cse4 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse5 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse0 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8448)) (.cse3 (= 3 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|)) (.cse2 (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|)) (.cse1 (<= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (or (and (<= 8640 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|) (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8640) .cse0 .cse1 (not .cse2)) (and .cse0 .cse3 .cse2 .cse1 .cse4) (and .cse5 .cse0 .cse6 .cse1 .cse7) (and (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse0 .cse3 .cse2 .cse1) (and (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse0 .cse6 .cse2 .cse1 .cse7) (and .cse0 .cse6 .cse1 .cse7 .cse4) (and .cse5 .cse0 .cse3 .cse2 .cse1))) [2021-12-14 11:44:48,488 INFO L854 garLoopResultBuilder]: At program point L144(lines 137 582) the Hoare annotation is: (let ((.cse0 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse4 (< |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) (.cse5 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse6 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse7 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse8 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse9 (<= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse10 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and .cse0 .cse1 .cse2 .cse3 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse4 .cse5 .cse6 .cse7 .cse8 (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|) .cse9 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576) .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0) .cse10))) [2021-12-14 11:44:48,488 INFO L858 garLoopResultBuilder]: For program point L111(line 111) no Hoare annotation was computed. [2021-12-14 11:44:48,488 INFO L858 garLoopResultBuilder]: For program point L541(lines 541 547) no Hoare annotation was computed. [2021-12-14 11:44:48,488 INFO L858 garLoopResultBuilder]: For program point L541-1(lines 541 547) no Hoare annotation was computed. [2021-12-14 11:44:48,488 INFO L858 garLoopResultBuilder]: For program point L344(lines 344 378) no Hoare annotation was computed. [2021-12-14 11:44:48,488 INFO L858 garLoopResultBuilder]: For program point L344-1(lines 344 378) no Hoare annotation was computed. [2021-12-14 11:44:48,488 INFO L858 garLoopResultBuilder]: For program point L212(lines 212 557) no Hoare annotation was computed. [2021-12-14 11:44:48,489 INFO L858 garLoopResultBuilder]: For program point L179(lines 179 568) no Hoare annotation was computed. [2021-12-14 11:44:48,489 INFO L858 garLoopResultBuilder]: For program point L146(lines 146 579) no Hoare annotation was computed. [2021-12-14 11:44:48,489 INFO L858 garLoopResultBuilder]: For program point L113(lines 113 590) no Hoare annotation was computed. [2021-12-14 11:44:48,489 INFO L858 garLoopResultBuilder]: For program point L477(lines 477 479) no Hoare annotation was computed. [2021-12-14 11:44:48,489 INFO L858 garLoopResultBuilder]: For program point L411(lines 411 413) no Hoare annotation was computed. [2021-12-14 11:44:48,489 INFO L858 garLoopResultBuilder]: For program point L345(lines 345 375) no Hoare annotation was computed. [2021-12-14 11:44:48,489 INFO L854 garLoopResultBuilder]: At program point L213(lines 209 558) the Hoare annotation is: (let ((.cse1 (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse0 (<= 8672 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse2 (not (= 12292 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse3 (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (or (and .cse0 .cse1 .cse2 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576)) (and .cse0 .cse2 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (and .cse0 .cse1 .cse2 (not .cse3)) (and .cse0 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1) .cse2 .cse3))) [2021-12-14 11:44:48,489 INFO L854 garLoopResultBuilder]: At program point L114(lines 113 590) the Hoare annotation is: false [2021-12-14 11:44:48,489 INFO L861 garLoopResultBuilder]: At program point L610(lines 109 611) the Hoare annotation is: true [2021-12-14 11:44:48,489 INFO L858 garLoopResultBuilder]: For program point L544(lines 544 546) no Hoare annotation was computed. [2021-12-14 11:44:48,490 INFO L858 garLoopResultBuilder]: For program point L215(lines 215 556) no Hoare annotation was computed. [2021-12-14 11:44:48,490 INFO L858 garLoopResultBuilder]: For program point L182(lines 182 567) no Hoare annotation was computed. [2021-12-14 11:44:48,490 INFO L858 garLoopResultBuilder]: For program point L149(lines 149 578) no Hoare annotation was computed. [2021-12-14 11:44:48,490 INFO L858 garLoopResultBuilder]: For program point L116(lines 116 589) no Hoare annotation was computed. [2021-12-14 11:44:48,490 INFO L858 garLoopResultBuilder]: For program point L315(lines 315 322) no Hoare annotation was computed. [2021-12-14 11:44:48,490 INFO L858 garLoopResultBuilder]: For program point L315-2(lines 315 322) no Hoare annotation was computed. [2021-12-14 11:44:48,490 INFO L854 garLoopResultBuilder]: At program point L216(lines 215 556) the Hoare annotation is: (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) [2021-12-14 11:44:48,490 INFO L854 garLoopResultBuilder]: At program point L183(lines 179 568) the Hoare annotation is: (let ((.cse0 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse2 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse3 (< |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8640)) (.cse4 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse5 (< 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse6 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and .cse0 .cse1 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse2 .cse3 .cse4 .cse5 (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|) (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576) .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0) .cse6) (and .cse0 .cse1 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1) .cse2 .cse3 .cse4 .cse5 .cse6))) [2021-12-14 11:44:48,490 INFO L854 garLoopResultBuilder]: At program point L150(lines 146 579) the Hoare annotation is: (let ((.cse0 (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse5 (< |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) (.cse6 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse7 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse8 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse9 (not (= 12292 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse10 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse11 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656))) (.cse12 (<= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse13 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576)) (.cse14 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|) .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0) .cse14))) [2021-12-14 11:44:48,491 INFO L858 garLoopResultBuilder]: For program point L350(lines 350 373) no Hoare annotation was computed. [2021-12-14 11:44:48,491 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-12-14 11:44:48,491 INFO L854 garLoopResultBuilder]: At program point L218(lines 217 556) the Hoare annotation is: (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) [2021-12-14 11:44:48,491 INFO L858 garLoopResultBuilder]: For program point L185(lines 185 566) no Hoare annotation was computed. [2021-12-14 11:44:48,491 INFO L858 garLoopResultBuilder]: For program point L152(lines 152 577) no Hoare annotation was computed. [2021-12-14 11:44:48,491 INFO L858 garLoopResultBuilder]: For program point L119(lines 119 588) no Hoare annotation was computed. [2021-12-14 11:44:48,491 INFO L858 garLoopResultBuilder]: For program point L615(lines 615 617) no Hoare annotation was computed. [2021-12-14 11:44:48,491 INFO L858 garLoopResultBuilder]: For program point L615-2(lines 615 617) no Hoare annotation was computed. [2021-12-14 11:44:48,491 INFO L858 garLoopResultBuilder]: For program point L516(lines 516 519) no Hoare annotation was computed. [2021-12-14 11:44:48,491 INFO L858 garLoopResultBuilder]: For program point L285(lines 285 287) no Hoare annotation was computed. [2021-12-14 11:44:48,492 INFO L858 garLoopResultBuilder]: For program point L285-2(lines 219 553) no Hoare annotation was computed. [2021-12-14 11:44:48,492 INFO L858 garLoopResultBuilder]: For program point L451(lines 451 453) no Hoare annotation was computed. [2021-12-14 11:44:48,492 INFO L858 garLoopResultBuilder]: For program point L319(lines 319 321) no Hoare annotation was computed. [2021-12-14 11:44:48,492 INFO L858 garLoopResultBuilder]: For program point L353(lines 353 357) no Hoare annotation was computed. [2021-12-14 11:44:48,492 INFO L858 garLoopResultBuilder]: For program point L353-2(lines 353 357) no Hoare annotation was computed. [2021-12-14 11:44:48,492 INFO L858 garLoopResultBuilder]: For program point L254(lines 254 264) no Hoare annotation was computed. [2021-12-14 11:44:48,492 INFO L858 garLoopResultBuilder]: For program point L188(lines 188 565) no Hoare annotation was computed. [2021-12-14 11:44:48,492 INFO L858 garLoopResultBuilder]: For program point L155(lines 155 576) no Hoare annotation was computed. [2021-12-14 11:44:48,492 INFO L858 garLoopResultBuilder]: For program point L122(lines 122 587) no Hoare annotation was computed. [2021-12-14 11:44:48,492 INFO L858 garLoopResultBuilder]: For program point L486(lines 486 488) no Hoare annotation was computed. [2021-12-14 11:44:48,493 INFO L858 garLoopResultBuilder]: For program point L387(lines 387 419) no Hoare annotation was computed. [2021-12-14 11:44:48,493 INFO L858 garLoopResultBuilder]: For program point L255(lines 255 258) no Hoare annotation was computed. [2021-12-14 11:44:48,493 INFO L854 garLoopResultBuilder]: At program point L222(lines 116 589) the Hoare annotation is: false [2021-12-14 11:44:48,493 INFO L854 garLoopResultBuilder]: At program point L189(lines 185 566) the Hoare annotation is: (let ((.cse0 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse2 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse3 (< |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8640)) (.cse4 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse5 (< 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse6 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and .cse0 .cse1 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse2 .cse3 .cse4 .cse5 (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|) (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576) .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0) .cse6) (and .cse0 .cse1 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1) .cse2 .cse3 .cse4 .cse5 .cse6))) [2021-12-14 11:44:48,493 INFO L854 garLoopResultBuilder]: At program point L156(lines 152 577) the Hoare annotation is: (let ((.cse0 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse2 (< |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) (.cse3 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse4 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse5 (< 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse6 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0) .cse6) (and .cse0 .cse1 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse2 .cse3 .cse4 .cse5 (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|) .cse6) (and .cse0 .cse1 .cse2 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1) .cse3 .cse4 .cse5 .cse6))) [2021-12-14 11:44:48,493 INFO L858 garLoopResultBuilder]: For program point L454(lines 454 463) no Hoare annotation was computed. [2021-12-14 11:44:48,493 INFO L858 garLoopResultBuilder]: For program point L388(lines 388 394) no Hoare annotation was computed. [2021-12-14 11:44:48,493 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-12-14 11:44:48,493 INFO L861 garLoopResultBuilder]: At program point L620(lines 22 622) the Hoare annotation is: true [2021-12-14 11:44:48,494 INFO L854 garLoopResultBuilder]: At program point L554(lines 110 609) the Hoare annotation is: (let ((.cse31 (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse26 (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse22 (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (let ((.cse13 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8640)) (.cse24 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse27 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse17 (<= 8640 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse30 (<= 8672 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse29 (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse16 (not .cse22)) (.cse25 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) (.cse9 (< 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse20 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) (.cse18 (< 8496 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|)) (.cse19 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576)) (.cse4 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse14 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8448)) (.cse28 (= 3 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|)) (.cse15 (<= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse12 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse0 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse21 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse5 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse6 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8640)) (.cse7 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse8 (not .cse26)) (.cse11 (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 3)) (.cse10 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse23 (not .cse31))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse11 .cse10 .cse12) (and (<= 8640 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|) .cse13 .cse14 .cse15 .cse16) (and .cse13 .cse17 .cse6 .cse16) (and .cse4 .cse9 .cse18 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse10 .cse15 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse21 (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8512) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse22 .cse23) (and .cse24 .cse4 .cse17 .cse22 .cse25) (and .cse9 .cse18 .cse19 .cse12 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse21 (< |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576) .cse5 .cse10 .cse22 .cse15 .cse19) (and .cse21 .cse22 .cse26) (and .cse21 .cse24 .cse27 .cse17 .cse19 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse11 .cse10) (and .cse13 .cse11) (and .cse14 .cse28 .cse22 .cse15 .cse12) (and .cse4 .cse14 .cse18 .cse15 .cse19) (and .cse24 .cse17 .cse12 .cse25) (and .cse21 .cse24 .cse27 .cse17 .cse16 .cse25) (and .cse29 .cse14 .cse28 .cse22 .cse15) (and .cse21 .cse14 .cse18 .cse22 .cse15 .cse19) (and .cse12 .cse26) (and .cse30 .cse29 .cse19 .cse25) (and .cse30 .cse29 .cse16 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse21 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse22 .cse19 .cse23) (and (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8528) .cse0 .cse1 .cse2 .cse3 .cse21 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse22 .cse23) (and .cse21 .cse9 .cse18 .cse22 .cse19 .cse20) (and .cse21 .cse31 .cse22) (and .cse14 .cse18 .cse15 .cse19 .cse12) (and .cse4 .cse14 .cse28 .cse22 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse10 .cse15 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse21 .cse5 .cse6 .cse7 .cse8 .cse11 .cse10 .cse23)))) [2021-12-14 11:44:48,494 INFO L858 garLoopResultBuilder]: For program point L191(lines 191 564) no Hoare annotation was computed. [2021-12-14 11:44:48,494 INFO L858 garLoopResultBuilder]: For program point L158(lines 158 575) no Hoare annotation was computed. [2021-12-14 11:44:48,494 INFO L858 garLoopResultBuilder]: For program point L125(lines 125 586) no Hoare annotation was computed. [2021-12-14 11:44:48,494 INFO L858 garLoopResultBuilder]: For program point L489(lines 489 493) no Hoare annotation was computed. [2021-12-14 11:44:48,494 INFO L858 garLoopResultBuilder]: For program point L489-2(lines 489 493) no Hoare annotation was computed. [2021-12-14 11:44:48,494 INFO L858 garLoopResultBuilder]: For program point L93(lines 93 99) no Hoare annotation was computed. [2021-12-14 11:44:48,494 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-12-14 11:44:48,494 INFO L858 garLoopResultBuilder]: For program point L524(lines 524 526) no Hoare annotation was computed. [2021-12-14 11:44:48,495 INFO L858 garLoopResultBuilder]: For program point L458(lines 458 460) no Hoare annotation was computed. [2021-12-14 11:44:48,495 INFO L858 garLoopResultBuilder]: For program point L227(lines 227 229) no Hoare annotation was computed. [2021-12-14 11:44:48,495 INFO L858 garLoopResultBuilder]: For program point L194(lines 194 563) no Hoare annotation was computed. [2021-12-14 11:44:48,495 INFO L858 garLoopResultBuilder]: For program point L161(lines 161 574) no Hoare annotation was computed. [2021-12-14 11:44:48,495 INFO L858 garLoopResultBuilder]: For program point L227-2(lines 227 229) no Hoare annotation was computed. [2021-12-14 11:44:48,495 INFO L858 garLoopResultBuilder]: For program point L128(lines 128 585) no Hoare annotation was computed. [2021-12-14 11:44:48,495 INFO L858 garLoopResultBuilder]: For program point L591(lines 591 607) no Hoare annotation was computed. [2021-12-14 11:44:48,495 INFO L854 garLoopResultBuilder]: At program point L525(lines 83 621) the Hoare annotation is: false [2021-12-14 11:44:48,495 INFO L854 garLoopResultBuilder]: At program point L195(lines 191 564) the Hoare annotation is: (let ((.cse0 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse2 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse3 (< |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8640)) (.cse4 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse5 (< 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse6 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and .cse0 .cse1 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse2 .cse3 .cse4 .cse5 (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|) (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576) .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0) .cse6) (and .cse0 .cse1 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1) .cse2 .cse3 .cse4 .cse5 .cse6))) [2021-12-14 11:44:48,495 INFO L854 garLoopResultBuilder]: At program point L162(lines 158 575) the Hoare annotation is: (let ((.cse0 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse2 (< |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) (.cse3 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse4 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse5 (< 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse6 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0) .cse6) (and .cse0 .cse1 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse2 .cse3 .cse4 .cse5 (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|) .cse6) (and .cse0 .cse1 .cse2 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1) .cse3 .cse4 .cse5 .cse6))) [2021-12-14 11:44:48,496 INFO L858 garLoopResultBuilder]: For program point L96(lines 96 98) no Hoare annotation was computed. [2021-12-14 11:44:48,496 INFO L858 garLoopResultBuilder]: For program point L96-2(lines 93 99) no Hoare annotation was computed. [2021-12-14 11:44:48,496 INFO L858 garLoopResultBuilder]: For program point L592(lines 592 606) no Hoare annotation was computed. [2021-12-14 11:44:48,496 INFO L858 garLoopResultBuilder]: For program point L361(lines 361 369) no Hoare annotation was computed. [2021-12-14 11:44:48,496 INFO L858 garLoopResultBuilder]: For program point L593(lines 593 598) no Hoare annotation was computed. [2021-12-14 11:44:48,496 INFO L858 garLoopResultBuilder]: For program point L527(lines 527 529) no Hoare annotation was computed. [2021-12-14 11:44:48,496 INFO L858 garLoopResultBuilder]: For program point L593-2(lines 592 606) no Hoare annotation was computed. [2021-12-14 11:44:48,496 INFO L854 garLoopResultBuilder]: At program point L362(lines 338 380) the Hoare annotation is: (let ((.cse0 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse2 (< |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) (.cse3 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse4 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse5 (< 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse6 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0) .cse6) (and .cse0 .cse1 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse2 .cse3 .cse4 .cse5 (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|) .cse6) (and .cse0 .cse1 .cse2 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1) .cse3 .cse4 .cse5 .cse6))) [2021-12-14 11:44:48,496 INFO L858 garLoopResultBuilder]: For program point L197(lines 197 562) no Hoare annotation was computed. [2021-12-14 11:44:48,496 INFO L858 garLoopResultBuilder]: For program point L164(lines 164 573) no Hoare annotation was computed. [2021-12-14 11:44:48,497 INFO L858 garLoopResultBuilder]: For program point L131(lines 131 584) no Hoare annotation was computed. [2021-12-14 11:44:48,497 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-12-14 11:44:48,497 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 619) no Hoare annotation was computed. [2021-12-14 11:44:48,497 INFO L858 garLoopResultBuilder]: For program point L429(lines 429 431) no Hoare annotation was computed. [2021-12-14 11:44:48,497 INFO L854 garLoopResultBuilder]: At program point L396(lines 387 419) the Hoare annotation is: (let ((.cse0 (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse4 (< |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) (.cse5 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse6 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse7 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse8 (< 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse9 (not (= 12292 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse10 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse11 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656))) (.cse12 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and .cse0 .cse1 .cse2 .cse3 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|) .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0) .cse12))) [2021-12-14 11:44:48,497 INFO L854 garLoopResultBuilder]: At program point L132(lines 128 585) the Hoare annotation is: false [2021-12-14 11:44:48,497 INFO L858 garLoopResultBuilder]: For program point L595(lines 595 597) no Hoare annotation was computed. [2021-12-14 11:44:48,497 INFO L858 garLoopResultBuilder]: For program point L364(lines 364 366) no Hoare annotation was computed. [2021-12-14 11:44:48,497 INFO L858 garLoopResultBuilder]: For program point L298(lines 298 300) no Hoare annotation was computed. [2021-12-14 11:44:48,498 INFO L858 garLoopResultBuilder]: For program point L232(lines 232 234) no Hoare annotation was computed. [2021-12-14 11:44:48,498 INFO L858 garLoopResultBuilder]: For program point L298-2(lines 219 553) no Hoare annotation was computed. [2021-12-14 11:44:48,498 INFO L858 garLoopResultBuilder]: For program point L332(lines 332 336) no Hoare annotation was computed. [2021-12-14 11:44:48,498 INFO L858 garLoopResultBuilder]: For program point L332-2(lines 219 553) no Hoare annotation was computed. [2021-12-14 11:44:48,498 INFO L858 garLoopResultBuilder]: For program point L200(lines 200 561) no Hoare annotation was computed. [2021-12-14 11:44:48,498 INFO L858 garLoopResultBuilder]: For program point L167(lines 167 572) no Hoare annotation was computed. [2021-12-14 11:44:48,498 INFO L858 garLoopResultBuilder]: For program point L134(lines 134 583) no Hoare annotation was computed. [2021-12-14 11:44:48,498 INFO L858 garLoopResultBuilder]: For program point L101(lines 101 105) no Hoare annotation was computed. [2021-12-14 11:44:48,498 INFO L858 garLoopResultBuilder]: For program point L101-1(lines 83 621) no Hoare annotation was computed. [2021-12-14 11:44:48,501 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:44:48,502 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-14 11:44:48,529 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.12 11:44:48 BoogieIcfgContainer [2021-12-14 11:44:48,541 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-14 11:44:48,542 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-14 11:44:48,542 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-14 11:44:48,543 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-14 11:44:48,543 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 11:44:21" (3/4) ... [2021-12-14 11:44:48,545 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-12-14 11:44:48,562 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2021-12-14 11:44:48,562 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2021-12-14 11:44:48,563 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-12-14 11:44:48,564 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-12-14 11:44:48,636 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-14 11:44:48,636 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-14 11:44:48,637 INFO L158 Benchmark]: Toolchain (without parser) took 28042.14ms. Allocated memory was 86.0MB in the beginning and 438.3MB in the end (delta: 352.3MB). Free memory was 55.4MB in the beginning and 247.6MB in the end (delta: -192.2MB). Peak memory consumption was 160.0MB. Max. memory is 16.1GB. [2021-12-14 11:44:48,638 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 86.0MB. Free memory was 41.9MB in the beginning and 41.9MB in the end (delta: 34.3kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-14 11:44:48,639 INFO L158 Benchmark]: CACSL2BoogieTranslator took 277.79ms. Allocated memory is still 86.0MB. Free memory was 55.1MB in the beginning and 58.4MB in the end (delta: -3.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-14 11:44:48,643 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.40ms. Allocated memory is still 86.0MB. Free memory was 58.4MB in the beginning and 55.8MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-14 11:44:48,643 INFO L158 Benchmark]: Boogie Preprocessor took 54.36ms. Allocated memory is still 86.0MB. Free memory was 55.4MB in the beginning and 53.7MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-14 11:44:48,643 INFO L158 Benchmark]: RCFGBuilder took 550.90ms. Allocated memory was 86.0MB in the beginning and 109.1MB in the end (delta: 23.1MB). Free memory was 53.7MB in the beginning and 79.8MB in the end (delta: -26.1MB). Peak memory consumption was 33.0MB. Max. memory is 16.1GB. [2021-12-14 11:44:48,643 INFO L158 Benchmark]: TraceAbstraction took 26995.37ms. Allocated memory was 109.1MB in the beginning and 438.3MB in the end (delta: 329.3MB). Free memory was 78.8MB in the beginning and 261.2MB in the end (delta: -182.4MB). Peak memory consumption was 266.3MB. Max. memory is 16.1GB. [2021-12-14 11:44:48,645 INFO L158 Benchmark]: Witness Printer took 94.16ms. Allocated memory is still 438.3MB. Free memory was 261.2MB in the beginning and 247.6MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-12-14 11:44:48,646 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 86.0MB. Free memory was 41.9MB in the beginning and 41.9MB in the end (delta: 34.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 277.79ms. Allocated memory is still 86.0MB. Free memory was 55.1MB in the beginning and 58.4MB in the end (delta: -3.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 64.40ms. Allocated memory is still 86.0MB. Free memory was 58.4MB in the beginning and 55.8MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.36ms. Allocated memory is still 86.0MB. Free memory was 55.4MB in the beginning and 53.7MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 550.90ms. Allocated memory was 86.0MB in the beginning and 109.1MB in the end (delta: 23.1MB). Free memory was 53.7MB in the beginning and 79.8MB in the end (delta: -26.1MB). Peak memory consumption was 33.0MB. Max. memory is 16.1GB. * TraceAbstraction took 26995.37ms. Allocated memory was 109.1MB in the beginning and 438.3MB in the end (delta: 329.3MB). Free memory was 78.8MB in the beginning and 261.2MB in the end (delta: -182.4MB). Peak memory consumption was 266.3MB. Max. memory is 16.1GB. * Witness Printer took 94.16ms. Allocated memory is still 438.3MB. Free memory was 261.2MB in the beginning and 247.6MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 619]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 141 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 26.9s, OverallIterations: 34, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 4.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 13.8s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4953 SdHoareTripleChecker+Valid, 2.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4953 mSDsluCounter, 10153 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3407 mSDsCounter, 1020 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4114 IncrementalHoareTripleChecker+Invalid, 5134 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1020 mSolverCounterUnsat, 6746 mSDtfsCounter, 4114 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3496 GetRequests, 3436 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4524occurred in iteration=27, InterpolantAutomatonStates: 119, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.3s AutomataMinimizationTime, 34 MinimizatonAttempts, 6551 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 28 LocationsWithAnnotation, 28 PreInvPairs, 235 NumberOfFragments, 3541 HoareAnnotationTreeSize, 28 FomulaSimplifications, 59486 FormulaSimplificationTreeSizeReduction, 5.6s HoareSimplificationTime, 28 FomulaSimplificationsInter, 207931 FormulaSimplificationTreeSizeReductionInter, 8.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 4.9s InterpolantComputationTime, 8782 NumberOfCodeBlocks, 8782 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 10232 ConstructedInterpolants, 0 QuantifiedInterpolants, 14127 SizeOfPredicates, 4 NumberOfNonLiveVariables, 3095 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 43 InterpolantComputations, 30 PerfectInterpolantSequences, 34894/35202 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 83]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 164]: Loop Invariant Derived loop invariant: (((((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && 2 == blastFlag) && s__state < 8576) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && 8496 < s__state) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && 0 == s__hit) && !(8560 == s__state)) || (((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && s__state < 8576) && !(s__state == 8657)) && blastFlag == 1) && !(s__state == 8672)) && !(8497 == s__state)) && 8496 < s__state) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(8560 == s__state))) || (((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && s__state < 8576) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && 8496 < s__state) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && blastFlag == 0) && !(8560 == s__state)) - InvariantResult [Line: 134]: Loop Invariant Derived loop invariant: (((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(8497 == s__state)) && s__s3__tmp__next_state___0 <= 8640) && s__state <= 8640) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && 8448 <= s__state) && !(8560 == s__state)) || (((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(8497 == s__state)) && s__state <= 8640) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && 8448 <= s__state) && !(8560 == s__state))) || (((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && blastFlag == 1) && !(8497 == s__state)) && s__state <= 8640) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && 8448 <= s__state) && !(8560 == s__state))) || (((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(8497 == s__state)) && s__state <= 8640) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && 8448 <= s__state) && blastFlag == 0) && !(8560 == s__state)) - InvariantResult [Line: 215]: Loop Invariant Derived loop invariant: !(s__state == 8672) - InvariantResult [Line: 203]: Loop Invariant Derived loop invariant: (((((((((!(8448 == s__state) && !(s__state == 8481)) && 2 == blastFlag) && !(s__state == 8672)) && 8640 <= s__state) && !(s__state == 8480)) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8672) || (((((((!(8448 == s__state) && !(s__state == 8481)) && blastFlag == 1) && !(s__state == 8672)) && 8640 <= s__state) && !(s__state == 8480)) && 0 == s__hit) && s__state <= 8672)) || ((((((!(8448 == s__state) && !(s__state == 8481)) && !(s__state == 8672)) && 8640 <= s__state) && !(s__state == 8480)) && blastFlag == 0) && s__state <= 8672)) || (((((((!(8448 == s__state) && !(s__state == 8481)) && 2 == blastFlag) && !(s__state == 8672)) && 8640 <= s__state) && !(s__state == 8480)) && !(0 == s__hit)) && s__state <= 8672) - InvariantResult [Line: 399]: Loop Invariant Derived loop invariant: (((((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && 2 == blastFlag) && s__state < 8576) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && 8496 < s__state) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && 0 == s__hit) && !(8560 == s__state)) || (((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && s__state < 8576) && !(s__state == 8657)) && blastFlag == 1) && !(s__state == 8672)) && !(8497 == s__state)) && 8496 < s__state) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(8560 == s__state))) || (((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && s__state < 8576) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && 8496 < s__state) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && blastFlag == 0) && !(8560 == s__state)) - InvariantResult [Line: 191]: Loop Invariant Derived loop invariant: ((((((((((!(s__state == 8561) && !(s__state == 8545)) && 2 == blastFlag) && !(8497 == s__state)) && s__state < 8640) && !(8544 == s__state)) && 8496 < s__state) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8576) && !(8560 == s__state)) || (((((((!(s__state == 8561) && !(s__state == 8545)) && !(8497 == s__state)) && s__state < 8640) && !(8544 == s__state)) && 8496 < s__state) && blastFlag == 0) && !(8560 == s__state))) || (((((((!(s__state == 8561) && !(s__state == 8545)) && blastFlag == 1) && !(8497 == s__state)) && s__state < 8640) && !(8544 == s__state)) && 8496 < s__state) && !(8560 == s__state)) - InvariantResult [Line: 137]: Loop Invariant Derived loop invariant: ((((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && s__state < 8576) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && 0 == s__hit) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && !(8560 == s__state)) || (((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && s__state < 8576) && blastFlag == 1) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && 8448 <= s__state) && !(8560 == s__state))) || (((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && s__state < 8576) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && 8448 <= s__state) && blastFlag == 0) && !(8560 == s__state)) - InvariantResult [Line: 217]: Loop Invariant Derived loop invariant: !(s__state == 8672) - InvariantResult [Line: 110]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && blastFlag == 1) && !(8497 == s__state)) && s__state <= 8640) && !(8496 == s__state)) && !(8544 == s__state)) && 8496 < s__state) && !(s__state == 8480)) || ((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(8497 == s__state)) && s__state <= 8640) && !(8496 == s__state)) && !(8544 == s__state)) && s__state == 3) && !(s__state == 8480)) && blastFlag == 0)) || ((((8640 <= s__s3__tmp__next_state___0 && s__s3__tmp__next_state___0 <= 8640) && s__state <= 8448) && 8448 <= s__state) && !(0 == s__hit))) || (((s__s3__tmp__next_state___0 <= 8640 && 8640 <= s__state) && s__state <= 8640) && !(0 == s__hit))) || ((((blastFlag == 1 && 8496 < s__state) && 8496 < s__s3__tmp__next_state___0) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576)) || ((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && blastFlag == 1) && !(8497 == s__state)) && !(s__state == 8480)) && 8448 <= s__state) && s__state <= 8576)) || (((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && s__state == 8512) && !(8497 == s__state)) && s__state <= 8640) && !(8496 == s__state)) && !(8544 == s__state)) && 8496 < s__state) && !(s__state == 8480)) && 0 == s__hit) && !(8560 == s__state))) || ((((!(s__state == 8657) && blastFlag == 1) && 8640 <= s__state) && 0 == s__hit) && s__state <= 8672)) || ((((8496 < s__state && 8496 < s__s3__tmp__next_state___0) && s__s3__tmp__next_state___0 <= 8576) && blastFlag == 0) && s__state <= 8576)) || ((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && s__state < 8576) && !(8497 == s__state)) && !(s__state == 8480)) && 0 == s__hit) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576)) || ((2 == blastFlag && 0 == s__hit) && 8544 == s__state)) || (((((2 == blastFlag && !(s__state == 8657)) && !(s__state == 8672)) && 8640 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8672)) || ((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && blastFlag == 1) && !(8497 == s__state)) && s__state <= 8640) && !(8496 == s__state)) && !(8544 == s__state)) && s__state == 3) && !(s__state == 8480))) || (s__s3__tmp__next_state___0 <= 8640 && s__state == 3)) || ((((s__state <= 8448 && 3 == s__s3__tmp__next_state___0) && 0 == s__hit) && 8448 <= s__state) && blastFlag == 0)) || ((((blastFlag == 1 && s__state <= 8448) && 8496 < s__s3__tmp__next_state___0) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576)) || (((!(s__state == 8657) && 8640 <= s__state) && blastFlag == 0) && s__state <= 8672)) || (((((2 == blastFlag && !(s__state == 8657)) && !(s__state == 8672)) && 8640 <= s__state) && !(0 == s__hit)) && s__state <= 8672)) || ((((3 == blastFlag && s__state <= 8448) && 3 == s__s3__tmp__next_state___0) && 0 == s__hit) && 8448 <= s__state)) || (((((2 == blastFlag && s__state <= 8448) && 8496 < s__s3__tmp__next_state___0) && 0 == s__hit) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576)) || (blastFlag == 0 && 8544 == s__state)) || (((8672 <= s__state && 3 == blastFlag) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8672)) || (((8672 <= s__state && 3 == blastFlag) && !(0 == s__hit)) && s__state <= 8672)) || (((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(8497 == s__state)) && s__state <= 8640) && !(8496 == s__state)) && !(8544 == s__state)) && 8496 < s__state) && !(s__state == 8480)) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8576) && !(8560 == s__state))) || (((((((((((((s__state == 8528 && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(8497 == s__state)) && s__state <= 8640) && !(8496 == s__state)) && !(8544 == s__state)) && 8496 < s__state) && !(s__state == 8480)) && 0 == s__hit) && !(8560 == s__state))) || (((((2 == blastFlag && 8496 < s__state) && 8496 < s__s3__tmp__next_state___0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576)) || ((2 == blastFlag && 8560 == s__state) && 0 == s__hit)) || ((((s__state <= 8448 && 8496 < s__s3__tmp__next_state___0) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && blastFlag == 0)) || ((((blastFlag == 1 && s__state <= 8448) && 3 == s__s3__tmp__next_state___0) && 0 == s__hit) && 8448 <= s__state)) || ((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(8497 == s__state)) && s__state <= 8640) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && 8448 <= s__state) && blastFlag == 0)) || (((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(8497 == s__state)) && s__state <= 8640) && !(8496 == s__state)) && !(8544 == s__state)) && s__state == 3) && !(s__state == 8480)) && !(8560 == s__state)) - InvariantResult [Line: 116]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 109]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 113]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 176]: Loop Invariant Derived loop invariant: (((((((((8640 <= s__s3__tmp__next_state___0 && s__s3__tmp__next_state___0 <= 8640) && s__state <= 8448) && 8448 <= s__state) && !(0 == s__hit)) || ((((s__state <= 8448 && 3 == s__s3__tmp__next_state___0) && 0 == s__hit) && 8448 <= s__state) && blastFlag == 0)) || ((((blastFlag == 1 && s__state <= 8448) && 8496 < s__s3__tmp__next_state___0) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576)) || ((((3 == blastFlag && s__state <= 8448) && 3 == s__s3__tmp__next_state___0) && 0 == s__hit) && 8448 <= s__state)) || (((((2 == blastFlag && s__state <= 8448) && 8496 < s__s3__tmp__next_state___0) && 0 == s__hit) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576)) || ((((s__state <= 8448 && 8496 < s__s3__tmp__next_state___0) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && blastFlag == 0)) || ((((blastFlag == 1 && s__state <= 8448) && 3 == s__s3__tmp__next_state___0) && 0 == s__hit) && 8448 <= s__state) - InvariantResult [Line: 185]: Loop Invariant Derived loop invariant: ((((((((((!(s__state == 8561) && !(s__state == 8545)) && 2 == blastFlag) && !(8497 == s__state)) && s__state < 8640) && !(8544 == s__state)) && 8496 < s__state) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8576) && !(8560 == s__state)) || (((((((!(s__state == 8561) && !(s__state == 8545)) && !(8497 == s__state)) && s__state < 8640) && !(8544 == s__state)) && 8496 < s__state) && blastFlag == 0) && !(8560 == s__state))) || (((((((!(s__state == 8561) && !(s__state == 8545)) && blastFlag == 1) && !(8497 == s__state)) && s__state < 8640) && !(8544 == s__state)) && 8496 < s__state) && !(8560 == s__state)) - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 387]: Loop Invariant Derived loop invariant: (((((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && 2 == blastFlag) && s__state < 8576) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && 8496 < s__state) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && 0 == s__hit) && !(8560 == s__state)) || (((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && s__state < 8576) && !(s__state == 8657)) && blastFlag == 1) && !(s__state == 8672)) && !(8497 == s__state)) && 8496 < s__state) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(8560 == s__state))) || (((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && s__state < 8576) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && 8496 < s__state) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && blastFlag == 0) && !(8560 == s__state)) - InvariantResult [Line: 209]: Loop Invariant Derived loop invariant: (((((8672 <= s__state && 3 == blastFlag) && !(12292 == s__state)) && s__s3__tmp__next_state___0 <= 8576) || ((8672 <= s__state && !(12292 == s__state)) && blastFlag == 0)) || (((8672 <= s__state && 3 == blastFlag) && !(12292 == s__state)) && !(0 == s__hit))) || (((8672 <= s__state && blastFlag == 1) && !(12292 == s__state)) && 0 == s__hit) - InvariantResult [Line: 128]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 338]: Loop Invariant Derived loop invariant: ((((((((!(s__state == 8561) && !(s__state == 8545)) && s__state < 8576) && !(8497 == s__state)) && !(8544 == s__state)) && 8496 < s__state) && blastFlag == 0) && !(8560 == s__state)) || ((((((((!(s__state == 8561) && !(s__state == 8545)) && 2 == blastFlag) && s__state < 8576) && !(8497 == s__state)) && !(8544 == s__state)) && 8496 < s__state) && 0 == s__hit) && !(8560 == s__state))) || (((((((!(s__state == 8561) && !(s__state == 8545)) && s__state < 8576) && blastFlag == 1) && !(8497 == s__state)) && !(8544 == s__state)) && 8496 < s__state) && !(8560 == s__state)) - InvariantResult [Line: 152]: Loop Invariant Derived loop invariant: ((((((((!(s__state == 8561) && !(s__state == 8545)) && s__state < 8576) && !(8497 == s__state)) && !(8544 == s__state)) && 8496 < s__state) && blastFlag == 0) && !(8560 == s__state)) || ((((((((!(s__state == 8561) && !(s__state == 8545)) && 2 == blastFlag) && s__state < 8576) && !(8497 == s__state)) && !(8544 == s__state)) && 8496 < s__state) && 0 == s__hit) && !(8560 == s__state))) || (((((((!(s__state == 8561) && !(s__state == 8545)) && s__state < 8576) && blastFlag == 1) && !(8497 == s__state)) && !(8544 == s__state)) && 8496 < s__state) && !(8560 == s__state)) - InvariantResult [Line: 623]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 170]: Loop Invariant Derived loop invariant: ((((((!(s__state == 8545) && s__state < 8576) && blastFlag == 1) && !(8497 == s__state)) && !(8544 == s__state)) && 8496 < s__state) || ((((((!(s__state == 8545) && 2 == blastFlag) && s__state < 8576) && !(8497 == s__state)) && !(8544 == s__state)) && 8496 < s__state) && 0 == s__hit)) || (((((!(s__state == 8545) && s__state < 8576) && !(8497 == s__state)) && !(8544 == s__state)) && 8496 < s__state) && blastFlag == 0) - InvariantResult [Line: 179]: Loop Invariant Derived loop invariant: ((((((((((!(s__state == 8561) && !(s__state == 8545)) && 2 == blastFlag) && !(8497 == s__state)) && s__state < 8640) && !(8544 == s__state)) && 8496 < s__state) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8576) && !(8560 == s__state)) || (((((((!(s__state == 8561) && !(s__state == 8545)) && !(8497 == s__state)) && s__state < 8640) && !(8544 == s__state)) && 8496 < s__state) && blastFlag == 0) && !(8560 == s__state))) || (((((((!(s__state == 8561) && !(s__state == 8545)) && blastFlag == 1) && !(8497 == s__state)) && s__state < 8640) && !(8544 == s__state)) && 8496 < s__state) && !(8560 == s__state)) - InvariantResult [Line: 146]: Loop Invariant Derived loop invariant: (((((((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && s__state < 8576) && !(s__state == 8657)) && !(s__state == 8672)) && !(8544 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && 0 == s__hit) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && !(8560 == s__state)) || ((((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && s__state < 8576) && !(s__state == 8657)) && blastFlag == 1) && !(s__state == 8672)) && !(8544 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && 8448 <= s__state) && !(8560 == s__state))) || (((((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && s__state < 8576) && !(s__state == 8657)) && !(s__state == 8672)) && !(8544 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && blastFlag == 0) && !(8560 == s__state)) - InvariantResult [Line: 197]: Loop Invariant Derived loop invariant: ((((((s__s3__tmp__next_state___0 <= 8640 && 8640 <= s__state) && s__state < 8656) && !(0 == s__hit)) || ((8640 <= s__state && s__state < 8656) && blastFlag == 0)) || (((2 == blastFlag && 8640 <= s__state) && s__state < 8656) && !(0 == s__hit))) || ((blastFlag == 1 && 8640 <= s__state) && s__state < 8656)) || (((2 == blastFlag && 8640 <= s__state) && s__state < 8656) && s__s3__tmp__next_state___0 <= 8576) - InvariantResult [Line: 158]: Loop Invariant Derived loop invariant: ((((((((!(s__state == 8561) && !(s__state == 8545)) && s__state < 8576) && !(8497 == s__state)) && !(8544 == s__state)) && 8496 < s__state) && blastFlag == 0) && !(8560 == s__state)) || ((((((((!(s__state == 8561) && !(s__state == 8545)) && 2 == blastFlag) && s__state < 8576) && !(8497 == s__state)) && !(8544 == s__state)) && 8496 < s__state) && 0 == s__hit) && !(8560 == s__state))) || (((((((!(s__state == 8561) && !(s__state == 8545)) && s__state < 8576) && blastFlag == 1) && !(8497 == s__state)) && !(8544 == s__state)) && 8496 < s__state) && !(8560 == s__state)) - InvariantResult [Line: 110]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && blastFlag == 1) && !(8497 == s__state)) && s__state <= 8640) && !(8496 == s__state)) && !(8544 == s__state)) && 8496 < s__state) && !(s__state == 8480)) || ((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(8497 == s__state)) && s__state <= 8640) && !(8496 == s__state)) && !(8544 == s__state)) && s__state == 3) && !(s__state == 8480)) && blastFlag == 0)) || ((((8640 <= s__s3__tmp__next_state___0 && s__s3__tmp__next_state___0 <= 8640) && s__state <= 8448) && 8448 <= s__state) && !(0 == s__hit))) || (((s__s3__tmp__next_state___0 <= 8640 && 8640 <= s__state) && s__state <= 8640) && !(0 == s__hit))) || ((((blastFlag == 1 && 8496 < s__state) && 8496 < s__s3__tmp__next_state___0) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576)) || ((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && blastFlag == 1) && !(8497 == s__state)) && !(s__state == 8480)) && 8448 <= s__state) && s__state <= 8576)) || (((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && s__state == 8512) && !(8497 == s__state)) && s__state <= 8640) && !(8496 == s__state)) && !(8544 == s__state)) && 8496 < s__state) && !(s__state == 8480)) && 0 == s__hit) && !(8560 == s__state))) || ((((!(s__state == 8657) && blastFlag == 1) && 8640 <= s__state) && 0 == s__hit) && s__state <= 8672)) || ((((8496 < s__state && 8496 < s__s3__tmp__next_state___0) && s__s3__tmp__next_state___0 <= 8576) && blastFlag == 0) && s__state <= 8576)) || ((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && s__state < 8576) && !(8497 == s__state)) && !(s__state == 8480)) && 0 == s__hit) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576)) || ((2 == blastFlag && 0 == s__hit) && 8544 == s__state)) || (((((2 == blastFlag && !(s__state == 8657)) && !(s__state == 8672)) && 8640 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8672)) || ((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && blastFlag == 1) && !(8497 == s__state)) && s__state <= 8640) && !(8496 == s__state)) && !(8544 == s__state)) && s__state == 3) && !(s__state == 8480))) || (s__s3__tmp__next_state___0 <= 8640 && s__state == 3)) || ((((s__state <= 8448 && 3 == s__s3__tmp__next_state___0) && 0 == s__hit) && 8448 <= s__state) && blastFlag == 0)) || ((((blastFlag == 1 && s__state <= 8448) && 8496 < s__s3__tmp__next_state___0) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576)) || (((!(s__state == 8657) && 8640 <= s__state) && blastFlag == 0) && s__state <= 8672)) || (((((2 == blastFlag && !(s__state == 8657)) && !(s__state == 8672)) && 8640 <= s__state) && !(0 == s__hit)) && s__state <= 8672)) || ((((3 == blastFlag && s__state <= 8448) && 3 == s__s3__tmp__next_state___0) && 0 == s__hit) && 8448 <= s__state)) || (((((2 == blastFlag && s__state <= 8448) && 8496 < s__s3__tmp__next_state___0) && 0 == s__hit) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576)) || (blastFlag == 0 && 8544 == s__state)) || (((8672 <= s__state && 3 == blastFlag) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8672)) || (((8672 <= s__state && 3 == blastFlag) && !(0 == s__hit)) && s__state <= 8672)) || (((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(8497 == s__state)) && s__state <= 8640) && !(8496 == s__state)) && !(8544 == s__state)) && 8496 < s__state) && !(s__state == 8480)) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8576) && !(8560 == s__state))) || (((((((((((((s__state == 8528 && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(8497 == s__state)) && s__state <= 8640) && !(8496 == s__state)) && !(8544 == s__state)) && 8496 < s__state) && !(s__state == 8480)) && 0 == s__hit) && !(8560 == s__state))) || (((((2 == blastFlag && 8496 < s__state) && 8496 < s__s3__tmp__next_state___0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576)) || ((2 == blastFlag && 8560 == s__state) && 0 == s__hit)) || ((((s__state <= 8448 && 8496 < s__s3__tmp__next_state___0) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && blastFlag == 0)) || ((((blastFlag == 1 && s__state <= 8448) && 3 == s__s3__tmp__next_state___0) && 0 == s__hit) && 8448 <= s__state)) || ((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(8497 == s__state)) && s__state <= 8640) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && 8448 <= s__state) && blastFlag == 0)) || (((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(8497 == s__state)) && s__state <= 8640) && !(8496 == s__state)) && !(8544 == s__state)) && s__state == 3) && !(s__state == 8480)) && !(8560 == s__state)) RESULT: Ultimate proved your program to be correct! [2021-12-14 11:44:48,697 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