./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/openssl-simplified/s3_srvr_3.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 20ed64ec 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_3.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 e1ab2298d5235b5cdcda71de2855499593daaa9e ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-20ed64e [2021-08-25 20:13:13,987 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-25 20:13:13,989 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-25 20:13:14,020 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-25 20:13:14,021 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-25 20:13:14,023 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-25 20:13:14,024 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-25 20:13:14,028 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-25 20:13:14,030 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-25 20:13:14,033 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-25 20:13:14,034 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-25 20:13:14,037 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-25 20:13:14,038 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-25 20:13:14,039 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-25 20:13:14,041 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-25 20:13:14,043 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-25 20:13:14,044 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-25 20:13:14,044 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-25 20:13:14,046 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-25 20:13:14,050 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-25 20:13:14,051 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-25 20:13:14,052 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-25 20:13:14,053 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-25 20:13:14,054 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-25 20:13:14,058 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-25 20:13:14,059 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-25 20:13:14,068 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-25 20:13:14,069 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-25 20:13:14,069 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-25 20:13:14,070 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-25 20:13:14,070 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-25 20:13:14,070 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-25 20:13:14,071 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-25 20:13:14,072 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-25 20:13:14,072 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-25 20:13:14,073 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-25 20:13:14,073 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-25 20:13:14,073 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-25 20:13:14,073 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-25 20:13:14,074 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-25 20:13:14,075 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-25 20:13:14,075 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-08-25 20:13:14,108 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-25 20:13:14,109 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-25 20:13:14,110 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-25 20:13:14,110 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-25 20:13:14,111 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-25 20:13:14,111 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-25 20:13:14,111 INFO L138 SettingsManager]: * Use SBE=true [2021-08-25 20:13:14,112 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-25 20:13:14,112 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-25 20:13:14,112 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-25 20:13:14,112 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-25 20:13:14,112 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-25 20:13:14,112 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-25 20:13:14,113 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-25 20:13:14,113 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-25 20:13:14,113 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-25 20:13:14,113 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-25 20:13:14,113 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-25 20:13:14,113 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-25 20:13:14,113 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-25 20:13:14,113 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-25 20:13:14,113 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-25 20:13:14,113 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-25 20:13:14,113 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-25 20:13:14,114 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-25 20:13:14,114 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-25 20:13:14,114 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-25 20:13:14,114 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-25 20:13:14,114 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-25 20:13:14,114 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-25 20:13:14,114 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 -> e1ab2298d5235b5cdcda71de2855499593daaa9e [2021-08-25 20:13:14,373 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-25 20:13:14,394 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-25 20:13:14,396 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-25 20:13:14,397 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-25 20:13:14,397 INFO L275 PluginConnector]: CDTParser initialized [2021-08-25 20:13:14,398 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/openssl-simplified/s3_srvr_3.cil.c [2021-08-25 20:13:14,455 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/833db5192/89dc40c0061341ef8601da3dcea37461/FLAGcc04a39aa [2021-08-25 20:13:14,874 INFO L306 CDTParser]: Found 1 translation units. [2021-08-25 20:13:14,874 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl-simplified/s3_srvr_3.cil.c [2021-08-25 20:13:14,895 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/833db5192/89dc40c0061341ef8601da3dcea37461/FLAGcc04a39aa [2021-08-25 20:13:14,908 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/833db5192/89dc40c0061341ef8601da3dcea37461 [2021-08-25 20:13:14,910 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-25 20:13:14,912 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-25 20:13:14,914 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-25 20:13:14,914 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-25 20:13:14,917 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-25 20:13:14,917 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 08:13:14" (1/1) ... [2021-08-25 20:13:14,918 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7bf9344 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:13:14, skipping insertion in model container [2021-08-25 20:13:14,918 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 08:13:14" (1/1) ... [2021-08-25 20:13:14,924 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-25 20:13:14,959 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-25 20:13:15,108 WARN L228 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_3.cil.c[42279,42292] [2021-08-25 20:13:15,113 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-25 20:13:15,119 INFO L203 MainTranslator]: Completed pre-run [2021-08-25 20:13:15,213 WARN L228 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_3.cil.c[42279,42292] [2021-08-25 20:13:15,216 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-25 20:13:15,235 INFO L208 MainTranslator]: Completed translation [2021-08-25 20:13:15,236 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:13:15 WrapperNode [2021-08-25 20:13:15,236 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-25 20:13:15,237 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-25 20:13:15,237 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-25 20:13:15,237 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-25 20:13:15,244 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:13:15" (1/1) ... [2021-08-25 20:13:15,265 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:13:15" (1/1) ... [2021-08-25 20:13:15,304 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-25 20:13:15,304 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-25 20:13:15,304 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-25 20:13:15,304 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-25 20:13:15,315 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:13:15" (1/1) ... [2021-08-25 20:13:15,315 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:13:15" (1/1) ... [2021-08-25 20:13:15,322 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:13:15" (1/1) ... [2021-08-25 20:13:15,322 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:13:15" (1/1) ... [2021-08-25 20:13:15,332 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:13:15" (1/1) ... [2021-08-25 20:13:15,338 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:13:15" (1/1) ... [2021-08-25 20:13:15,340 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:13:15" (1/1) ... [2021-08-25 20:13:15,353 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-25 20:13:15,354 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-25 20:13:15,354 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-25 20:13:15,354 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-25 20:13:15,355 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:13:15" (1/1) ... [2021-08-25 20:13:15,362 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-25 20:13:15,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 20:13:15,382 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-08-25 20:13:15,410 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-08-25 20:13:15,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-25 20:13:15,426 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-25 20:13:15,428 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-25 20:13:15,428 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-25 20:13:15,611 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-25 20:13:16,186 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2021-08-25 20:13:16,186 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2021-08-25 20:13:16,192 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-25 20:13:16,192 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2021-08-25 20:13:16,193 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 08:13:16 BoogieIcfgContainer [2021-08-25 20:13:16,193 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-25 20:13:16,195 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-25 20:13:16,195 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-25 20:13:16,197 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-25 20:13:16,197 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.08 08:13:14" (1/3) ... [2021-08-25 20:13:16,197 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54b153d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 08:13:16, skipping insertion in model container [2021-08-25 20:13:16,197 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:13:15" (2/3) ... [2021-08-25 20:13:16,197 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54b153d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 08:13:16, skipping insertion in model container [2021-08-25 20:13:16,198 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 08:13:16" (3/3) ... [2021-08-25 20:13:16,198 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr_3.cil.c [2021-08-25 20:13:16,202 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-25 20:13:16,202 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-08-25 20:13:16,232 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-25 20:13:16,236 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, mConcurrency=FINITE_AUTOMATA, 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-08-25 20:13:16,236 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-08-25 20:13:16,249 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-08-25 20:13:16,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-08-25 20:13:16,254 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:16,255 INFO L512 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-08-25 20:13:16,255 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:16,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:16,259 INFO L82 PathProgramCache]: Analyzing trace with hash 1632006987, now seen corresponding path program 1 times [2021-08-25 20:13:16,264 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:16,265 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38794785] [2021-08-25 20:13:16,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:16,266 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:16,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:16,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:13:16,461 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:16,462 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38794785] [2021-08-25 20:13:16,462 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38794785] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:16,462 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:16,462 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:16,471 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713538418] [2021-08-25 20:13:16,476 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:16,477 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:16,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:16,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:16,492 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-08-25 20:13:16,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:16,831 INFO L93 Difference]: Finished difference Result 328 states and 564 transitions. [2021-08-25 20:13:16,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:16,833 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-08-25 20:13:16,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:16,840 INFO L225 Difference]: With dead ends: 328 [2021-08-25 20:13:16,840 INFO L226 Difference]: Without dead ends: 175 [2021-08-25 20:13:16,842 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:16,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2021-08-25 20:13:16,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 170. [2021-08-25 20:13:16,875 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-08-25 20:13:16,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 275 transitions. [2021-08-25 20:13:16,877 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 275 transitions. Word has length 44 [2021-08-25 20:13:16,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:16,878 INFO L470 AbstractCegarLoop]: Abstraction has 170 states and 275 transitions. [2021-08-25 20:13:16,878 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-08-25 20:13:16,878 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 275 transitions. [2021-08-25 20:13:16,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-08-25 20:13:16,879 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:16,879 INFO L512 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-08-25 20:13:16,880 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-25 20:13:16,880 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:16,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:16,880 INFO L82 PathProgramCache]: Analyzing trace with hash -954575443, now seen corresponding path program 1 times [2021-08-25 20:13:16,881 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:16,881 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720860130] [2021-08-25 20:13:16,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:16,881 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:16,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:16,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:13:16,966 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:16,966 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720860130] [2021-08-25 20:13:16,966 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720860130] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:16,966 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:16,966 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:16,966 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147914380] [2021-08-25 20:13:16,967 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:16,968 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:16,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:16,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:16,968 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-08-25 20:13:17,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:17,328 INFO L93 Difference]: Finished difference Result 380 states and 624 transitions. [2021-08-25 20:13:17,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:17,329 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-08-25 20:13:17,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:17,338 INFO L225 Difference]: With dead ends: 380 [2021-08-25 20:13:17,338 INFO L226 Difference]: Without dead ends: 216 [2021-08-25 20:13:17,339 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:17,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2021-08-25 20:13:17,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 211. [2021-08-25 20:13:17,350 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-08-25 20:13:17,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 352 transitions. [2021-08-25 20:13:17,351 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 352 transitions. Word has length 45 [2021-08-25 20:13:17,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:17,351 INFO L470 AbstractCegarLoop]: Abstraction has 211 states and 352 transitions. [2021-08-25 20:13:17,351 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-08-25 20:13:17,351 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 352 transitions. [2021-08-25 20:13:17,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-08-25 20:13:17,366 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:17,366 INFO L512 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-08-25 20:13:17,366 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-25 20:13:17,367 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:17,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:17,367 INFO L82 PathProgramCache]: Analyzing trace with hash -1216100442, now seen corresponding path program 1 times [2021-08-25 20:13:17,367 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:17,368 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648488945] [2021-08-25 20:13:17,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:17,368 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:17,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:17,444 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:13:17,444 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:17,445 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648488945] [2021-08-25 20:13:17,446 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648488945] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:17,446 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:17,447 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:17,447 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185707614] [2021-08-25 20:13:17,448 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:17,448 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:17,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:17,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:17,450 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-08-25 20:13:17,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:17,607 INFO L93 Difference]: Finished difference Result 445 states and 750 transitions. [2021-08-25 20:13:17,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:17,608 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-08-25 20:13:17,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:17,609 INFO L225 Difference]: With dead ends: 445 [2021-08-25 20:13:17,610 INFO L226 Difference]: Without dead ends: 242 [2021-08-25 20:13:17,611 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:17,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2021-08-25 20:13:17,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2021-08-25 20:13:17,620 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-08-25 20:13:17,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 408 transitions. [2021-08-25 20:13:17,621 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 408 transitions. Word has length 72 [2021-08-25 20:13:17,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:17,621 INFO L470 AbstractCegarLoop]: Abstraction has 242 states and 408 transitions. [2021-08-25 20:13:17,621 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-08-25 20:13:17,621 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 408 transitions. [2021-08-25 20:13:17,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-08-25 20:13:17,623 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:17,624 INFO L512 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-08-25 20:13:17,624 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-25 20:13:17,624 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:17,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:17,624 INFO L82 PathProgramCache]: Analyzing trace with hash 2076235292, now seen corresponding path program 1 times [2021-08-25 20:13:17,625 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:17,625 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027312112] [2021-08-25 20:13:17,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:17,625 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:17,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:17,662 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-08-25 20:13:17,663 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:17,663 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027312112] [2021-08-25 20:13:17,663 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027312112] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:17,663 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:17,663 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:17,663 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356565607] [2021-08-25 20:13:17,664 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:17,664 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:17,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:17,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:17,665 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-08-25 20:13:17,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:17,804 INFO L93 Difference]: Finished difference Result 493 states and 832 transitions. [2021-08-25 20:13:17,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:17,804 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-08-25 20:13:17,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:17,806 INFO L225 Difference]: With dead ends: 493 [2021-08-25 20:13:17,806 INFO L226 Difference]: Without dead ends: 259 [2021-08-25 20:13:17,806 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:17,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2021-08-25 20:13:17,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 257. [2021-08-25 20:13:17,821 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-08-25 20:13:17,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 431 transitions. [2021-08-25 20:13:17,823 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 431 transitions. Word has length 84 [2021-08-25 20:13:17,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:17,836 INFO L470 AbstractCegarLoop]: Abstraction has 257 states and 431 transitions. [2021-08-25 20:13:17,837 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-08-25 20:13:17,837 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 431 transitions. [2021-08-25 20:13:17,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-08-25 20:13:17,839 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:17,839 INFO L512 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-08-25 20:13:17,839 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-25 20:13:17,840 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:17,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:17,840 INFO L82 PathProgramCache]: Analyzing trace with hash -1320798359, now seen corresponding path program 1 times [2021-08-25 20:13:17,840 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:17,840 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637000632] [2021-08-25 20:13:17,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:17,841 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:17,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:17,918 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:13:17,918 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:17,918 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637000632] [2021-08-25 20:13:17,918 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637000632] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:17,918 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:17,919 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:17,919 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774244755] [2021-08-25 20:13:17,919 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:17,919 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:17,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:17,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:17,920 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-08-25 20:13:18,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:18,092 INFO L93 Difference]: Finished difference Result 552 states and 931 transitions. [2021-08-25 20:13:18,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:18,093 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-08-25 20:13:18,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:18,095 INFO L225 Difference]: With dead ends: 552 [2021-08-25 20:13:18,095 INFO L226 Difference]: Without dead ends: 303 [2021-08-25 20:13:18,095 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:18,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2021-08-25 20:13:18,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 299. [2021-08-25 20:13:18,108 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-08-25 20:13:18,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 505 transitions. [2021-08-25 20:13:18,109 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 505 transitions. Word has length 84 [2021-08-25 20:13:18,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:18,109 INFO L470 AbstractCegarLoop]: Abstraction has 299 states and 505 transitions. [2021-08-25 20:13:18,109 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-08-25 20:13:18,109 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 505 transitions. [2021-08-25 20:13:18,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-08-25 20:13:18,110 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:18,111 INFO L512 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-08-25 20:13:18,111 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-25 20:13:18,111 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:18,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:18,111 INFO L82 PathProgramCache]: Analyzing trace with hash 858126211, now seen corresponding path program 1 times [2021-08-25 20:13:18,111 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:18,112 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450667147] [2021-08-25 20:13:18,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:18,112 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:18,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:18,142 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-08-25 20:13:18,143 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:18,143 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450667147] [2021-08-25 20:13:18,143 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450667147] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:18,143 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:18,143 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:18,143 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352876836] [2021-08-25 20:13:18,144 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:18,144 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:18,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:18,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:18,145 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-08-25 20:13:18,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:18,255 INFO L93 Difference]: Finished difference Result 592 states and 1000 transitions. [2021-08-25 20:13:18,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:18,255 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-08-25 20:13:18,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:18,257 INFO L225 Difference]: With dead ends: 592 [2021-08-25 20:13:18,257 INFO L226 Difference]: Without dead ends: 301 [2021-08-25 20:13:18,257 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:18,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2021-08-25 20:13:18,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 299. [2021-08-25 20:13:18,265 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-08-25 20:13:18,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 501 transitions. [2021-08-25 20:13:18,266 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 501 transitions. Word has length 85 [2021-08-25 20:13:18,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:18,266 INFO L470 AbstractCegarLoop]: Abstraction has 299 states and 501 transitions. [2021-08-25 20:13:18,266 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-08-25 20:13:18,266 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 501 transitions. [2021-08-25 20:13:18,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-08-25 20:13:18,267 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:18,267 INFO L512 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-08-25 20:13:18,267 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-25 20:13:18,267 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:18,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:18,268 INFO L82 PathProgramCache]: Analyzing trace with hash -274811797, now seen corresponding path program 1 times [2021-08-25 20:13:18,268 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:18,268 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808879556] [2021-08-25 20:13:18,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:18,268 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:18,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:18,300 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:13:18,301 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:18,301 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808879556] [2021-08-25 20:13:18,301 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808879556] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:18,301 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:18,301 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:18,301 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383325780] [2021-08-25 20:13:18,301 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:18,302 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:18,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:18,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:18,302 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-08-25 20:13:18,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:18,456 INFO L93 Difference]: Finished difference Result 594 states and 995 transitions. [2021-08-25 20:13:18,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:18,457 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-08-25 20:13:18,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:18,458 INFO L225 Difference]: With dead ends: 594 [2021-08-25 20:13:18,458 INFO L226 Difference]: Without dead ends: 301 [2021-08-25 20:13:18,459 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:18,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2021-08-25 20:13:18,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 297. [2021-08-25 20:13:18,464 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-08-25 20:13:18,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 496 transitions. [2021-08-25 20:13:18,465 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 496 transitions. Word has length 85 [2021-08-25 20:13:18,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:18,466 INFO L470 AbstractCegarLoop]: Abstraction has 297 states and 496 transitions. [2021-08-25 20:13:18,466 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-08-25 20:13:18,466 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 496 transitions. [2021-08-25 20:13:18,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-08-25 20:13:18,467 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:18,467 INFO L512 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-08-25 20:13:18,467 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-25 20:13:18,467 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:18,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:18,468 INFO L82 PathProgramCache]: Analyzing trace with hash 1018959428, now seen corresponding path program 1 times [2021-08-25 20:13:18,468 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:18,468 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861832110] [2021-08-25 20:13:18,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:18,468 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:18,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:18,505 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2021-08-25 20:13:18,506 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:18,506 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861832110] [2021-08-25 20:13:18,506 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861832110] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:18,506 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:18,506 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:18,506 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299263339] [2021-08-25 20:13:18,506 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:18,507 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:18,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:18,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:18,507 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-08-25 20:13:18,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:18,602 INFO L93 Difference]: Finished difference Result 595 states and 992 transitions. [2021-08-25 20:13:18,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:18,603 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-08-25 20:13:18,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:18,604 INFO L225 Difference]: With dead ends: 595 [2021-08-25 20:13:18,604 INFO L226 Difference]: Without dead ends: 306 [2021-08-25 20:13:18,605 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:18,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2021-08-25 20:13:18,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 306. [2021-08-25 20:13:18,612 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-08-25 20:13:18,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 502 transitions. [2021-08-25 20:13:18,613 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 502 transitions. Word has length 97 [2021-08-25 20:13:18,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:18,613 INFO L470 AbstractCegarLoop]: Abstraction has 306 states and 502 transitions. [2021-08-25 20:13:18,614 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-08-25 20:13:18,614 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 502 transitions. [2021-08-25 20:13:18,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-08-25 20:13:18,615 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:18,615 INFO L512 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-08-25 20:13:18,615 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-25 20:13:18,615 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:18,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:18,615 INFO L82 PathProgramCache]: Analyzing trace with hash 1695142111, now seen corresponding path program 1 times [2021-08-25 20:13:18,615 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:18,616 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166119394] [2021-08-25 20:13:18,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:18,616 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:18,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:18,649 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-08-25 20:13:18,650 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:18,650 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166119394] [2021-08-25 20:13:18,650 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166119394] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:18,650 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:18,650 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:18,650 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826915505] [2021-08-25 20:13:18,650 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:18,651 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:18,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:18,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:18,651 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-08-25 20:13:18,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:18,769 INFO L93 Difference]: Finished difference Result 635 states and 1045 transitions. [2021-08-25 20:13:18,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:18,770 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-08-25 20:13:18,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:18,771 INFO L225 Difference]: With dead ends: 635 [2021-08-25 20:13:18,771 INFO L226 Difference]: Without dead ends: 337 [2021-08-25 20:13:18,772 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:18,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2021-08-25 20:13:18,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 335. [2021-08-25 20:13:18,780 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-08-25 20:13:18,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 549 transitions. [2021-08-25 20:13:18,781 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 549 transitions. Word has length 98 [2021-08-25 20:13:18,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:18,782 INFO L470 AbstractCegarLoop]: Abstraction has 335 states and 549 transitions. [2021-08-25 20:13:18,782 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-08-25 20:13:18,782 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 549 transitions. [2021-08-25 20:13:18,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-08-25 20:13:18,783 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:18,783 INFO L512 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-08-25 20:13:18,783 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-25 20:13:18,783 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:18,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:18,784 INFO L82 PathProgramCache]: Analyzing trace with hash -618764698, now seen corresponding path program 1 times [2021-08-25 20:13:18,784 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:18,784 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500028806] [2021-08-25 20:13:18,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:18,784 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:18,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:18,811 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-08-25 20:13:18,811 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:18,811 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500028806] [2021-08-25 20:13:18,811 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500028806] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:18,812 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:18,812 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:18,812 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495035929] [2021-08-25 20:13:18,812 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:18,812 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:18,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:18,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:18,813 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-08-25 20:13:18,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:18,939 INFO L93 Difference]: Finished difference Result 664 states and 1088 transitions. [2021-08-25 20:13:18,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:18,940 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-08-25 20:13:18,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:18,941 INFO L225 Difference]: With dead ends: 664 [2021-08-25 20:13:18,941 INFO L226 Difference]: Without dead ends: 337 [2021-08-25 20:13:18,942 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:18,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2021-08-25 20:13:18,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 335. [2021-08-25 20:13:18,951 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-08-25 20:13:18,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 545 transitions. [2021-08-25 20:13:18,952 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 545 transitions. Word has length 99 [2021-08-25 20:13:18,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:18,952 INFO L470 AbstractCegarLoop]: Abstraction has 335 states and 545 transitions. [2021-08-25 20:13:18,953 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-08-25 20:13:18,953 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 545 transitions. [2021-08-25 20:13:18,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-08-25 20:13:18,954 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:18,954 INFO L512 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-08-25 20:13:18,954 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-25 20:13:18,954 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:18,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:18,955 INFO L82 PathProgramCache]: Analyzing trace with hash 1470499215, now seen corresponding path program 1 times [2021-08-25 20:13:18,955 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:18,955 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669195463] [2021-08-25 20:13:18,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:18,955 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:18,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:18,981 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-08-25 20:13:18,981 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:18,981 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669195463] [2021-08-25 20:13:18,981 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669195463] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:18,981 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:18,981 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:18,981 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137170021] [2021-08-25 20:13:18,982 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:18,982 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:18,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:18,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:18,982 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-08-25 20:13:19,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:19,126 INFO L93 Difference]: Finished difference Result 697 states and 1138 transitions. [2021-08-25 20:13:19,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:19,126 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-08-25 20:13:19,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:19,128 INFO L225 Difference]: With dead ends: 697 [2021-08-25 20:13:19,128 INFO L226 Difference]: Without dead ends: 370 [2021-08-25 20:13:19,128 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:19,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2021-08-25 20:13:19,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 362. [2021-08-25 20:13:19,137 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-08-25 20:13:19,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 587 transitions. [2021-08-25 20:13:19,138 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 587 transitions. Word has length 100 [2021-08-25 20:13:19,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:19,138 INFO L470 AbstractCegarLoop]: Abstraction has 362 states and 587 transitions. [2021-08-25 20:13:19,139 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-08-25 20:13:19,139 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 587 transitions. [2021-08-25 20:13:19,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-08-25 20:13:19,140 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:19,140 INFO L512 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-08-25 20:13:19,140 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-08-25 20:13:19,140 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:19,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:19,141 INFO L82 PathProgramCache]: Analyzing trace with hash 863697078, now seen corresponding path program 1 times [2021-08-25 20:13:19,141 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:19,141 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224961047] [2021-08-25 20:13:19,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:19,141 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:19,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:19,169 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-08-25 20:13:19,170 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:19,170 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224961047] [2021-08-25 20:13:19,170 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224961047] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:19,170 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:19,170 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:19,170 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928757855] [2021-08-25 20:13:19,170 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:19,170 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:19,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:19,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:19,171 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-08-25 20:13:19,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:19,300 INFO L93 Difference]: Finished difference Result 724 states and 1175 transitions. [2021-08-25 20:13:19,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:19,300 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-08-25 20:13:19,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:19,302 INFO L225 Difference]: With dead ends: 724 [2021-08-25 20:13:19,302 INFO L226 Difference]: Without dead ends: 370 [2021-08-25 20:13:19,303 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:19,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2021-08-25 20:13:19,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 362. [2021-08-25 20:13:19,312 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-08-25 20:13:19,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 582 transitions. [2021-08-25 20:13:19,313 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 582 transitions. Word has length 101 [2021-08-25 20:13:19,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:19,313 INFO L470 AbstractCegarLoop]: Abstraction has 362 states and 582 transitions. [2021-08-25 20:13:19,313 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-08-25 20:13:19,313 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 582 transitions. [2021-08-25 20:13:19,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-08-25 20:13:19,314 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:19,314 INFO L512 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-08-25 20:13:19,314 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-08-25 20:13:19,314 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:19,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:19,315 INFO L82 PathProgramCache]: Analyzing trace with hash 227220919, now seen corresponding path program 1 times [2021-08-25 20:13:19,315 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:19,315 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107526415] [2021-08-25 20:13:19,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:19,315 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:19,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:19,338 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2021-08-25 20:13:19,338 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:19,338 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107526415] [2021-08-25 20:13:19,338 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107526415] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:19,338 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:19,338 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:19,338 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127459833] [2021-08-25 20:13:19,339 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:19,339 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:19,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:19,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:19,339 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-08-25 20:13:19,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:19,474 INFO L93 Difference]: Finished difference Result 741 states and 1193 transitions. [2021-08-25 20:13:19,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:19,474 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-08-25 20:13:19,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:19,476 INFO L225 Difference]: With dead ends: 741 [2021-08-25 20:13:19,476 INFO L226 Difference]: Without dead ends: 387 [2021-08-25 20:13:19,476 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:19,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2021-08-25 20:13:19,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 383. [2021-08-25 20:13:19,486 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-08-25 20:13:19,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 611 transitions. [2021-08-25 20:13:19,487 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 611 transitions. Word has length 105 [2021-08-25 20:13:19,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:19,487 INFO L470 AbstractCegarLoop]: Abstraction has 383 states and 611 transitions. [2021-08-25 20:13:19,488 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-08-25 20:13:19,488 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 611 transitions. [2021-08-25 20:13:19,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-08-25 20:13:19,489 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:19,489 INFO L512 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-08-25 20:13:19,489 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-08-25 20:13:19,489 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:19,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:19,489 INFO L82 PathProgramCache]: Analyzing trace with hash -1469868848, now seen corresponding path program 1 times [2021-08-25 20:13:19,490 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:19,490 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007493192] [2021-08-25 20:13:19,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:19,490 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:19,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:19,523 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2021-08-25 20:13:19,523 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:19,523 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007493192] [2021-08-25 20:13:19,523 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007493192] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:19,523 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:19,523 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:19,523 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33831498] [2021-08-25 20:13:19,524 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:19,524 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:19,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:19,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:19,524 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-08-25 20:13:19,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:19,649 INFO L93 Difference]: Finished difference Result 762 states and 1216 transitions. [2021-08-25 20:13:19,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:19,650 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-08-25 20:13:19,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:19,652 INFO L225 Difference]: With dead ends: 762 [2021-08-25 20:13:19,652 INFO L226 Difference]: Without dead ends: 387 [2021-08-25 20:13:19,654 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:19,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2021-08-25 20:13:19,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 383. [2021-08-25 20:13:19,664 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-08-25 20:13:19,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 605 transitions. [2021-08-25 20:13:19,665 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 605 transitions. Word has length 106 [2021-08-25 20:13:19,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:19,665 INFO L470 AbstractCegarLoop]: Abstraction has 383 states and 605 transitions. [2021-08-25 20:13:19,665 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-08-25 20:13:19,665 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 605 transitions. [2021-08-25 20:13:19,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2021-08-25 20:13:19,667 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:19,667 INFO L512 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-08-25 20:13:19,667 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-08-25 20:13:19,667 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:19,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:19,667 INFO L82 PathProgramCache]: Analyzing trace with hash -1361423817, now seen corresponding path program 1 times [2021-08-25 20:13:19,668 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:19,668 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948677] [2021-08-25 20:13:19,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:19,668 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:19,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:19,711 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2021-08-25 20:13:19,711 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:19,711 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948677] [2021-08-25 20:13:19,711 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948677] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:19,711 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:19,711 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:19,711 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967874023] [2021-08-25 20:13:19,711 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:19,712 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:19,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:19,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:19,712 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-08-25 20:13:19,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:19,751 INFO L93 Difference]: Finished difference Result 758 states and 1198 transitions. [2021-08-25 20:13:19,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:19,752 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-08-25 20:13:19,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:19,754 INFO L225 Difference]: With dead ends: 758 [2021-08-25 20:13:19,755 INFO L226 Difference]: Without dead ends: 756 [2021-08-25 20:13:19,756 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:19,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states. [2021-08-25 20:13:19,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 756. [2021-08-25 20:13:19,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 756 states, 755 states have (on average 1.5841059602649006) internal successors, (1196), 755 states have internal predecessors, (1196), 0 states have call successors, (0), 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-08-25 20:13:19,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 756 states to 756 states and 1196 transitions. [2021-08-25 20:13:19,793 INFO L78 Accepts]: Start accepts. Automaton has 756 states and 1196 transitions. Word has length 121 [2021-08-25 20:13:19,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:19,793 INFO L470 AbstractCegarLoop]: Abstraction has 756 states and 1196 transitions. [2021-08-25 20:13:19,793 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-08-25 20:13:19,793 INFO L276 IsEmpty]: Start isEmpty. Operand 756 states and 1196 transitions. [2021-08-25 20:13:19,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2021-08-25 20:13:19,795 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:19,795 INFO L512 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, 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] [2021-08-25 20:13:19,796 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-08-25 20:13:19,796 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:19,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:19,796 INFO L82 PathProgramCache]: Analyzing trace with hash -222925540, now seen corresponding path program 1 times [2021-08-25 20:13:19,796 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:19,796 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079936545] [2021-08-25 20:13:19,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:19,797 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:19,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:19,837 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2021-08-25 20:13:19,838 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:19,839 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079936545] [2021-08-25 20:13:19,840 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079936545] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:19,840 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:19,840 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:19,840 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876381717] [2021-08-25 20:13:19,841 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:19,841 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:19,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:19,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:19,841 INFO L87 Difference]: Start difference. First operand 756 states and 1196 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-08-25 20:13:20,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:20,000 INFO L93 Difference]: Finished difference Result 1588 states and 2516 transitions. [2021-08-25 20:13:20,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:20,001 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-08-25 20:13:20,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:20,004 INFO L225 Difference]: With dead ends: 1588 [2021-08-25 20:13:20,004 INFO L226 Difference]: Without dead ends: 840 [2021-08-25 20:13:20,005 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:20,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 840 states. [2021-08-25 20:13:20,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 840 to 832. [2021-08-25 20:13:20,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 832 states, 831 states have (on average 1.5812274368231047) internal successors, (1314), 831 states have internal predecessors, (1314), 0 states have call successors, (0), 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-08-25 20:13:20,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 832 states to 832 states and 1314 transitions. [2021-08-25 20:13:20,031 INFO L78 Accepts]: Start accepts. Automaton has 832 states and 1314 transitions. Word has length 122 [2021-08-25 20:13:20,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:20,031 INFO L470 AbstractCegarLoop]: Abstraction has 832 states and 1314 transitions. [2021-08-25 20:13:20,032 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-08-25 20:13:20,032 INFO L276 IsEmpty]: Start isEmpty. Operand 832 states and 1314 transitions. [2021-08-25 20:13:20,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2021-08-25 20:13:20,033 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:20,034 INFO L512 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, 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] [2021-08-25 20:13:20,034 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-08-25 20:13:20,034 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:20,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:20,034 INFO L82 PathProgramCache]: Analyzing trace with hash -1171251906, now seen corresponding path program 1 times [2021-08-25 20:13:20,034 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:20,034 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409840060] [2021-08-25 20:13:20,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:20,035 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:20,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:20,086 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2021-08-25 20:13:20,086 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:20,086 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409840060] [2021-08-25 20:13:20,087 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409840060] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:20,087 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:20,087 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:20,087 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204996538] [2021-08-25 20:13:20,087 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:20,087 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:20,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:20,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:20,088 INFO L87 Difference]: Start difference. First operand 832 states and 1314 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 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-08-25 20:13:20,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:20,249 INFO L93 Difference]: Finished difference Result 1664 states and 2628 transitions. [2021-08-25 20:13:20,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:20,250 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 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 123 [2021-08-25 20:13:20,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:20,253 INFO L225 Difference]: With dead ends: 1664 [2021-08-25 20:13:20,253 INFO L226 Difference]: Without dead ends: 836 [2021-08-25 20:13:20,254 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:20,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 836 states. [2021-08-25 20:13:20,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 836 to 828. [2021-08-25 20:13:20,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 828 states, 827 states have (on average 1.5743651753325272) internal successors, (1302), 827 states have internal predecessors, (1302), 0 states have call successors, (0), 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-08-25 20:13:20,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 828 states and 1302 transitions. [2021-08-25 20:13:20,279 INFO L78 Accepts]: Start accepts. Automaton has 828 states and 1302 transitions. Word has length 123 [2021-08-25 20:13:20,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:20,279 INFO L470 AbstractCegarLoop]: Abstraction has 828 states and 1302 transitions. [2021-08-25 20:13:20,280 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 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-08-25 20:13:20,280 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 1302 transitions. [2021-08-25 20:13:20,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2021-08-25 20:13:20,282 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:20,282 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:13:20,282 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-08-25 20:13:20,282 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:20,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:20,282 INFO L82 PathProgramCache]: Analyzing trace with hash -803901493, now seen corresponding path program 1 times [2021-08-25 20:13:20,282 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:20,283 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200100270] [2021-08-25 20:13:20,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:20,283 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:20,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:20,310 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2021-08-25 20:13:20,310 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:20,310 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200100270] [2021-08-25 20:13:20,310 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200100270] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:20,310 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:20,311 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:20,311 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667151867] [2021-08-25 20:13:20,312 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:20,312 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:20,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:20,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:20,313 INFO L87 Difference]: Start difference. First operand 828 states and 1302 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 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-08-25 20:13:20,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:20,496 INFO L93 Difference]: Finished difference Result 1724 states and 2712 transitions. [2021-08-25 20:13:20,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:20,497 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 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 155 [2021-08-25 20:13:20,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:20,502 INFO L225 Difference]: With dead ends: 1724 [2021-08-25 20:13:20,502 INFO L226 Difference]: Without dead ends: 904 [2021-08-25 20:13:20,504 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:20,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 904 states. [2021-08-25 20:13:20,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 904 to 900. [2021-08-25 20:13:20,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 900 states, 899 states have (on average 1.568409343715239) internal successors, (1410), 899 states have internal predecessors, (1410), 0 states have call successors, (0), 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-08-25 20:13:20,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 900 states and 1410 transitions. [2021-08-25 20:13:20,533 INFO L78 Accepts]: Start accepts. Automaton has 900 states and 1410 transitions. Word has length 155 [2021-08-25 20:13:20,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:20,533 INFO L470 AbstractCegarLoop]: Abstraction has 900 states and 1410 transitions. [2021-08-25 20:13:20,533 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 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-08-25 20:13:20,533 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 1410 transitions. [2021-08-25 20:13:20,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2021-08-25 20:13:20,535 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:20,536 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:13:20,536 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-08-25 20:13:20,536 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:20,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:20,536 INFO L82 PathProgramCache]: Analyzing trace with hash 1923711817, now seen corresponding path program 1 times [2021-08-25 20:13:20,536 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:20,537 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028853813] [2021-08-25 20:13:20,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:20,537 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:20,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:20,581 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2021-08-25 20:13:20,581 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:20,581 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028853813] [2021-08-25 20:13:20,581 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028853813] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:20,582 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:20,582 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:20,582 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931238345] [2021-08-25 20:13:20,583 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:20,583 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:20,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:20,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:20,584 INFO L87 Difference]: Start difference. First operand 900 states and 1410 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 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-08-25 20:13:20,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:20,732 INFO L93 Difference]: Finished difference Result 1796 states and 2812 transitions. [2021-08-25 20:13:20,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:20,732 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 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 156 [2021-08-25 20:13:20,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:20,766 INFO L225 Difference]: With dead ends: 1796 [2021-08-25 20:13:20,767 INFO L226 Difference]: Without dead ends: 900 [2021-08-25 20:13:20,768 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:20,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 900 states. [2021-08-25 20:13:20,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 900 to 896. [2021-08-25 20:13:20,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 896 states, 895 states have (on average 1.559776536312849) internal successors, (1396), 895 states have internal predecessors, (1396), 0 states have call successors, (0), 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-08-25 20:13:20,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 896 states and 1396 transitions. [2021-08-25 20:13:20,791 INFO L78 Accepts]: Start accepts. Automaton has 896 states and 1396 transitions. Word has length 156 [2021-08-25 20:13:20,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:20,792 INFO L470 AbstractCegarLoop]: Abstraction has 896 states and 1396 transitions. [2021-08-25 20:13:20,792 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 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-08-25 20:13:20,792 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 1396 transitions. [2021-08-25 20:13:20,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2021-08-25 20:13:20,794 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:20,794 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:13:20,794 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-08-25 20:13:20,795 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:20,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:20,795 INFO L82 PathProgramCache]: Analyzing trace with hash -2027249663, now seen corresponding path program 1 times [2021-08-25 20:13:20,795 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:20,795 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566247111] [2021-08-25 20:13:20,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:20,795 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:20,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:20,830 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2021-08-25 20:13:20,830 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:20,830 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566247111] [2021-08-25 20:13:20,830 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566247111] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:20,831 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:20,831 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:20,831 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580947085] [2021-08-25 20:13:20,831 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:20,831 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:20,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:20,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:20,832 INFO L87 Difference]: Start difference. First operand 896 states and 1396 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 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-08-25 20:13:20,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:20,986 INFO L93 Difference]: Finished difference Result 1856 states and 2892 transitions. [2021-08-25 20:13:20,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:20,986 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 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 186 [2021-08-25 20:13:20,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:20,989 INFO L225 Difference]: With dead ends: 1856 [2021-08-25 20:13:20,989 INFO L226 Difference]: Without dead ends: 968 [2021-08-25 20:13:20,990 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:20,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 968 states. [2021-08-25 20:13:21,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 968 to 964. [2021-08-25 20:13:21,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 964 states, 963 states have (on average 1.5514018691588785) internal successors, (1494), 963 states have internal predecessors, (1494), 0 states have call successors, (0), 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-08-25 20:13:21,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 964 states to 964 states and 1494 transitions. [2021-08-25 20:13:21,028 INFO L78 Accepts]: Start accepts. Automaton has 964 states and 1494 transitions. Word has length 186 [2021-08-25 20:13:21,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:21,028 INFO L470 AbstractCegarLoop]: Abstraction has 964 states and 1494 transitions. [2021-08-25 20:13:21,028 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 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-08-25 20:13:21,028 INFO L276 IsEmpty]: Start isEmpty. Operand 964 states and 1494 transitions. [2021-08-25 20:13:21,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2021-08-25 20:13:21,030 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:21,030 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:13:21,030 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-08-25 20:13:21,031 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:21,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:21,031 INFO L82 PathProgramCache]: Analyzing trace with hash -441429661, now seen corresponding path program 1 times [2021-08-25 20:13:21,031 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:21,031 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529735896] [2021-08-25 20:13:21,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:21,031 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:21,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:21,056 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2021-08-25 20:13:21,057 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:21,057 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529735896] [2021-08-25 20:13:21,057 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529735896] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:21,057 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:21,057 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:21,057 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292730712] [2021-08-25 20:13:21,058 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:21,059 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:21,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:21,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:21,059 INFO L87 Difference]: Start difference. First operand 964 states and 1494 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 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-08-25 20:13:21,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:21,205 INFO L93 Difference]: Finished difference Result 1924 states and 2980 transitions. [2021-08-25 20:13:21,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:21,205 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 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 187 [2021-08-25 20:13:21,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:21,209 INFO L225 Difference]: With dead ends: 1924 [2021-08-25 20:13:21,210 INFO L226 Difference]: Without dead ends: 964 [2021-08-25 20:13:21,212 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:21,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 964 states. [2021-08-25 20:13:21,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 964 to 960. [2021-08-25 20:13:21,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 960 states, 959 states have (on average 1.5411887382690301) internal successors, (1478), 959 states have internal predecessors, (1478), 0 states have call successors, (0), 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-08-25 20:13:21,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 960 states to 960 states and 1478 transitions. [2021-08-25 20:13:21,243 INFO L78 Accepts]: Start accepts. Automaton has 960 states and 1478 transitions. Word has length 187 [2021-08-25 20:13:21,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:21,243 INFO L470 AbstractCegarLoop]: Abstraction has 960 states and 1478 transitions. [2021-08-25 20:13:21,243 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 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-08-25 20:13:21,243 INFO L276 IsEmpty]: Start isEmpty. Operand 960 states and 1478 transitions. [2021-08-25 20:13:21,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2021-08-25 20:13:21,246 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:21,246 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:13:21,247 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-08-25 20:13:21,247 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:21,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:21,247 INFO L82 PathProgramCache]: Analyzing trace with hash 687937557, now seen corresponding path program 1 times [2021-08-25 20:13:21,247 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:21,248 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933642825] [2021-08-25 20:13:21,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:21,248 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:21,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:21,282 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 267 trivial. 0 not checked. [2021-08-25 20:13:21,282 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:21,282 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933642825] [2021-08-25 20:13:21,283 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933642825] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:21,283 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:21,283 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:21,283 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227245732] [2021-08-25 20:13:21,283 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:21,284 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:21,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:21,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:21,285 INFO L87 Difference]: Start difference. First operand 960 states and 1478 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 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-08-25 20:13:21,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:21,419 INFO L93 Difference]: Finished difference Result 1988 states and 3068 transitions. [2021-08-25 20:13:21,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:21,420 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 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 204 [2021-08-25 20:13:21,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:21,423 INFO L225 Difference]: With dead ends: 1988 [2021-08-25 20:13:21,423 INFO L226 Difference]: Without dead ends: 1036 [2021-08-25 20:13:21,425 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:21,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1036 states. [2021-08-25 20:13:21,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1036 to 1010. [2021-08-25 20:13:21,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1010 states, 1009 states have (on average 1.5282457879088207) internal successors, (1542), 1009 states have internal predecessors, (1542), 0 states have call successors, (0), 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-08-25 20:13:21,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1010 states to 1010 states and 1542 transitions. [2021-08-25 20:13:21,452 INFO L78 Accepts]: Start accepts. Automaton has 1010 states and 1542 transitions. Word has length 204 [2021-08-25 20:13:21,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:21,452 INFO L470 AbstractCegarLoop]: Abstraction has 1010 states and 1542 transitions. [2021-08-25 20:13:21,452 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 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-08-25 20:13:21,452 INFO L276 IsEmpty]: Start isEmpty. Operand 1010 states and 1542 transitions. [2021-08-25 20:13:21,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2021-08-25 20:13:21,454 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:21,454 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:13:21,455 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-08-25 20:13:21,455 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:21,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:21,455 INFO L82 PathProgramCache]: Analyzing trace with hash 1592017820, now seen corresponding path program 1 times [2021-08-25 20:13:21,455 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:21,456 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739676803] [2021-08-25 20:13:21,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:21,456 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:21,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:21,490 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 267 trivial. 0 not checked. [2021-08-25 20:13:21,490 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:21,490 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739676803] [2021-08-25 20:13:21,490 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739676803] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:21,490 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:21,491 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:21,491 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188713250] [2021-08-25 20:13:21,492 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:21,492 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:21,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:21,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:21,493 INFO L87 Difference]: Start difference. First operand 1010 states and 1542 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:21,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:21,608 INFO L93 Difference]: Finished difference Result 2038 states and 3114 transitions. [2021-08-25 20:13:21,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:21,608 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 205 [2021-08-25 20:13:21,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:21,611 INFO L225 Difference]: With dead ends: 2038 [2021-08-25 20:13:21,612 INFO L226 Difference]: Without dead ends: 1036 [2021-08-25 20:13:21,613 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:21,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1036 states. [2021-08-25 20:13:21,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1036 to 1010. [2021-08-25 20:13:21,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1010 states, 1009 states have (on average 1.510406342913776) internal successors, (1524), 1009 states have internal predecessors, (1524), 0 states have call successors, (0), 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-08-25 20:13:21,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1010 states to 1010 states and 1524 transitions. [2021-08-25 20:13:21,664 INFO L78 Accepts]: Start accepts. Automaton has 1010 states and 1524 transitions. Word has length 205 [2021-08-25 20:13:21,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:21,665 INFO L470 AbstractCegarLoop]: Abstraction has 1010 states and 1524 transitions. [2021-08-25 20:13:21,665 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:21,665 INFO L276 IsEmpty]: Start isEmpty. Operand 1010 states and 1524 transitions. [2021-08-25 20:13:21,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2021-08-25 20:13:21,667 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:21,668 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:13:21,668 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-08-25 20:13:21,668 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:21,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:21,668 INFO L82 PathProgramCache]: Analyzing trace with hash 77251339, now seen corresponding path program 1 times [2021-08-25 20:13:21,668 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:21,668 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478184915] [2021-08-25 20:13:21,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:21,669 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:21,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:21,697 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2021-08-25 20:13:21,698 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:21,698 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478184915] [2021-08-25 20:13:21,698 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478184915] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:21,698 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:21,698 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:21,698 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477031675] [2021-08-25 20:13:21,699 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:21,699 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:21,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:21,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:21,699 INFO L87 Difference]: Start difference. First operand 1010 states and 1524 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:21,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:21,838 INFO L93 Difference]: Finished difference Result 2020 states and 3046 transitions. [2021-08-25 20:13:21,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:21,839 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 217 [2021-08-25 20:13:21,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:21,842 INFO L225 Difference]: With dead ends: 2020 [2021-08-25 20:13:21,842 INFO L226 Difference]: Without dead ends: 1018 [2021-08-25 20:13:21,843 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:21,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1018 states. [2021-08-25 20:13:21,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1018 to 1010. [2021-08-25 20:13:21,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1010 states, 1009 states have (on average 1.4985133795837462) internal successors, (1512), 1009 states have internal predecessors, (1512), 0 states have call successors, (0), 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-08-25 20:13:21,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1010 states to 1010 states and 1512 transitions. [2021-08-25 20:13:21,874 INFO L78 Accepts]: Start accepts. Automaton has 1010 states and 1512 transitions. Word has length 217 [2021-08-25 20:13:21,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:21,874 INFO L470 AbstractCegarLoop]: Abstraction has 1010 states and 1512 transitions. [2021-08-25 20:13:21,874 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:21,874 INFO L276 IsEmpty]: Start isEmpty. Operand 1010 states and 1512 transitions. [2021-08-25 20:13:21,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2021-08-25 20:13:21,877 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:21,877 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:13:21,877 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-08-25 20:13:21,877 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:21,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:21,878 INFO L82 PathProgramCache]: Analyzing trace with hash -1170488119, now seen corresponding path program 1 times [2021-08-25 20:13:21,878 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:21,878 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125100680] [2021-08-25 20:13:21,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:21,878 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:21,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:21,907 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2021-08-25 20:13:21,907 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:21,907 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125100680] [2021-08-25 20:13:21,907 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125100680] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:21,907 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:21,908 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:21,908 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372598710] [2021-08-25 20:13:21,908 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:21,908 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:21,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:21,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:21,909 INFO L87 Difference]: Start difference. First operand 1010 states and 1512 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 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-08-25 20:13:22,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:22,028 INFO L93 Difference]: Finished difference Result 2020 states and 3022 transitions. [2021-08-25 20:13:22,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:22,028 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 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 218 [2021-08-25 20:13:22,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:22,031 INFO L225 Difference]: With dead ends: 2020 [2021-08-25 20:13:22,031 INFO L226 Difference]: Without dead ends: 1000 [2021-08-25 20:13:22,032 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:22,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1000 states. [2021-08-25 20:13:22,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1000 to 992. [2021-08-25 20:13:22,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 992 states, 991 states have (on average 1.4873864783047426) internal successors, (1474), 991 states have internal predecessors, (1474), 0 states have call successors, (0), 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-08-25 20:13:22,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 992 states to 992 states and 1474 transitions. [2021-08-25 20:13:22,064 INFO L78 Accepts]: Start accepts. Automaton has 992 states and 1474 transitions. Word has length 218 [2021-08-25 20:13:22,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:22,065 INFO L470 AbstractCegarLoop]: Abstraction has 992 states and 1474 transitions. [2021-08-25 20:13:22,065 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 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-08-25 20:13:22,065 INFO L276 IsEmpty]: Start isEmpty. Operand 992 states and 1474 transitions. [2021-08-25 20:13:22,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2021-08-25 20:13:22,067 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:22,067 INFO L512 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:13:22,067 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-08-25 20:13:22,067 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:22,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:22,068 INFO L82 PathProgramCache]: Analyzing trace with hash -1769719953, now seen corresponding path program 1 times [2021-08-25 20:13:22,068 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:22,068 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729317547] [2021-08-25 20:13:22,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:22,068 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:22,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:22,092 INFO L134 CoverageAnalysis]: Checked inductivity of 463 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 367 trivial. 0 not checked. [2021-08-25 20:13:22,092 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:22,092 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729317547] [2021-08-25 20:13:22,092 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729317547] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:22,092 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:22,092 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:22,092 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029757516] [2021-08-25 20:13:22,093 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:22,093 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:22,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:22,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:22,094 INFO L87 Difference]: Start difference. First operand 992 states and 1474 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 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-08-25 20:13:22,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:22,200 INFO L93 Difference]: Finished difference Result 2030 states and 3020 transitions. [2021-08-25 20:13:22,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:22,201 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 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 225 [2021-08-25 20:13:22,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:22,204 INFO L225 Difference]: With dead ends: 2030 [2021-08-25 20:13:22,204 INFO L226 Difference]: Without dead ends: 1046 [2021-08-25 20:13:22,205 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:22,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1046 states. [2021-08-25 20:13:22,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1046 to 1038. [2021-08-25 20:13:22,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1038 states, 1037 states have (on average 1.4734811957569913) internal successors, (1528), 1037 states have internal predecessors, (1528), 0 states have call successors, (0), 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-08-25 20:13:22,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1038 states to 1038 states and 1528 transitions. [2021-08-25 20:13:22,231 INFO L78 Accepts]: Start accepts. Automaton has 1038 states and 1528 transitions. Word has length 225 [2021-08-25 20:13:22,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:22,231 INFO L470 AbstractCegarLoop]: Abstraction has 1038 states and 1528 transitions. [2021-08-25 20:13:22,232 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 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-08-25 20:13:22,232 INFO L276 IsEmpty]: Start isEmpty. Operand 1038 states and 1528 transitions. [2021-08-25 20:13:22,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2021-08-25 20:13:22,234 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:22,234 INFO L512 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:13:22,234 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-08-25 20:13:22,234 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:22,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:22,235 INFO L82 PathProgramCache]: Analyzing trace with hash -1554406680, now seen corresponding path program 1 times [2021-08-25 20:13:22,235 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:22,235 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856729615] [2021-08-25 20:13:22,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:22,235 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:22,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:22,257 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 367 trivial. 0 not checked. [2021-08-25 20:13:22,258 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:22,258 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856729615] [2021-08-25 20:13:22,258 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856729615] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:22,258 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:22,258 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:22,258 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437869368] [2021-08-25 20:13:22,259 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:22,259 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:22,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:22,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:22,259 INFO L87 Difference]: Start difference. First operand 1038 states and 1528 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 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-08-25 20:13:22,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:22,371 INFO L93 Difference]: Finished difference Result 2076 states and 3054 transitions. [2021-08-25 20:13:22,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:22,372 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 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 226 [2021-08-25 20:13:22,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:22,375 INFO L225 Difference]: With dead ends: 2076 [2021-08-25 20:13:22,375 INFO L226 Difference]: Without dead ends: 1038 [2021-08-25 20:13:22,376 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:22,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1038 states. [2021-08-25 20:13:22,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1038 to 1030. [2021-08-25 20:13:22,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1030 states, 1029 states have (on average 1.4538386783284742) internal successors, (1496), 1029 states have internal predecessors, (1496), 0 states have call successors, (0), 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-08-25 20:13:22,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1030 states to 1030 states and 1496 transitions. [2021-08-25 20:13:22,408 INFO L78 Accepts]: Start accepts. Automaton has 1030 states and 1496 transitions. Word has length 226 [2021-08-25 20:13:22,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:22,408 INFO L470 AbstractCegarLoop]: Abstraction has 1030 states and 1496 transitions. [2021-08-25 20:13:22,408 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 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-08-25 20:13:22,408 INFO L276 IsEmpty]: Start isEmpty. Operand 1030 states and 1496 transitions. [2021-08-25 20:13:22,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2021-08-25 20:13:22,410 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:22,411 INFO L512 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:13:22,411 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-08-25 20:13:22,411 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:22,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:22,411 INFO L82 PathProgramCache]: Analyzing trace with hash -2127307805, now seen corresponding path program 1 times [2021-08-25 20:13:22,412 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:22,412 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27250137] [2021-08-25 20:13:22,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:22,412 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:22,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:22,449 INFO L134 CoverageAnalysis]: Checked inductivity of 675 backedges. 466 proven. 26 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2021-08-25 20:13:22,450 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:22,450 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27250137] [2021-08-25 20:13:22,450 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27250137] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 20:13:22,450 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [629357256] [2021-08-25 20:13:22,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:22,450 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 20:13:22,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 20:13:22,452 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-08-25 20:13:22,457 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-08-25 20:13:22,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:22,562 INFO L263 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-25 20:13:22,569 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:13:23,418 INFO L134 CoverageAnalysis]: Checked inductivity of 675 backedges. 427 proven. 0 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2021-08-25 20:13:23,419 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [629357256] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:23,419 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-08-25 20:13:23,419 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2021-08-25 20:13:23,419 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320125896] [2021-08-25 20:13:23,420 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:23,420 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:23,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:23,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:13:23,421 INFO L87 Difference]: Start difference. First operand 1030 states and 1496 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-08-25 20:13:23,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:23,471 INFO L93 Difference]: Finished difference Result 2562 states and 3721 transitions. [2021-08-25 20:13:23,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:23,472 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 262 [2021-08-25 20:13:23,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:23,478 INFO L225 Difference]: With dead ends: 2562 [2021-08-25 20:13:23,478 INFO L226 Difference]: Without dead ends: 1540 [2021-08-25 20:13:23,480 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 262 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.7ms TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:13:23,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1540 states. [2021-08-25 20:13:23,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1540 to 1540. [2021-08-25 20:13:23,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1540 states, 1539 states have (on average 1.4528914879792072) internal successors, (2236), 1539 states have internal predecessors, (2236), 0 states have call successors, (0), 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-08-25 20:13:23,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1540 states to 1540 states and 2236 transitions. [2021-08-25 20:13:23,528 INFO L78 Accepts]: Start accepts. Automaton has 1540 states and 2236 transitions. Word has length 262 [2021-08-25 20:13:23,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:23,528 INFO L470 AbstractCegarLoop]: Abstraction has 1540 states and 2236 transitions. [2021-08-25 20:13:23,529 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-08-25 20:13:23,529 INFO L276 IsEmpty]: Start isEmpty. Operand 1540 states and 2236 transitions. [2021-08-25 20:13:23,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2021-08-25 20:13:23,533 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:23,534 INFO L512 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:13:23,566 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-08-25 20:13:23,761 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,SelfDestructingSolverStorable27 [2021-08-25 20:13:23,761 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:23,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:23,761 INFO L82 PathProgramCache]: Analyzing trace with hash -1414485870, now seen corresponding path program 1 times [2021-08-25 20:13:23,761 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:23,761 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083821510] [2021-08-25 20:13:23,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:23,762 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:23,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:23,811 INFO L134 CoverageAnalysis]: Checked inductivity of 654 backedges. 429 proven. 0 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2021-08-25 20:13:23,811 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:23,812 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083821510] [2021-08-25 20:13:23,812 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083821510] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:23,812 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:23,812 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:23,812 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860567702] [2021-08-25 20:13:23,813 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:23,813 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:23,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:23,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:23,813 INFO L87 Difference]: Start difference. First operand 1540 states and 2236 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-08-25 20:13:23,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:23,889 INFO L93 Difference]: Finished difference Result 4523 states and 6564 transitions. [2021-08-25 20:13:23,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:23,889 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 269 [2021-08-25 20:13:23,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:23,898 INFO L225 Difference]: With dead ends: 4523 [2021-08-25 20:13:23,898 INFO L226 Difference]: Without dead ends: 2991 [2021-08-25 20:13:23,902 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:23,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2991 states. [2021-08-25 20:13:23,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2991 to 2989. [2021-08-25 20:13:23,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2989 states, 2988 states have (on average 1.4491298527443106) internal successors, (4330), 2988 states have internal predecessors, (4330), 0 states have call successors, (0), 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-08-25 20:13:23,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2989 states to 2989 states and 4330 transitions. [2021-08-25 20:13:23,996 INFO L78 Accepts]: Start accepts. Automaton has 2989 states and 4330 transitions. Word has length 269 [2021-08-25 20:13:23,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:23,996 INFO L470 AbstractCegarLoop]: Abstraction has 2989 states and 4330 transitions. [2021-08-25 20:13:23,997 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-08-25 20:13:23,997 INFO L276 IsEmpty]: Start isEmpty. Operand 2989 states and 4330 transitions. [2021-08-25 20:13:24,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2021-08-25 20:13:24,002 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:24,002 INFO L512 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 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] [2021-08-25 20:13:24,002 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-08-25 20:13:24,002 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:24,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:24,003 INFO L82 PathProgramCache]: Analyzing trace with hash 1314633518, now seen corresponding path program 1 times [2021-08-25 20:13:24,003 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:24,003 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974316536] [2021-08-25 20:13:24,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:24,003 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:24,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:24,047 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 535 proven. 0 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2021-08-25 20:13:24,048 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:24,048 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974316536] [2021-08-25 20:13:24,048 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974316536] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:24,048 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:24,048 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:24,049 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983570618] [2021-08-25 20:13:24,049 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:24,049 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:24,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:24,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:24,050 INFO L87 Difference]: Start difference. First operand 2989 states and 4330 transitions. Second operand has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:24,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:24,229 INFO L93 Difference]: Finished difference Result 6090 states and 8840 transitions. [2021-08-25 20:13:24,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:24,230 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 306 [2021-08-25 20:13:24,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:24,238 INFO L225 Difference]: With dead ends: 6090 [2021-08-25 20:13:24,238 INFO L226 Difference]: Without dead ends: 1992 [2021-08-25 20:13:24,242 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:24,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1992 states. [2021-08-25 20:13:24,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1992 to 1972. [2021-08-25 20:13:24,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1972 states, 1971 states have (on average 1.4246575342465753) internal successors, (2808), 1971 states have internal predecessors, (2808), 0 states have call successors, (0), 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-08-25 20:13:24,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1972 states to 1972 states and 2808 transitions. [2021-08-25 20:13:24,301 INFO L78 Accepts]: Start accepts. Automaton has 1972 states and 2808 transitions. Word has length 306 [2021-08-25 20:13:24,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:24,301 INFO L470 AbstractCegarLoop]: Abstraction has 1972 states and 2808 transitions. [2021-08-25 20:13:24,301 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:13:24,301 INFO L276 IsEmpty]: Start isEmpty. Operand 1972 states and 2808 transitions. [2021-08-25 20:13:24,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2021-08-25 20:13:24,307 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:24,307 INFO L512 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:13:24,308 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-08-25 20:13:24,308 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:24,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:24,308 INFO L82 PathProgramCache]: Analyzing trace with hash -240397493, now seen corresponding path program 1 times [2021-08-25 20:13:24,309 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:24,309 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140126605] [2021-08-25 20:13:24,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:24,309 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:24,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:24,366 INFO L134 CoverageAnalysis]: Checked inductivity of 1396 backedges. 905 proven. 26 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2021-08-25 20:13:24,366 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:24,367 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140126605] [2021-08-25 20:13:24,367 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140126605] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 20:13:24,367 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [195847546] [2021-08-25 20:13:24,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:24,367 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 20:13:24,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 20:13:24,381 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-08-25 20:13:24,413 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-08-25 20:13:24,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:24,617 INFO L263 TraceCheckSpWp]: Trace formula consists of 619 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-25 20:13:24,634 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:13:25,480 INFO L134 CoverageAnalysis]: Checked inductivity of 1396 backedges. 905 proven. 26 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2021-08-25 20:13:25,481 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [195847546] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 20:13:25,481 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-25 20:13:25,481 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2021-08-25 20:13:25,481 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355801695] [2021-08-25 20:13:25,482 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:13:25,482 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:25,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:13:25,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:13:25,483 INFO L87 Difference]: Start difference. First operand 1972 states and 2808 transitions. Second operand has 4 states, 4 states have (on average 44.5) internal successors, (178), 4 states have internal predecessors, (178), 0 states have call successors, (0), 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-08-25 20:13:25,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:25,740 INFO L93 Difference]: Finished difference Result 4562 states and 6485 transitions. [2021-08-25 20:13:25,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-25 20:13:25,740 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 44.5) internal successors, (178), 4 states have internal predecessors, (178), 0 states have call successors, (0), 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 372 [2021-08-25 20:13:25,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:25,749 INFO L225 Difference]: With dead ends: 4562 [2021-08-25 20:13:25,749 INFO L226 Difference]: Without dead ends: 2554 [2021-08-25 20:13:25,753 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 377 GetRequests, 374 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:13:25,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2554 states. [2021-08-25 20:13:25,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2554 to 1943. [2021-08-25 20:13:25,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1943 states, 1942 states have (on average 1.3820803295571575) internal successors, (2684), 1942 states have internal predecessors, (2684), 0 states have call successors, (0), 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-08-25 20:13:25,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1943 states to 1943 states and 2684 transitions. [2021-08-25 20:13:25,811 INFO L78 Accepts]: Start accepts. Automaton has 1943 states and 2684 transitions. Word has length 372 [2021-08-25 20:13:25,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:25,811 INFO L470 AbstractCegarLoop]: Abstraction has 1943 states and 2684 transitions. [2021-08-25 20:13:25,811 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 44.5) internal successors, (178), 4 states have internal predecessors, (178), 0 states have call successors, (0), 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-08-25 20:13:25,812 INFO L276 IsEmpty]: Start isEmpty. Operand 1943 states and 2684 transitions. [2021-08-25 20:13:25,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 601 [2021-08-25 20:13:25,822 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:25,822 INFO L512 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, 1] [2021-08-25 20:13:25,852 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-08-25 20:13:26,052 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,SelfDestructingSolverStorable30 [2021-08-25 20:13:26,053 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:26,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:26,054 INFO L82 PathProgramCache]: Analyzing trace with hash 712864204, now seen corresponding path program 1 times [2021-08-25 20:13:26,054 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:26,054 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244670459] [2021-08-25 20:13:26,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:26,054 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:26,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:26,158 INFO L134 CoverageAnalysis]: Checked inductivity of 4010 backedges. 2316 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2021-08-25 20:13:26,159 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:26,159 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244670459] [2021-08-25 20:13:26,159 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244670459] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 20:13:26,159 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [30009807] [2021-08-25 20:13:26,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:26,160 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 20:13:26,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 20:13:26,161 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-08-25 20:13:26,186 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-08-25 20:13:26,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:26,609 INFO L263 TraceCheckSpWp]: Trace formula consists of 925 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-25 20:13:26,612 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:13:27,906 INFO L134 CoverageAnalysis]: Checked inductivity of 4010 backedges. 2316 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2021-08-25 20:13:27,907 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [30009807] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 20:13:27,907 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-25 20:13:27,907 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2021-08-25 20:13:27,907 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433833593] [2021-08-25 20:13:27,908 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-25 20:13:27,908 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:27,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-25 20:13:27,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-25 20:13:27,909 INFO L87 Difference]: Start difference. First operand 1943 states and 2684 transitions. Second operand has 6 states, 6 states have (on average 46.0) internal successors, (276), 6 states have internal predecessors, (276), 0 states have call successors, (0), 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-08-25 20:13:28,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:28,108 INFO L93 Difference]: Finished difference Result 4798 states and 6655 transitions. [2021-08-25 20:13:28,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:13:28,108 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 46.0) internal successors, (276), 6 states have internal predecessors, (276), 0 states have call successors, (0), 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 600 [2021-08-25 20:13:28,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:28,127 INFO L225 Difference]: With dead ends: 4798 [2021-08-25 20:13:28,127 INFO L226 Difference]: Without dead ends: 2725 [2021-08-25 20:13:28,131 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 605 GetRequests, 600 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 14.4ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-08-25 20:13:28,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2725 states. [2021-08-25 20:13:28,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2725 to 1943. [2021-08-25 20:13:28,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1943 states, 1942 states have (on average 1.3820803295571575) internal successors, (2684), 1942 states have internal predecessors, (2684), 0 states have call successors, (0), 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-08-25 20:13:28,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1943 states to 1943 states and 2684 transitions. [2021-08-25 20:13:28,185 INFO L78 Accepts]: Start accepts. Automaton has 1943 states and 2684 transitions. Word has length 600 [2021-08-25 20:13:28,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:28,185 INFO L470 AbstractCegarLoop]: Abstraction has 1943 states and 2684 transitions. [2021-08-25 20:13:28,185 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 46.0) internal successors, (276), 6 states have internal predecessors, (276), 0 states have call successors, (0), 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-08-25 20:13:28,185 INFO L276 IsEmpty]: Start isEmpty. Operand 1943 states and 2684 transitions. [2021-08-25 20:13:28,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 671 [2021-08-25 20:13:28,195 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:28,196 INFO L512 BasicCegarLoop]: trace histogram [23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 22, 22, 21, 21, 21, 19, 19, 17, 17, 15, 15, 13, 13, 13, 13, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-08-25 20:13:28,227 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-08-25 20:13:28,413 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 20:13:28,413 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:28,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:28,414 INFO L82 PathProgramCache]: Analyzing trace with hash -1159037713, now seen corresponding path program 1 times [2021-08-25 20:13:28,414 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:28,414 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741386729] [2021-08-25 20:13:28,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:28,414 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:28,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:28,519 INFO L134 CoverageAnalysis]: Checked inductivity of 5249 backedges. 2922 proven. 0 refuted. 0 times theorem prover too weak. 2327 trivial. 0 not checked. [2021-08-25 20:13:28,519 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:28,519 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741386729] [2021-08-25 20:13:28,519 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741386729] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:28,519 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:28,520 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:28,520 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570474301] [2021-08-25 20:13:28,520 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:28,520 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:28,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:28,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:28,521 INFO L87 Difference]: Start difference. First operand 1943 states and 2684 transitions. Second operand has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 states have internal predecessors, (200), 0 states have call successors, (0), 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-08-25 20:13:28,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:28,638 INFO L93 Difference]: Finished difference Result 3918 states and 5404 transitions. [2021-08-25 20:13:28,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:28,639 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 states have internal predecessors, (200), 0 states have call successors, (0), 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 670 [2021-08-25 20:13:28,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:28,642 INFO L225 Difference]: With dead ends: 3918 [2021-08-25 20:13:28,643 INFO L226 Difference]: Without dead ends: 1983 [2021-08-25 20:13:28,645 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:28,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1983 states. [2021-08-25 20:13:28,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1983 to 1943. [2021-08-25 20:13:28,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1943 states, 1942 states have (on average 1.37178166838311) internal successors, (2664), 1942 states have internal predecessors, (2664), 0 states have call successors, (0), 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-08-25 20:13:28,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1943 states to 1943 states and 2664 transitions. [2021-08-25 20:13:28,684 INFO L78 Accepts]: Start accepts. Automaton has 1943 states and 2664 transitions. Word has length 670 [2021-08-25 20:13:28,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:28,684 INFO L470 AbstractCegarLoop]: Abstraction has 1943 states and 2664 transitions. [2021-08-25 20:13:28,685 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 states have internal predecessors, (200), 0 states have call successors, (0), 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-08-25 20:13:28,685 INFO L276 IsEmpty]: Start isEmpty. Operand 1943 states and 2664 transitions. [2021-08-25 20:13:28,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 685 [2021-08-25 20:13:28,689 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:28,689 INFO L512 BasicCegarLoop]: trace histogram [24, 24, 24, 23, 23, 23, 23, 23, 23, 23, 23, 23, 21, 21, 21, 19, 19, 17, 17, 15, 15, 13, 13, 13, 13, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:13:28,689 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-08-25 20:13:28,689 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:28,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:28,690 INFO L82 PathProgramCache]: Analyzing trace with hash -671834123, now seen corresponding path program 1 times [2021-08-25 20:13:28,690 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:28,690 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017454596] [2021-08-25 20:13:28,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:28,690 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:28,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:28,765 INFO L134 CoverageAnalysis]: Checked inductivity of 5385 backedges. 2915 proven. 0 refuted. 0 times theorem prover too weak. 2470 trivial. 0 not checked. [2021-08-25 20:13:28,766 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:28,766 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017454596] [2021-08-25 20:13:28,766 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017454596] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:28,766 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:28,766 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:28,766 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045206252] [2021-08-25 20:13:28,767 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:28,767 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:28,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:28,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:28,768 INFO L87 Difference]: Start difference. First operand 1943 states and 2664 transitions. Second operand has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 3 states have internal predecessors, (202), 0 states have call successors, (0), 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-08-25 20:13:28,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:28,908 INFO L93 Difference]: Finished difference Result 3893 states and 5333 transitions. [2021-08-25 20:13:28,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:28,908 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 3 states have internal predecessors, (202), 0 states have call successors, (0), 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 684 [2021-08-25 20:13:28,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:28,911 INFO L225 Difference]: With dead ends: 3893 [2021-08-25 20:13:28,912 INFO L226 Difference]: Without dead ends: 1958 [2021-08-25 20:13:28,913 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:28,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1958 states. [2021-08-25 20:13:28,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1958 to 1930. [2021-08-25 20:13:28,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1930 states, 1929 states have (on average 1.3504406428201141) internal successors, (2605), 1929 states have internal predecessors, (2605), 0 states have call successors, (0), 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-08-25 20:13:28,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1930 states to 1930 states and 2605 transitions. [2021-08-25 20:13:28,963 INFO L78 Accepts]: Start accepts. Automaton has 1930 states and 2605 transitions. Word has length 684 [2021-08-25 20:13:28,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:28,964 INFO L470 AbstractCegarLoop]: Abstraction has 1930 states and 2605 transitions. [2021-08-25 20:13:28,964 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 3 states have internal predecessors, (202), 0 states have call successors, (0), 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-08-25 20:13:28,964 INFO L276 IsEmpty]: Start isEmpty. Operand 1930 states and 2605 transitions. [2021-08-25 20:13:28,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 713 [2021-08-25 20:13:28,970 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:28,972 INFO L512 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 23, 23, 22, 22, 22, 20, 20, 18, 18, 16, 16, 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, 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-08-25 20:13:28,972 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-08-25 20:13:28,972 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:28,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:28,973 INFO L82 PathProgramCache]: Analyzing trace with hash -652254752, now seen corresponding path program 1 times [2021-08-25 20:13:28,973 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:28,973 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527164205] [2021-08-25 20:13:28,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:28,973 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:28,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:29,056 INFO L134 CoverageAnalysis]: Checked inductivity of 5826 backedges. 3231 proven. 0 refuted. 0 times theorem prover too weak. 2595 trivial. 0 not checked. [2021-08-25 20:13:29,056 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:29,057 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527164205] [2021-08-25 20:13:29,057 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527164205] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:29,057 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:29,057 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:29,058 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852760087] [2021-08-25 20:13:29,058 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:29,058 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:29,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:29,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:29,059 INFO L87 Difference]: Start difference. First operand 1930 states and 2605 transitions. Second operand has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 0 states have call successors, (0), 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-08-25 20:13:29,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:29,166 INFO L93 Difference]: Finished difference Result 3922 states and 5297 transitions. [2021-08-25 20:13:29,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:29,166 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 0 states have call successors, (0), 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 712 [2021-08-25 20:13:29,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:29,169 INFO L225 Difference]: With dead ends: 3922 [2021-08-25 20:13:29,169 INFO L226 Difference]: Without dead ends: 1982 [2021-08-25 20:13:29,171 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:29,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1982 states. [2021-08-25 20:13:29,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1982 to 1972. [2021-08-25 20:13:29,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1972 states, 1971 states have (on average 1.3444951801116185) internal successors, (2650), 1971 states have internal predecessors, (2650), 0 states have call successors, (0), 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-08-25 20:13:29,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1972 states to 1972 states and 2650 transitions. [2021-08-25 20:13:29,209 INFO L78 Accepts]: Start accepts. Automaton has 1972 states and 2650 transitions. Word has length 712 [2021-08-25 20:13:29,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:29,210 INFO L470 AbstractCegarLoop]: Abstraction has 1972 states and 2650 transitions. [2021-08-25 20:13:29,210 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 0 states have call successors, (0), 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-08-25 20:13:29,210 INFO L276 IsEmpty]: Start isEmpty. Operand 1972 states and 2650 transitions. [2021-08-25 20:13:29,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 728 [2021-08-25 20:13:29,214 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:13:29,215 INFO L512 BasicCegarLoop]: trace histogram [25, 25, 25, 25, 24, 24, 24, 24, 24, 24, 24, 24, 22, 22, 22, 20, 20, 18, 18, 16, 16, 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, 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] [2021-08-25 20:13:29,215 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-08-25 20:13:29,215 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:13:29,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:13:29,217 INFO L82 PathProgramCache]: Analyzing trace with hash -1056243417, now seen corresponding path program 1 times [2021-08-25 20:13:29,218 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:13:29,218 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940185010] [2021-08-25 20:13:29,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:13:29,218 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:13:29,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:13:29,293 INFO L134 CoverageAnalysis]: Checked inductivity of 5992 backedges. 3254 proven. 0 refuted. 0 times theorem prover too weak. 2738 trivial. 0 not checked. [2021-08-25 20:13:29,293 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:13:29,293 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940185010] [2021-08-25 20:13:29,293 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940185010] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:13:29,294 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:13:29,294 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:13:29,294 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459909973] [2021-08-25 20:13:29,294 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:13:29,294 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:13:29,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:13:29,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:29,295 INFO L87 Difference]: Start difference. First operand 1972 states and 2650 transitions. Second operand has 3 states, 3 states have (on average 70.33333333333333) internal successors, (211), 3 states have internal predecessors, (211), 0 states have call successors, (0), 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-08-25 20:13:29,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:13:29,402 INFO L93 Difference]: Finished difference Result 2520 states and 3370 transitions. [2021-08-25 20:13:29,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:13:29,402 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.33333333333333) internal successors, (211), 3 states have internal predecessors, (211), 0 states have call successors, (0), 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 727 [2021-08-25 20:13:29,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:13:29,403 INFO L225 Difference]: With dead ends: 2520 [2021-08-25 20:13:29,403 INFO L226 Difference]: Without dead ends: 0 [2021-08-25 20:13:29,405 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:13:29,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-08-25 20:13:29,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-08-25 20:13:29,406 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-08-25 20:13:29,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-08-25 20:13:29,406 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 727 [2021-08-25 20:13:29,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:13:29,406 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-25 20:13:29,407 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.33333333333333) internal successors, (211), 3 states have internal predecessors, (211), 0 states have call successors, (0), 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-08-25 20:13:29,407 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-08-25 20:13:29,407 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-08-25 20:13:29,409 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:13:29,410 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-08-25 20:13:29,412 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-08-25 20:13:29,418 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:13:29,457 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:13:29,493 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:13:29,494 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:13:29,515 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:13:29,542 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:13:29,543 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:13:29,562 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:13:29,563 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:13:29,729 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:13:29,748 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:13:29,767 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:13:29,780 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:13:29,800 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:13:29,807 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:13:29,826 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:13:29,835 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:13:29,873 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:13:29,885 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:13:29,902 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:13:29,928 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:13:29,939 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:13:29,940 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:13:29,941 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:13:29,949 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:13:29,959 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:13:29,975 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:13:30,091 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:13:35,786 INFO L857 garLoopResultBuilder]: For program point L334(lines 334 368) no Hoare annotation was computed. [2021-08-25 20:13:35,786 INFO L857 garLoopResultBuilder]: For program point L334-1(lines 334 368) no Hoare annotation was computed. [2021-08-25 20:13:35,786 INFO L857 garLoopResultBuilder]: For program point L202(lines 202 546) no Hoare annotation was computed. [2021-08-25 20:13:35,787 INFO L857 garLoopResultBuilder]: For program point L169(lines 169 557) no Hoare annotation was computed. [2021-08-25 20:13:35,787 INFO L857 garLoopResultBuilder]: For program point L136(lines 136 568) no Hoare annotation was computed. [2021-08-25 20:13:35,787 INFO L857 garLoopResultBuilder]: For program point L103(lines 103 579) no Hoare annotation was computed. [2021-08-25 20:13:35,787 INFO L860 garLoopResultBuilder]: At program point L599(lines 99 600) the Hoare annotation is: true [2021-08-25 20:13:35,787 INFO L857 garLoopResultBuilder]: For program point L533(lines 533 535) no Hoare annotation was computed. [2021-08-25 20:13:35,787 INFO L857 garLoopResultBuilder]: For program point L467(lines 467 469) no Hoare annotation was computed. [2021-08-25 20:13:35,787 INFO L857 garLoopResultBuilder]: For program point L401(lines 401 403) no Hoare annotation was computed. [2021-08-25 20:13:35,787 INFO L857 garLoopResultBuilder]: For program point L335(lines 335 365) no Hoare annotation was computed. [2021-08-25 20:13:35,788 INFO L853 garLoopResultBuilder]: At program point L203(lines 199 547) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3))) (or (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0) .cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (and (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8577 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529)) (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528)) (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))))) [2021-08-25 20:13:35,788 INFO L853 garLoopResultBuilder]: At program point L104(lines 103 579) the Hoare annotation is: (and (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8577 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529)) (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528)) (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) [2021-08-25 20:13:35,788 INFO L857 garLoopResultBuilder]: For program point L205(lines 205 545) no Hoare annotation was computed. [2021-08-25 20:13:35,788 INFO L857 garLoopResultBuilder]: For program point L172(lines 172 556) no Hoare annotation was computed. [2021-08-25 20:13:35,789 INFO L857 garLoopResultBuilder]: For program point L139(lines 139 567) no Hoare annotation was computed. [2021-08-25 20:13:35,789 INFO L857 garLoopResultBuilder]: For program point L106(lines 106 578) no Hoare annotation was computed. [2021-08-25 20:13:35,789 INFO L857 garLoopResultBuilder]: For program point L305(lines 305 312) no Hoare annotation was computed. [2021-08-25 20:13:35,789 INFO L857 garLoopResultBuilder]: For program point L305-2(lines 305 312) no Hoare annotation was computed. [2021-08-25 20:13:35,789 INFO L853 garLoopResultBuilder]: At program point L206(lines 205 545) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) [2021-08-25 20:13:35,789 INFO L853 garLoopResultBuilder]: At program point L173(lines 169 557) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse2 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse4 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse8 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse11 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)))) (or (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse10 .cse11 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse12) (and .cse0 .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) .cse3 .cse4 .cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) .cse6 .cse7 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) .cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0)) .cse9 .cse10 .cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) .cse12))) [2021-08-25 20:13:35,789 INFO L853 garLoopResultBuilder]: At program point L140(lines 136 568) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse2 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse6 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse10 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)))) (or (and .cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse11) (and (not (= 8577 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) .cse4 .cse5 .cse6 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) .cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0)) .cse8 .cse9 .cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) .cse11))) [2021-08-25 20:13:35,790 INFO L857 garLoopResultBuilder]: For program point L604(lines 604 606) no Hoare annotation was computed. [2021-08-25 20:13:35,790 INFO L857 garLoopResultBuilder]: For program point L604-2(lines 604 606) no Hoare annotation was computed. [2021-08-25 20:13:35,790 INFO L857 garLoopResultBuilder]: For program point L505(lines 505 508) no Hoare annotation was computed. [2021-08-25 20:13:35,790 INFO L857 garLoopResultBuilder]: For program point L340(lines 340 363) no Hoare annotation was computed. [2021-08-25 20:13:35,790 INFO L853 garLoopResultBuilder]: At program point L208(lines 207 545) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) [2021-08-25 20:13:35,790 INFO L857 garLoopResultBuilder]: For program point L175(lines 175 555) no Hoare annotation was computed. [2021-08-25 20:13:35,790 INFO L857 garLoopResultBuilder]: For program point L142(lines 142 566) no Hoare annotation was computed. [2021-08-25 20:13:35,790 INFO L857 garLoopResultBuilder]: For program point L109(lines 109 577) no Hoare annotation was computed. [2021-08-25 20:13:35,791 INFO L857 garLoopResultBuilder]: For program point L275(lines 275 277) no Hoare annotation was computed. [2021-08-25 20:13:35,791 INFO L857 garLoopResultBuilder]: For program point L275-2(lines 209 542) no Hoare annotation was computed. [2021-08-25 20:13:35,791 INFO L857 garLoopResultBuilder]: For program point L441(lines 441 443) no Hoare annotation was computed. [2021-08-25 20:13:35,791 INFO L857 garLoopResultBuilder]: For program point L309(lines 309 311) no Hoare annotation was computed. [2021-08-25 20:13:35,791 INFO L857 garLoopResultBuilder]: For program point L343(lines 343 347) no Hoare annotation was computed. [2021-08-25 20:13:35,791 INFO L857 garLoopResultBuilder]: For program point L343-2(lines 343 347) no Hoare annotation was computed. [2021-08-25 20:13:35,791 INFO L857 garLoopResultBuilder]: For program point L244(lines 244 254) no Hoare annotation was computed. [2021-08-25 20:13:35,791 INFO L857 garLoopResultBuilder]: For program point L178(lines 178 554) no Hoare annotation was computed. [2021-08-25 20:13:35,792 INFO L857 garLoopResultBuilder]: For program point L145(lines 145 565) no Hoare annotation was computed. [2021-08-25 20:13:35,792 INFO L857 garLoopResultBuilder]: For program point L112(lines 112 576) no Hoare annotation was computed. [2021-08-25 20:13:35,792 INFO L857 garLoopResultBuilder]: For program point L476(lines 476 478) no Hoare annotation was computed. [2021-08-25 20:13:35,792 INFO L857 garLoopResultBuilder]: For program point L476-2(lines 209 542) no Hoare annotation was computed. [2021-08-25 20:13:35,792 INFO L857 garLoopResultBuilder]: For program point L377(lines 377 409) no Hoare annotation was computed. [2021-08-25 20:13:35,792 INFO L857 garLoopResultBuilder]: For program point L245(lines 245 248) no Hoare annotation was computed. [2021-08-25 20:13:35,792 INFO L853 garLoopResultBuilder]: At program point L212(lines 106 578) the Hoare annotation is: (let ((.cse0 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)))) (or (and (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8577 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529)) (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528)) .cse0 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) (and .cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)))) [2021-08-25 20:13:35,793 INFO L853 garLoopResultBuilder]: At program point L179(lines 175 555) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8577 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse4 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse7 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse12 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse14 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse18 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609))) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641))) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) .cse13 .cse14 .cse15 .cse16 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse17 .cse18 .cse19 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse20 .cse21) (and .cse0 .cse1 .cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse13 .cse14 .cse15 (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0)) .cse16 .cse17 .cse18 .cse19 .cse20 .cse21))) [2021-08-25 20:13:35,793 INFO L853 garLoopResultBuilder]: At program point L146(lines 142 566) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse2 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse7 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse11 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)))) (or (and .cse0 (not (= 8577 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) .cse3 .cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) .cse5 .cse6 .cse7 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) .cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0)) .cse9 .cse10 .cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641))) (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)))) [2021-08-25 20:13:35,793 INFO L860 garLoopResultBuilder]: At program point L609(lines 12 611) the Hoare annotation is: true [2021-08-25 20:13:35,793 INFO L853 garLoopResultBuilder]: At program point L543(lines 100 598) the Hoare annotation is: (let ((.cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse3 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse4 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and .cse0 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0) .cse0 .cse1 .cse2) (and (not (= 8577 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) .cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) .cse3 (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641))) (and (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529)) (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)) (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse3 .cse4) (and (= 3 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0) .cse0 .cse4 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (<= ULTIMATE.start_ssl3_accept_~s__state~0 3))) [2021-08-25 20:13:35,793 INFO L857 garLoopResultBuilder]: For program point L444(lines 444 453) no Hoare annotation was computed. [2021-08-25 20:13:35,793 INFO L857 garLoopResultBuilder]: For program point L378(lines 378 384) no Hoare annotation was computed. [2021-08-25 20:13:35,794 INFO L857 garLoopResultBuilder]: For program point L181(lines 181 553) no Hoare annotation was computed. [2021-08-25 20:13:35,794 INFO L857 garLoopResultBuilder]: For program point L148(lines 148 564) no Hoare annotation was computed. [2021-08-25 20:13:35,794 INFO L857 garLoopResultBuilder]: For program point L115(lines 115 575) no Hoare annotation was computed. [2021-08-25 20:13:35,794 INFO L857 garLoopResultBuilder]: For program point L83(lines 83 89) no Hoare annotation was computed. [2021-08-25 20:13:35,794 INFO L857 garLoopResultBuilder]: For program point L513(lines 513 515) no Hoare annotation was computed. [2021-08-25 20:13:35,794 INFO L857 garLoopResultBuilder]: For program point L580(lines 580 596) no Hoare annotation was computed. [2021-08-25 20:13:35,794 INFO L853 garLoopResultBuilder]: At program point L514(lines 73 610) the Hoare annotation is: false [2021-08-25 20:13:35,794 INFO L857 garLoopResultBuilder]: For program point L448(lines 448 450) no Hoare annotation was computed. [2021-08-25 20:13:35,794 INFO L857 garLoopResultBuilder]: For program point L217(lines 217 219) no Hoare annotation was computed. [2021-08-25 20:13:35,795 INFO L857 garLoopResultBuilder]: For program point L184(lines 184 552) no Hoare annotation was computed. [2021-08-25 20:13:35,795 INFO L857 garLoopResultBuilder]: For program point L151(lines 151 563) no Hoare annotation was computed. [2021-08-25 20:13:35,795 INFO L857 garLoopResultBuilder]: For program point L217-2(lines 217 219) no Hoare annotation was computed. [2021-08-25 20:13:35,795 INFO L857 garLoopResultBuilder]: For program point L118(lines 118 574) no Hoare annotation was computed. [2021-08-25 20:13:35,795 INFO L857 garLoopResultBuilder]: For program point L581(lines 581 595) no Hoare annotation was computed. [2021-08-25 20:13:35,795 INFO L857 garLoopResultBuilder]: For program point L482(lines 482 486) no Hoare annotation was computed. [2021-08-25 20:13:35,795 INFO L857 garLoopResultBuilder]: For program point L482-2(lines 482 486) no Hoare annotation was computed. [2021-08-25 20:13:35,795 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-08-25 20:13:35,796 INFO L853 garLoopResultBuilder]: At program point L185(lines 181 553) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8577 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse5 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse8 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse12 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse14 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse18 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse19 (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641))) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)))) (or (and .cse0 .cse1 .cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse13 .cse14 .cse15 (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0)) .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) .cse13 .cse14 .cse15 .cse16 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse17 .cse18 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse19 .cse20 .cse21))) [2021-08-25 20:13:35,796 INFO L853 garLoopResultBuilder]: At program point L152(lines 148 564) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse2 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse4 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse7 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse10 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)))) (or (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse11) (and .cse0 (not (= 8577 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) .cse3 .cse4 .cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) .cse6 .cse7 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) .cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0)) .cse9 .cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) .cse11))) [2021-08-25 20:13:35,796 INFO L857 garLoopResultBuilder]: For program point L86(lines 86 88) no Hoare annotation was computed. [2021-08-25 20:13:35,796 INFO L857 garLoopResultBuilder]: For program point L86-2(lines 83 89) no Hoare annotation was computed. [2021-08-25 20:13:35,796 INFO L857 garLoopResultBuilder]: For program point L582(lines 582 587) no Hoare annotation was computed. [2021-08-25 20:13:35,796 INFO L857 garLoopResultBuilder]: For program point L516(lines 516 518) no Hoare annotation was computed. [2021-08-25 20:13:35,796 INFO L857 garLoopResultBuilder]: For program point L582-2(lines 581 595) no Hoare annotation was computed. [2021-08-25 20:13:35,797 INFO L857 garLoopResultBuilder]: For program point L351(lines 351 359) no Hoare annotation was computed. [2021-08-25 20:13:35,797 INFO L853 garLoopResultBuilder]: At program point L352(lines 328 370) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse2 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse4 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse7 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse10 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)))) (or (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse11) (and .cse0 (not (= 8577 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) .cse3 .cse4 .cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) .cse6 .cse7 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) .cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0)) .cse9 .cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) .cse11))) [2021-08-25 20:13:35,797 INFO L857 garLoopResultBuilder]: For program point L187(lines 187 551) no Hoare annotation was computed. [2021-08-25 20:13:35,797 INFO L857 garLoopResultBuilder]: For program point L154(lines 154 562) no Hoare annotation was computed. [2021-08-25 20:13:35,797 INFO L857 garLoopResultBuilder]: For program point L121(lines 121 573) no Hoare annotation was computed. [2021-08-25 20:13:35,797 INFO L857 garLoopResultBuilder]: For program point L584(lines 584 586) no Hoare annotation was computed. [2021-08-25 20:13:35,797 INFO L857 garLoopResultBuilder]: For program point L419(lines 419 421) no Hoare annotation was computed. [2021-08-25 20:13:35,798 INFO L853 garLoopResultBuilder]: At program point L386(lines 377 409) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse2 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse4 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse7 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse10 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)))) (or (and .cse0 (not (= 8577 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) .cse3 .cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) .cse5 .cse6 .cse7 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) .cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0)) .cse9 .cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) .cse11) (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse11))) [2021-08-25 20:13:35,798 INFO L853 garLoopResultBuilder]: At program point L122(lines 118 574) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse3 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse6 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse7 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse10 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)))) (or (and .cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse9 .cse10 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse11) (and .cse0 (not (= 8577 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) .cse2 .cse3 .cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) .cse5 .cse6 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) .cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0)) .cse8 .cse9 .cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) .cse11))) [2021-08-25 20:13:35,798 INFO L857 garLoopResultBuilder]: For program point L354(lines 354 356) no Hoare annotation was computed. [2021-08-25 20:13:35,798 INFO L857 garLoopResultBuilder]: For program point L288(lines 288 290) no Hoare annotation was computed. [2021-08-25 20:13:35,798 INFO L857 garLoopResultBuilder]: For program point L222(lines 222 224) no Hoare annotation was computed. [2021-08-25 20:13:35,798 INFO L857 garLoopResultBuilder]: For program point L288-2(lines 209 542) no Hoare annotation was computed. [2021-08-25 20:13:35,798 INFO L857 garLoopResultBuilder]: For program point L520(lines 520 524) no Hoare annotation was computed. [2021-08-25 20:13:35,799 INFO L857 garLoopResultBuilder]: For program point L520-2(lines 520 524) no Hoare annotation was computed. [2021-08-25 20:13:35,799 INFO L857 garLoopResultBuilder]: For program point L322(lines 322 326) no Hoare annotation was computed. [2021-08-25 20:13:35,799 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-08-25 20:13:35,799 INFO L857 garLoopResultBuilder]: For program point L322-2(lines 209 542) no Hoare annotation was computed. [2021-08-25 20:13:35,799 INFO L857 garLoopResultBuilder]: For program point L190(lines 190 550) no Hoare annotation was computed. [2021-08-25 20:13:35,799 INFO L857 garLoopResultBuilder]: For program point L157(lines 157 561) no Hoare annotation was computed. [2021-08-25 20:13:35,799 INFO L857 garLoopResultBuilder]: For program point L124(lines 124 572) no Hoare annotation was computed. [2021-08-25 20:13:35,799 INFO L857 garLoopResultBuilder]: For program point L91(lines 91 95) no Hoare annotation was computed. [2021-08-25 20:13:35,800 INFO L857 garLoopResultBuilder]: For program point L91-1(lines 73 610) no Hoare annotation was computed. [2021-08-25 20:13:35,800 INFO L857 garLoopResultBuilder]: For program point L389(lines 389 407) no Hoare annotation was computed. [2021-08-25 20:13:35,800 INFO L853 garLoopResultBuilder]: At program point L191(lines 187 551) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8577 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse5 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse7 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse12 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse14 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse17 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse18 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse19 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609))) (.cse20 (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) .cse13 .cse14 .cse15 .cse16 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse17 .cse18 .cse19 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse20 .cse21) (and .cse0 .cse1 .cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0)) .cse16 .cse17 .cse18 .cse19 .cse20 .cse21))) [2021-08-25 20:13:35,800 INFO L853 garLoopResultBuilder]: At program point L158(lines 154 562) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse2 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse4 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse7 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse10 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)))) (or (and .cse0 (not (= 8577 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) .cse3 .cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) .cse5 .cse6 .cse7 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) .cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0)) .cse9 .cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) .cse11) (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse11))) [2021-08-25 20:13:35,800 INFO L853 garLoopResultBuilder]: At program point L125(lines 124 572) the Hoare annotation is: (and (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= 8577 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529)) (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528)) (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512))) [2021-08-25 20:13:35,800 INFO L857 garLoopResultBuilder]: For program point L92(lines 92 94) no Hoare annotation was computed. [2021-08-25 20:13:35,801 INFO L860 garLoopResultBuilder]: At program point L621(lines 612 623) the Hoare annotation is: true [2021-08-25 20:13:35,801 INFO L857 garLoopResultBuilder]: For program point L390(lines 390 396) no Hoare annotation was computed. [2021-08-25 20:13:35,801 INFO L857 garLoopResultBuilder]: For program point L589(lines 589 593) no Hoare annotation was computed. [2021-08-25 20:13:35,801 INFO L857 garLoopResultBuilder]: For program point L193(lines 193 549) no Hoare annotation was computed. [2021-08-25 20:13:35,801 INFO L857 garLoopResultBuilder]: For program point L160(lines 160 560) no Hoare annotation was computed. [2021-08-25 20:13:35,801 INFO L857 garLoopResultBuilder]: For program point L127(lines 127 571) no Hoare annotation was computed. [2021-08-25 20:13:35,801 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-08-25 20:13:35,801 INFO L857 garLoopResultBuilder]: For program point L458(lines 458 460) no Hoare annotation was computed. [2021-08-25 20:13:35,802 INFO L857 garLoopResultBuilder]: For program point L260(lines 260 262) no Hoare annotation was computed. [2021-08-25 20:13:35,802 INFO L857 garLoopResultBuilder]: For program point L227(lines 227 238) no Hoare annotation was computed. [2021-08-25 20:13:35,802 INFO L857 garLoopResultBuilder]: For program point L227-2(lines 209 542) no Hoare annotation was computed. [2021-08-25 20:13:35,802 INFO L857 garLoopResultBuilder]: For program point L492(lines 492 495) no Hoare annotation was computed. [2021-08-25 20:13:35,802 INFO L857 garLoopResultBuilder]: For program point L294(lines 294 298) no Hoare annotation was computed. [2021-08-25 20:13:35,802 INFO L857 garLoopResultBuilder]: For program point L294-2(lines 294 298) no Hoare annotation was computed. [2021-08-25 20:13:35,802 INFO L857 garLoopResultBuilder]: For program point L427-1(lines 427 435) no Hoare annotation was computed. [2021-08-25 20:13:35,802 INFO L857 garLoopResultBuilder]: For program point L229(lines 229 232) no Hoare annotation was computed. [2021-08-25 20:13:35,802 INFO L857 garLoopResultBuilder]: For program point L196(lines 196 548) no Hoare annotation was computed. [2021-08-25 20:13:35,803 INFO L857 garLoopResultBuilder]: For program point L163(lines 163 559) no Hoare annotation was computed. [2021-08-25 20:13:35,803 INFO L857 garLoopResultBuilder]: For program point L130(lines 130 570) no Hoare annotation was computed. [2021-08-25 20:13:35,803 INFO L853 garLoopResultBuilder]: At program point L197(lines 193 549) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= 8577 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse5 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse8 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse13 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse14 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse15 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse17 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse18 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609))) (.cse19 (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse20 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641))) (.cse21 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)))) (or (and .cse0 .cse1 .cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse14 (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0)) .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672) .cse14 .cse15 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse16 .cse17 .cse18 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse19 .cse20 .cse21))) [2021-08-25 20:13:35,803 INFO L853 garLoopResultBuilder]: At program point L164(lines 160 560) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse2 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse7 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse10 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)))) (or (and .cse0 (not (= 8577 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) .cse3 .cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) .cse5 .cse6 .cse7 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0)) .cse8 .cse9 .cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) .cse11) (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse11))) [2021-08-25 20:13:35,803 INFO L857 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-08-25 20:13:35,804 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 608) no Hoare annotation was computed. [2021-08-25 20:13:35,804 INFO L857 garLoopResultBuilder]: For program point L430(lines 430 433) no Hoare annotation was computed. [2021-08-25 20:13:35,804 INFO L857 garLoopResultBuilder]: For program point L331(lines 331 369) no Hoare annotation was computed. [2021-08-25 20:13:35,804 INFO L857 garLoopResultBuilder]: For program point L199(lines 199 547) no Hoare annotation was computed. [2021-08-25 20:13:35,804 INFO L857 garLoopResultBuilder]: For program point L166(lines 166 558) no Hoare annotation was computed. [2021-08-25 20:13:35,804 INFO L857 garLoopResultBuilder]: For program point L133(lines 133 569) no Hoare annotation was computed. [2021-08-25 20:13:35,804 INFO L853 garLoopResultBuilder]: At program point L100-2(lines 100 598) the Hoare annotation is: (let ((.cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse3 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3)) (.cse4 (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (or (and .cse0 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0))) (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~0) .cse0 .cse1 .cse2) (and (not (= 8577 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) .cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) .cse3 (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641))) (and (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480)) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561)) (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529)) (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545)) (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse3 .cse4) (and (= 3 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0) .cse0 .cse4 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (<= ULTIMATE.start_ssl3_accept_~s__state~0 3))) [2021-08-25 20:13:35,805 INFO L857 garLoopResultBuilder]: For program point L530(lines 530 536) no Hoare annotation was computed. [2021-08-25 20:13:35,805 INFO L857 garLoopResultBuilder]: For program point L497(lines 497 499) no Hoare annotation was computed. [2021-08-25 20:13:35,805 INFO L857 garLoopResultBuilder]: For program point L530-1(lines 530 536) no Hoare annotation was computed. [2021-08-25 20:13:35,805 INFO L857 garLoopResultBuilder]: For program point L497-2(lines 209 542) no Hoare annotation was computed. [2021-08-25 20:13:35,805 INFO L853 garLoopResultBuilder]: At program point L398(lines 389 407) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse2 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse4 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse7 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse8 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse10 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)))) (or (and .cse0 (not (= 8577 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) .cse3 .cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) .cse5 .cse6 .cse7 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) .cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0)) .cse9 .cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) .cse11) (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse11))) [2021-08-25 20:13:35,805 INFO L857 garLoopResultBuilder]: For program point L233(lines 233 236) no Hoare annotation was computed. [2021-08-25 20:13:35,805 INFO L853 garLoopResultBuilder]: At program point L167(lines 166 558) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse2 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse4 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse8 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)))) (or (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse2 (= 3 ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0 8576) (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) (<= ULTIMATE.start_ssl3_accept_~s__state~0 8448)) (and .cse0 (not (= 8577 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) .cse3 .cse4 .cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) .cse6 .cse7 .cse8 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) .cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0)) .cse10 .cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) .cse12))) [2021-08-25 20:13:35,806 INFO L853 garLoopResultBuilder]: At program point L134(lines 127 571) the Hoare annotation is: (let ((.cse0 (not (= 8497 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8480))) (.cse2 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8561))) (.cse4 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse8 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse9 (not (= 8560 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse12 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)))) (or (and .cse0 (not (= 8577 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse1 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8673)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) .cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) .cse3 .cse4 .cse5 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) .cse6 .cse7 .cse8 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657)) .cse9 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656)) (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0)) .cse10 .cse11 .cse12 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8609)) (not (= 8593 ULTIMATE.start_ssl3_accept_~s__state~0)) (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8641)) .cse13) (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse13))) [2021-08-25 20:13:35,806 INFO L857 garLoopResultBuilder]: For program point L101(line 101) no Hoare annotation was computed. [2021-08-25 20:13:35,809 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-25 20:13:35,837 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.08 08:13:35 BoogieIcfgContainer [2021-08-25 20:13:35,837 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-25 20:13:35,838 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-25 20:13:35,838 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-25 20:13:35,838 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-25 20:13:35,839 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 08:13:16" (3/4) ... [2021-08-25 20:13:35,841 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-08-25 20:13:35,855 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2021-08-25 20:13:35,856 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-08-25 20:13:35,856 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-08-25 20:13:35,857 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-08-25 20:13:35,955 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-08-25 20:13:35,956 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-25 20:13:35,957 INFO L168 Benchmark]: Toolchain (without parser) took 21044.84 ms. Allocated memory was 71.3 MB in the beginning and 455.1 MB in the end (delta: 383.8 MB). Free memory was 53.0 MB in the beginning and 340.5 MB in the end (delta: -287.5 MB). Peak memory consumption was 96.3 MB. Max. memory is 16.1 GB. [2021-08-25 20:13:35,958 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 71.3 MB. Free memory was 51.9 MB in the beginning and 51.8 MB in the end (delta: 36.1 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-25 20:13:35,958 INFO L168 Benchmark]: CACSL2BoogieTranslator took 321.91 ms. Allocated memory is still 71.3 MB. Free memory was 52.7 MB in the beginning and 51.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. [2021-08-25 20:13:35,959 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.12 ms. Allocated memory is still 71.3 MB. Free memory was 51.4 MB in the beginning and 48.4 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-08-25 20:13:35,959 INFO L168 Benchmark]: Boogie Preprocessor took 49.02 ms. Allocated memory is still 71.3 MB. Free memory was 48.4 MB in the beginning and 46.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-25 20:13:35,959 INFO L168 Benchmark]: RCFGBuilder took 839.49 ms. Allocated memory was 71.3 MB in the beginning and 109.1 MB in the end (delta: 37.7 MB). Free memory was 46.3 MB in the beginning and 77.4 MB in the end (delta: -31.1 MB). Peak memory consumption was 24.2 MB. Max. memory is 16.1 GB. [2021-08-25 20:13:35,960 INFO L168 Benchmark]: TraceAbstraction took 19642.94 ms. Allocated memory was 109.1 MB in the beginning and 455.1 MB in the end (delta: 346.0 MB). Free memory was 76.9 MB in the beginning and 354.1 MB in the end (delta: -277.3 MB). Peak memory consumption was 278.0 MB. Max. memory is 16.1 GB. [2021-08-25 20:13:35,960 INFO L168 Benchmark]: Witness Printer took 118.13 ms. Allocated memory is still 455.1 MB. Free memory was 354.1 MB in the beginning and 340.5 MB in the end (delta: 13.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-08-25 20:13:35,965 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.11 ms. Allocated memory is still 71.3 MB. Free memory was 51.9 MB in the beginning and 51.8 MB in the end (delta: 36.1 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 321.91 ms. Allocated memory is still 71.3 MB. Free memory was 52.7 MB in the beginning and 51.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 67.12 ms. Allocated memory is still 71.3 MB. Free memory was 51.4 MB in the beginning and 48.4 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 49.02 ms. Allocated memory is still 71.3 MB. Free memory was 48.4 MB in the beginning and 46.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 839.49 ms. Allocated memory was 71.3 MB in the beginning and 109.1 MB in the end (delta: 37.7 MB). Free memory was 46.3 MB in the beginning and 77.4 MB in the end (delta: -31.1 MB). Peak memory consumption was 24.2 MB. Max. memory is 16.1 GB. * TraceAbstraction took 19642.94 ms. Allocated memory was 109.1 MB in the beginning and 455.1 MB in the end (delta: 346.0 MB). Free memory was 76.9 MB in the beginning and 354.1 MB in the end (delta: -277.3 MB). Peak memory consumption was 278.0 MB. Max. memory is 16.1 GB. * Witness Printer took 118.13 ms. Allocated memory is still 455.1 MB. Free memory was 354.1 MB in the beginning and 340.5 MB in the end (delta: 13.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 608]: 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: 19578.8ms, OverallIterations: 36, TraceHistogramMax: 25, EmptinessCheckTime: 115.3ms, AutomataDifference: 5535.8ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 6375.3ms, InitialAbstractionConstructionTime: 8.9ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 5549 SDtfs, 4974 SDslu, 1879 SDs, 0 SdLazy, 3378 SolverSat, 1373 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2986.1ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1346 GetRequests, 1302 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 108.7ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=2989occurred in iteration=29, InterpolantAutomatonStates: 111, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 975.8ms AutomataMinimizationTime, 36 MinimizatonAttempts, 1659 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: 0.0ms HoareAnnotationTime, 28 LocationsWithAnnotation, 28 PreInvPairs, 207 NumberOfFragments, 3512 HoareAnnotationTreeSize, 28 FomulaSimplifications, 31191 FormulaSimplificationTreeSizeReduction, 675.6ms HoareSimplificationTime, 28 FomulaSimplificationsInter, 5983 FormulaSimplificationTreeSizeReductionInter, 5679.0ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 172.4ms SsaConstructionTime, 523.1ms SatisfiabilityAnalysisTime, 4246.9ms InterpolantComputationTime, 9386 NumberOfCodeBlocks, 9386 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 9347 ConstructedInterpolants, 0 QuantifiedInterpolants, 12770 SizeOfPredicates, 2 NumberOfNonLiveVariables, 2022 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 39 InterpolantComputations, 34 PerfectInterpolantSequences, 40483/40613 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: 328]: Loop Invariant Derived loop invariant: ((((((((((((((!(8497 == s__state) && !(s__state == 8480)) && s__state <= 8576) && !(8496 == s__state)) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8544)) && !(s__state == 8481)) && !(8576 == s__state)) && !(8560 == s__state)) && !(s__state == 8545)) && !(8448 == s__state)) && blastFlag <= 2) && 8448 <= s__state) && !(s__state == 8512)) || (((((((((((((((((((((((((!(8497 == s__state) && !(8577 == s__state)) && !(s__state == 8480)) && !(s__state == 8673)) && !(s__state == 8592)) && !(s__state == 8672)) && !(8496 == s__state)) && !(s__state == 8640)) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8544)) && !(s__state == 8608)) && !(s__state == 8481)) && !(8576 == s__state)) && blastFlag <= 3) && !(s__state == 8657)) && !(8560 == s__state)) && !(s__state == 8656)) && !(12292 == s__state)) && !(s__hit == 0)) && !(s__state == 8545)) && !(8448 == s__state)) && !(s__state == 8609)) && !(8593 == s__state)) && !(s__state == 8641)) && !(s__state == 8512)) - InvariantResult [Line: 106]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((!(8497 == s__state) && !(8577 == s__state)) && !(s__state == 8480)) && !(s__state == 8673)) && !(s__state == 8592)) && !(s__state == 8672)) && !(8496 == s__state)) && !(s__state == 8640)) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8544)) && !(s__state == 8608)) && !(s__state == 8481)) && !(s__state == 8529)) && !(8576 == s__state)) && blastFlag <= 3) && !(s__state == 8657)) && !(8560 == s__state)) && !(s__state == 8656)) && !(s__hit == 0)) && !(s__state == 8545)) && !(s__state == 8528)) && !(8448 == s__state)) && !(s__state == 8609)) && !(8593 == s__state)) && !(s__state == 8641)) && !(s__state == 8512)) || ((!(8448 == s__state) && blastFlag <= 2) && s__state <= 8448) - InvariantResult [Line: 207]: Loop Invariant Derived loop invariant: !(s__state == 8672) - InvariantResult [Line: 193]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((!(8497 == s__state) && !(8577 == s__state)) && !(s__state == 8480)) && !(s__state == 8673)) && !(s__state == 8592)) && !(s__state == 8672)) && !(8496 == s__state)) && !(s__state == 8640)) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8544)) && !(s__state == 8608)) && !(s__state == 8481)) && !(s__state == 8529)) && !(8576 == s__state)) && blastFlag <= 3) && !(8560 == s__state)) && !(12292 == s__state)) && !(s__hit == 0)) && !(s__state == 8545)) && !(s__state == 8528)) && !(8448 == s__state)) && !(s__state == 8609)) && !(8593 == s__state)) && !(s__state == 8641)) && !(s__state == 8512)) || (((((((((((((((((((((((((!(8497 == s__state) && !(8577 == s__state)) && !(s__state == 8480)) && !(s__state == 8592)) && !(s__state == 8672)) && !(8496 == s__state)) && !(s__state == 8640)) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8544)) && !(s__state == 8608)) && !(s__state == 8481)) && !(s__state == 8529)) && !(8576 == s__state)) && s__state <= 8672) && !(8560 == s__state)) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8528)) && !(8448 == s__state)) && !(s__state == 8609)) && blastFlag <= 2) && 8448 <= s__state) && !(8593 == s__state)) && !(s__state == 8641)) && !(s__state == 8512)) - InvariantResult [Line: 377]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((!(8497 == s__state) && !(8577 == s__state)) && !(s__state == 8480)) && !(s__state == 8673)) && !(s__state == 8592)) && !(s__state == 8672)) && !(8496 == s__state)) && !(s__state == 8640)) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8608)) && !(s__state == 8481)) && !(s__state == 8529)) && !(8576 == s__state)) && blastFlag <= 3) && !(s__state == 8657)) && !(8560 == s__state)) && !(s__state == 8656)) && !(12292 == s__state)) && !(s__hit == 0)) && !(s__state == 8528)) && !(8448 == s__state)) && !(s__state == 8609)) && !(8593 == s__state)) && !(s__state == 8641)) && !(s__state == 8512)) || ((((((((((((((!(8497 == s__state) && !(s__state == 8480)) && s__state <= 8576) && !(8496 == s__state)) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8481)) && !(s__state == 8529)) && !(8576 == s__state)) && !(8560 == s__state)) && !(s__state == 8528)) && !(8448 == s__state)) && blastFlag <= 2) && 8448 <= s__state) && !(s__state == 8512)) - InvariantResult [Line: 12]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 187]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((!(8497 == s__state) && !(8577 == s__state)) && !(s__state == 8480)) && !(s__state == 8592)) && !(s__state == 8672)) && !(8496 == s__state)) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8544)) && !(s__state == 8608)) && !(s__state == 8481)) && !(s__state == 8529)) && !(8576 == s__state)) && s__state <= 8672) && !(s__state == 8657)) && !(8560 == s__state)) && !(s__state == 8656)) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8528)) && !(8448 == s__state)) && !(s__state == 8609)) && blastFlag <= 2) && 8448 <= s__state) && !(8593 == s__state)) && !(s__state == 8512)) || ((((((((((((((((((((((((!(8497 == s__state) && !(8577 == s__state)) && !(s__state == 8480)) && !(s__state == 8673)) && !(s__state == 8592)) && !(s__state == 8672)) && !(8496 == s__state)) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8544)) && !(s__state == 8608)) && !(s__state == 8481)) && !(s__state == 8529)) && !(8576 == s__state)) && !(s__state == 8657)) && !(8560 == s__state)) && !(s__state == 8656)) && !(12292 == s__state)) && !(s__hit == 0)) && !(s__state == 8545)) && !(s__state == 8528)) && !(8448 == s__state)) && !(s__state == 8609)) && !(8593 == s__state)) && !(s__state == 8512)) - InvariantResult [Line: 73]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 100]: Loop Invariant Derived loop invariant: (((((blastFlag <= 3 && !(s__hit == 0)) || (((8672 <= s__state && blastFlag <= 3) && s__state <= 8672) && s__s3__tmp__next_state___0 <= 8576)) || (((((((!(8577 == s__state) && s__state <= 8672) && !(s__state == 8657)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8609)) && blastFlag <= 2) && !(8593 == s__state)) && !(s__state == 8641))) || (((((((((((!(8497 == s__state) && !(s__state == 8480)) && s__state <= 8576) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8481)) && !(s__state == 8529)) && !(8576 == s__state)) && !(s__state == 8545)) && !(8448 == s__state)) && blastFlag <= 2) && 8448 <= s__state)) || (((3 == s__s3__tmp__next_state___0 && blastFlag <= 3) && 8448 <= s__state) && s__state <= 8448)) || s__state <= 3 - InvariantResult [Line: 389]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((!(8497 == s__state) && !(8577 == s__state)) && !(s__state == 8480)) && !(s__state == 8673)) && !(s__state == 8592)) && !(s__state == 8672)) && !(8496 == s__state)) && !(s__state == 8640)) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8608)) && !(s__state == 8481)) && !(s__state == 8529)) && !(8576 == s__state)) && blastFlag <= 3) && !(s__state == 8657)) && !(8560 == s__state)) && !(s__state == 8656)) && !(12292 == s__state)) && !(s__hit == 0)) && !(s__state == 8528)) && !(8448 == s__state)) && !(s__state == 8609)) && !(8593 == s__state)) && !(s__state == 8641)) && !(s__state == 8512)) || ((((((((((((((!(8497 == s__state) && !(s__state == 8480)) && s__state <= 8576) && !(8496 == s__state)) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8481)) && !(s__state == 8529)) && !(8576 == s__state)) && !(8560 == s__state)) && !(s__state == 8528)) && !(8448 == s__state)) && blastFlag <= 2) && 8448 <= s__state) && !(s__state == 8512)) - InvariantResult [Line: 154]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((!(8497 == s__state) && !(8577 == s__state)) && !(s__state == 8480)) && !(s__state == 8673)) && !(s__state == 8592)) && !(s__state == 8672)) && !(8496 == s__state)) && !(s__state == 8640)) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8608)) && !(s__state == 8481)) && !(s__state == 8529)) && !(8576 == s__state)) && blastFlag <= 3) && !(s__state == 8657)) && !(8560 == s__state)) && !(s__state == 8656)) && !(12292 == s__state)) && !(s__hit == 0)) && !(s__state == 8528)) && !(8448 == s__state)) && !(s__state == 8609)) && !(8593 == s__state)) && !(s__state == 8641)) && !(s__state == 8512)) || ((((((((((((((!(8497 == s__state) && !(s__state == 8480)) && s__state <= 8576) && !(8496 == s__state)) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8481)) && !(s__state == 8529)) && !(8576 == s__state)) && !(8560 == s__state)) && !(s__state == 8528)) && !(8448 == s__state)) && blastFlag <= 2) && 8448 <= s__state) && !(s__state == 8512)) - InvariantResult [Line: 118]: Loop Invariant Derived loop invariant: (((((((((((((((!(8497 == s__state) && s__state <= 8576) && !(8496 == s__state)) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8544)) && !(s__state == 8529)) && !(8576 == s__state)) && !(8560 == s__state)) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8528)) && !(8448 == s__state)) && blastFlag <= 2) && 8448 <= s__state) && !(s__state == 8512)) || (((((((((((((((((((((((((!(8497 == s__state) && !(8577 == s__state)) && !(s__state == 8673)) && !(s__state == 8592)) && !(s__state == 8672)) && !(8496 == s__state)) && !(s__state == 8640)) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8544)) && !(s__state == 8608)) && !(s__state == 8529)) && !(8576 == s__state)) && blastFlag <= 3) && !(s__state == 8657)) && !(8560 == s__state)) && !(s__state == 8656)) && !(12292 == s__state)) && !(s__hit == 0)) && !(s__state == 8545)) && !(s__state == 8528)) && !(8448 == s__state)) && !(s__state == 8609)) && !(8593 == s__state)) && !(s__state == 8641)) && !(s__state == 8512)) - InvariantResult [Line: 160]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((!(8497 == s__state) && !(8577 == s__state)) && !(s__state == 8480)) && !(s__state == 8673)) && !(s__state == 8592)) && !(s__state == 8672)) && !(8496 == s__state)) && !(s__state == 8640)) && !(8513 == s__state)) && !(s__state == 8544)) && !(s__state == 8608)) && !(s__state == 8481)) && !(s__state == 8529)) && !(8576 == s__state)) && blastFlag <= 3) && !(s__state == 8657)) && !(s__state == 8656)) && !(12292 == s__state)) && !(s__hit == 0)) && !(s__state == 8545)) && !(s__state == 8528)) && !(8448 == s__state)) && !(s__state == 8609)) && !(8593 == s__state)) && !(s__state == 8641)) && !(s__state == 8512)) || ((((((((((((((!(8497 == s__state) && !(s__state == 8480)) && s__state <= 8576) && !(8496 == s__state)) && !(8513 == s__state)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8529)) && !(8576 == s__state)) && !(s__state == 8545)) && !(s__state == 8528)) && !(8448 == s__state)) && blastFlag <= 2) && 8448 <= s__state) && !(s__state == 8512)) - InvariantResult [Line: 103]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((!(8497 == s__state) && !(8577 == s__state)) && !(s__state == 8480)) && !(s__state == 8673)) && !(s__state == 8592)) && !(s__state == 8672)) && !(8496 == s__state)) && !(s__state == 8640)) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8544)) && !(s__state == 8608)) && !(s__state == 8481)) && !(s__state == 8529)) && !(8576 == s__state)) && blastFlag <= 3) && !(s__state == 8657)) && !(8560 == s__state)) && !(s__state == 8656)) && !(s__hit == 0)) && !(s__state == 8545)) && !(s__state == 8528)) && !(8448 == s__state)) && !(s__state == 8609)) && !(8593 == s__state)) && !(s__state == 8641)) && !(s__state == 8512) - InvariantResult [Line: 124]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((!(8497 == s__state) && !(8577 == s__state)) && !(s__state == 8480)) && !(s__state == 8673)) && !(s__state == 8592)) && !(s__state == 8672)) && !(8496 == s__state)) && !(s__state == 8640)) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8544)) && !(s__state == 8608)) && !(s__state == 8481)) && !(s__state == 8529)) && !(8576 == s__state)) && !(s__state == 8657)) && !(8560 == s__state)) && !(s__state == 8656)) && !(12292 == s__state)) && !(s__state == 8545)) && !(s__state == 8528)) && !(8448 == s__state)) && !(s__state == 8609)) && !(8593 == s__state)) && !(s__state == 8641)) && !(s__state == 8512) - InvariantResult [Line: 127]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((!(8497 == s__state) && !(8577 == s__state)) && !(s__state == 8480)) && !(s__state == 8673)) && !(s__state == 8592)) && !(s__state == 8672)) && !(8496 == s__state)) && !(s__state == 8640)) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8544)) && !(s__state == 8608)) && !(s__state == 8481)) && !(s__state == 8529)) && !(8576 == s__state)) && blastFlag <= 3) && !(s__state == 8657)) && !(8560 == s__state)) && !(s__state == 8656)) && !(12292 == s__state)) && !(s__hit == 0)) && !(s__state == 8545)) && !(s__state == 8528)) && !(8448 == s__state)) && !(s__state == 8609)) && !(8593 == s__state)) && !(s__state == 8641)) && !(s__state == 8512)) || ((((((((((((((((!(8497 == s__state) && !(s__state == 8480)) && s__state <= 8576) && !(8496 == s__state)) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8529)) && !(8576 == s__state)) && !(8560 == s__state)) && !(s__state == 8545)) && !(s__state == 8528)) && !(8448 == s__state)) && blastFlag <= 2) && 8448 <= s__state) && !(s__state == 8512)) - InvariantResult [Line: 142]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((!(8497 == s__state) && !(8577 == s__state)) && !(s__state == 8480)) && !(s__state == 8673)) && !(s__state == 8592)) && !(s__state == 8672)) && !(8496 == s__state)) && !(s__state == 8640)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8608)) && !(s__state == 8481)) && !(s__state == 8529)) && !(8576 == s__state)) && blastFlag <= 3) && !(s__state == 8657)) && !(8560 == s__state)) && !(s__state == 8656)) && !(12292 == s__state)) && !(s__hit == 0)) && !(s__state == 8545)) && !(s__state == 8528)) && !(8448 == s__state)) && !(s__state == 8609)) && !(8593 == s__state)) && !(s__state == 8641)) || ((((((((((((((!(8497 == s__state) && !(s__state == 8480)) && s__state <= 8576) && !(8496 == s__state)) && !(s__state == 8561)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8529)) && !(8576 == s__state)) && !(8560 == s__state)) && !(s__state == 8545)) && !(s__state == 8528)) && !(8448 == s__state)) && blastFlag <= 2) && 8448 <= s__state) - InvariantResult [Line: 166]: Loop Invariant Derived loop invariant: (((((((((((((((!(8497 == s__state) && !(s__state == 8480)) && s__state <= 8576) && !(8496 == s__state)) && 3 == s__s3__tmp__next_state___0) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8529)) && !(8576 == s__state)) && !(8560 == s__state)) && !(s__state == 8545)) && !(s__state == 8528)) && !(s__state == 8512)) || (((s__s3__tmp__next_state___0 <= 8576 && blastFlag <= 2) && 8448 <= s__state) && s__state <= 8448)) || ((((((((((((((((((((((((((!(8497 == s__state) && !(8577 == s__state)) && !(s__state == 8480)) && !(s__state == 8673)) && !(s__state == 8592)) && !(s__state == 8672)) && !(8496 == s__state)) && !(s__state == 8640)) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8544)) && !(s__state == 8608)) && !(s__state == 8481)) && !(s__state == 8529)) && !(8576 == s__state)) && blastFlag <= 3) && !(s__state == 8657)) && !(8560 == s__state)) && !(s__state == 8656)) && !(12292 == s__state)) && !(s__hit == 0)) && !(s__state == 8545)) && !(s__state == 8528)) && !(s__state == 8609)) && !(8593 == s__state)) && !(s__state == 8641)) && !(s__state == 8512)) - InvariantResult [Line: 136]: Loop Invariant Derived loop invariant: ((((((((((((((!(s__state == 8480) && s__state <= 8576) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8529)) && !(8576 == s__state)) && !(8560 == s__state)) && !(s__state == 8545)) && !(s__state == 8528)) && !(8448 == s__state)) && blastFlag <= 2) && 8448 <= s__state) && !(s__state == 8512)) || (((((((((((((((((((((((((!(8577 == s__state) && !(s__state == 8480)) && !(s__state == 8673)) && !(s__state == 8592)) && !(s__state == 8672)) && !(s__state == 8640)) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8544)) && !(s__state == 8608)) && !(s__state == 8481)) && !(s__state == 8529)) && !(8576 == s__state)) && blastFlag <= 3) && !(s__state == 8657)) && !(8560 == s__state)) && !(s__state == 8656)) && !(12292 == s__state)) && !(s__hit == 0)) && !(s__state == 8545)) && !(s__state == 8528)) && !(8448 == s__state)) && !(s__state == 8609)) && !(8593 == s__state)) && !(s__state == 8641)) && !(s__state == 8512)) - InvariantResult [Line: 169]: Loop Invariant Derived loop invariant: ((((((((((((((((!(8497 == s__state) && !(s__state == 8480)) && s__state <= 8576) && !(8496 == s__state)) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8529)) && !(8560 == s__state)) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8528)) && !(8448 == s__state)) && blastFlag <= 2) && 8448 <= s__state) && !(s__state == 8512)) || (((((((((((((((((((((((((!(8497 == s__state) && !(s__state == 8480)) && !(s__state == 8673)) && !(s__state == 8592)) && !(s__state == 8672)) && !(8496 == s__state)) && !(s__state == 8640)) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8544)) && !(s__state == 8608)) && !(s__state == 8481)) && !(s__state == 8529)) && blastFlag <= 3) && !(s__state == 8657)) && !(8560 == s__state)) && !(s__state == 8656)) && !(12292 == s__state)) && !(s__hit == 0)) && !(s__state == 8545)) && !(s__state == 8528)) && !(8448 == s__state)) && !(s__state == 8609)) && !(8593 == s__state)) && !(s__state == 8641)) && !(s__state == 8512)) - InvariantResult [Line: 175]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((!(8497 == s__state) && !(8577 == s__state)) && !(s__state == 8480)) && !(s__state == 8672)) && !(8496 == s__state)) && !(s__state == 8640)) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8544)) && !(s__state == 8608)) && !(s__state == 8481)) && !(s__state == 8529)) && !(8576 == s__state)) && s__state <= 8672) && !(s__state == 8657)) && !(8560 == s__state)) && !(s__state == 8656)) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8528)) && !(8448 == s__state)) && !(s__state == 8609)) && blastFlag <= 2) && 8448 <= s__state) && !(s__state == 8641)) && !(s__state == 8512)) || (((((((((((((((((((((((((!(8497 == s__state) && !(8577 == s__state)) && !(s__state == 8480)) && !(s__state == 8673)) && !(s__state == 8672)) && !(8496 == s__state)) && !(s__state == 8640)) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8544)) && !(s__state == 8608)) && !(s__state == 8481)) && !(s__state == 8529)) && !(8576 == s__state)) && blastFlag <= 3) && !(s__state == 8657)) && !(8560 == s__state)) && !(s__state == 8656)) && !(12292 == s__state)) && !(s__hit == 0)) && !(s__state == 8545)) && !(s__state == 8528)) && !(8448 == s__state)) && !(s__state == 8609)) && !(s__state == 8641)) && !(s__state == 8512)) - InvariantResult [Line: 612]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 199]: Loop Invariant Derived loop invariant: (((8672 <= s__state && blastFlag <= 3) && s__state <= 8672) && s__s3__tmp__next_state___0 <= 8576) || (((((((((((((((((((((((((!(8497 == s__state) && !(8577 == s__state)) && !(s__state == 8480)) && !(s__state == 8592)) && !(8496 == s__state)) && !(s__state == 8640)) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8544)) && !(s__state == 8608)) && !(s__state == 8481)) && !(s__state == 8529)) && !(8576 == s__state)) && blastFlag <= 3) && !(s__state == 8657)) && !(8560 == s__state)) && !(s__state == 8656)) && !(12292 == s__state)) && !(s__hit == 0)) && !(s__state == 8545)) && !(s__state == 8528)) && !(8448 == s__state)) && !(s__state == 8609)) && !(8593 == s__state)) && !(s__state == 8641)) && !(s__state == 8512)) - InvariantResult [Line: 181]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((!(8497 == s__state) && !(8577 == s__state)) && !(s__state == 8480)) && !(s__state == 8673)) && !(s__state == 8592)) && !(s__state == 8672)) && !(8496 == s__state)) && !(s__state == 8640)) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8529)) && !(8576 == s__state)) && blastFlag <= 3) && !(s__state == 8657)) && !(8560 == s__state)) && !(s__state == 8656)) && !(12292 == s__state)) && !(s__hit == 0)) && !(s__state == 8545)) && !(s__state == 8528)) && !(8448 == s__state)) && !(8593 == s__state)) && !(s__state == 8641)) && !(s__state == 8512)) || (((((((((((((((((((((((((!(8497 == s__state) && !(8577 == s__state)) && !(s__state == 8480)) && !(s__state == 8592)) && !(s__state == 8672)) && !(8496 == s__state)) && !(s__state == 8640)) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8529)) && !(8576 == s__state)) && s__state <= 8672) && !(s__state == 8657)) && !(8560 == s__state)) && !(s__state == 8656)) && !(s__state == 8545)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8528)) && !(8448 == s__state)) && blastFlag <= 2) && 8448 <= s__state) && !(8593 == s__state)) && !(s__state == 8641)) && !(s__state == 8512)) - InvariantResult [Line: 148]: Loop Invariant Derived loop invariant: ((((((((((((((!(8497 == s__state) && !(s__state == 8480)) && s__state <= 8576) && !(8496 == s__state)) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8544)) && !(s__state == 8481)) && !(8576 == s__state)) && !(8560 == s__state)) && !(s__state == 8545)) && !(8448 == s__state)) && blastFlag <= 2) && 8448 <= s__state) && !(s__state == 8512)) || (((((((((((((((((((((((((!(8497 == s__state) && !(8577 == s__state)) && !(s__state == 8480)) && !(s__state == 8673)) && !(s__state == 8592)) && !(s__state == 8672)) && !(8496 == s__state)) && !(s__state == 8640)) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8544)) && !(s__state == 8608)) && !(s__state == 8481)) && !(8576 == s__state)) && blastFlag <= 3) && !(s__state == 8657)) && !(8560 == s__state)) && !(s__state == 8656)) && !(12292 == s__state)) && !(s__hit == 0)) && !(s__state == 8545)) && !(8448 == s__state)) && !(s__state == 8609)) && !(8593 == s__state)) && !(s__state == 8641)) && !(s__state == 8512)) - InvariantResult [Line: 100]: Loop Invariant Derived loop invariant: (((((blastFlag <= 3 && !(s__hit == 0)) || (((8672 <= s__state && blastFlag <= 3) && s__state <= 8672) && s__s3__tmp__next_state___0 <= 8576)) || (((((((!(8577 == s__state) && s__state <= 8672) && !(s__state == 8657)) && s__s3__tmp__next_state___0 <= 8576) && !(s__state == 8609)) && blastFlag <= 2) && !(8593 == s__state)) && !(s__state == 8641))) || (((((((((((!(8497 == s__state) && !(s__state == 8480)) && s__state <= 8576) && !(s__state == 8561)) && !(8513 == s__state)) && !(s__state == 8481)) && !(s__state == 8529)) && !(8576 == s__state)) && !(s__state == 8545)) && !(8448 == s__state)) && blastFlag <= 2) && 8448 <= s__state)) || (((3 == s__s3__tmp__next_state___0 && blastFlag <= 3) && 8448 <= s__state) && s__state <= 8448)) || s__state <= 3 - InvariantResult [Line: 205]: Loop Invariant Derived loop invariant: !(s__state == 8672) RESULT: Ultimate proved your program to be correct! [2021-08-25 20:13:36,017 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...