./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/bitvector/s3_srvr_1a.BV.c.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/bitvector/s3_srvr_1a.BV.c.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b0b2d978b2f3873db9b988022a041d2d18a2f859 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:01:58,301 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-25 20:01:58,303 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-25 20:01:58,373 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-25 20:01:58,380 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-25 20:01:58,389 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-25 20:01:58,390 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-25 20:01:58,398 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-25 20:01:58,405 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-25 20:01:58,406 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-25 20:01:58,407 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-25 20:01:58,409 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-25 20:01:58,438 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-25 20:01:58,444 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-25 20:01:58,445 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-25 20:01:58,446 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-25 20:01:58,447 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-25 20:01:58,448 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-25 20:01:58,454 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-25 20:01:58,456 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-25 20:01:58,461 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-25 20:01:58,469 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-25 20:01:58,474 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-25 20:01:58,475 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-25 20:01:58,477 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-25 20:01:58,477 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-25 20:01:58,477 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-25 20:01:58,478 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-25 20:01:58,478 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-25 20:01:58,479 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-25 20:01:58,479 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-25 20:01:58,480 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-25 20:01:58,480 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-25 20:01:58,481 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-25 20:01:58,482 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-25 20:01:58,482 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-25 20:01:58,482 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-25 20:01:58,482 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-25 20:01:58,483 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-25 20:01:58,483 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-25 20:01:58,484 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-25 20:01:58,512 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:01:58,601 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-25 20:01:58,602 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-25 20:01:58,603 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-25 20:01:58,603 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-25 20:01:58,605 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-25 20:01:58,605 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-25 20:01:58,605 INFO L138 SettingsManager]: * Use SBE=true [2021-08-25 20:01:58,606 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-25 20:01:58,606 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-25 20:01:58,606 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-25 20:01:58,607 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-25 20:01:58,608 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-25 20:01:58,608 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-25 20:01:58,608 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-25 20:01:58,608 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-25 20:01:58,608 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-25 20:01:58,609 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-25 20:01:58,609 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-25 20:01:58,609 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-25 20:01:58,609 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-25 20:01:58,609 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-25 20:01:58,610 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-25 20:01:58,610 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-25 20:01:58,610 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-25 20:01:58,610 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-25 20:01:58,610 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-25 20:01:58,611 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-25 20:01:58,611 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-25 20:01:58,611 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-25 20:01:58,611 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-25 20:01:58,611 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 -> b0b2d978b2f3873db9b988022a041d2d18a2f859 [2021-08-25 20:01:59,100 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-25 20:01:59,139 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-25 20:01:59,142 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-25 20:01:59,143 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-25 20:01:59,143 INFO L275 PluginConnector]: CDTParser initialized [2021-08-25 20:01:59,144 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/s3_srvr_1a.BV.c.cil.c [2021-08-25 20:01:59,252 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ca688cf9/c3d0f83e0c8e4a8fbab95f6f2ebad3d7/FLAG550ea63e1 [2021-08-25 20:02:00,021 INFO L306 CDTParser]: Found 1 translation units. [2021-08-25 20:02:00,021 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/s3_srvr_1a.BV.c.cil.c [2021-08-25 20:02:00,059 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ca688cf9/c3d0f83e0c8e4a8fbab95f6f2ebad3d7/FLAG550ea63e1 [2021-08-25 20:02:00,287 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ca688cf9/c3d0f83e0c8e4a8fbab95f6f2ebad3d7 [2021-08-25 20:02:00,289 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-25 20:02:00,300 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-25 20:02:00,302 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-25 20:02:00,316 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-25 20:02:00,320 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-25 20:02:00,321 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 08:02:00" (1/1) ... [2021-08-25 20:02:00,322 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@496928c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:02:00, skipping insertion in model container [2021-08-25 20:02:00,322 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 08:02:00" (1/1) ... [2021-08-25 20:02:00,327 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-25 20:02:00,398 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-25 20:02:00,747 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/bitvector/s3_srvr_1a.BV.c.cil.c[44644,44657] [2021-08-25 20:02:00,765 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-25 20:02:00,783 INFO L203 MainTranslator]: Completed pre-run [2021-08-25 20:02:00,955 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/bitvector/s3_srvr_1a.BV.c.cil.c[44644,44657] [2021-08-25 20:02:00,970 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-25 20:02:00,999 INFO L208 MainTranslator]: Completed translation [2021-08-25 20:02:00,999 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:02:00 WrapperNode [2021-08-25 20:02:01,000 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-25 20:02:01,002 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-25 20:02:01,002 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-25 20:02:01,003 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-25 20:02:01,008 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:02:00" (1/1) ... [2021-08-25 20:02:01,042 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:02:00" (1/1) ... [2021-08-25 20:02:01,095 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-25 20:02:01,108 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-25 20:02:01,109 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-25 20:02:01,109 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-25 20:02:01,116 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:02:00" (1/1) ... [2021-08-25 20:02:01,128 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:02:00" (1/1) ... [2021-08-25 20:02:01,140 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:02:00" (1/1) ... [2021-08-25 20:02:01,142 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:02:00" (1/1) ... [2021-08-25 20:02:01,151 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:02:00" (1/1) ... [2021-08-25 20:02:01,166 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:02:00" (1/1) ... [2021-08-25 20:02:01,181 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:02:00" (1/1) ... [2021-08-25 20:02:01,187 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-25 20:02:01,188 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-25 20:02:01,189 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-25 20:02:01,189 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-25 20:02:01,205 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:02:00" (1/1) ... [2021-08-25 20:02:01,212 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-25 20:02:01,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 20:02:01,247 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:02:01,318 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:02:01,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-25 20:02:01,353 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-25 20:02:01,354 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-25 20:02:01,354 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-25 20:02:01,656 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-25 20:02:02,249 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2021-08-25 20:02:02,249 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2021-08-25 20:02:02,256 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-25 20:02:02,256 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2021-08-25 20:02:02,258 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 08:02:02 BoogieIcfgContainer [2021-08-25 20:02:02,258 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-25 20:02:02,259 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-25 20:02:02,260 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-25 20:02:02,262 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-25 20:02:02,262 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.08 08:02:00" (1/3) ... [2021-08-25 20:02:02,263 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39d2121c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 08:02:02, skipping insertion in model container [2021-08-25 20:02:02,263 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:02:00" (2/3) ... [2021-08-25 20:02:02,263 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39d2121c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 08:02:02, skipping insertion in model container [2021-08-25 20:02:02,264 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 08:02:02" (3/3) ... [2021-08-25 20:02:02,265 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr_1a.BV.c.cil.c [2021-08-25 20:02:02,269 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-25 20:02:02,269 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-08-25 20:02:02,307 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-25 20:02:02,312 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:02:02,312 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-08-25 20:02:02,326 INFO L276 IsEmpty]: Start isEmpty. Operand has 140 states, 138 states have (on average 1.7318840579710144) internal successors, (239), 139 states have internal predecessors, (239), 0 states have call successors, (0), 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:02:02,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-08-25 20:02:02,333 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:02:02,333 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:02:02,334 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:02:02,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:02:02,339 INFO L82 PathProgramCache]: Analyzing trace with hash 1632000041, now seen corresponding path program 1 times [2021-08-25 20:02:02,346 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:02:02,346 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989240501] [2021-08-25 20:02:02,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:02:02,347 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:02:02,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:02:02,522 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:02:02,523 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:02:02,523 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989240501] [2021-08-25 20:02:02,524 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989240501] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:02:02,524 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:02:02,524 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:02:02,527 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017093452] [2021-08-25 20:02:02,532 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:02:02,532 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:02:02,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:02:02,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:02:02,549 INFO L87 Difference]: Start difference. First operand has 140 states, 138 states have (on average 1.7318840579710144) internal successors, (239), 139 states have internal predecessors, (239), 0 states have call successors, (0), 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:02:02,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:02:02,874 INFO L93 Difference]: Finished difference Result 328 states and 565 transitions. [2021-08-25 20:02:02,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:02:02,876 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:02:02,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:02:02,888 INFO L225 Difference]: With dead ends: 328 [2021-08-25 20:02:02,888 INFO L226 Difference]: Without dead ends: 174 [2021-08-25 20:02:02,892 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:02:02,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2021-08-25 20:02:02,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 168. [2021-08-25 20:02:02,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 167 states have (on average 1.6407185628742516) internal successors, (274), 167 states have internal predecessors, (274), 0 states have call successors, (0), 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:02:02,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 274 transitions. [2021-08-25 20:02:02,955 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 274 transitions. Word has length 44 [2021-08-25 20:02:02,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:02:02,955 INFO L470 AbstractCegarLoop]: Abstraction has 168 states and 274 transitions. [2021-08-25 20:02:02,956 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:02:02,956 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 274 transitions. [2021-08-25 20:02:02,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-08-25 20:02:02,957 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:02:02,957 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:02:02,958 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-25 20:02:02,958 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:02:02,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:02:02,959 INFO L82 PathProgramCache]: Analyzing trace with hash -954582389, now seen corresponding path program 1 times [2021-08-25 20:02:02,959 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:02:02,959 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677986381] [2021-08-25 20:02:02,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:02:02,959 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:02:02,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:02:03,074 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:02:03,075 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:02:03,075 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677986381] [2021-08-25 20:02:03,075 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677986381] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:02:03,075 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:02:03,076 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:02:03,076 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545677764] [2021-08-25 20:02:03,077 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:02:03,077 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:02:03,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:02:03,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:02:03,078 INFO L87 Difference]: Start difference. First operand 168 states and 274 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:02:03,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:02:03,322 INFO L93 Difference]: Finished difference Result 377 states and 624 transitions. [2021-08-25 20:02:03,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:02:03,323 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:02:03,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:02:03,327 INFO L225 Difference]: With dead ends: 377 [2021-08-25 20:02:03,327 INFO L226 Difference]: Without dead ends: 215 [2021-08-25 20:02:03,331 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:02:03,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2021-08-25 20:02:03,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 209. [2021-08-25 20:02:03,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 208 states have (on average 1.6875) internal successors, (351), 208 states have internal predecessors, (351), 0 states have call successors, (0), 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:02:03,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 351 transitions. [2021-08-25 20:02:03,360 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 351 transitions. Word has length 45 [2021-08-25 20:02:03,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:02:03,360 INFO L470 AbstractCegarLoop]: Abstraction has 209 states and 351 transitions. [2021-08-25 20:02:03,360 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:02:03,361 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 351 transitions. [2021-08-25 20:02:03,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-08-25 20:02:03,365 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:02:03,365 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, 1] [2021-08-25 20:02:03,366 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-25 20:02:03,366 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:02:03,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:02:03,371 INFO L82 PathProgramCache]: Analyzing trace with hash -1257706733, now seen corresponding path program 1 times [2021-08-25 20:02:03,371 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:02:03,371 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791432203] [2021-08-25 20:02:03,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:02:03,372 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:02:03,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:02:03,434 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:02:03,434 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:02:03,434 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791432203] [2021-08-25 20:02:03,435 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791432203] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:02:03,435 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:02:03,435 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:02:03,435 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732107194] [2021-08-25 20:02:03,436 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:02:03,436 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:02:03,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:02:03,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:02:03,437 INFO L87 Difference]: Start difference. First operand 209 states and 351 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:02:03,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:02:03,626 INFO L93 Difference]: Finished difference Result 441 states and 748 transitions. [2021-08-25 20:02:03,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:02:03,627 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 73 [2021-08-25 20:02:03,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:02:03,628 INFO L225 Difference]: With dead ends: 441 [2021-08-25 20:02:03,629 INFO L226 Difference]: Without dead ends: 240 [2021-08-25 20:02:03,630 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:02:03,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2021-08-25 20:02:03,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 240. [2021-08-25 20:02:03,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 239 states have (on average 1.702928870292887) internal successors, (407), 239 states have internal predecessors, (407), 0 states have call successors, (0), 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:02:03,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 407 transitions. [2021-08-25 20:02:03,646 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 407 transitions. Word has length 73 [2021-08-25 20:02:03,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:02:03,647 INFO L470 AbstractCegarLoop]: Abstraction has 240 states and 407 transitions. [2021-08-25 20:02:03,648 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:02:03,648 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 407 transitions. [2021-08-25 20:02:03,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-08-25 20:02:03,654 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:02:03,654 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:02:03,654 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-25 20:02:03,655 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:02:03,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:02:03,655 INFO L82 PathProgramCache]: Analyzing trace with hash -1858309952, now seen corresponding path program 1 times [2021-08-25 20:02:03,656 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:02:03,656 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205435666] [2021-08-25 20:02:03,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:02:03,657 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:02:03,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:02:03,727 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:02:03,728 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:02:03,728 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205435666] [2021-08-25 20:02:03,728 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205435666] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:02:03,728 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:02:03,729 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:02:03,729 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209433292] [2021-08-25 20:02:03,729 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:02:03,730 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:02:03,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:02:03,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:02:03,731 INFO L87 Difference]: Start difference. First operand 240 states and 407 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:02:04,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:02:04,687 INFO L93 Difference]: Finished difference Result 518 states and 884 transitions. [2021-08-25 20:02:04,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:02:04,687 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:02:04,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:02:04,689 INFO L225 Difference]: With dead ends: 518 [2021-08-25 20:02:04,700 INFO L226 Difference]: Without dead ends: 286 [2021-08-25 20:02:04,701 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:02:04,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2021-08-25 20:02:04,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 282. [2021-08-25 20:02:04,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 281 states have (on average 1.7153024911032029) internal successors, (482), 281 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:02:04,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 482 transitions. [2021-08-25 20:02:04,721 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 482 transitions. Word has length 84 [2021-08-25 20:02:04,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:02:04,721 INFO L470 AbstractCegarLoop]: Abstraction has 282 states and 482 transitions. [2021-08-25 20:02:04,721 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:02:04,721 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 482 transitions. [2021-08-25 20:02:04,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-08-25 20:02:04,730 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:02:04,731 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, 1] [2021-08-25 20:02:04,731 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-25 20:02:04,731 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:02:04,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:02:04,741 INFO L82 PathProgramCache]: Analyzing trace with hash -793628611, now seen corresponding path program 1 times [2021-08-25 20:02:04,741 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:02:04,742 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681321623] [2021-08-25 20:02:04,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:02:04,742 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:02:04,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:02:04,942 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:02:04,942 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:02:04,942 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681321623] [2021-08-25 20:02:04,942 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681321623] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:02:04,943 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:02:04,943 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:02:04,943 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580345691] [2021-08-25 20:02:04,945 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:02:04,945 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:02:04,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:02:04,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:02:04,946 INFO L87 Difference]: Start difference. First operand 282 states and 482 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:02:05,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:02:05,152 INFO L93 Difference]: Finished difference Result 573 states and 980 transitions. [2021-08-25 20:02:05,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:02:05,153 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:02:05,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:02:05,172 INFO L225 Difference]: With dead ends: 573 [2021-08-25 20:02:05,181 INFO L226 Difference]: Without dead ends: 299 [2021-08-25 20:02:05,182 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:02:05,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2021-08-25 20:02:05,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 297. [2021-08-25 20:02:05,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 296 states have (on average 1.7027027027027026) internal successors, (504), 296 states have internal predecessors, (504), 0 states have call successors, (0), 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:02:05,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 504 transitions. [2021-08-25 20:02:05,212 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 504 transitions. Word has length 85 [2021-08-25 20:02:05,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:02:05,213 INFO L470 AbstractCegarLoop]: Abstraction has 297 states and 504 transitions. [2021-08-25 20:02:05,213 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:02:05,213 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 504 transitions. [2021-08-25 20:02:05,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-08-25 20:02:05,214 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:02:05,214 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:02:05,215 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-25 20:02:05,215 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:02:05,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:02:05,215 INFO L82 PathProgramCache]: Analyzing trace with hash -812323390, now seen corresponding path program 1 times [2021-08-25 20:02:05,216 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:02:05,216 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828779274] [2021-08-25 20:02:05,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:02:05,216 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:02:05,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:02:05,325 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:02:05,325 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:02:05,326 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828779274] [2021-08-25 20:02:05,326 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828779274] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:02:05,326 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:02:05,326 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:02:05,326 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62739533] [2021-08-25 20:02:05,326 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:02:05,326 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:02:05,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:02:05,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:02:05,327 INFO L87 Difference]: Start difference. First operand 297 states and 504 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:02:05,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:02:05,587 INFO L93 Difference]: Finished difference Result 590 states and 1001 transitions. [2021-08-25 20:02:05,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:02:05,588 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:02:05,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:02:05,600 INFO L225 Difference]: With dead ends: 590 [2021-08-25 20:02:05,614 INFO L226 Difference]: Without dead ends: 299 [2021-08-25 20:02:05,616 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:02:05,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2021-08-25 20:02:05,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 295. [2021-08-25 20:02:05,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 294 states have (on average 1.6972789115646258) internal successors, (499), 294 states have internal predecessors, (499), 0 states have call successors, (0), 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:02:05,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 499 transitions. [2021-08-25 20:02:05,643 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 499 transitions. Word has length 85 [2021-08-25 20:02:05,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:02:05,643 INFO L470 AbstractCegarLoop]: Abstraction has 295 states and 499 transitions. [2021-08-25 20:02:05,643 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:02:05,643 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 499 transitions. [2021-08-25 20:02:05,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-08-25 20:02:05,644 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:02:05,645 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, 1] [2021-08-25 20:02:05,645 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-25 20:02:05,645 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:02:05,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:02:05,645 INFO L82 PathProgramCache]: Analyzing trace with hash 99695542, now seen corresponding path program 1 times [2021-08-25 20:02:05,646 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:02:05,646 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97223773] [2021-08-25 20:02:05,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:02:05,646 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:02:05,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:02:05,677 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:02:05,677 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:02:05,678 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97223773] [2021-08-25 20:02:05,678 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97223773] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:02:05,678 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:02:05,678 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:02:05,678 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042425595] [2021-08-25 20:02:05,679 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:02:05,679 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:02:05,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:02:05,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:02:05,680 INFO L87 Difference]: Start difference. First operand 295 states and 499 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 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:02:05,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:02:05,845 INFO L93 Difference]: Finished difference Result 584 states and 988 transitions. [2021-08-25 20:02:05,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:02:05,846 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 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 86 [2021-08-25 20:02:05,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:02:05,848 INFO L225 Difference]: With dead ends: 584 [2021-08-25 20:02:05,848 INFO L226 Difference]: Without dead ends: 297 [2021-08-25 20:02:05,849 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:02:05,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2021-08-25 20:02:05,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 295. [2021-08-25 20:02:05,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 294 states have (on average 1.683673469387755) internal successors, (495), 294 states have internal predecessors, (495), 0 states have call successors, (0), 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:02:05,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 495 transitions. [2021-08-25 20:02:05,858 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 495 transitions. Word has length 86 [2021-08-25 20:02:05,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:02:05,858 INFO L470 AbstractCegarLoop]: Abstraction has 295 states and 495 transitions. [2021-08-25 20:02:05,858 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 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:02:05,859 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 495 transitions. [2021-08-25 20:02:05,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-08-25 20:02:05,860 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:02:05,860 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, 1] [2021-08-25 20:02:05,860 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-25 20:02:05,860 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:02:05,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:02:05,861 INFO L82 PathProgramCache]: Analyzing trace with hash -247819138, now seen corresponding path program 1 times [2021-08-25 20:02:05,861 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:02:05,861 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102302130] [2021-08-25 20:02:05,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:02:05,862 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:02:05,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:02:05,891 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:02:05,891 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:02:05,891 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102302130] [2021-08-25 20:02:05,891 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102302130] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:02:05,892 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:02:05,892 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:02:05,892 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68252338] [2021-08-25 20:02:05,892 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:02:05,893 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:02:05,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:02:05,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:02:05,893 INFO L87 Difference]: Start difference. First operand 295 states and 495 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 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:02:06,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:02:06,126 INFO L93 Difference]: Finished difference Result 590 states and 989 transitions. [2021-08-25 20:02:06,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:02:06,141 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 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:02:06,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:02:06,143 INFO L225 Difference]: With dead ends: 590 [2021-08-25 20:02:06,143 INFO L226 Difference]: Without dead ends: 303 [2021-08-25 20:02:06,143 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:02:06,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2021-08-25 20:02:06,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 303. [2021-08-25 20:02:06,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 302 states have (on average 1.6556291390728477) internal successors, (500), 302 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:02:06,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 500 transitions. [2021-08-25 20:02:06,156 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 500 transitions. Word has length 98 [2021-08-25 20:02:06,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:02:06,156 INFO L470 AbstractCegarLoop]: Abstraction has 303 states and 500 transitions. [2021-08-25 20:02:06,156 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 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:02:06,157 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 500 transitions. [2021-08-25 20:02:06,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-08-25 20:02:06,157 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:02:06,158 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, 1] [2021-08-25 20:02:06,158 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-25 20:02:06,158 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:02:06,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:02:06,158 INFO L82 PathProgramCache]: Analyzing trace with hash -1134276038, now seen corresponding path program 1 times [2021-08-25 20:02:06,159 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:02:06,159 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583627358] [2021-08-25 20:02:06,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:02:06,159 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:02:06,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:02:06,248 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:02:06,248 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:02:06,248 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583627358] [2021-08-25 20:02:06,248 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583627358] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:02:06,248 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:02:06,248 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:02:06,249 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488213963] [2021-08-25 20:02:06,250 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:02:06,250 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:02:06,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:02:06,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:02:06,251 INFO L87 Difference]: Start difference. First operand 303 states and 500 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:02:06,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:02:06,431 INFO L93 Difference]: Finished difference Result 629 states and 1041 transitions. [2021-08-25 20:02:06,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:02:06,432 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:02:06,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:02:06,434 INFO L225 Difference]: With dead ends: 629 [2021-08-25 20:02:06,434 INFO L226 Difference]: Without dead ends: 334 [2021-08-25 20:02:06,435 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:02:06,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2021-08-25 20:02:06,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 332. [2021-08-25 20:02:06,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 331 states have (on average 1.6525679758308156) internal successors, (547), 331 states have internal predecessors, (547), 0 states have call successors, (0), 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:02:06,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 547 transitions. [2021-08-25 20:02:06,445 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 547 transitions. Word has length 99 [2021-08-25 20:02:06,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:02:06,445 INFO L470 AbstractCegarLoop]: Abstraction has 332 states and 547 transitions. [2021-08-25 20:02:06,445 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:02:06,446 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 547 transitions. [2021-08-25 20:02:06,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-08-25 20:02:06,447 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:02:06,447 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:02:06,447 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-25 20:02:06,447 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:02:06,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:02:06,448 INFO L82 PathProgramCache]: Analyzing trace with hash -85258053, now seen corresponding path program 1 times [2021-08-25 20:02:06,448 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:02:06,448 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264056641] [2021-08-25 20:02:06,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:02:06,449 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:02:06,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:02:06,487 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:02:06,487 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:02:06,487 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264056641] [2021-08-25 20:02:06,488 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264056641] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:02:06,488 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:02:06,488 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:02:06,488 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002290019] [2021-08-25 20:02:06,488 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:02:06,489 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:02:06,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:02:06,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:02:06,489 INFO L87 Difference]: Start difference. First operand 332 states and 547 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:02:06,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:02:06,625 INFO L93 Difference]: Finished difference Result 690 states and 1141 transitions. [2021-08-25 20:02:06,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:02:06,626 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:02:06,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:02:06,628 INFO L225 Difference]: With dead ends: 690 [2021-08-25 20:02:06,628 INFO L226 Difference]: Without dead ends: 366 [2021-08-25 20:02:06,629 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:02:06,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2021-08-25 20:02:06,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 359. [2021-08-25 20:02:06,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 358 states have (on average 1.6452513966480447) internal successors, (589), 358 states have internal predecessors, (589), 0 states have call successors, (0), 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:02:06,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 589 transitions. [2021-08-25 20:02:06,640 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 589 transitions. Word has length 100 [2021-08-25 20:02:06,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:02:06,640 INFO L470 AbstractCegarLoop]: Abstraction has 359 states and 589 transitions. [2021-08-25 20:02:06,640 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:02:06,641 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 589 transitions. [2021-08-25 20:02:06,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-08-25 20:02:06,642 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:02:06,642 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, 1] [2021-08-25 20:02:06,642 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-25 20:02:06,642 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:02:06,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:02:06,643 INFO L82 PathProgramCache]: Analyzing trace with hash 149056915, now seen corresponding path program 1 times [2021-08-25 20:02:06,643 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:02:06,643 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435325763] [2021-08-25 20:02:06,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:02:06,644 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:02:06,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:02:06,685 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:02:06,686 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:02:06,686 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435325763] [2021-08-25 20:02:06,686 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435325763] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:02:06,686 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:02:06,686 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:02:06,686 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824648793] [2021-08-25 20:02:06,687 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:02:06,687 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:02:06,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:02:06,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:02:06,688 INFO L87 Difference]: Start difference. First operand 359 states and 589 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:02:06,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:02:06,836 INFO L93 Difference]: Finished difference Result 712 states and 1168 transitions. [2021-08-25 20:02:06,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:02:06,836 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:02:06,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:02:06,838 INFO L225 Difference]: With dead ends: 712 [2021-08-25 20:02:06,838 INFO L226 Difference]: Without dead ends: 361 [2021-08-25 20:02:06,839 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:02:06,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2021-08-25 20:02:06,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 359. [2021-08-25 20:02:06,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 358 states have (on average 1.6340782122905029) internal successors, (585), 358 states have internal predecessors, (585), 0 states have call successors, (0), 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:02:06,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 585 transitions. [2021-08-25 20:02:06,850 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 585 transitions. Word has length 100 [2021-08-25 20:02:06,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:02:06,850 INFO L470 AbstractCegarLoop]: Abstraction has 359 states and 585 transitions. [2021-08-25 20:02:06,850 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:02:06,850 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 585 transitions. [2021-08-25 20:02:06,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-08-25 20:02:06,852 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:02:06,852 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:02:06,852 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-08-25 20:02:06,852 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:02:06,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:02:06,853 INFO L82 PathProgramCache]: Analyzing trace with hash -692060190, now seen corresponding path program 1 times [2021-08-25 20:02:06,853 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:02:06,853 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985582994] [2021-08-25 20:02:06,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:02:06,853 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:02:06,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:02:06,879 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:02:06,879 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:02:06,879 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985582994] [2021-08-25 20:02:06,879 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985582994] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:02:06,879 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:02:06,880 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:02:06,880 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617964388] [2021-08-25 20:02:06,880 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:02:06,880 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:02:06,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:02:06,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:02:06,881 INFO L87 Difference]: Start difference. First operand 359 states and 585 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:02:07,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:02:07,019 INFO L93 Difference]: Finished difference Result 717 states and 1170 transitions. [2021-08-25 20:02:07,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:02:07,020 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:02:07,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:02:07,022 INFO L225 Difference]: With dead ends: 717 [2021-08-25 20:02:07,022 INFO L226 Difference]: Without dead ends: 366 [2021-08-25 20:02:07,023 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:02:07,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2021-08-25 20:02:07,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 359. [2021-08-25 20:02:07,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 358 states have (on average 1.6201117318435754) internal successors, (580), 358 states have internal predecessors, (580), 0 states have call successors, (0), 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:02:07,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 580 transitions. [2021-08-25 20:02:07,033 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 580 transitions. Word has length 101 [2021-08-25 20:02:07,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:02:07,034 INFO L470 AbstractCegarLoop]: Abstraction has 359 states and 580 transitions. [2021-08-25 20:02:07,034 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:02:07,034 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 580 transitions. [2021-08-25 20:02:07,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-08-25 20:02:07,035 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:02:07,035 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:02:07,036 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-08-25 20:02:07,036 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:02:07,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:02:07,036 INFO L82 PathProgramCache]: Analyzing trace with hash -1838364151, now seen corresponding path program 1 times [2021-08-25 20:02:07,037 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:02:07,037 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799705117] [2021-08-25 20:02:07,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:02:07,037 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:02:07,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:02:07,061 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:02:07,061 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:02:07,061 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799705117] [2021-08-25 20:02:07,062 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799705117] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:02:07,062 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:02:07,062 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:02:07,062 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324678010] [2021-08-25 20:02:07,062 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:02:07,063 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:02:07,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:02:07,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:02:07,063 INFO L87 Difference]: Start difference. First operand 359 states and 580 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:02:07,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:02:07,196 INFO L93 Difference]: Finished difference Result 735 states and 1189 transitions. [2021-08-25 20:02:07,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:02:07,196 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:02:07,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:02:07,198 INFO L225 Difference]: With dead ends: 735 [2021-08-25 20:02:07,198 INFO L226 Difference]: Without dead ends: 384 [2021-08-25 20:02:07,199 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:02:07,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2021-08-25 20:02:07,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 380. [2021-08-25 20:02:07,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 379 states have (on average 1.6068601583113455) internal successors, (609), 379 states have internal predecessors, (609), 0 states have call successors, (0), 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:02:07,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 609 transitions. [2021-08-25 20:02:07,210 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 609 transitions. Word has length 105 [2021-08-25 20:02:07,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:02:07,210 INFO L470 AbstractCegarLoop]: Abstraction has 380 states and 609 transitions. [2021-08-25 20:02:07,210 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:02:07,211 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 609 transitions. [2021-08-25 20:02:07,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-08-25 20:02:07,212 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:02:07,212 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:02:07,212 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-08-25 20:02:07,212 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:02:07,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:02:07,213 INFO L82 PathProgramCache]: Analyzing trace with hash 759513378, now seen corresponding path program 1 times [2021-08-25 20:02:07,213 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:02:07,213 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397281897] [2021-08-25 20:02:07,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:02:07,213 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:02:07,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:02:07,237 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:02:07,237 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:02:07,237 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397281897] [2021-08-25 20:02:07,238 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397281897] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:02:07,238 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:02:07,238 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:02:07,238 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028886286] [2021-08-25 20:02:07,238 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:02:07,239 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:02:07,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:02:07,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:02:07,239 INFO L87 Difference]: Start difference. First operand 380 states and 609 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:02:07,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:02:07,377 INFO L93 Difference]: Finished difference Result 756 states and 1212 transitions. [2021-08-25 20:02:07,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:02:07,377 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:02:07,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:02:07,379 INFO L225 Difference]: With dead ends: 756 [2021-08-25 20:02:07,379 INFO L226 Difference]: Without dead ends: 384 [2021-08-25 20:02:07,380 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:02:07,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2021-08-25 20:02:07,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 380. [2021-08-25 20:02:07,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 379 states have (on average 1.5910290237467017) internal successors, (603), 379 states have internal predecessors, (603), 0 states have call successors, (0), 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:02:07,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 603 transitions. [2021-08-25 20:02:07,399 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 603 transitions. Word has length 106 [2021-08-25 20:02:07,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:02:07,399 INFO L470 AbstractCegarLoop]: Abstraction has 380 states and 603 transitions. [2021-08-25 20:02:07,400 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:02:07,400 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 603 transitions. [2021-08-25 20:02:07,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2021-08-25 20:02:07,401 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:02:07,401 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:02:07,402 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-08-25 20:02:07,402 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:02:07,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:02:07,402 INFO L82 PathProgramCache]: Analyzing trace with hash 112174862, now seen corresponding path program 1 times [2021-08-25 20:02:07,403 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:02:07,403 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478667070] [2021-08-25 20:02:07,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:02:07,403 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:02:07,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:02:07,439 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:02:07,439 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:02:07,440 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478667070] [2021-08-25 20:02:07,440 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478667070] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:02:07,440 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:02:07,440 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:02:07,440 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498300248] [2021-08-25 20:02:07,441 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:02:07,441 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:02:07,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:02:07,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:02:07,442 INFO L87 Difference]: Start difference. First operand 380 states and 603 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:02:07,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:02:07,488 INFO L93 Difference]: Finished difference Result 752 states and 1194 transitions. [2021-08-25 20:02:07,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:02:07,489 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:02:07,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:02:07,492 INFO L225 Difference]: With dead ends: 752 [2021-08-25 20:02:07,492 INFO L226 Difference]: Without dead ends: 750 [2021-08-25 20:02:07,493 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:02:07,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 750 states. [2021-08-25 20:02:07,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 750 to 750. [2021-08-25 20:02:07,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 750 states, 749 states have (on average 1.5901201602136181) internal successors, (1191), 749 states have internal predecessors, (1191), 0 states have call successors, (0), 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:02:07,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 750 states to 750 states and 1191 transitions. [2021-08-25 20:02:07,515 INFO L78 Accepts]: Start accepts. Automaton has 750 states and 1191 transitions. Word has length 121 [2021-08-25 20:02:07,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:02:07,516 INFO L470 AbstractCegarLoop]: Abstraction has 750 states and 1191 transitions. [2021-08-25 20:02:07,516 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:02:07,516 INFO L276 IsEmpty]: Start isEmpty. Operand 750 states and 1191 transitions. [2021-08-25 20:02:07,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2021-08-25 20:02:07,518 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:02:07,518 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:02:07,518 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-08-25 20:02:07,518 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:02:07,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:02:07,519 INFO L82 PathProgramCache]: Analyzing trace with hash 175328748, now seen corresponding path program 1 times [2021-08-25 20:02:07,519 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:02:07,519 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035011061] [2021-08-25 20:02:07,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:02:07,520 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:02:07,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:02:07,546 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:02:07,546 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:02:07,546 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035011061] [2021-08-25 20:02:07,547 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035011061] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:02:07,547 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:02:07,547 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:02:07,547 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933026491] [2021-08-25 20:02:07,547 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:02:07,548 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:02:07,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:02:07,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:02:07,548 INFO L87 Difference]: Start difference. First operand 750 states and 1191 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:02:07,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:02:07,732 INFO L93 Difference]: Finished difference Result 1576 states and 2506 transitions. [2021-08-25 20:02:07,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:02:07,733 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:02:07,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:02:07,736 INFO L225 Difference]: With dead ends: 1576 [2021-08-25 20:02:07,736 INFO L226 Difference]: Without dead ends: 834 [2021-08-25 20:02:07,737 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:02:07,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 834 states. [2021-08-25 20:02:07,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 834 to 826. [2021-08-25 20:02:07,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 826 states, 825 states have (on average 1.5866666666666667) internal successors, (1309), 825 states have internal predecessors, (1309), 0 states have call successors, (0), 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:02:07,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 826 states to 826 states and 1309 transitions. [2021-08-25 20:02:07,764 INFO L78 Accepts]: Start accepts. Automaton has 826 states and 1309 transitions. Word has length 122 [2021-08-25 20:02:07,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:02:07,765 INFO L470 AbstractCegarLoop]: Abstraction has 826 states and 1309 transitions. [2021-08-25 20:02:07,765 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:02:07,765 INFO L276 IsEmpty]: Start isEmpty. Operand 826 states and 1309 transitions. [2021-08-25 20:02:07,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2021-08-25 20:02:07,767 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:02:07,767 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:02:07,767 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-08-25 20:02:07,768 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:02:07,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:02:07,768 INFO L82 PathProgramCache]: Analyzing trace with hash -772997618, now seen corresponding path program 1 times [2021-08-25 20:02:07,768 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:02:07,768 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160650267] [2021-08-25 20:02:07,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:02:07,769 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:02:07,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:02:07,802 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:02:07,802 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:02:07,802 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160650267] [2021-08-25 20:02:07,802 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160650267] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:02:07,803 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:02:07,803 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:02:07,803 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560445524] [2021-08-25 20:02:07,803 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:02:07,803 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:02:07,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:02:07,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:02:07,804 INFO L87 Difference]: Start difference. First operand 826 states and 1309 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:02:08,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:02:08,126 INFO L93 Difference]: Finished difference Result 1652 states and 2618 transitions. [2021-08-25 20:02:08,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:02:08,126 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:02:08,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:02:08,130 INFO L225 Difference]: With dead ends: 1652 [2021-08-25 20:02:08,130 INFO L226 Difference]: Without dead ends: 830 [2021-08-25 20:02:08,132 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:02:08,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 830 states. [2021-08-25 20:02:08,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 830 to 822. [2021-08-25 20:02:08,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 822 states, 821 states have (on average 1.5797807551766139) internal successors, (1297), 821 states have internal predecessors, (1297), 0 states have call successors, (0), 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:02:08,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 822 states to 822 states and 1297 transitions. [2021-08-25 20:02:08,160 INFO L78 Accepts]: Start accepts. Automaton has 822 states and 1297 transitions. Word has length 123 [2021-08-25 20:02:08,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:02:08,160 INFO L470 AbstractCegarLoop]: Abstraction has 822 states and 1297 transitions. [2021-08-25 20:02:08,160 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:02:08,161 INFO L276 IsEmpty]: Start isEmpty. Operand 822 states and 1297 transitions. [2021-08-25 20:02:08,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2021-08-25 20:02:08,163 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:02:08,163 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:02:08,163 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-08-25 20:02:08,163 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:02:08,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:02:08,164 INFO L82 PathProgramCache]: Analyzing trace with hash 733239163, now seen corresponding path program 1 times [2021-08-25 20:02:08,164 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:02:08,164 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236402126] [2021-08-25 20:02:08,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:02:08,165 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:02:08,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:02:08,205 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:02:08,205 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:02:08,205 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236402126] [2021-08-25 20:02:08,205 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236402126] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:02:08,205 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:02:08,206 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:02:08,206 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947135937] [2021-08-25 20:02:08,207 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:02:08,207 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:02:08,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:02:08,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:02:08,208 INFO L87 Difference]: Start difference. First operand 822 states and 1297 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:02:08,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:02:08,366 INFO L93 Difference]: Finished difference Result 1712 states and 2702 transitions. [2021-08-25 20:02:08,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:02:08,367 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:02:08,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:02:08,372 INFO L225 Difference]: With dead ends: 1712 [2021-08-25 20:02:08,372 INFO L226 Difference]: Without dead ends: 898 [2021-08-25 20:02:08,374 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:02:08,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 898 states. [2021-08-25 20:02:08,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 898 to 894. [2021-08-25 20:02:08,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 894 states, 893 states have (on average 1.5733482642777155) internal successors, (1405), 893 states have internal predecessors, (1405), 0 states have call successors, (0), 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:02:08,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 894 states to 894 states and 1405 transitions. [2021-08-25 20:02:08,410 INFO L78 Accepts]: Start accepts. Automaton has 894 states and 1405 transitions. Word has length 155 [2021-08-25 20:02:08,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:02:08,410 INFO L470 AbstractCegarLoop]: Abstraction has 894 states and 1405 transitions. [2021-08-25 20:02:08,410 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:02:08,411 INFO L276 IsEmpty]: Start isEmpty. Operand 894 states and 1405 transitions. [2021-08-25 20:02:08,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2021-08-25 20:02:08,413 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:02:08,413 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:02:08,413 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-08-25 20:02:08,413 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:02:08,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:02:08,414 INFO L82 PathProgramCache]: Analyzing trace with hash -834114823, now seen corresponding path program 1 times [2021-08-25 20:02:08,414 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:02:08,414 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610262358] [2021-08-25 20:02:08,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:02:08,415 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:02:08,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:02:08,448 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:02:08,448 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:02:08,448 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610262358] [2021-08-25 20:02:08,449 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610262358] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:02:08,449 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:02:08,449 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:02:08,449 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362299283] [2021-08-25 20:02:08,450 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:02:08,451 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:02:08,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:02:08,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:02:08,451 INFO L87 Difference]: Start difference. First operand 894 states and 1405 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:02:08,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:02:08,642 INFO L93 Difference]: Finished difference Result 1784 states and 2802 transitions. [2021-08-25 20:02:08,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:02:08,643 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:02:08,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:02:08,647 INFO L225 Difference]: With dead ends: 1784 [2021-08-25 20:02:08,647 INFO L226 Difference]: Without dead ends: 894 [2021-08-25 20:02:08,649 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:02:08,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 894 states. [2021-08-25 20:02:08,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 894 to 890. [2021-08-25 20:02:08,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 890 states, 889 states have (on average 1.5646794150731158) internal successors, (1391), 889 states have internal predecessors, (1391), 0 states have call successors, (0), 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:02:08,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 890 states to 890 states and 1391 transitions. [2021-08-25 20:02:08,680 INFO L78 Accepts]: Start accepts. Automaton has 890 states and 1391 transitions. Word has length 156 [2021-08-25 20:02:08,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:02:08,681 INFO L470 AbstractCegarLoop]: Abstraction has 890 states and 1391 transitions. [2021-08-25 20:02:08,681 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:02:08,681 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states and 1391 transitions. [2021-08-25 20:02:08,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2021-08-25 20:02:08,684 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:02:08,684 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:02:08,684 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-08-25 20:02:08,685 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:02:08,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:02:08,685 INFO L82 PathProgramCache]: Analyzing trace with hash 1569447121, now seen corresponding path program 1 times [2021-08-25 20:02:08,685 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:02:08,685 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492697985] [2021-08-25 20:02:08,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:02:08,686 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:02:08,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:02:08,723 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:02:08,724 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:02:08,724 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492697985] [2021-08-25 20:02:08,724 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492697985] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:02:08,724 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:02:08,724 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:02:08,725 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962972949] [2021-08-25 20:02:08,725 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:02:08,725 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:02:08,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:02:08,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:02:08,726 INFO L87 Difference]: Start difference. First operand 890 states and 1391 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:02:08,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:02:08,915 INFO L93 Difference]: Finished difference Result 1844 states and 2882 transitions. [2021-08-25 20:02:08,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:02:08,916 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:02:08,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:02:08,920 INFO L225 Difference]: With dead ends: 1844 [2021-08-25 20:02:08,920 INFO L226 Difference]: Without dead ends: 962 [2021-08-25 20:02:08,922 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:02:08,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 962 states. [2021-08-25 20:02:08,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 962 to 958. [2021-08-25 20:02:08,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 958 states, 957 states have (on average 1.555903866248694) internal successors, (1489), 957 states have internal predecessors, (1489), 0 states have call successors, (0), 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:02:08,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 958 states to 958 states and 1489 transitions. [2021-08-25 20:02:08,961 INFO L78 Accepts]: Start accepts. Automaton has 958 states and 1489 transitions. Word has length 186 [2021-08-25 20:02:08,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:02:08,961 INFO L470 AbstractCegarLoop]: Abstraction has 958 states and 1489 transitions. [2021-08-25 20:02:08,962 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:02:08,962 INFO L276 IsEmpty]: Start isEmpty. Operand 958 states and 1489 transitions. [2021-08-25 20:02:08,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2021-08-25 20:02:08,965 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:02:08,965 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:02:08,965 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-08-25 20:02:08,965 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:02:08,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:02:08,966 INFO L82 PathProgramCache]: Analyzing trace with hash -1139700173, now seen corresponding path program 1 times [2021-08-25 20:02:08,966 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:02:08,966 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982170761] [2021-08-25 20:02:08,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:02:08,967 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:02:08,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:02:09,002 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:02:09,003 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:02:09,003 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982170761] [2021-08-25 20:02:09,003 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982170761] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:02:09,003 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:02:09,003 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:02:09,003 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776772064] [2021-08-25 20:02:09,004 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:02:09,005 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:02:09,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:02:09,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:02:09,006 INFO L87 Difference]: Start difference. First operand 958 states and 1489 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:02:09,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:02:09,165 INFO L93 Difference]: Finished difference Result 1912 states and 2970 transitions. [2021-08-25 20:02:09,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:02:09,166 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:02:09,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:02:09,170 INFO L225 Difference]: With dead ends: 1912 [2021-08-25 20:02:09,170 INFO L226 Difference]: Without dead ends: 958 [2021-08-25 20:02:09,172 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:02:09,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 958 states. [2021-08-25 20:02:09,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 958 to 954. [2021-08-25 20:02:09,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 954 states, 953 states have (on average 1.545645330535152) internal successors, (1473), 953 states have internal predecessors, (1473), 0 states have call successors, (0), 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:02:09,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 954 states to 954 states and 1473 transitions. [2021-08-25 20:02:09,206 INFO L78 Accepts]: Start accepts. Automaton has 954 states and 1473 transitions. Word has length 187 [2021-08-25 20:02:09,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:02:09,207 INFO L470 AbstractCegarLoop]: Abstraction has 954 states and 1473 transitions. [2021-08-25 20:02:09,207 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:02:09,207 INFO L276 IsEmpty]: Start isEmpty. Operand 954 states and 1473 transitions. [2021-08-25 20:02:09,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2021-08-25 20:02:09,210 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:02:09,210 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:02:09,210 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-08-25 20:02:09,211 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:02:09,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:02:09,211 INFO L82 PathProgramCache]: Analyzing trace with hash 449451538, now seen corresponding path program 1 times [2021-08-25 20:02:09,211 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:02:09,211 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694189826] [2021-08-25 20:02:09,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:02:09,212 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:02:09,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:02:09,254 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:02:09,254 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:02:09,254 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694189826] [2021-08-25 20:02:09,254 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694189826] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:02:09,254 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:02:09,255 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:02:09,255 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225093527] [2021-08-25 20:02:09,255 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:02:09,255 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:02:09,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:02:09,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:02:09,257 INFO L87 Difference]: Start difference. First operand 954 states and 1473 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:02:09,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:02:09,572 INFO L93 Difference]: Finished difference Result 1974 states and 3056 transitions. [2021-08-25 20:02:09,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:02:09,573 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:02:09,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:02:09,577 INFO L225 Difference]: With dead ends: 1974 [2021-08-25 20:02:09,588 INFO L226 Difference]: Without dead ends: 1028 [2021-08-25 20:02:09,590 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:02:09,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1028 states. [2021-08-25 20:02:09,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1028 to 1004. [2021-08-25 20:02:09,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1004 states, 1003 states have (on average 1.5324027916251246) internal successors, (1537), 1003 states have internal predecessors, (1537), 0 states have call successors, (0), 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:02:09,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1004 states to 1004 states and 1537 transitions. [2021-08-25 20:02:09,659 INFO L78 Accepts]: Start accepts. Automaton has 1004 states and 1537 transitions. Word has length 204 [2021-08-25 20:02:09,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:02:09,659 INFO L470 AbstractCegarLoop]: Abstraction has 1004 states and 1537 transitions. [2021-08-25 20:02:09,659 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:02:09,659 INFO L276 IsEmpty]: Start isEmpty. Operand 1004 states and 1537 transitions. [2021-08-25 20:02:09,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2021-08-25 20:02:09,662 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:02:09,662 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:02:09,662 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-08-25 20:02:09,663 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:02:09,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:02:09,663 INFO L82 PathProgramCache]: Analyzing trace with hash 1353531801, now seen corresponding path program 1 times [2021-08-25 20:02:09,663 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:02:09,663 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372155104] [2021-08-25 20:02:09,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:02:09,664 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:02:09,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:02:09,706 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:02:09,707 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:02:09,707 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372155104] [2021-08-25 20:02:09,707 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372155104] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:02:09,707 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:02:09,707 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:02:09,707 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293137394] [2021-08-25 20:02:09,708 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:02:09,708 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:02:09,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:02:09,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:02:09,709 INFO L87 Difference]: Start difference. First operand 1004 states and 1537 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:02:09,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:02:09,872 INFO L93 Difference]: Finished difference Result 2024 states and 3102 transitions. [2021-08-25 20:02:09,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:02:09,873 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:02:09,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:02:09,877 INFO L225 Difference]: With dead ends: 2024 [2021-08-25 20:02:09,877 INFO L226 Difference]: Without dead ends: 1028 [2021-08-25 20:02:09,878 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:02:09,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1028 states. [2021-08-25 20:02:09,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1028 to 1004. [2021-08-25 20:02:09,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1004 states, 1003 states have (on average 1.514456630109671) internal successors, (1519), 1003 states have internal predecessors, (1519), 0 states have call successors, (0), 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:02:09,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1004 states to 1004 states and 1519 transitions. [2021-08-25 20:02:09,910 INFO L78 Accepts]: Start accepts. Automaton has 1004 states and 1519 transitions. Word has length 205 [2021-08-25 20:02:09,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:02:09,911 INFO L470 AbstractCegarLoop]: Abstraction has 1004 states and 1519 transitions. [2021-08-25 20:02:09,911 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:02:09,911 INFO L276 IsEmpty]: Start isEmpty. Operand 1004 states and 1519 transitions. [2021-08-25 20:02:09,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2021-08-25 20:02:09,914 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:02:09,914 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:02:09,915 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-08-25 20:02:09,915 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:02:09,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:02:09,915 INFO L82 PathProgramCache]: Analyzing trace with hash -929225253, now seen corresponding path program 1 times [2021-08-25 20:02:09,916 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:02:09,916 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620912717] [2021-08-25 20:02:09,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:02:09,916 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:02:09,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:02:09,945 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:02:09,945 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:02:09,946 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620912717] [2021-08-25 20:02:09,946 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620912717] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:02:09,946 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:02:09,946 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:02:09,946 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269993468] [2021-08-25 20:02:09,947 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:02:09,947 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:02:09,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:02:09,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:02:09,947 INFO L87 Difference]: Start difference. First operand 1004 states and 1519 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:02:10,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:02:10,107 INFO L93 Difference]: Finished difference Result 2008 states and 3036 transitions. [2021-08-25 20:02:10,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:02:10,108 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:02:10,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:02:10,112 INFO L225 Difference]: With dead ends: 2008 [2021-08-25 20:02:10,112 INFO L226 Difference]: Without dead ends: 1012 [2021-08-25 20:02:10,113 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:02:10,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1012 states. [2021-08-25 20:02:10,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1012 to 1004. [2021-08-25 20:02:10,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1004 states, 1003 states have (on average 1.502492522432702) internal successors, (1507), 1003 states have internal predecessors, (1507), 0 states have call successors, (0), 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:02:10,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1004 states to 1004 states and 1507 transitions. [2021-08-25 20:02:10,147 INFO L78 Accepts]: Start accepts. Automaton has 1004 states and 1507 transitions. Word has length 217 [2021-08-25 20:02:10,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:02:10,147 INFO L470 AbstractCegarLoop]: Abstraction has 1004 states and 1507 transitions. [2021-08-25 20:02:10,147 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:02:10,148 INFO L276 IsEmpty]: Start isEmpty. Operand 1004 states and 1507 transitions. [2021-08-25 20:02:10,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2021-08-25 20:02:10,151 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:02:10,151 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:02:10,151 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-08-25 20:02:10,151 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:02:10,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:02:10,152 INFO L82 PathProgramCache]: Analyzing trace with hash 2118002585, now seen corresponding path program 1 times [2021-08-25 20:02:10,152 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:02:10,152 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238945120] [2021-08-25 20:02:10,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:02:10,153 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:02:10,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:02:10,192 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:02:10,192 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:02:10,193 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238945120] [2021-08-25 20:02:10,193 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238945120] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:02:10,193 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:02:10,193 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:02:10,193 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103767839] [2021-08-25 20:02:10,194 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:02:10,194 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:02:10,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:02:10,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:02:10,195 INFO L87 Difference]: Start difference. First operand 1004 states and 1507 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:02:10,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:02:10,363 INFO L93 Difference]: Finished difference Result 2008 states and 3012 transitions. [2021-08-25 20:02:10,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:02:10,364 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:02:10,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:02:10,369 INFO L225 Difference]: With dead ends: 2008 [2021-08-25 20:02:10,370 INFO L226 Difference]: Without dead ends: 994 [2021-08-25 20:02:10,371 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:02:10,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 994 states. [2021-08-25 20:02:10,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 994 to 986. [2021-08-25 20:02:10,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 986 states, 985 states have (on average 1.4913705583756345) internal successors, (1469), 985 states have internal predecessors, (1469), 0 states have call successors, (0), 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:02:10,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 986 states to 986 states and 1469 transitions. [2021-08-25 20:02:10,404 INFO L78 Accepts]: Start accepts. Automaton has 986 states and 1469 transitions. Word has length 218 [2021-08-25 20:02:10,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:02:10,404 INFO L470 AbstractCegarLoop]: Abstraction has 986 states and 1469 transitions. [2021-08-25 20:02:10,405 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:02:10,405 INFO L276 IsEmpty]: Start isEmpty. Operand 986 states and 1469 transitions. [2021-08-25 20:02:10,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2021-08-25 20:02:10,408 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:02:10,408 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] [2021-08-25 20:02:10,408 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-08-25 20:02:10,408 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:02:10,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:02:10,409 INFO L82 PathProgramCache]: Analyzing trace with hash 1080917184, now seen corresponding path program 1 times [2021-08-25 20:02:10,409 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:02:10,409 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249287145] [2021-08-25 20:02:10,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:02:10,409 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:02:10,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:02:10,442 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:02:10,442 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:02:10,442 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249287145] [2021-08-25 20:02:10,443 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249287145] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:02:10,443 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:02:10,443 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:02:10,443 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717687777] [2021-08-25 20:02:10,444 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:02:10,444 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:02:10,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:02:10,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:02:10,445 INFO L87 Difference]: Start difference. First operand 986 states and 1469 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:02:10,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:02:10,604 INFO L93 Difference]: Finished difference Result 2016 states and 3008 transitions. [2021-08-25 20:02:10,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:02:10,604 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 224 [2021-08-25 20:02:10,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:02:10,608 INFO L225 Difference]: With dead ends: 2016 [2021-08-25 20:02:10,609 INFO L226 Difference]: Without dead ends: 1038 [2021-08-25 20:02:10,610 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:02:10,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1038 states. [2021-08-25 20:02:10,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1038 to 1032. [2021-08-25 20:02:10,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1032 states, 1031 states have (on average 1.4772065955383122) internal successors, (1523), 1031 states have internal predecessors, (1523), 0 states have call successors, (0), 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:02:10,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1032 states to 1032 states and 1523 transitions. [2021-08-25 20:02:10,647 INFO L78 Accepts]: Start accepts. Automaton has 1032 states and 1523 transitions. Word has length 224 [2021-08-25 20:02:10,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:02:10,648 INFO L470 AbstractCegarLoop]: Abstraction has 1032 states and 1523 transitions. [2021-08-25 20:02:10,648 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:02:10,648 INFO L276 IsEmpty]: Start isEmpty. Operand 1032 states and 1523 transitions. [2021-08-25 20:02:10,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2021-08-25 20:02:10,651 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:02:10,652 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] [2021-08-25 20:02:10,652 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-08-25 20:02:10,652 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:02:10,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:02:10,653 INFO L82 PathProgramCache]: Analyzing trace with hash -1544536537, now seen corresponding path program 1 times [2021-08-25 20:02:10,653 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:02:10,653 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475936681] [2021-08-25 20:02:10,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:02:10,654 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:02:10,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:02:10,687 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:02:10,688 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:02:10,688 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475936681] [2021-08-25 20:02:10,690 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475936681] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:02:10,690 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:02:10,690 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:02:10,690 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213152595] [2021-08-25 20:02:10,691 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:02:10,691 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:02:10,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:02:10,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:02:10,692 INFO L87 Difference]: Start difference. First operand 1032 states and 1523 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:02:10,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:02:10,832 INFO L93 Difference]: Finished difference Result 2062 states and 3042 transitions. [2021-08-25 20:02:10,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:02:10,833 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:02:10,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:02:10,837 INFO L225 Difference]: With dead ends: 2062 [2021-08-25 20:02:10,837 INFO L226 Difference]: Without dead ends: 1030 [2021-08-25 20:02:10,838 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:02:10,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1030 states. [2021-08-25 20:02:10,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1030 to 1024. [2021-08-25 20:02:10,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1024 states, 1023 states have (on average 1.4574780058651027) internal successors, (1491), 1023 states have internal predecessors, (1491), 0 states have call successors, (0), 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:02:10,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1024 states to 1024 states and 1491 transitions. [2021-08-25 20:02:10,872 INFO L78 Accepts]: Start accepts. Automaton has 1024 states and 1491 transitions. Word has length 225 [2021-08-25 20:02:10,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:02:10,872 INFO L470 AbstractCegarLoop]: Abstraction has 1024 states and 1491 transitions. [2021-08-25 20:02:10,873 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:02:10,873 INFO L276 IsEmpty]: Start isEmpty. Operand 1024 states and 1491 transitions. [2021-08-25 20:02:10,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2021-08-25 20:02:10,876 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:02:10,876 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] [2021-08-25 20:02:10,877 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-08-25 20:02:10,877 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:02:10,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:02:10,877 INFO L82 PathProgramCache]: Analyzing trace with hash 454513996, now seen corresponding path program 1 times [2021-08-25 20:02:10,878 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:02:10,878 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376633619] [2021-08-25 20:02:10,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:02:10,879 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:02:10,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:02:10,937 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:02:10,937 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:02:10,938 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376633619] [2021-08-25 20:02:10,938 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376633619] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 20:02:10,938 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [229851210] [2021-08-25 20:02:10,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:02:10,938 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 20:02:10,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 20:02:10,944 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:02:10,954 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:02:11,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:02:11,098 INFO L263 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-25 20:02:11,123 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:02:12,094 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:02:12,094 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [229851210] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:02:12,094 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-08-25 20:02:12,094 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2021-08-25 20:02:12,095 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612830831] [2021-08-25 20:02:12,095 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:02:12,095 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:02:12,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:02:12,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:02:12,096 INFO L87 Difference]: Start difference. First operand 1024 states and 1491 transitions. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:02:12,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:02:12,152 INFO L93 Difference]: Finished difference Result 2547 states and 3708 transitions. [2021-08-25 20:02:12,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:02:12,153 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 261 [2021-08-25 20:02:12,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:02:12,159 INFO L225 Difference]: With dead ends: 2547 [2021-08-25 20:02:12,159 INFO L226 Difference]: Without dead ends: 1531 [2021-08-25 20:02:12,161 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 261 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.0ms TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:02:12,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1531 states. [2021-08-25 20:02:12,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1531 to 1531. [2021-08-25 20:02:12,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1531 states, 1530 states have (on average 1.4562091503267973) internal successors, (2228), 1530 states have internal predecessors, (2228), 0 states have call successors, (0), 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:02:12,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1531 states to 1531 states and 2228 transitions. [2021-08-25 20:02:12,204 INFO L78 Accepts]: Start accepts. Automaton has 1531 states and 2228 transitions. Word has length 261 [2021-08-25 20:02:12,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:02:12,205 INFO L470 AbstractCegarLoop]: Abstraction has 1531 states and 2228 transitions. [2021-08-25 20:02:12,205 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:02:12,205 INFO L276 IsEmpty]: Start isEmpty. Operand 1531 states and 2228 transitions. [2021-08-25 20:02:12,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2021-08-25 20:02:12,209 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:02:12,209 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, 1, 1] [2021-08-25 20:02:12,238 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:02:12,435 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:02:12,435 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:02:12,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:02:12,435 INFO L82 PathProgramCache]: Analyzing trace with hash -1829254476, now seen corresponding path program 1 times [2021-08-25 20:02:12,436 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:02:12,436 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766836378] [2021-08-25 20:02:12,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:02:12,436 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:02:12,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:02:12,749 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:02:12,750 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:02:12,750 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766836378] [2021-08-25 20:02:12,750 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766836378] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:02:12,750 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:02:12,750 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:02:12,750 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684765097] [2021-08-25 20:02:12,750 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:02:12,751 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:02:12,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:02:12,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:02:12,751 INFO L87 Difference]: Start difference. First operand 1531 states and 2228 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:02:12,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:02:12,936 INFO L93 Difference]: Finished difference Result 4496 states and 6540 transitions. [2021-08-25 20:02:12,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:02:12,937 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 271 [2021-08-25 20:02:12,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:02:12,947 INFO L225 Difference]: With dead ends: 4496 [2021-08-25 20:02:12,948 INFO L226 Difference]: Without dead ends: 2973 [2021-08-25 20:02:12,965 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 39.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:02:12,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2973 states. [2021-08-25 20:02:13,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2973 to 2971. [2021-08-25 20:02:13,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2971 states, 2970 states have (on average 1.4525252525252526) internal successors, (4314), 2970 states have internal predecessors, (4314), 0 states have call successors, (0), 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:02:13,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2971 states to 2971 states and 4314 transitions. [2021-08-25 20:02:13,143 INFO L78 Accepts]: Start accepts. Automaton has 2971 states and 4314 transitions. Word has length 271 [2021-08-25 20:02:13,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:02:13,144 INFO L470 AbstractCegarLoop]: Abstraction has 2971 states and 4314 transitions. [2021-08-25 20:02:13,144 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:02:13,144 INFO L276 IsEmpty]: Start isEmpty. Operand 2971 states and 4314 transitions. [2021-08-25 20:02:13,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2021-08-25 20:02:13,164 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:02:13,164 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, 1, 1] [2021-08-25 20:02:13,164 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-08-25 20:02:13,165 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:02:13,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:02:13,165 INFO L82 PathProgramCache]: Analyzing trace with hash -86423524, now seen corresponding path program 1 times [2021-08-25 20:02:13,165 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:02:13,166 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555325259] [2021-08-25 20:02:13,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:02:13,166 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:02:13,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:02:13,280 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:02:13,280 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:02:13,280 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555325259] [2021-08-25 20:02:13,280 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555325259] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:02:13,280 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:02:13,281 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:02:13,281 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290213231] [2021-08-25 20:02:13,281 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:02:13,282 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:02:13,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:02:13,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:02:13,282 INFO L87 Difference]: Start difference. First operand 2971 states and 4314 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 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:02:13,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:02:13,772 INFO L93 Difference]: Finished difference Result 6054 states and 8808 transitions. [2021-08-25 20:02:13,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:02:13,773 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 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 308 [2021-08-25 20:02:13,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:02:13,780 INFO L225 Difference]: With dead ends: 6054 [2021-08-25 20:02:13,789 INFO L226 Difference]: Without dead ends: 1980 [2021-08-25 20:02:13,794 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:02:13,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1980 states. [2021-08-25 20:02:13,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1980 to 1960. [2021-08-25 20:02:13,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1960 states, 1959 states have (on average 1.4282797345584481) internal successors, (2798), 1959 states have internal predecessors, (2798), 0 states have call successors, (0), 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:02:13,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1960 states to 1960 states and 2798 transitions. [2021-08-25 20:02:13,916 INFO L78 Accepts]: Start accepts. Automaton has 1960 states and 2798 transitions. Word has length 308 [2021-08-25 20:02:13,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:02:13,917 INFO L470 AbstractCegarLoop]: Abstraction has 1960 states and 2798 transitions. [2021-08-25 20:02:13,918 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 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:02:13,918 INFO L276 IsEmpty]: Start isEmpty. Operand 1960 states and 2798 transitions. [2021-08-25 20:02:13,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2021-08-25 20:02:13,924 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:02:13,924 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, 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] [2021-08-25 20:02:13,924 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-08-25 20:02:13,924 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:02:13,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:02:13,925 INFO L82 PathProgramCache]: Analyzing trace with hash 1520948552, now seen corresponding path program 1 times [2021-08-25 20:02:13,925 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:02:13,925 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874997035] [2021-08-25 20:02:13,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:02:13,926 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:02:13,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:02:14,037 INFO L134 CoverageAnalysis]: Checked inductivity of 1397 backedges. 906 proven. 26 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2021-08-25 20:02:14,037 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:02:14,037 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874997035] [2021-08-25 20:02:14,038 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874997035] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 20:02:14,038 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1588144593] [2021-08-25 20:02:14,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:02:14,038 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 20:02:14,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 20:02:14,044 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:02:14,099 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:02:14,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:02:14,464 INFO L263 TraceCheckSpWp]: Trace formula consists of 615 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-25 20:02:14,475 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:02:15,855 INFO L134 CoverageAnalysis]: Checked inductivity of 1397 backedges. 906 proven. 26 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2021-08-25 20:02:15,855 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1588144593] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 20:02:15,855 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-25 20:02:15,856 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2021-08-25 20:02:15,856 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829673595] [2021-08-25 20:02:15,856 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:02:15,857 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:02:15,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:02:15,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:02:15,858 INFO L87 Difference]: Start difference. First operand 1960 states and 2798 transitions. Second operand has 4 states, 4 states have (on average 44.75) internal successors, (179), 4 states have internal predecessors, (179), 0 states have call successors, (0), 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:02:16,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:02:16,375 INFO L93 Difference]: Finished difference Result 4530 states and 6458 transitions. [2021-08-25 20:02:16,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-25 20:02:16,378 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 44.75) internal successors, (179), 4 states have internal predecessors, (179), 0 states have call successors, (0), 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 373 [2021-08-25 20:02:16,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:02:16,413 INFO L225 Difference]: With dead ends: 4530 [2021-08-25 20:02:16,413 INFO L226 Difference]: Without dead ends: 2534 [2021-08-25 20:02:16,416 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 378 GetRequests, 375 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:02:16,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2534 states. [2021-08-25 20:02:16,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2534 to 1935. [2021-08-25 20:02:16,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1935 states, 1934 states have (on average 1.3846949327817994) internal successors, (2678), 1934 states have internal predecessors, (2678), 0 states have call successors, (0), 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:02:16,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1935 states to 1935 states and 2678 transitions. [2021-08-25 20:02:16,527 INFO L78 Accepts]: Start accepts. Automaton has 1935 states and 2678 transitions. Word has length 373 [2021-08-25 20:02:16,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:02:16,528 INFO L470 AbstractCegarLoop]: Abstraction has 1935 states and 2678 transitions. [2021-08-25 20:02:16,528 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 44.75) internal successors, (179), 4 states have internal predecessors, (179), 0 states have call successors, (0), 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:02:16,528 INFO L276 IsEmpty]: Start isEmpty. Operand 1935 states and 2678 transitions. [2021-08-25 20:02:16,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 602 [2021-08-25 20:02:16,554 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:02:16,554 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:02:16,605 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2021-08-25 20:02:16,755 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:02:16,755 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:02:16,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:02:16,757 INFO L82 PathProgramCache]: Analyzing trace with hash -145524280, now seen corresponding path program 1 times [2021-08-25 20:02:16,757 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:02:16,758 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014029493] [2021-08-25 20:02:16,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:02:16,758 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:02:16,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:02:16,945 INFO L134 CoverageAnalysis]: Checked inductivity of 4011 backedges. 2317 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2021-08-25 20:02:16,946 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:02:16,946 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014029493] [2021-08-25 20:02:16,946 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014029493] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 20:02:16,946 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [397553122] [2021-08-25 20:02:16,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:02:16,946 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-25 20:02:16,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 20:02:16,953 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:02:17,000 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:02:17,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:02:17,681 INFO L263 TraceCheckSpWp]: Trace formula consists of 921 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-25 20:02:17,686 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:02:19,676 INFO L134 CoverageAnalysis]: Checked inductivity of 4011 backedges. 2317 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2021-08-25 20:02:19,677 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [397553122] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-25 20:02:19,677 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-25 20:02:19,677 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2021-08-25 20:02:19,680 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602498653] [2021-08-25 20:02:19,681 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-25 20:02:19,681 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:02:19,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-25 20:02:19,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-25 20:02:19,682 INFO L87 Difference]: Start difference. First operand 1935 states and 2678 transitions. Second operand has 6 states, 6 states have (on average 46.333333333333336) internal successors, (278), 6 states have internal predecessors, (278), 0 states have call successors, (0), 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:02:20,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:02:20,122 INFO L93 Difference]: Finished difference Result 4773 states and 6635 transitions. [2021-08-25 20:02:20,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:02:20,122 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 46.333333333333336) internal successors, (278), 6 states have internal predecessors, (278), 0 states have call successors, (0), 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 601 [2021-08-25 20:02:20,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:02:20,139 INFO L225 Difference]: With dead ends: 4773 [2021-08-25 20:02:20,140 INFO L226 Difference]: Without dead ends: 2705 [2021-08-25 20:02:20,144 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 606 GetRequests, 601 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 32.4ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-08-25 20:02:20,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2705 states. [2021-08-25 20:02:20,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2705 to 1935. [2021-08-25 20:02:20,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1935 states, 1934 states have (on average 1.3846949327817994) internal successors, (2678), 1934 states have internal predecessors, (2678), 0 states have call successors, (0), 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:02:20,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1935 states to 1935 states and 2678 transitions. [2021-08-25 20:02:20,264 INFO L78 Accepts]: Start accepts. Automaton has 1935 states and 2678 transitions. Word has length 601 [2021-08-25 20:02:20,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:02:20,265 INFO L470 AbstractCegarLoop]: Abstraction has 1935 states and 2678 transitions. [2021-08-25 20:02:20,265 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 46.333333333333336) internal successors, (278), 6 states have internal predecessors, (278), 0 states have call successors, (0), 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:02:20,265 INFO L276 IsEmpty]: Start isEmpty. Operand 1935 states and 2678 transitions. [2021-08-25 20:02:20,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 669 [2021-08-25 20:02:20,286 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:02:20,287 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:02:20,336 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2021-08-25 20:02:20,504 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:02:20,505 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:02:20,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:02:20,505 INFO L82 PathProgramCache]: Analyzing trace with hash 1751516873, now seen corresponding path program 1 times [2021-08-25 20:02:20,505 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:02:20,506 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483875902] [2021-08-25 20:02:20,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:02:20,506 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:02:20,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:02:20,637 INFO L134 CoverageAnalysis]: Checked inductivity of 5248 backedges. 2921 proven. 0 refuted. 0 times theorem prover too weak. 2327 trivial. 0 not checked. [2021-08-25 20:02:20,638 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:02:20,638 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483875902] [2021-08-25 20:02:20,638 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483875902] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:02:20,638 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:02:20,638 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:02:20,638 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252677898] [2021-08-25 20:02:20,639 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:02:20,639 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:02:20,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:02:20,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:02:20,640 INFO L87 Difference]: Start difference. First operand 1935 states and 2678 transitions. Second operand has 3 states, 3 states have (on average 66.0) internal successors, (198), 3 states have internal predecessors, (198), 0 states have call successors, (0), 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:02:20,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:02:20,881 INFO L93 Difference]: Finished difference Result 3898 states and 5388 transitions. [2021-08-25 20:02:20,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:02:20,881 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.0) internal successors, (198), 3 states have internal predecessors, (198), 0 states have call successors, (0), 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 668 [2021-08-25 20:02:20,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:02:20,885 INFO L225 Difference]: With dead ends: 3898 [2021-08-25 20:02:20,885 INFO L226 Difference]: Without dead ends: 1971 [2021-08-25 20:02:20,888 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:02:20,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1971 states. [2021-08-25 20:02:21,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1971 to 1935. [2021-08-25 20:02:21,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1935 states, 1934 states have (on average 1.37435367114788) internal successors, (2658), 1934 states have internal predecessors, (2658), 0 states have call successors, (0), 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:02:21,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1935 states to 1935 states and 2658 transitions. [2021-08-25 20:02:21,047 INFO L78 Accepts]: Start accepts. Automaton has 1935 states and 2658 transitions. Word has length 668 [2021-08-25 20:02:21,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:02:21,048 INFO L470 AbstractCegarLoop]: Abstraction has 1935 states and 2658 transitions. [2021-08-25 20:02:21,061 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.0) internal successors, (198), 3 states have internal predecessors, (198), 0 states have call successors, (0), 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:02:21,061 INFO L276 IsEmpty]: Start isEmpty. Operand 1935 states and 2658 transitions. [2021-08-25 20:02:21,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 683 [2021-08-25 20:02:21,068 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:02:21,068 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, 1, 1, 1, 1, 1, 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:02:21,069 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-08-25 20:02:21,069 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:02:21,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:02:21,069 INFO L82 PathProgramCache]: Analyzing trace with hash -267197401, now seen corresponding path program 1 times [2021-08-25 20:02:21,070 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:02:21,070 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107848842] [2021-08-25 20:02:21,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:02:21,070 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:02:21,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:02:21,182 INFO L134 CoverageAnalysis]: Checked inductivity of 5384 backedges. 2914 proven. 0 refuted. 0 times theorem prover too weak. 2470 trivial. 0 not checked. [2021-08-25 20:02:21,182 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:02:21,182 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107848842] [2021-08-25 20:02:21,182 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107848842] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:02:21,182 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:02:21,183 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:02:21,183 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386066918] [2021-08-25 20:02:21,183 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:02:21,184 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:02:21,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:02:21,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:02:21,184 INFO L87 Difference]: Start difference. First operand 1935 states and 2658 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:02:21,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:02:21,391 INFO L93 Difference]: Finished difference Result 3877 states and 5322 transitions. [2021-08-25 20:02:21,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:02:21,392 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 682 [2021-08-25 20:02:21,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:02:21,396 INFO L225 Difference]: With dead ends: 3877 [2021-08-25 20:02:21,396 INFO L226 Difference]: Without dead ends: 1950 [2021-08-25 20:02:21,399 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:02:21,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1950 states. [2021-08-25 20:02:21,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1950 to 1922. [2021-08-25 20:02:21,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1922 states, 1921 states have (on average 1.3529411764705883) internal successors, (2599), 1921 states have internal predecessors, (2599), 0 states have call successors, (0), 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:02:21,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1922 states to 1922 states and 2599 transitions. [2021-08-25 20:02:21,455 INFO L78 Accepts]: Start accepts. Automaton has 1922 states and 2599 transitions. Word has length 682 [2021-08-25 20:02:21,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:02:21,455 INFO L470 AbstractCegarLoop]: Abstraction has 1922 states and 2599 transitions. [2021-08-25 20:02:21,456 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:02:21,456 INFO L276 IsEmpty]: Start isEmpty. Operand 1922 states and 2599 transitions. [2021-08-25 20:02:21,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 712 [2021-08-25 20:02:21,461 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:02:21,462 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, 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:02:21,462 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-08-25 20:02:21,462 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:02:21,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:02:21,463 INFO L82 PathProgramCache]: Analyzing trace with hash 616266130, now seen corresponding path program 1 times [2021-08-25 20:02:21,463 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:02:21,463 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106555714] [2021-08-25 20:02:21,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:02:21,464 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:02:21,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:02:21,574 INFO L134 CoverageAnalysis]: Checked inductivity of 5825 backedges. 3230 proven. 0 refuted. 0 times theorem prover too weak. 2595 trivial. 0 not checked. [2021-08-25 20:02:21,574 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:02:21,574 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106555714] [2021-08-25 20:02:21,575 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106555714] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:02:21,575 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:02:21,575 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:02:21,575 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074984093] [2021-08-25 20:02:21,576 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:02:21,576 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:02:21,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:02:21,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:02:21,577 INFO L87 Difference]: Start difference. First operand 1922 states and 2599 transitions. Second operand has 3 states, 3 states have (on average 69.0) internal successors, (207), 3 states have internal predecessors, (207), 0 states have call successors, (0), 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:02:21,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:02:21,893 INFO L93 Difference]: Finished difference Result 3905 states and 5284 transitions. [2021-08-25 20:02:21,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:02:21,899 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.0) internal successors, (207), 3 states have internal predecessors, (207), 0 states have call successors, (0), 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 711 [2021-08-25 20:02:21,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:02:21,902 INFO L225 Difference]: With dead ends: 3905 [2021-08-25 20:02:21,902 INFO L226 Difference]: Without dead ends: 1973 [2021-08-25 20:02:21,912 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:02:21,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1973 states. [2021-08-25 20:02:21,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1973 to 1964. [2021-08-25 20:02:21,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1964 states, 1963 states have (on average 1.346917982679572) internal successors, (2644), 1963 states have internal predecessors, (2644), 0 states have call successors, (0), 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:02:21,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1964 states to 1964 states and 2644 transitions. [2021-08-25 20:02:21,964 INFO L78 Accepts]: Start accepts. Automaton has 1964 states and 2644 transitions. Word has length 711 [2021-08-25 20:02:21,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:02:21,965 INFO L470 AbstractCegarLoop]: Abstraction has 1964 states and 2644 transitions. [2021-08-25 20:02:21,965 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.0) internal successors, (207), 3 states have internal predecessors, (207), 0 states have call successors, (0), 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:02:21,965 INFO L276 IsEmpty]: Start isEmpty. Operand 1964 states and 2644 transitions. [2021-08-25 20:02:21,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 727 [2021-08-25 20:02:21,971 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:02:21,971 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, 1, 1, 1, 1, 1, 1, 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:02:21,972 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-08-25 20:02:21,972 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:02:21,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:02:21,976 INFO L82 PathProgramCache]: Analyzing trace with hash 2029147081, now seen corresponding path program 1 times [2021-08-25 20:02:21,976 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:02:21,976 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943503601] [2021-08-25 20:02:21,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:02:21,976 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:02:22,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:02:22,087 INFO L134 CoverageAnalysis]: Checked inductivity of 5991 backedges. 3253 proven. 0 refuted. 0 times theorem prover too weak. 2738 trivial. 0 not checked. [2021-08-25 20:02:22,087 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:02:22,087 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943503601] [2021-08-25 20:02:22,088 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943503601] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:02:22,088 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:02:22,088 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:02:22,088 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584921253] [2021-08-25 20:02:22,089 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:02:22,089 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:02:22,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:02:22,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:02:22,090 INFO L87 Difference]: Start difference. First operand 1964 states and 2644 transitions. Second operand has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 0 states have call successors, (0), 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:02:22,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:02:22,236 INFO L93 Difference]: Finished difference Result 2511 states and 3363 transitions. [2021-08-25 20:02:22,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:02:22,236 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 0 states have call successors, (0), 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 726 [2021-08-25 20:02:22,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:02:22,237 INFO L225 Difference]: With dead ends: 2511 [2021-08-25 20:02:22,237 INFO L226 Difference]: Without dead ends: 0 [2021-08-25 20:02:22,239 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:02:22,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-08-25 20:02:22,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-08-25 20:02:22,239 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:02:22,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-08-25 20:02:22,240 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 726 [2021-08-25 20:02:22,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:02:22,240 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-25 20:02:22,240 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 0 states have call successors, (0), 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:02:22,240 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-08-25 20:02:22,240 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-08-25 20:02:22,243 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:02:22,244 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-08-25 20:02:22,245 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-08-25 20:02:22,251 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:02:22,254 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:02:22,304 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:02:22,331 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:02:22,362 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:02:22,389 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:02:22,409 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:02:22,411 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:02:22,436 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:02:22,461 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:02:22,473 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:02:22,498 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:02:22,498 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:02:22,499 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:02:22,651 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:02:22,671 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:02:22,691 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:02:22,692 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:02:22,711 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:02:22,903 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:02:22,911 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:02:22,912 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:02:22,925 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:02:22,953 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:02:22,976 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:02:22,993 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:02:23,009 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:02:23,010 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:02:23,022 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:02:30,445 INFO L853 garLoopResultBuilder]: At program point L168(lines 167 609) 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:02:30,447 INFO L853 garLoopResultBuilder]: At program point L135(lines 128 622) 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:02:30,447 INFO L857 garLoopResultBuilder]: For program point L102(line 102) no Hoare annotation was computed. [2021-08-25 20:02:30,468 INFO L857 garLoopResultBuilder]: For program point L631(lines 631 659) no Hoare annotation was computed. [2021-08-25 20:02:30,468 INFO L857 garLoopResultBuilder]: For program point L466(lines 466 470) no Hoare annotation was computed. [2021-08-25 20:02:30,468 INFO L857 garLoopResultBuilder]: For program point L632(lines 632 656) no Hoare annotation was computed. [2021-08-25 20:02:30,468 INFO L857 garLoopResultBuilder]: For program point L566(lines 566 570) no Hoare annotation was computed. [2021-08-25 20:02:30,468 INFO L857 garLoopResultBuilder]: For program point L500(lines 500 504) no Hoare annotation was computed. [2021-08-25 20:02:30,468 INFO L857 garLoopResultBuilder]: For program point L566-2(lines 566 570) no Hoare annotation was computed. [2021-08-25 20:02:30,469 INFO L857 garLoopResultBuilder]: For program point L500-2(lines 211 592) no Hoare annotation was computed. [2021-08-25 20:02:30,469 INFO L857 garLoopResultBuilder]: For program point L203(lines 203 597) no Hoare annotation was computed. [2021-08-25 20:02:30,469 INFO L857 garLoopResultBuilder]: For program point L170(lines 170 608) no Hoare annotation was computed. [2021-08-25 20:02:30,469 INFO L857 garLoopResultBuilder]: For program point L137(lines 137 619) no Hoare annotation was computed. [2021-08-25 20:02:30,469 INFO L857 garLoopResultBuilder]: For program point L104(lines 104 630) no Hoare annotation was computed. [2021-08-25 20:02:30,469 INFO L857 garLoopResultBuilder]: For program point L666(lines 666 670) no Hoare annotation was computed. [2021-08-25 20:02:30,469 INFO L857 garLoopResultBuilder]: For program point L633(lines 633 642) no Hoare annotation was computed. [2021-08-25 20:02:30,469 INFO L857 garLoopResultBuilder]: For program point L666-2(lines 666 670) no Hoare annotation was computed. [2021-08-25 20:02:30,470 INFO L857 garLoopResultBuilder]: For program point L633-2(lines 632 654) no Hoare annotation was computed. [2021-08-25 20:02:30,470 INFO L857 garLoopResultBuilder]: For program point L270(lines 270 274) no Hoare annotation was computed. [2021-08-25 20:02:30,470 INFO L853 garLoopResultBuilder]: At program point L204(lines 200 598) 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:02:30,470 INFO L853 garLoopResultBuilder]: At program point L105(lines 104 630) 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:02:30,470 INFO L857 garLoopResultBuilder]: For program point L304(lines 304 308) no Hoare annotation was computed. [2021-08-25 20:02:30,470 INFO L857 garLoopResultBuilder]: For program point L304-2(lines 211 592) no Hoare annotation was computed. [2021-08-25 20:02:30,471 INFO L857 garLoopResultBuilder]: For program point L635(lines 635 639) no Hoare annotation was computed. [2021-08-25 20:02:30,471 INFO L857 garLoopResultBuilder]: For program point L206(lines 206 596) no Hoare annotation was computed. [2021-08-25 20:02:30,471 INFO L857 garLoopResultBuilder]: For program point L173(lines 173 607) no Hoare annotation was computed. [2021-08-25 20:02:30,471 INFO L857 garLoopResultBuilder]: For program point L140(lines 140 618) no Hoare annotation was computed. [2021-08-25 20:02:30,471 INFO L857 garLoopResultBuilder]: For program point L107(lines 107 629) no Hoare annotation was computed. [2021-08-25 20:02:30,471 INFO L857 garLoopResultBuilder]: For program point L339(lines 339 343) no Hoare annotation was computed. [2021-08-25 20:02:30,471 INFO L857 garLoopResultBuilder]: For program point L339-2(lines 211 592) no Hoare annotation was computed. [2021-08-25 20:02:30,471 INFO L853 garLoopResultBuilder]: At program point L207(lines 206 596) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) [2021-08-25 20:02:30,472 INFO L853 garLoopResultBuilder]: At program point L174(lines 170 608) 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:02:30,472 INFO L853 garLoopResultBuilder]: At program point L141(lines 137 619) 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:02:30,472 INFO L857 garLoopResultBuilder]: For program point L75(lines 75 83) no Hoare annotation was computed. [2021-08-25 20:02:30,472 INFO L857 garLoopResultBuilder]: For program point L439(lines 439 451) no Hoare annotation was computed. [2021-08-25 20:02:30,472 INFO L853 garLoopResultBuilder]: At program point L406(lines 397 417) 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:02:30,472 INFO L857 garLoopResultBuilder]: For program point L439-2(lines 439 451) no Hoare annotation was computed. [2021-08-25 20:02:30,473 INFO L857 garLoopResultBuilder]: For program point L176(lines 176 606) no Hoare annotation was computed. [2021-08-25 20:02:30,473 INFO L857 garLoopResultBuilder]: For program point L143(lines 143 617) no Hoare annotation was computed. [2021-08-25 20:02:30,473 INFO L857 garLoopResultBuilder]: For program point L110(lines 110 628) no Hoare annotation was computed. [2021-08-25 20:02:30,473 INFO L853 garLoopResultBuilder]: At program point L210(lines 209 595) the Hoare annotation is: (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672)) [2021-08-25 20:02:30,473 INFO L857 garLoopResultBuilder]: For program point L78(lines 78 82) no Hoare annotation was computed. [2021-08-25 20:02:30,473 INFO L857 garLoopResultBuilder]: For program point L78-2(lines 75 83) no Hoare annotation was computed. [2021-08-25 20:02:30,473 INFO L857 garLoopResultBuilder]: For program point L541(lines 541 546) no Hoare annotation was computed. [2021-08-25 20:02:30,473 INFO L857 garLoopResultBuilder]: For program point L442(lines 442 447) no Hoare annotation was computed. [2021-08-25 20:02:30,474 INFO L857 garLoopResultBuilder]: For program point L409(lines 409 413) no Hoare annotation was computed. [2021-08-25 20:02:30,474 INFO L857 garLoopResultBuilder]: For program point L244(lines 244 249) no Hoare annotation was computed. [2021-08-25 20:02:30,474 INFO L857 garLoopResultBuilder]: For program point L179(lines 179 605) no Hoare annotation was computed. [2021-08-25 20:02:30,474 INFO L857 garLoopResultBuilder]: For program point L146(lines 146 616) no Hoare annotation was computed. [2021-08-25 20:02:30,474 INFO L857 garLoopResultBuilder]: For program point L113(lines 113 627) no Hoare annotation was computed. [2021-08-25 20:02:30,474 INFO L857 garLoopResultBuilder]: For program point L576(lines 576 586) no Hoare annotation was computed. [2021-08-25 20:02:30,474 INFO L857 garLoopResultBuilder]: For program point L576-1(lines 576 586) no Hoare annotation was computed. [2021-08-25 20:02:30,474 INFO L857 garLoopResultBuilder]: For program point L510(lines 510 514) no Hoare annotation was computed. [2021-08-25 20:02:30,475 INFO L857 garLoopResultBuilder]: For program point L510-2(lines 510 514) no Hoare annotation was computed. [2021-08-25 20:02:30,475 INFO L853 garLoopResultBuilder]: At program point L180(lines 176 606) 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:02:30,475 INFO L853 garLoopResultBuilder]: At program point L147(lines 143 617) 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:02:30,475 INFO L857 garLoopResultBuilder]: For program point L478(lines 478 482) no Hoare annotation was computed. [2021-08-25 20:02:30,475 INFO L853 garLoopResultBuilder]: At program point L214(lines 107 629) 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:02:30,476 INFO L860 garLoopResultBuilder]: At program point L677(lines 67 679) the Hoare annotation is: true [2021-08-25 20:02:30,476 INFO L857 garLoopResultBuilder]: For program point L644(lines 644 650) no Hoare annotation was computed. [2021-08-25 20:02:30,476 INFO L857 garLoopResultBuilder]: For program point L347(lines 347 379) no Hoare annotation was computed. [2021-08-25 20:02:30,476 INFO L857 garLoopResultBuilder]: For program point L314(lines 314 318) no Hoare annotation was computed. [2021-08-25 20:02:30,476 INFO L857 garLoopResultBuilder]: For program point L314-2(lines 314 318) no Hoare annotation was computed. [2021-08-25 20:02:30,476 INFO L857 garLoopResultBuilder]: For program point L182(lines 182 604) no Hoare annotation was computed. [2021-08-25 20:02:30,476 INFO L857 garLoopResultBuilder]: For program point L149(lines 149 615) no Hoare annotation was computed. [2021-08-25 20:02:30,476 INFO L857 garLoopResultBuilder]: For program point L116(lines 116 626) no Hoare annotation was computed. [2021-08-25 20:02:30,476 INFO L860 garLoopResultBuilder]: At program point L678(lines 12 680) the Hoare annotation is: true [2021-08-25 20:02:30,477 INFO L857 garLoopResultBuilder]: For program point L579(lines 579 583) no Hoare annotation was computed. [2021-08-25 20:02:30,477 INFO L857 garLoopResultBuilder]: For program point L85(lines 85 93) no Hoare annotation was computed. [2021-08-25 20:02:30,477 INFO L857 garLoopResultBuilder]: For program point L85-1(lines 67 679) no Hoare annotation was computed. [2021-08-25 20:02:30,477 INFO L857 garLoopResultBuilder]: For program point L350(lines 350 378) no Hoare annotation was computed. [2021-08-25 20:02:30,477 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-08-25 20:02:30,477 INFO L857 garLoopResultBuilder]: For program point L350-1(lines 350 378) no Hoare annotation was computed. [2021-08-25 20:02:30,477 INFO L857 garLoopResultBuilder]: For program point L251(lines 251 264) no Hoare annotation was computed. [2021-08-25 20:02:30,477 INFO L857 garLoopResultBuilder]: For program point L185(lines 185 603) no Hoare annotation was computed. [2021-08-25 20:02:30,478 INFO L857 garLoopResultBuilder]: For program point L152(lines 152 614) no Hoare annotation was computed. [2021-08-25 20:02:30,480 INFO L857 garLoopResultBuilder]: For program point L119(lines 119 625) no Hoare annotation was computed. [2021-08-25 20:02:30,480 INFO L857 garLoopResultBuilder]: For program point L86(lines 86 90) no Hoare annotation was computed. [2021-08-25 20:02:30,496 INFO L857 garLoopResultBuilder]: For program point L351(lines 351 375) no Hoare annotation was computed. [2021-08-25 20:02:30,497 INFO L857 garLoopResultBuilder]: For program point L219(lines 219 223) no Hoare annotation was computed. [2021-08-25 20:02:30,497 INFO L853 garLoopResultBuilder]: At program point L186(lines 182 604) 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:02:30,497 INFO L853 garLoopResultBuilder]: At program point L153(lines 149 615) 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:02:30,497 INFO L857 garLoopResultBuilder]: For program point L219-2(lines 211 592) no Hoare annotation was computed. [2021-08-25 20:02:30,498 INFO L857 garLoopResultBuilder]: For program point L253(lines 253 258) no Hoare annotation was computed. [2021-08-25 20:02:30,498 INFO L857 garLoopResultBuilder]: For program point L551(lines 551 559) no Hoare annotation was computed. [2021-08-25 20:02:30,498 INFO L857 garLoopResultBuilder]: For program point L287(lines 287 291) no Hoare annotation was computed. [2021-08-25 20:02:30,498 INFO L857 garLoopResultBuilder]: For program point L287-2(lines 211 592) no Hoare annotation was computed. [2021-08-25 20:02:30,498 INFO L857 garLoopResultBuilder]: For program point L188(lines 188 602) no Hoare annotation was computed. [2021-08-25 20:02:30,498 INFO L857 garLoopResultBuilder]: For program point L155(lines 155 613) no Hoare annotation was computed. [2021-08-25 20:02:30,498 INFO L857 garLoopResultBuilder]: For program point L122(lines 122 624) no Hoare annotation was computed. [2021-08-25 20:02:30,498 INFO L857 garLoopResultBuilder]: For program point L387(lines 387 418) no Hoare annotation was computed. [2021-08-25 20:02:30,499 INFO L857 garLoopResultBuilder]: For program point L354(lines 354 374) no Hoare annotation was computed. [2021-08-25 20:02:30,499 INFO L853 garLoopResultBuilder]: At program point L123(lines 119 625) 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:02:30,499 INFO L857 garLoopResultBuilder]: For program point L388(lines 388 394) no Hoare annotation was computed. [2021-08-25 20:02:30,499 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-08-25 20:02:30,499 INFO L857 garLoopResultBuilder]: For program point L554(lines 554 558) no Hoare annotation was computed. [2021-08-25 20:02:30,499 INFO L857 garLoopResultBuilder]: For program point L521(lines 521 526) no Hoare annotation was computed. [2021-08-25 20:02:30,499 INFO L857 garLoopResultBuilder]: For program point L356(lines 356 360) no Hoare annotation was computed. [2021-08-25 20:02:30,499 INFO L857 garLoopResultBuilder]: For program point L323-1(lines 323 332) no Hoare annotation was computed. [2021-08-25 20:02:30,500 INFO L857 garLoopResultBuilder]: For program point L356-2(lines 354 372) no Hoare annotation was computed. [2021-08-25 20:02:30,500 INFO L857 garLoopResultBuilder]: For program point L191(lines 191 601) no Hoare annotation was computed. [2021-08-25 20:02:30,500 INFO L857 garLoopResultBuilder]: For program point L158(lines 158 612) no Hoare annotation was computed. [2021-08-25 20:02:30,500 INFO L857 garLoopResultBuilder]: For program point L125(lines 125 623) no Hoare annotation was computed. [2021-08-25 20:02:30,500 INFO L853 garLoopResultBuilder]: At program point L555(lines 67 679) the Hoare annotation is: false [2021-08-25 20:02:30,500 INFO L857 garLoopResultBuilder]: For program point L489(lines 489 493) no Hoare annotation was computed. [2021-08-25 20:02:30,500 INFO L853 garLoopResultBuilder]: At program point L192(lines 188 602) 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:02:30,501 INFO L853 garLoopResultBuilder]: At program point L159(lines 155 613) 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:02:30,501 INFO L853 garLoopResultBuilder]: At program point L126(lines 125 623) 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:02:30,501 INFO L857 garLoopResultBuilder]: For program point L457(lines 457 461) no Hoare annotation was computed. [2021-08-25 20:02:30,501 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-08-25 20:02:30,501 INFO L857 garLoopResultBuilder]: For program point L194(lines 194 600) no Hoare annotation was computed. [2021-08-25 20:02:30,501 INFO L857 garLoopResultBuilder]: For program point L161(lines 161 611) no Hoare annotation was computed. [2021-08-25 20:02:30,502 INFO L857 garLoopResultBuilder]: For program point L128(lines 128 622) no Hoare annotation was computed. [2021-08-25 20:02:30,502 INFO L860 garLoopResultBuilder]: At program point L690(lines 681 692) the Hoare annotation is: true [2021-08-25 20:02:30,502 INFO L857 garLoopResultBuilder]: For program point L327(lines 327 331) no Hoare annotation was computed. [2021-08-25 20:02:30,502 INFO L853 garLoopResultBuilder]: At program point L593(lines 101 661) 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:02:30,503 INFO L857 garLoopResultBuilder]: For program point L560(lines 560 564) no Hoare annotation was computed. [2021-08-25 20:02:30,503 INFO L857 garLoopResultBuilder]: For program point L428(lines 428 432) no Hoare annotation was computed. [2021-08-25 20:02:30,503 INFO L853 garLoopResultBuilder]: At program point L362(lines 344 380) 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:02:30,503 INFO L857 garLoopResultBuilder]: For program point L197(lines 197 599) no Hoare annotation was computed. [2021-08-25 20:02:30,503 INFO L857 garLoopResultBuilder]: For program point L164(lines 164 610) no Hoare annotation was computed. [2021-08-25 20:02:30,503 INFO L857 garLoopResultBuilder]: For program point L131(lines 131 621) no Hoare annotation was computed. [2021-08-25 20:02:30,503 INFO L857 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-08-25 20:02:30,504 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 673) no Hoare annotation was computed. [2021-08-25 20:02:30,504 INFO L857 garLoopResultBuilder]: For program point L528(lines 528 532) no Hoare annotation was computed. [2021-08-25 20:02:30,504 INFO L857 garLoopResultBuilder]: For program point L462(lines 462 473) no Hoare annotation was computed. [2021-08-25 20:02:30,504 INFO L857 garLoopResultBuilder]: For program point L528-2(lines 211 592) no Hoare annotation was computed. [2021-08-25 20:02:30,504 INFO L853 garLoopResultBuilder]: At program point L396(lines 387 418) 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:02:30,504 INFO L857 garLoopResultBuilder]: For program point L231(lines 231 242) no Hoare annotation was computed. [2021-08-25 20:02:30,505 INFO L853 garLoopResultBuilder]: At program point L198(lines 194 600) 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:02:30,505 INFO L853 garLoopResultBuilder]: At program point L165(lines 161 611) 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 (= ULTIMATE.start_ssl3_accept_~s__state~0 8673))) (.cse3 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8672))) (.cse4 (not (= 8496 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse5 (not (= 8513 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8544))) (.cse7 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8481))) (.cse8 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8529))) (.cse9 (not (= 8576 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse10 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8657))) (.cse11 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8656))) (.cse12 (not (= 12292 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse13 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8545))) (.cse14 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8528))) (.cse15 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~0))) (.cse16 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8512)))) (or (and .cse0 (not (= 8577 ULTIMATE.start_ssl3_accept_~s__state~0)) .cse1 .cse2 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8592)) .cse3 .cse4 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8640)) .cse5 .cse6 (not (= ULTIMATE.start_ssl3_accept_~s__state~0 8608)) .cse7 .cse8 .cse9 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 3) .cse10 .cse11 .cse12 (not (= ULTIMATE.start_ssl3_accept_~s__hit~0 0)) .cse13 .cse14 .cse15 (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)) .cse16) (and .cse0 .cse1 .cse2 .cse3 (<= ULTIMATE.start_ssl3_accept_~s__state~0 8576) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (<= ULTIMATE.start_ssl3_accept_~blastFlag~0 2) (<= 8448 ULTIMATE.start_ssl3_accept_~s__state~0) .cse16))) [2021-08-25 20:02:30,505 INFO L857 garLoopResultBuilder]: For program point L231-2(lines 231 242) no Hoare annotation was computed. [2021-08-25 20:02:30,506 INFO L857 garLoopResultBuilder]: For program point L364(lines 364 368) no Hoare annotation was computed. [2021-08-25 20:02:30,507 INFO L860 garLoopResultBuilder]: At program point L662(lines 100 663) the Hoare annotation is: true [2021-08-25 20:02:30,507 INFO L857 garLoopResultBuilder]: For program point L398(lines 398 404) no Hoare annotation was computed. [2021-08-25 20:02:30,507 INFO L857 garLoopResultBuilder]: For program point L233(lines 233 238) no Hoare annotation was computed. [2021-08-25 20:02:30,507 INFO L857 garLoopResultBuilder]: For program point L200(lines 200 598) no Hoare annotation was computed. [2021-08-25 20:02:30,507 INFO L857 garLoopResultBuilder]: For program point L167(lines 167 609) no Hoare annotation was computed. [2021-08-25 20:02:30,507 INFO L857 garLoopResultBuilder]: For program point L134(lines 134 620) no Hoare annotation was computed. [2021-08-25 20:02:30,507 INFO L853 garLoopResultBuilder]: At program point L101-2(lines 101 661) 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:02:30,512 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-25 20:02:30,605 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.08 08:02:30 BoogieIcfgContainer [2021-08-25 20:02:30,605 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-25 20:02:30,606 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-25 20:02:30,606 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-25 20:02:30,606 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-25 20:02:30,606 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 08:02:02" (3/4) ... [2021-08-25 20:02:30,609 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-08-25 20:02:30,637 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2021-08-25 20:02:30,638 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-08-25 20:02:30,638 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-08-25 20:02:30,639 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-08-25 20:02:30,802 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-08-25 20:02:30,803 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-25 20:02:30,805 INFO L168 Benchmark]: Toolchain (without parser) took 30504.00 ms. Allocated memory was 48.2 MB in the beginning and 362.8 MB in the end (delta: 314.6 MB). Free memory was 25.7 MB in the beginning and 139.4 MB in the end (delta: -113.8 MB). Peak memory consumption was 199.4 MB. Max. memory is 16.1 GB. [2021-08-25 20:02:30,805 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 48.2 MB. Free memory was 30.9 MB in the beginning and 30.8 MB in the end (delta: 37.6 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-25 20:02:30,805 INFO L168 Benchmark]: CACSL2BoogieTranslator took 699.38 ms. Allocated memory was 48.2 MB in the beginning and 62.9 MB in the end (delta: 14.7 MB). Free memory was 25.4 MB in the beginning and 44.0 MB in the end (delta: -18.7 MB). Peak memory consumption was 8.1 MB. Max. memory is 16.1 GB. [2021-08-25 20:02:30,806 INFO L168 Benchmark]: Boogie Procedure Inliner took 105.46 ms. Allocated memory is still 62.9 MB. Free memory was 44.0 MB in the beginning and 41.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-25 20:02:30,806 INFO L168 Benchmark]: Boogie Preprocessor took 79.68 ms. Allocated memory is still 62.9 MB. Free memory was 41.3 MB in the beginning and 39.2 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:02:30,806 INFO L168 Benchmark]: RCFGBuilder took 1069.52 ms. Allocated memory was 62.9 MB in the beginning and 75.5 MB in the end (delta: 12.6 MB). Free memory was 39.2 MB in the beginning and 49.5 MB in the end (delta: -10.3 MB). Peak memory consumption was 15.5 MB. Max. memory is 16.1 GB. [2021-08-25 20:02:30,807 INFO L168 Benchmark]: TraceAbstraction took 28345.61 ms. Allocated memory was 75.5 MB in the beginning and 362.8 MB in the end (delta: 287.3 MB). Free memory was 49.1 MB in the beginning and 152.0 MB in the end (delta: -102.9 MB). Peak memory consumption was 222.1 MB. Max. memory is 16.1 GB. [2021-08-25 20:02:30,807 INFO L168 Benchmark]: Witness Printer took 197.51 ms. Allocated memory is still 362.8 MB. Free memory was 152.0 MB in the beginning and 139.4 MB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-08-25 20:02:30,811 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.17 ms. Allocated memory is still 48.2 MB. Free memory was 30.9 MB in the beginning and 30.8 MB in the end (delta: 37.6 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 699.38 ms. Allocated memory was 48.2 MB in the beginning and 62.9 MB in the end (delta: 14.7 MB). Free memory was 25.4 MB in the beginning and 44.0 MB in the end (delta: -18.7 MB). Peak memory consumption was 8.1 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 105.46 ms. Allocated memory is still 62.9 MB. Free memory was 44.0 MB in the beginning and 41.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 79.68 ms. Allocated memory is still 62.9 MB. Free memory was 41.3 MB in the beginning and 39.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1069.52 ms. Allocated memory was 62.9 MB in the beginning and 75.5 MB in the end (delta: 12.6 MB). Free memory was 39.2 MB in the beginning and 49.5 MB in the end (delta: -10.3 MB). Peak memory consumption was 15.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 28345.61 ms. Allocated memory was 75.5 MB in the beginning and 362.8 MB in the end (delta: 287.3 MB). Free memory was 49.1 MB in the beginning and 152.0 MB in the end (delta: -102.9 MB). Peak memory consumption was 222.1 MB. Max. memory is 16.1 GB. * Witness Printer took 197.51 ms. Allocated memory is still 362.8 MB. Free memory was 152.0 MB in the beginning and 139.4 MB in the end (delta: 12.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: 673]: 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, 140 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 28206.1ms, OverallIterations: 36, TraceHistogramMax: 25, EmptinessCheckTime: 172.0ms, AutomataDifference: 8843.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 8200.5ms, InitialAbstractionConstructionTime: 10.7ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 5501 SDtfs, 4923 SDslu, 1862 SDs, 0 SdLazy, 3385 SolverSat, 1374 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5076.7ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1347 GetRequests, 1303 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 198.6ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=2971occurred 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: 1545.3ms AutomataMinimizationTime, 36 MinimizatonAttempts, 1622 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: 0.0ms HoareAnnotationTime, 29 LocationsWithAnnotation, 29 PreInvPairs, 210 NumberOfFragments, 3533 HoareAnnotationTreeSize, 29 FomulaSimplifications, 29761 FormulaSimplificationTreeSizeReduction, 784.3ms HoareSimplificationTime, 29 FomulaSimplificationsInter, 7321 FormulaSimplificationTreeSizeReductionInter, 7390.8ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 228.1ms SsaConstructionTime, 878.5ms SatisfiabilityAnalysisTime, 6282.5ms InterpolantComputationTime, 9390 NumberOfCodeBlocks, 9390 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 9351 ConstructedInterpolants, 0 QuantifiedInterpolants, 12986 SizeOfPredicates, 2 NumberOfNonLiveVariables, 1997 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: 12]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 176]: 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: 125]: 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: 167]: 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: 194]: 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: 128]: 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: 206]: Loop Invariant Derived loop invariant: !(s__state == 8672) - InvariantResult [Line: 397]: 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: 155]: 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: 67]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 149]: 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: 200]: 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: 209]: Loop Invariant Derived loop invariant: !(s__state == 8672) - InvariantResult [Line: 101]: 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: 161]: 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 == 8673)) && !(s__state == 8672)) && s__state <= 8576) && !(8496 == s__state)) && !(8513 == s__state)) && !(s__state == 8544)) && !(s__state == 8481)) && !(s__state == 8529)) && !(8576 == s__state)) && !(s__state == 8657)) && !(s__state == 8656)) && !(12292 == s__state)) && !(s__state == 8545)) && !(s__state == 8528)) && !(8448 == s__state)) && blastFlag <= 2) && 8448 <= s__state) && !(s__state == 8512)) - InvariantResult [Line: 137]: 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: 100]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 143]: 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: 101]: 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: 104]: 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: 681]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 119]: 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: 387]: 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: 107]: 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: 344]: 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: 188]: 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: 67]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 170]: 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: 182]: 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)) RESULT: Ultimate proved your program to be correct! [2021-08-25 20:02:30,898 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...