./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/bitvector/s3_srvr_2a.BV.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 791161d1 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_2a.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 b8cfead7c1f307a9ba2676fad86c005fa434c5b4bc168c34fe90a644ea9973b2 --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-22 11:03:39,263 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 11:03:39,265 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 11:03:39,310 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 11:03:39,311 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 11:03:39,312 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 11:03:39,315 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 11:03:39,317 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 11:03:39,319 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 11:03:39,323 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 11:03:39,324 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 11:03:39,326 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 11:03:39,326 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 11:03:39,328 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 11:03:39,329 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 11:03:39,332 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 11:03:39,332 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 11:03:39,334 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 11:03:39,335 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 11:03:39,340 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 11:03:39,342 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 11:03:39,343 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 11:03:39,344 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 11:03:39,345 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 11:03:39,346 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 11:03:39,352 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 11:03:39,353 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 11:03:39,353 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 11:03:39,354 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 11:03:39,355 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 11:03:39,356 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 11:03:39,356 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 11:03:39,358 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 11:03:39,358 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 11:03:39,359 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 11:03:39,360 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 11:03:39,360 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 11:03:39,361 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 11:03:39,362 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 11:03:39,362 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 11:03:39,363 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 11:03:39,364 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 11:03:39,366 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-22 11:03:39,395 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 11:03:39,395 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 11:03:39,396 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 11:03:39,396 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 11:03:39,396 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-22 11:03:39,397 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-22 11:03:39,397 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 11:03:39,398 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 11:03:39,398 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 11:03:39,399 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 11:03:39,399 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 11:03:39,399 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 11:03:39,399 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 11:03:39,400 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 11:03:39,400 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-22 11:03:39,400 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-22 11:03:39,400 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-22 11:03:39,401 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 11:03:39,401 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 11:03:39,401 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 11:03:39,401 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-22 11:03:39,401 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 11:03:39,402 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 11:03:39,402 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-22 11:03:39,403 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 11:03:39,403 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 11:03:39,403 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-22 11:03:39,404 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-22 11:03:39,404 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 11:03:39,404 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-22 11:03:39,404 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 11:03:39,404 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-22 11:03:39,405 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-22 11:03:39,405 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 -> b8cfead7c1f307a9ba2676fad86c005fa434c5b4bc168c34fe90a644ea9973b2 [2022-07-22 11:03:39,637 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 11:03:39,660 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 11:03:39,663 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 11:03:39,664 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 11:03:39,665 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 11:03:39,666 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/s3_srvr_2a.BV.c.cil.c [2022-07-22 11:03:39,722 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c188204d/d6060f1eac724b3a89291c69263af9d5/FLAGb2065af79 [2022-07-22 11:03:40,095 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 11:03:40,096 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/s3_srvr_2a.BV.c.cil.c [2022-07-22 11:03:40,107 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c188204d/d6060f1eac724b3a89291c69263af9d5/FLAGb2065af79 [2022-07-22 11:03:40,502 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c188204d/d6060f1eac724b3a89291c69263af9d5 [2022-07-22 11:03:40,504 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 11:03:40,506 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 11:03:40,507 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 11:03:40,507 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 11:03:40,516 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 11:03:40,517 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 11:03:40" (1/1) ... [2022-07-22 11:03:40,517 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53dc5775 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:03:40, skipping insertion in model container [2022-07-22 11:03:40,518 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 11:03:40" (1/1) ... [2022-07-22 11:03:40,523 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 11:03:40,570 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 11:03:40,811 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/s3_srvr_2a.BV.c.cil.c[44872,44885] [2022-07-22 11:03:40,817 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 11:03:40,824 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 11:03:40,863 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/s3_srvr_2a.BV.c.cil.c[44872,44885] [2022-07-22 11:03:40,866 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 11:03:40,876 INFO L208 MainTranslator]: Completed translation [2022-07-22 11:03:40,876 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:03:40 WrapperNode [2022-07-22 11:03:40,877 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 11:03:40,878 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 11:03:40,878 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 11:03:40,878 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 11:03:40,886 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:03:40" (1/1) ... [2022-07-22 11:03:40,895 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:03:40" (1/1) ... [2022-07-22 11:03:40,933 INFO L137 Inliner]: procedures = 15, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 528 [2022-07-22 11:03:40,933 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 11:03:40,934 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 11:03:40,934 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 11:03:40,934 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 11:03:40,941 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:03:40" (1/1) ... [2022-07-22 11:03:40,942 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:03:40" (1/1) ... [2022-07-22 11:03:40,947 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:03:40" (1/1) ... [2022-07-22 11:03:40,956 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:03:40" (1/1) ... [2022-07-22 11:03:40,963 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:03:40" (1/1) ... [2022-07-22 11:03:40,981 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:03:40" (1/1) ... [2022-07-22 11:03:40,983 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:03:40" (1/1) ... [2022-07-22 11:03:40,986 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 11:03:40,992 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 11:03:40,992 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 11:03:40,992 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 11:03:40,993 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:03:40" (1/1) ... [2022-07-22 11:03:41,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 11:03:41,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:03:41,029 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) [2022-07-22 11:03:41,036 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 [2022-07-22 11:03:41,063 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 11:03:41,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 11:03:41,064 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 11:03:41,064 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 11:03:41,136 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 11:03:41,137 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 11:03:41,151 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-22 11:03:41,521 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2022-07-22 11:03:41,522 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2022-07-22 11:03:41,522 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 11:03:41,529 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 11:03:41,529 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-22 11:03:41,531 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 11:03:41 BoogieIcfgContainer [2022-07-22 11:03:41,531 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 11:03:41,532 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-22 11:03:41,533 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-22 11:03:41,535 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-22 11:03:41,536 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 11:03:40" (1/3) ... [2022-07-22 11:03:41,536 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c649a1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 11:03:41, skipping insertion in model container [2022-07-22 11:03:41,536 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:03:40" (2/3) ... [2022-07-22 11:03:41,537 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c649a1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 11:03:41, skipping insertion in model container [2022-07-22 11:03:41,537 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 11:03:41" (3/3) ... [2022-07-22 11:03:41,538 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr_2a.BV.c.cil.c [2022-07-22 11:03:41,558 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-22 11:03:41,572 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-22 11:03:41,615 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-22 11:03:41,621 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@33ae20ea, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2395ad7 [2022-07-22 11:03:41,621 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-22 11:03:41,625 INFO L276 IsEmpty]: Start isEmpty. Operand has 138 states, 136 states have (on average 1.7426470588235294) internal successors, (237), 137 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:03:41,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-22 11:03:41,634 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:03:41,634 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:03:41,635 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:03:41,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:03:41,640 INFO L85 PathProgramCache]: Analyzing trace with hash 1632002022, now seen corresponding path program 1 times [2022-07-22 11:03:41,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:03:41,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972413230] [2022-07-22 11:03:41,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:03:41,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:03:41,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:03:41,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 11:03:41,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:03:41,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972413230] [2022-07-22 11:03:41,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972413230] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:03:41,867 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:03:41,867 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 11:03:41,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766083888] [2022-07-22 11:03:41,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:03:41,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 11:03:41,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:03:41,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 11:03:41,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:03:41,897 INFO L87 Difference]: Start difference. First operand has 138 states, 136 states have (on average 1.7426470588235294) internal successors, (237), 137 states have internal predecessors, (237), 0 states have call successors, (0), 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) [2022-07-22 11:03:42,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:03:42,157 INFO L93 Difference]: Finished difference Result 317 states and 547 transitions. [2022-07-22 11:03:42,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 11:03:42,160 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 [2022-07-22 11:03:42,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:03:42,168 INFO L225 Difference]: With dead ends: 317 [2022-07-22 11:03:42,168 INFO L226 Difference]: Without dead ends: 161 [2022-07-22 11:03:42,179 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:03:42,182 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 156 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-22 11:03:42,183 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 177 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-22 11:03:42,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2022-07-22 11:03:42,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 156. [2022-07-22 11:03:42,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 155 states have (on average 1.6) internal successors, (248), 155 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:03:42,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 248 transitions. [2022-07-22 11:03:42,225 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 248 transitions. Word has length 44 [2022-07-22 11:03:42,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:03:42,226 INFO L495 AbstractCegarLoop]: Abstraction has 156 states and 248 transitions. [2022-07-22 11:03:42,226 INFO L496 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) [2022-07-22 11:03:42,226 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 248 transitions. [2022-07-22 11:03:42,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-22 11:03:42,228 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:03:42,228 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:03:42,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-22 11:03:42,229 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:03:42,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:03:42,230 INFO L85 PathProgramCache]: Analyzing trace with hash -954580408, now seen corresponding path program 1 times [2022-07-22 11:03:42,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:03:42,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699105174] [2022-07-22 11:03:42,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:03:42,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:03:42,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:03:42,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 11:03:42,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:03:42,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699105174] [2022-07-22 11:03:42,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699105174] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:03:42,311 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:03:42,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 11:03:42,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105102606] [2022-07-22 11:03:42,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:03:42,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 11:03:42,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:03:42,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 11:03:42,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:03:42,314 INFO L87 Difference]: Start difference. First operand 156 states and 248 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) [2022-07-22 11:03:42,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:03:42,481 INFO L93 Difference]: Finished difference Result 352 states and 565 transitions. [2022-07-22 11:03:42,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 11:03:42,481 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 [2022-07-22 11:03:42,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:03:42,486 INFO L225 Difference]: With dead ends: 352 [2022-07-22 11:03:42,486 INFO L226 Difference]: Without dead ends: 202 [2022-07-22 11:03:42,487 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:03:42,488 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 110 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 11:03:42,488 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 126 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 11:03:42,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2022-07-22 11:03:42,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 197. [2022-07-22 11:03:42,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 196 states have (on average 1.6326530612244898) internal successors, (320), 196 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:03:42,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 320 transitions. [2022-07-22 11:03:42,509 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 320 transitions. Word has length 45 [2022-07-22 11:03:42,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:03:42,509 INFO L495 AbstractCegarLoop]: Abstraction has 197 states and 320 transitions. [2022-07-22 11:03:42,510 INFO L496 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) [2022-07-22 11:03:42,510 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 320 transitions. [2022-07-22 11:03:42,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-07-22 11:03:42,518 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:03:42,519 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-22 11:03:42,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-22 11:03:42,519 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:03:42,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:03:42,523 INFO L85 PathProgramCache]: Analyzing trace with hash 2033157093, now seen corresponding path program 1 times [2022-07-22 11:03:42,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:03:42,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022330235] [2022-07-22 11:03:42,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:03:42,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:03:42,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:03:42,591 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 11:03:42,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:03:42,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022330235] [2022-07-22 11:03:42,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022330235] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:03:42,592 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:03:42,592 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 11:03:42,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132422608] [2022-07-22 11:03:42,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:03:42,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 11:03:42,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:03:42,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 11:03:42,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:03:42,594 INFO L87 Difference]: Start difference. First operand 197 states and 320 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) [2022-07-22 11:03:42,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:03:42,621 INFO L93 Difference]: Finished difference Result 569 states and 929 transitions. [2022-07-22 11:03:42,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 11:03:42,622 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 60 [2022-07-22 11:03:42,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:03:42,624 INFO L225 Difference]: With dead ends: 569 [2022-07-22 11:03:42,624 INFO L226 Difference]: Without dead ends: 380 [2022-07-22 11:03:42,626 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:03:42,627 INFO L413 NwaCegarLoop]: 312 mSDtfsCounter, 111 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 11:03:42,627 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 475 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 11:03:42,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2022-07-22 11:03:42,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 380. [2022-07-22 11:03:42,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 379 states have (on average 1.6279683377308707) internal successors, (617), 379 states have internal predecessors, (617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:03:42,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 617 transitions. [2022-07-22 11:03:42,654 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 617 transitions. Word has length 60 [2022-07-22 11:03:42,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:03:42,654 INFO L495 AbstractCegarLoop]: Abstraction has 380 states and 617 transitions. [2022-07-22 11:03:42,654 INFO L496 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) [2022-07-22 11:03:42,654 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 617 transitions. [2022-07-22 11:03:42,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-07-22 11:03:42,657 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:03:42,657 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-22 11:03:42,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-22 11:03:42,657 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:03:42,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:03:42,658 INFO L85 PathProgramCache]: Analyzing trace with hash -2013663709, now seen corresponding path program 1 times [2022-07-22 11:03:42,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:03:42,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610784366] [2022-07-22 11:03:42,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:03:42,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:03:42,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:03:42,748 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 11:03:42,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:03:42,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610784366] [2022-07-22 11:03:42,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610784366] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:03:42,749 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:03:42,749 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 11:03:42,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780813961] [2022-07-22 11:03:42,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:03:42,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 11:03:42,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:03:42,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 11:03:42,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:03:42,751 INFO L87 Difference]: Start difference. First operand 380 states and 617 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) [2022-07-22 11:03:42,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:03:42,782 INFO L93 Difference]: Finished difference Result 938 states and 1528 transitions. [2022-07-22 11:03:42,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 11:03:42,783 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 60 [2022-07-22 11:03:42,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:03:42,785 INFO L225 Difference]: With dead ends: 938 [2022-07-22 11:03:42,786 INFO L226 Difference]: Without dead ends: 566 [2022-07-22 11:03:42,787 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:03:42,789 INFO L413 NwaCegarLoop]: 177 mSDtfsCounter, 148 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 11:03:42,789 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 330 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 11:03:42,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2022-07-22 11:03:42,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 566. [2022-07-22 11:03:42,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 565 states have (on average 1.6247787610619469) internal successors, (918), 565 states have internal predecessors, (918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:03:42,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 918 transitions. [2022-07-22 11:03:42,810 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 918 transitions. Word has length 60 [2022-07-22 11:03:42,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:03:42,811 INFO L495 AbstractCegarLoop]: Abstraction has 566 states and 918 transitions. [2022-07-22 11:03:42,811 INFO L496 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) [2022-07-22 11:03:42,811 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 918 transitions. [2022-07-22 11:03:42,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-07-22 11:03:42,818 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:03:42,818 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:03:42,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-22 11:03:42,819 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:03:42,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:03:42,821 INFO L85 PathProgramCache]: Analyzing trace with hash -1930486570, now seen corresponding path program 1 times [2022-07-22 11:03:42,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:03:42,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537928173] [2022-07-22 11:03:42,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:03:42,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:03:42,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:03:42,923 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-22 11:03:42,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:03:42,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537928173] [2022-07-22 11:03:42,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537928173] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:03:42,924 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:03:42,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 11:03:42,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472398986] [2022-07-22 11:03:42,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:03:42,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 11:03:42,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:03:42,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 11:03:42,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:03:42,926 INFO L87 Difference]: Start difference. First operand 566 states and 918 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:03:43,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:03:43,079 INFO L93 Difference]: Finished difference Result 1336 states and 2193 transitions. [2022-07-22 11:03:43,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 11:03:43,080 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2022-07-22 11:03:43,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:03:43,084 INFO L225 Difference]: With dead ends: 1336 [2022-07-22 11:03:43,085 INFO L226 Difference]: Without dead ends: 778 [2022-07-22 11:03:43,086 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:03:43,096 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 43 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 11:03:43,097 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 263 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 11:03:43,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 778 states. [2022-07-22 11:03:43,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 778 to 766. [2022-07-22 11:03:43,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 766 states, 765 states have (on average 1.461437908496732) internal successors, (1118), 765 states have internal predecessors, (1118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:03:43,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 766 states to 766 states and 1118 transitions. [2022-07-22 11:03:43,121 INFO L78 Accepts]: Start accepts. Automaton has 766 states and 1118 transitions. Word has length 97 [2022-07-22 11:03:43,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:03:43,123 INFO L495 AbstractCegarLoop]: Abstraction has 766 states and 1118 transitions. [2022-07-22 11:03:43,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:03:43,124 INFO L276 IsEmpty]: Start isEmpty. Operand 766 states and 1118 transitions. [2022-07-22 11:03:43,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-07-22 11:03:43,126 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:03:43,126 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:03:43,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-22 11:03:43,127 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:03:43,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:03:43,127 INFO L85 PathProgramCache]: Analyzing trace with hash -1496757484, now seen corresponding path program 1 times [2022-07-22 11:03:43,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:03:43,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489609184] [2022-07-22 11:03:43,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:03:43,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:03:43,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:03:43,182 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-22 11:03:43,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:03:43,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489609184] [2022-07-22 11:03:43,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489609184] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:03:43,183 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:03:43,183 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 11:03:43,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766391782] [2022-07-22 11:03:43,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:03:43,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 11:03:43,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:03:43,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 11:03:43,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:03:43,185 INFO L87 Difference]: Start difference. First operand 766 states and 1118 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:03:43,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:03:43,334 INFO L93 Difference]: Finished difference Result 1653 states and 2450 transitions. [2022-07-22 11:03:43,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 11:03:43,334 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2022-07-22 11:03:43,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:03:43,338 INFO L225 Difference]: With dead ends: 1653 [2022-07-22 11:03:43,338 INFO L226 Difference]: Without dead ends: 895 [2022-07-22 11:03:43,339 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:03:43,340 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 81 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 11:03:43,341 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 224 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 11:03:43,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 895 states. [2022-07-22 11:03:43,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 895 to 859. [2022-07-22 11:03:43,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 859 states, 858 states have (on average 1.456876456876457) internal successors, (1250), 858 states have internal predecessors, (1250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:03:43,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 859 states to 859 states and 1250 transitions. [2022-07-22 11:03:43,364 INFO L78 Accepts]: Start accepts. Automaton has 859 states and 1250 transitions. Word has length 97 [2022-07-22 11:03:43,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:03:43,365 INFO L495 AbstractCegarLoop]: Abstraction has 859 states and 1250 transitions. [2022-07-22 11:03:43,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:03:43,365 INFO L276 IsEmpty]: Start isEmpty. Operand 859 states and 1250 transitions. [2022-07-22 11:03:43,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-07-22 11:03:43,367 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:03:43,368 INFO L195 NwaCegarLoop]: 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] [2022-07-22 11:03:43,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-22 11:03:43,368 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:03:43,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:03:43,369 INFO L85 PathProgramCache]: Analyzing trace with hash -1340556462, now seen corresponding path program 1 times [2022-07-22 11:03:43,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:03:43,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697036191] [2022-07-22 11:03:43,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:03:43,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:03:43,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:03:43,422 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-07-22 11:03:43,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:03:43,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697036191] [2022-07-22 11:03:43,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697036191] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:03:43,423 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:03:43,423 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 11:03:43,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788034721] [2022-07-22 11:03:43,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:03:43,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 11:03:43,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:03:43,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 11:03:43,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:03:43,425 INFO L87 Difference]: Start difference. First operand 859 states and 1250 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) [2022-07-22 11:03:43,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:03:43,458 INFO L93 Difference]: Finished difference Result 1746 states and 2558 transitions. [2022-07-22 11:03:43,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 11:03:43,458 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 [2022-07-22 11:03:43,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:03:43,463 INFO L225 Difference]: With dead ends: 1746 [2022-07-22 11:03:43,463 INFO L226 Difference]: Without dead ends: 1153 [2022-07-22 11:03:43,464 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:03:43,465 INFO L413 NwaCegarLoop]: 321 mSDtfsCounter, 111 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 11:03:43,465 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 484 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 11:03:43,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1153 states. [2022-07-22 11:03:43,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1153 to 1153. [2022-07-22 11:03:43,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1153 states, 1152 states have (on average 1.4592013888888888) internal successors, (1681), 1152 states have internal predecessors, (1681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:03:43,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1153 states to 1153 states and 1681 transitions. [2022-07-22 11:03:43,491 INFO L78 Accepts]: Start accepts. Automaton has 1153 states and 1681 transitions. Word has length 121 [2022-07-22 11:03:43,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:03:43,491 INFO L495 AbstractCegarLoop]: Abstraction has 1153 states and 1681 transitions. [2022-07-22 11:03:43,492 INFO L496 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) [2022-07-22 11:03:43,492 INFO L276 IsEmpty]: Start isEmpty. Operand 1153 states and 1681 transitions. [2022-07-22 11:03:43,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-07-22 11:03:43,494 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:03:43,494 INFO L195 NwaCegarLoop]: 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] [2022-07-22 11:03:43,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-22 11:03:43,495 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:03:43,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:03:43,495 INFO L85 PathProgramCache]: Analyzing trace with hash 2057017556, now seen corresponding path program 1 times [2022-07-22 11:03:43,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:03:43,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748835676] [2022-07-22 11:03:43,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:03:43,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:03:43,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:03:43,553 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-22 11:03:43,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:03:43,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748835676] [2022-07-22 11:03:43,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748835676] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:03:43,554 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:03:43,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 11:03:43,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149438409] [2022-07-22 11:03:43,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:03:43,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 11:03:43,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:03:43,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 11:03:43,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:03:43,556 INFO L87 Difference]: Start difference. First operand 1153 states and 1681 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:03:43,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:03:43,591 INFO L93 Difference]: Finished difference Result 2297 states and 3379 transitions. [2022-07-22 11:03:43,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 11:03:43,592 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 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 [2022-07-22 11:03:43,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:03:43,596 INFO L225 Difference]: With dead ends: 2297 [2022-07-22 11:03:43,597 INFO L226 Difference]: Without dead ends: 1410 [2022-07-22 11:03:43,598 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:03:43,599 INFO L413 NwaCegarLoop]: 322 mSDtfsCounter, 113 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 11:03:43,599 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 485 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 11:03:43,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1410 states. [2022-07-22 11:03:43,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1410 to 1410. [2022-07-22 11:03:43,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1410 states, 1409 states have (on average 1.4698367636621719) internal successors, (2071), 1409 states have internal predecessors, (2071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:03:43,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1410 states to 1410 states and 2071 transitions. [2022-07-22 11:03:43,630 INFO L78 Accepts]: Start accepts. Automaton has 1410 states and 2071 transitions. Word has length 121 [2022-07-22 11:03:43,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:03:43,631 INFO L495 AbstractCegarLoop]: Abstraction has 1410 states and 2071 transitions. [2022-07-22 11:03:43,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:03:43,631 INFO L276 IsEmpty]: Start isEmpty. Operand 1410 states and 2071 transitions. [2022-07-22 11:03:43,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2022-07-22 11:03:43,635 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:03:43,635 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:03:43,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-22 11:03:43,635 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:03:43,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:03:43,636 INFO L85 PathProgramCache]: Analyzing trace with hash -860101462, now seen corresponding path program 1 times [2022-07-22 11:03:43,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:03:43,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449172326] [2022-07-22 11:03:43,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:03:43,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:03:43,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:03:43,717 INFO L134 CoverageAnalysis]: Checked inductivity of 434 backedges. 299 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2022-07-22 11:03:43,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:03:43,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449172326] [2022-07-22 11:03:43,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449172326] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:03:43,722 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:03:43,722 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 11:03:43,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626326350] [2022-07-22 11:03:43,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:03:43,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 11:03:43,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:03:43,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 11:03:43,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:03:43,724 INFO L87 Difference]: Start difference. First operand 1410 states and 2071 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:03:43,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:03:43,871 INFO L93 Difference]: Finished difference Result 3017 states and 4490 transitions. [2022-07-22 11:03:43,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 11:03:43,872 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 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 [2022-07-22 11:03:43,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:03:43,878 INFO L225 Difference]: With dead ends: 3017 [2022-07-22 11:03:43,878 INFO L226 Difference]: Without dead ends: 1565 [2022-07-22 11:03:43,880 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:03:43,882 INFO L413 NwaCegarLoop]: 174 mSDtfsCounter, 34 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 11:03:43,883 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 255 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 11:03:43,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1565 states. [2022-07-22 11:03:43,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1565 to 1565. [2022-07-22 11:03:43,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1565 states, 1564 states have (on average 1.4392583120204603) internal successors, (2251), 1564 states have internal predecessors, (2251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:03:43,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1565 states to 1565 states and 2251 transitions. [2022-07-22 11:03:43,938 INFO L78 Accepts]: Start accepts. Automaton has 1565 states and 2251 transitions. Word has length 225 [2022-07-22 11:03:43,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:03:43,939 INFO L495 AbstractCegarLoop]: Abstraction has 1565 states and 2251 transitions. [2022-07-22 11:03:43,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:03:43,939 INFO L276 IsEmpty]: Start isEmpty. Operand 1565 states and 2251 transitions. [2022-07-22 11:03:43,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2022-07-22 11:03:43,944 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:03:43,944 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:03:43,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-22 11:03:43,944 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:03:43,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:03:43,945 INFO L85 PathProgramCache]: Analyzing trace with hash -482554043, now seen corresponding path program 1 times [2022-07-22 11:03:43,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:03:43,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764137439] [2022-07-22 11:03:43,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:03:43,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:03:43,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:03:44,033 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 430 proven. 16 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2022-07-22 11:03:44,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:03:44,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764137439] [2022-07-22 11:03:44,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764137439] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 11:03:44,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [508535375] [2022-07-22 11:03:44,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:03:44,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 11:03:44,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:03:44,043 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) [2022-07-22 11:03:44,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-22 11:03:44,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:03:44,162 INFO L263 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-22 11:03:44,170 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 11:03:44,282 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 430 proven. 16 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2022-07-22 11:03:44,282 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 11:03:44,410 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 430 proven. 16 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2022-07-22 11:03:44,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [508535375] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 11:03:44,410 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 11:03:44,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-07-22 11:03:44,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46038992] [2022-07-22 11:03:44,410 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 11:03:44,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-22 11:03:44,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:03:44,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 11:03:44,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-22 11:03:44,412 INFO L87 Difference]: Start difference. First operand 1565 states and 2251 transitions. Second operand has 6 states, 6 states have (on average 34.333333333333336) internal successors, (206), 6 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:03:45,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:03:45,133 INFO L93 Difference]: Finished difference Result 6075 states and 8721 transitions. [2022-07-22 11:03:45,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-22 11:03:45,134 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 34.333333333333336) internal successors, (206), 6 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 253 [2022-07-22 11:03:45,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:03:45,148 INFO L225 Difference]: With dead ends: 6075 [2022-07-22 11:03:45,148 INFO L226 Difference]: Without dead ends: 4518 [2022-07-22 11:03:45,152 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 514 GetRequests, 507 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-07-22 11:03:45,152 INFO L413 NwaCegarLoop]: 421 mSDtfsCounter, 336 mSDsluCounter, 806 mSDsCounter, 0 mSdLazyCounter, 914 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 1227 SdHoareTripleChecker+Invalid, 973 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 914 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-22 11:03:45,152 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 1227 Invalid, 973 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 914 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-22 11:03:45,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4518 states. [2022-07-22 11:03:45,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4518 to 3398. [2022-07-22 11:03:45,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3398 states, 3397 states have (on average 1.40270827200471) internal successors, (4765), 3397 states have internal predecessors, (4765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:03:45,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3398 states to 3398 states and 4765 transitions. [2022-07-22 11:03:45,265 INFO L78 Accepts]: Start accepts. Automaton has 3398 states and 4765 transitions. Word has length 253 [2022-07-22 11:03:45,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:03:45,266 INFO L495 AbstractCegarLoop]: Abstraction has 3398 states and 4765 transitions. [2022-07-22 11:03:45,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 34.333333333333336) internal successors, (206), 6 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:03:45,266 INFO L276 IsEmpty]: Start isEmpty. Operand 3398 states and 4765 transitions. [2022-07-22 11:03:45,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2022-07-22 11:03:45,274 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:03:45,274 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:03:45,304 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-22 11:03:45,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-07-22 11:03:45,501 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:03:45,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:03:45,502 INFO L85 PathProgramCache]: Analyzing trace with hash -193734653, now seen corresponding path program 1 times [2022-07-22 11:03:45,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:03:45,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680409807] [2022-07-22 11:03:45,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:03:45,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:03:45,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:03:45,555 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 400 proven. 0 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2022-07-22 11:03:45,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:03:45,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680409807] [2022-07-22 11:03:45,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680409807] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:03:45,556 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:03:45,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 11:03:45,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941814097] [2022-07-22 11:03:45,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:03:45,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 11:03:45,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:03:45,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 11:03:45,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:03:45,558 INFO L87 Difference]: Start difference. First operand 3398 states and 4765 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) [2022-07-22 11:03:45,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:03:45,671 INFO L93 Difference]: Finished difference Result 9681 states and 13694 transitions. [2022-07-22 11:03:45,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 11:03:45,672 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 253 [2022-07-22 11:03:45,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:03:45,687 INFO L225 Difference]: With dead ends: 9681 [2022-07-22 11:03:45,687 INFO L226 Difference]: Without dead ends: 4220 [2022-07-22 11:03:45,694 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:03:45,694 INFO L413 NwaCegarLoop]: 325 mSDtfsCounter, 109 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 11:03:45,695 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 492 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 11:03:45,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4220 states. [2022-07-22 11:03:45,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4220 to 3918. [2022-07-22 11:03:45,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3918 states, 3917 states have (on average 1.4237937196834312) internal successors, (5577), 3917 states have internal predecessors, (5577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:03:45,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3918 states to 3918 states and 5577 transitions. [2022-07-22 11:03:45,817 INFO L78 Accepts]: Start accepts. Automaton has 3918 states and 5577 transitions. Word has length 253 [2022-07-22 11:03:45,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:03:45,817 INFO L495 AbstractCegarLoop]: Abstraction has 3918 states and 5577 transitions. [2022-07-22 11:03:45,818 INFO L496 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) [2022-07-22 11:03:45,818 INFO L276 IsEmpty]: Start isEmpty. Operand 3918 states and 5577 transitions. [2022-07-22 11:03:45,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2022-07-22 11:03:45,826 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:03:45,826 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:03:45,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-22 11:03:45,827 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:03:45,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:03:45,827 INFO L85 PathProgramCache]: Analyzing trace with hash -1163625151, now seen corresponding path program 1 times [2022-07-22 11:03:45,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:03:45,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016549566] [2022-07-22 11:03:45,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:03:45,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:03:45,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:03:45,876 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 255 proven. 0 refuted. 0 times theorem prover too weak. 326 trivial. 0 not checked. [2022-07-22 11:03:45,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:03:45,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016549566] [2022-07-22 11:03:45,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016549566] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:03:45,877 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:03:45,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 11:03:45,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774141141] [2022-07-22 11:03:45,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:03:45,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 11:03:45,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:03:45,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 11:03:45,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:03:45,879 INFO L87 Difference]: Start difference. First operand 3918 states and 5577 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:03:46,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:03:46,020 INFO L93 Difference]: Finished difference Result 8008 states and 11372 transitions. [2022-07-22 11:03:46,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 11:03:46,020 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 253 [2022-07-22 11:03:46,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:03:46,034 INFO L225 Difference]: With dead ends: 8008 [2022-07-22 11:03:46,034 INFO L226 Difference]: Without dead ends: 4098 [2022-07-22 11:03:46,040 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:03:46,040 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 12 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 11:03:46,041 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 272 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 11:03:46,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4098 states. [2022-07-22 11:03:46,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4098 to 4056. [2022-07-22 11:03:46,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4056 states, 4055 states have (on average 1.4167694204685573) internal successors, (5745), 4055 states have internal predecessors, (5745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:03:46,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4056 states to 4056 states and 5745 transitions. [2022-07-22 11:03:46,160 INFO L78 Accepts]: Start accepts. Automaton has 4056 states and 5745 transitions. Word has length 253 [2022-07-22 11:03:46,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:03:46,161 INFO L495 AbstractCegarLoop]: Abstraction has 4056 states and 5745 transitions. [2022-07-22 11:03:46,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:03:46,161 INFO L276 IsEmpty]: Start isEmpty. Operand 4056 states and 5745 transitions. [2022-07-22 11:03:46,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2022-07-22 11:03:46,168 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:03:46,168 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:03:46,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-22 11:03:46,169 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:03:46,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:03:46,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1335839441, now seen corresponding path program 1 times [2022-07-22 11:03:46,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:03:46,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837028543] [2022-07-22 11:03:46,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:03:46,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:03:46,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:03:46,218 INFO L134 CoverageAnalysis]: Checked inductivity of 714 backedges. 369 proven. 0 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2022-07-22 11:03:46,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:03:46,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837028543] [2022-07-22 11:03:46,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837028543] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:03:46,219 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:03:46,219 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 11:03:46,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761751799] [2022-07-22 11:03:46,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:03:46,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 11:03:46,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:03:46,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 11:03:46,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:03:46,220 INFO L87 Difference]: Start difference. First operand 4056 states and 5745 transitions. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:03:46,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:03:46,375 INFO L93 Difference]: Finished difference Result 8622 states and 12220 transitions. [2022-07-22 11:03:46,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 11:03:46,376 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 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 273 [2022-07-22 11:03:46,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:03:46,391 INFO L225 Difference]: With dead ends: 8622 [2022-07-22 11:03:46,391 INFO L226 Difference]: Without dead ends: 4574 [2022-07-22 11:03:46,397 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:03:46,399 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 28 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 11:03:46,399 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 272 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 11:03:46,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4574 states. [2022-07-22 11:03:46,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4574 to 4406. [2022-07-22 11:03:46,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4406 states, 4405 states have (on average 1.3995459704880817) internal successors, (6165), 4405 states have internal predecessors, (6165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:03:46,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4406 states to 4406 states and 6165 transitions. [2022-07-22 11:03:46,548 INFO L78 Accepts]: Start accepts. Automaton has 4406 states and 6165 transitions. Word has length 273 [2022-07-22 11:03:46,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:03:46,548 INFO L495 AbstractCegarLoop]: Abstraction has 4406 states and 6165 transitions. [2022-07-22 11:03:46,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:03:46,549 INFO L276 IsEmpty]: Start isEmpty. Operand 4406 states and 6165 transitions. [2022-07-22 11:03:46,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2022-07-22 11:03:46,556 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:03:46,556 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 7, 7, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:03:46,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-22 11:03:46,556 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:03:46,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:03:46,557 INFO L85 PathProgramCache]: Analyzing trace with hash -257796221, now seen corresponding path program 1 times [2022-07-22 11:03:46,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:03:46,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315586357] [2022-07-22 11:03:46,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:03:46,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:03:46,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:03:46,607 INFO L134 CoverageAnalysis]: Checked inductivity of 875 backedges. 493 proven. 0 refuted. 0 times theorem prover too weak. 382 trivial. 0 not checked. [2022-07-22 11:03:46,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:03:46,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315586357] [2022-07-22 11:03:46,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315586357] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:03:46,608 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:03:46,608 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 11:03:46,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299396484] [2022-07-22 11:03:46,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:03:46,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 11:03:46,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:03:46,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 11:03:46,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:03:46,611 INFO L87 Difference]: Start difference. First operand 4406 states and 6165 transitions. Second operand has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:03:46,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:03:46,770 INFO L93 Difference]: Finished difference Result 9266 states and 12990 transitions. [2022-07-22 11:03:46,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 11:03:46,770 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 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 299 [2022-07-22 11:03:46,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:03:46,797 INFO L225 Difference]: With dead ends: 9266 [2022-07-22 11:03:46,797 INFO L226 Difference]: Without dead ends: 4868 [2022-07-22 11:03:46,803 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:03:46,804 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 17 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 11:03:46,805 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 272 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 11:03:46,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4868 states. [2022-07-22 11:03:46,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4868 to 4784. [2022-07-22 11:03:46,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4784 states, 4783 states have (on average 1.382605059586034) internal successors, (6613), 4783 states have internal predecessors, (6613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:03:46,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4784 states to 4784 states and 6613 transitions. [2022-07-22 11:03:46,974 INFO L78 Accepts]: Start accepts. Automaton has 4784 states and 6613 transitions. Word has length 299 [2022-07-22 11:03:46,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:03:46,974 INFO L495 AbstractCegarLoop]: Abstraction has 4784 states and 6613 transitions. [2022-07-22 11:03:46,975 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:03:46,975 INFO L276 IsEmpty]: Start isEmpty. Operand 4784 states and 6613 transitions. [2022-07-22 11:03:46,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2022-07-22 11:03:46,985 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:03:46,985 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 8, 8, 7, 7, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:03:46,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-22 11:03:46,985 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:03:46,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:03:46,986 INFO L85 PathProgramCache]: Analyzing trace with hash 212293102, now seen corresponding path program 1 times [2022-07-22 11:03:46,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:03:46,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938269133] [2022-07-22 11:03:46,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:03:46,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:03:47,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:03:47,055 INFO L134 CoverageAnalysis]: Checked inductivity of 1066 backedges. 627 proven. 0 refuted. 0 times theorem prover too weak. 439 trivial. 0 not checked. [2022-07-22 11:03:47,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:03:47,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938269133] [2022-07-22 11:03:47,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938269133] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:03:47,056 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:03:47,056 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 11:03:47,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126551780] [2022-07-22 11:03:47,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:03:47,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 11:03:47,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:03:47,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 11:03:47,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:03:47,059 INFO L87 Difference]: Start difference. First operand 4784 states and 6613 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:03:47,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:03:47,238 INFO L93 Difference]: Finished difference Result 9980 states and 13802 transitions. [2022-07-22 11:03:47,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 11:03:47,239 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 322 [2022-07-22 11:03:47,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:03:47,248 INFO L225 Difference]: With dead ends: 9980 [2022-07-22 11:03:47,248 INFO L226 Difference]: Without dead ends: 5204 [2022-07-22 11:03:47,255 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:03:47,255 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 10 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 11:03:47,256 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 272 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 11:03:47,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5204 states. [2022-07-22 11:03:47,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5204 to 4391. [2022-07-22 11:03:47,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4391 states, 4390 states have (on average 1.3824601366742597) internal successors, (6069), 4390 states have internal predecessors, (6069), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:03:47,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4391 states to 4391 states and 6069 transitions. [2022-07-22 11:03:47,414 INFO L78 Accepts]: Start accepts. Automaton has 4391 states and 6069 transitions. Word has length 322 [2022-07-22 11:03:47,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:03:47,415 INFO L495 AbstractCegarLoop]: Abstraction has 4391 states and 6069 transitions. [2022-07-22 11:03:47,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:03:47,415 INFO L276 IsEmpty]: Start isEmpty. Operand 4391 states and 6069 transitions. [2022-07-22 11:03:47,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2022-07-22 11:03:47,423 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:03:47,423 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 9, 9, 8, 8, 7, 7, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:03:47,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-22 11:03:47,424 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:03:47,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:03:47,424 INFO L85 PathProgramCache]: Analyzing trace with hash -812160295, now seen corresponding path program 1 times [2022-07-22 11:03:47,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:03:47,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517385147] [2022-07-22 11:03:47,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:03:47,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:03:47,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:03:47,501 INFO L134 CoverageAnalysis]: Checked inductivity of 1301 backedges. 692 proven. 0 refuted. 0 times theorem prover too weak. 609 trivial. 0 not checked. [2022-07-22 11:03:47,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:03:47,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517385147] [2022-07-22 11:03:47,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517385147] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:03:47,501 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:03:47,502 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 11:03:47,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992351687] [2022-07-22 11:03:47,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:03:47,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 11:03:47,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:03:47,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 11:03:47,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:03:47,503 INFO L87 Difference]: Start difference. First operand 4391 states and 6069 transitions. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:03:47,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:03:47,653 INFO L93 Difference]: Finished difference Result 13143 states and 18162 transitions. [2022-07-22 11:03:47,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 11:03:47,653 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 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 354 [2022-07-22 11:03:47,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:03:47,669 INFO L225 Difference]: With dead ends: 13143 [2022-07-22 11:03:47,669 INFO L226 Difference]: Without dead ends: 8760 [2022-07-22 11:03:47,677 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 11:03:47,677 INFO L413 NwaCegarLoop]: 320 mSDtfsCounter, 125 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 11:03:47,678 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 486 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 11:03:47,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8760 states. [2022-07-22 11:03:47,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8760 to 8575. [2022-07-22 11:03:47,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8575 states, 8574 states have (on average 1.385117797993935) internal successors, (11876), 8574 states have internal predecessors, (11876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:03:47,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8575 states to 8575 states and 11876 transitions. [2022-07-22 11:03:47,925 INFO L78 Accepts]: Start accepts. Automaton has 8575 states and 11876 transitions. Word has length 354 [2022-07-22 11:03:47,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:03:47,925 INFO L495 AbstractCegarLoop]: Abstraction has 8575 states and 11876 transitions. [2022-07-22 11:03:47,925 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:03:47,925 INFO L276 IsEmpty]: Start isEmpty. Operand 8575 states and 11876 transitions. [2022-07-22 11:03:47,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2022-07-22 11:03:47,938 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:03:47,938 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 9, 9, 8, 8, 7, 7, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:03:47,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-22 11:03:47,939 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:03:47,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:03:47,939 INFO L85 PathProgramCache]: Analyzing trace with hash 209922624, now seen corresponding path program 1 times [2022-07-22 11:03:47,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:03:47,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100378491] [2022-07-22 11:03:47,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:03:47,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:03:47,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:03:48,001 INFO L134 CoverageAnalysis]: Checked inductivity of 1301 backedges. 871 proven. 26 refuted. 0 times theorem prover too weak. 404 trivial. 0 not checked. [2022-07-22 11:03:48,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:03:48,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100378491] [2022-07-22 11:03:48,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100378491] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 11:03:48,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1472744341] [2022-07-22 11:03:48,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:03:48,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 11:03:48,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:03:48,003 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) [2022-07-22 11:03:48,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-22 11:03:48,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:03:48,138 INFO L263 TraceCheckSpWp]: Trace formula consists of 582 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-22 11:03:48,151 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 11:03:48,435 INFO L134 CoverageAnalysis]: Checked inductivity of 1301 backedges. 680 proven. 0 refuted. 0 times theorem prover too weak. 621 trivial. 0 not checked. [2022-07-22 11:03:48,435 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 11:03:48,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1472744341] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:03:48,435 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 11:03:48,436 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-07-22 11:03:48,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224748619] [2022-07-22 11:03:48,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:03:48,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 11:03:48,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:03:48,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 11:03:48,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-22 11:03:48,438 INFO L87 Difference]: Start difference. First operand 8575 states and 11876 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:03:48,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:03:48,572 INFO L93 Difference]: Finished difference Result 10751 states and 14913 transitions. [2022-07-22 11:03:48,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 11:03:48,573 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 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 355 [2022-07-22 11:03:48,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:03:48,589 INFO L225 Difference]: With dead ends: 10751 [2022-07-22 11:03:48,589 INFO L226 Difference]: Without dead ends: 8530 [2022-07-22 11:03:48,594 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 355 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-22 11:03:48,595 INFO L413 NwaCegarLoop]: 320 mSDtfsCounter, 83 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 11:03:48,595 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 480 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 11:03:48,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8530 states. [2022-07-22 11:03:48,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8530 to 6140. [2022-07-22 11:03:48,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6140 states, 6139 states have (on average 1.3924091871640332) internal successors, (8548), 6139 states have internal predecessors, (8548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:03:48,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6140 states to 6140 states and 8548 transitions. [2022-07-22 11:03:48,813 INFO L78 Accepts]: Start accepts. Automaton has 6140 states and 8548 transitions. Word has length 355 [2022-07-22 11:03:48,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:03:48,813 INFO L495 AbstractCegarLoop]: Abstraction has 6140 states and 8548 transitions. [2022-07-22 11:03:48,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:03:48,814 INFO L276 IsEmpty]: Start isEmpty. Operand 6140 states and 8548 transitions. [2022-07-22 11:03:48,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 418 [2022-07-22 11:03:48,829 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:03:48,829 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 6, 6, 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, 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] [2022-07-22 11:03:48,853 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-22 11:03:49,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-07-22 11:03:49,043 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:03:49,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:03:49,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1965226690, now seen corresponding path program 1 times [2022-07-22 11:03:49,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:03:49,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122949620] [2022-07-22 11:03:49,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:03:49,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:03:49,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:03:49,125 INFO L134 CoverageAnalysis]: Checked inductivity of 2004 backedges. 1251 proven. 26 refuted. 0 times theorem prover too weak. 727 trivial. 0 not checked. [2022-07-22 11:03:49,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:03:49,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122949620] [2022-07-22 11:03:49,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122949620] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 11:03:49,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2094648093] [2022-07-22 11:03:49,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:03:49,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 11:03:49,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:03:49,128 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) [2022-07-22 11:03:49,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-22 11:03:49,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:03:49,270 INFO L263 TraceCheckSpWp]: Trace formula consists of 672 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-22 11:03:49,275 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 11:03:49,355 INFO L134 CoverageAnalysis]: Checked inductivity of 2004 backedges. 1251 proven. 26 refuted. 0 times theorem prover too weak. 727 trivial. 0 not checked. [2022-07-22 11:03:49,355 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 11:03:49,446 INFO L134 CoverageAnalysis]: Checked inductivity of 2004 backedges. 1251 proven. 26 refuted. 0 times theorem prover too weak. 727 trivial. 0 not checked. [2022-07-22 11:03:49,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2094648093] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 11:03:49,447 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 11:03:49,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-07-22 11:03:49,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389382492] [2022-07-22 11:03:49,447 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 11:03:49,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-22 11:03:49,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:03:49,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 11:03:49,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-22 11:03:49,449 INFO L87 Difference]: Start difference. First operand 6140 states and 8548 transitions. Second operand has 6 states, 6 states have (on average 42.833333333333336) internal successors, (257), 6 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:03:49,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:03:49,968 INFO L93 Difference]: Finished difference Result 13848 states and 19249 transitions. [2022-07-22 11:03:49,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-22 11:03:49,969 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 42.833333333333336) internal successors, (257), 6 states have internal predecessors, (257), 0 states have call successors, (0), 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 417 [2022-07-22 11:03:49,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:03:49,983 INFO L225 Difference]: With dead ends: 13848 [2022-07-22 11:03:49,983 INFO L226 Difference]: Without dead ends: 7414 [2022-07-22 11:03:49,992 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 840 GetRequests, 834 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-07-22 11:03:49,993 INFO L413 NwaCegarLoop]: 207 mSDtfsCounter, 383 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 383 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-22 11:03:49,993 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [383 Valid, 499 Invalid, 524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-22 11:03:50,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7414 states. [2022-07-22 11:03:50,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7414 to 6032. [2022-07-22 11:03:50,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6032 states, 6031 states have (on average 1.3669374896368762) internal successors, (8244), 6031 states have internal predecessors, (8244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:03:50,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6032 states to 6032 states and 8244 transitions. [2022-07-22 11:03:50,226 INFO L78 Accepts]: Start accepts. Automaton has 6032 states and 8244 transitions. Word has length 417 [2022-07-22 11:03:50,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:03:50,226 INFO L495 AbstractCegarLoop]: Abstraction has 6032 states and 8244 transitions. [2022-07-22 11:03:50,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 42.833333333333336) internal successors, (257), 6 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:03:50,227 INFO L276 IsEmpty]: Start isEmpty. Operand 6032 states and 8244 transitions. [2022-07-22 11:03:50,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 510 [2022-07-22 11:03:50,242 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:03:50,242 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 16, 16, 16, 14, 14, 12, 12, 10, 10, 8, 8, 8, 8, 5, 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, 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] [2022-07-22 11:03:50,269 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-22 11:03:50,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-07-22 11:03:50,455 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:03:50,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:03:50,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1529804208, now seen corresponding path program 1 times [2022-07-22 11:03:50,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:03:50,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586362378] [2022-07-22 11:03:50,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:03:50,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:03:50,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:03:50,557 INFO L134 CoverageAnalysis]: Checked inductivity of 3138 backedges. 1660 proven. 77 refuted. 0 times theorem prover too weak. 1401 trivial. 0 not checked. [2022-07-22 11:03:50,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:03:50,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586362378] [2022-07-22 11:03:50,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586362378] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 11:03:50,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1492190807] [2022-07-22 11:03:50,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:03:50,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 11:03:50,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:03:50,559 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 11:03:50,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-22 11:03:50,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:03:50,708 INFO L263 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 11:03:50,712 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 11:03:50,746 INFO L134 CoverageAnalysis]: Checked inductivity of 3138 backedges. 1671 proven. 0 refuted. 0 times theorem prover too weak. 1467 trivial. 0 not checked. [2022-07-22 11:03:50,746 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 11:03:50,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1492190807] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:03:50,747 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 11:03:50,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-07-22 11:03:50,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280538561] [2022-07-22 11:03:50,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:03:50,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 11:03:50,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:03:50,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 11:03:50,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-22 11:03:50,749 INFO L87 Difference]: Start difference. First operand 6032 states and 8244 transitions. Second operand has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:03:50,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:03:50,977 INFO L93 Difference]: Finished difference Result 12486 states and 17159 transitions. [2022-07-22 11:03:50,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 11:03:50,977 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 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 509 [2022-07-22 11:03:50,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:03:50,989 INFO L225 Difference]: With dead ends: 12486 [2022-07-22 11:03:50,989 INFO L226 Difference]: Without dead ends: 6462 [2022-07-22 11:03:50,998 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 513 GetRequests, 510 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-22 11:03:50,999 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 92 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 11:03:51,000 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 216 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 11:03:51,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6462 states. [2022-07-22 11:03:51,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6462 to 6266. [2022-07-22 11:03:51,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6266 states, 6265 states have (on average 1.3661612130885874) internal successors, (8559), 6265 states have internal predecessors, (8559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:03:51,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6266 states to 6266 states and 8559 transitions. [2022-07-22 11:03:51,162 INFO L78 Accepts]: Start accepts. Automaton has 6266 states and 8559 transitions. Word has length 509 [2022-07-22 11:03:51,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:03:51,162 INFO L495 AbstractCegarLoop]: Abstraction has 6266 states and 8559 transitions. [2022-07-22 11:03:51,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:03:51,163 INFO L276 IsEmpty]: Start isEmpty. Operand 6266 states and 8559 transitions. [2022-07-22 11:03:51,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 514 [2022-07-22 11:03:51,179 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:03:51,179 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 18, 16, 14, 14, 12, 12, 10, 10, 8, 8, 8, 8, 5, 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, 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] [2022-07-22 11:03:51,205 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-22 11:03:51,404 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 11:03:51,404 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:03:51,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:03:51,405 INFO L85 PathProgramCache]: Analyzing trace with hash -1911316890, now seen corresponding path program 1 times [2022-07-22 11:03:51,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:03:51,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948820329] [2022-07-22 11:03:51,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:03:51,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:03:51,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:03:51,637 INFO L134 CoverageAnalysis]: Checked inductivity of 3204 backedges. 1744 proven. 206 refuted. 0 times theorem prover too weak. 1254 trivial. 0 not checked. [2022-07-22 11:03:51,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:03:51,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948820329] [2022-07-22 11:03:51,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948820329] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 11:03:51,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1800005214] [2022-07-22 11:03:51,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:03:51,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 11:03:51,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:03:51,639 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 11:03:51,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-22 11:03:51,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:03:51,789 INFO L263 TraceCheckSpWp]: Trace formula consists of 814 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 11:03:51,801 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 11:03:53,003 INFO L134 CoverageAnalysis]: Checked inductivity of 3204 backedges. 1792 proven. 239 refuted. 0 times theorem prover too weak. 1173 trivial. 0 not checked. [2022-07-22 11:03:53,003 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 11:03:53,784 INFO L134 CoverageAnalysis]: Checked inductivity of 3204 backedges. 1887 proven. 144 refuted. 0 times theorem prover too weak. 1173 trivial. 0 not checked. [2022-07-22 11:03:53,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1800005214] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 11:03:53,785 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 11:03:53,785 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-07-22 11:03:53,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991073167] [2022-07-22 11:03:53,787 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 11:03:53,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-22 11:03:53,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:03:53,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-22 11:03:53,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-07-22 11:03:53,789 INFO L87 Difference]: Start difference. First operand 6266 states and 8559 transitions. Second operand has 11 states, 11 states have (on average 38.0) internal successors, (418), 11 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:03:56,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:03:56,222 INFO L93 Difference]: Finished difference Result 25619 states and 35084 transitions. [2022-07-22 11:03:56,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-22 11:03:56,223 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 38.0) internal successors, (418), 11 states have internal predecessors, (418), 0 states have call successors, (0), 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 513 [2022-07-22 11:03:56,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:03:56,261 INFO L225 Difference]: With dead ends: 25619 [2022-07-22 11:03:56,262 INFO L226 Difference]: Without dead ends: 20476 [2022-07-22 11:03:56,274 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1058 GetRequests, 1033 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=183, Invalid=417, Unknown=0, NotChecked=0, Total=600 [2022-07-22 11:03:56,275 INFO L413 NwaCegarLoop]: 407 mSDtfsCounter, 1243 mSDsluCounter, 1151 mSDsCounter, 0 mSdLazyCounter, 1671 mSolverCounterSat, 224 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1243 SdHoareTripleChecker+Valid, 1558 SdHoareTripleChecker+Invalid, 2611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 224 IncrementalHoareTripleChecker+Valid, 1671 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 716 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-07-22 11:03:56,275 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1243 Valid, 1558 Invalid, 2611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [224 Valid, 1671 Invalid, 0 Unknown, 716 Unchecked, 1.4s Time] [2022-07-22 11:03:56,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20476 states. [2022-07-22 11:03:56,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20476 to 19067. [2022-07-22 11:03:56,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19067 states, 19066 states have (on average 1.3313227735235498) internal successors, (25383), 19066 states have internal predecessors, (25383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:03:56,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19067 states to 19067 states and 25383 transitions. [2022-07-22 11:03:56,950 INFO L78 Accepts]: Start accepts. Automaton has 19067 states and 25383 transitions. Word has length 513 [2022-07-22 11:03:56,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:03:56,951 INFO L495 AbstractCegarLoop]: Abstraction has 19067 states and 25383 transitions. [2022-07-22 11:03:56,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 38.0) internal successors, (418), 11 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:03:56,951 INFO L276 IsEmpty]: Start isEmpty. Operand 19067 states and 25383 transitions. [2022-07-22 11:03:56,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 584 [2022-07-22 11:03:56,994 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:03:56,994 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 20, 20, 20, 20, 18, 16, 16, 14, 14, 12, 12, 10, 10, 10, 10, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-07-22 11:03:57,022 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-22 11:03:57,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 11:03:57,208 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:03:57,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:03:57,209 INFO L85 PathProgramCache]: Analyzing trace with hash 944376353, now seen corresponding path program 2 times [2022-07-22 11:03:57,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:03:57,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714288060] [2022-07-22 11:03:57,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:03:57,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:03:57,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:03:57,287 INFO L134 CoverageAnalysis]: Checked inductivity of 4078 backedges. 1321 proven. 16 refuted. 0 times theorem prover too weak. 2741 trivial. 0 not checked. [2022-07-22 11:03:57,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:03:57,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714288060] [2022-07-22 11:03:57,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714288060] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 11:03:57,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1935993483] [2022-07-22 11:03:57,288 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 11:03:57,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 11:03:57,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:03:57,290 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 11:03:57,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-22 11:03:57,451 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-22 11:03:57,452 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 11:03:57,456 INFO L263 TraceCheckSpWp]: Trace formula consists of 900 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-22 11:03:57,460 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 11:03:57,528 INFO L134 CoverageAnalysis]: Checked inductivity of 4078 backedges. 1321 proven. 16 refuted. 0 times theorem prover too weak. 2741 trivial. 0 not checked. [2022-07-22 11:03:57,528 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 11:03:57,594 INFO L134 CoverageAnalysis]: Checked inductivity of 4078 backedges. 1321 proven. 16 refuted. 0 times theorem prover too weak. 2741 trivial. 0 not checked. [2022-07-22 11:03:57,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1935993483] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 11:03:57,594 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 11:03:57,594 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2022-07-22 11:03:57,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35117058] [2022-07-22 11:03:57,595 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 11:03:57,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-22 11:03:57,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:03:57,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-22 11:03:57,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-07-22 11:03:57,596 INFO L87 Difference]: Start difference. First operand 19067 states and 25383 transitions. Second operand has 8 states, 8 states have (on average 34.25) internal successors, (274), 8 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) [2022-07-22 11:03:58,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:03:58,322 INFO L93 Difference]: Finished difference Result 29586 states and 39053 transitions. [2022-07-22 11:03:58,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-22 11:03:58,322 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 34.25) internal successors, (274), 8 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) Word has length 583 [2022-07-22 11:03:58,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:03:58,323 INFO L225 Difference]: With dead ends: 29586 [2022-07-22 11:03:58,323 INFO L226 Difference]: Without dead ends: 0 [2022-07-22 11:03:58,337 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1176 GetRequests, 1166 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2022-07-22 11:03:58,338 INFO L413 NwaCegarLoop]: 292 mSDtfsCounter, 262 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 518 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 728 SdHoareTripleChecker+Invalid, 563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-22 11:03:58,338 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 728 Invalid, 563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 518 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-22 11:03:58,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-22 11:03:58,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-22 11:03:58,339 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) [2022-07-22 11:03:58,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-22 11:03:58,339 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 583 [2022-07-22 11:03:58,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:03:58,339 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-22 11:03:58,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 34.25) internal successors, (274), 8 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) [2022-07-22 11:03:58,340 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-22 11:03:58,340 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-22 11:03:58,342 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-22 11:03:58,370 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-22 11:03:58,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 11:03:58,564 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-22 11:04:04,528 WARN L233 SmtUtils]: Spent 5.95s on a formula simplification. DAG size of input: 763 DAG size of output: 741 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-07-22 11:04:17,463 WARN L233 SmtUtils]: Spent 5.93s on a formula simplification. DAG size of input: 724 DAG size of output: 122 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-07-22 11:04:28,142 WARN L233 SmtUtils]: Spent 5.68s on a formula simplification. DAG size of input: 725 DAG size of output: 122 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-07-22 11:04:29,140 INFO L899 garLoopResultBuilder]: For program point L267(lines 267 272) no Hoare annotation was computed. [2022-07-22 11:04:29,140 INFO L899 garLoopResultBuilder]: For program point L201(lines 201 608) no Hoare annotation was computed. [2022-07-22 11:04:29,141 INFO L899 garLoopResultBuilder]: For program point L168(lines 168 619) no Hoare annotation was computed. [2022-07-22 11:04:29,141 INFO L899 garLoopResultBuilder]: For program point L135(lines 135 630) no Hoare annotation was computed. [2022-07-22 11:04:29,141 INFO L902 garLoopResultBuilder]: At program point L697(lines 688 699) the Hoare annotation is: true [2022-07-22 11:04:29,141 INFO L899 garLoopResultBuilder]: For program point L367(lines 367 398) no Hoare annotation was computed. [2022-07-22 11:04:29,141 INFO L899 garLoopResultBuilder]: For program point L334(lines 334 338) no Hoare annotation was computed. [2022-07-22 11:04:29,141 INFO L899 garLoopResultBuilder]: For program point L334-2(lines 334 338) no Hoare annotation was computed. [2022-07-22 11:04:29,142 INFO L895 garLoopResultBuilder]: At program point L202(lines 198 609) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse8 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse4 (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse6 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse7 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (.cse5 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse1 (<= 8640 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse2 (let ((.cse9 (mod (+ (* 2 |ULTIMATE.start_ssl3_accept_~ag_X~0#1|) (* 2 |ULTIMATE.start_ssl3_accept_~ag_Y~0#1|)) 4294967296))) (or (< .cse9 8656) (not (<= .cse9 2147483647))))) (.cse3 (not (<= 8656 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6 .cse1 .cse7) (and .cse4 .cse0 .cse6 .cse1 .cse7) (and .cse4 .cse6 .cse1 .cse8 .cse7) (and .cse1 .cse8 .cse3) (and .cse4 (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse6 (<= 8640 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|) .cse1 .cse7) (and .cse5 .cse1 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576) .cse2 .cse3))) [2022-07-22 11:04:29,142 INFO L895 garLoopResultBuilder]: At program point L169(lines 165 620) the Hoare annotation is: (let ((.cse2 (let ((.cse9 (mod (+ (* 2 |ULTIMATE.start_ssl3_accept_~ag_X~0#1|) (* 2 |ULTIMATE.start_ssl3_accept_~ag_Y~0#1|)) 4294967296))) (or (< .cse9 8656) (not (<= .cse9 2147483647))))) (.cse3 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) (.cse4 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse5 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse6 (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse0 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse7 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse1 (<= 8512 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse8 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|)))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse1 .cse2 .cse3) (and .cse1 .cse5 .cse3) (and .cse6 .cse4 .cse7 .cse1 .cse8) (and .cse6 .cse7 .cse1 .cse5 .cse8) (and .cse6 .cse0 .cse7 .cse1 .cse8))) [2022-07-22 11:04:29,142 INFO L895 garLoopResultBuilder]: At program point L136(lines 135 630) the Hoare annotation is: (let ((.cse0 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse3 (let ((.cse9 (mod (+ (* 2 |ULTIMATE.start_ssl3_accept_~ag_X~0#1|) (* 2 |ULTIMATE.start_ssl3_accept_~ag_Y~0#1|)) 4294967296))) (or (< .cse9 8656) (not (<= .cse9 2147483647))))) (.cse1 (<= 8466 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse2 (< |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8496)) (.cse4 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse5 (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse6 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse8 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse7 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|)))) (or (and .cse0 .cse1 .cse2 (< 8496 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|) (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576) .cse3) (and .cse4 .cse1 .cse2 .cse3) (and .cse5 .cse0 .cse6 .cse7) (and .cse0 .cse1 .cse2 (< |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8496) .cse3) (and .cse1 .cse2 .cse8) (and .cse5 .cse4 .cse6 .cse7) (and .cse5 .cse6 .cse8 .cse7))) [2022-07-22 11:04:29,142 INFO L899 garLoopResultBuilder]: For program point L533(lines 533 538) no Hoare annotation was computed. [2022-07-22 11:04:29,142 INFO L895 garLoopResultBuilder]: At program point L600(lines 111 668) the Hoare annotation is: (let ((.cse26 (+ (* 2 |ULTIMATE.start_ssl3_accept_~ag_X~0#1|) (* 2 |ULTIMATE.start_ssl3_accept_~ag_Y~0#1|)))) (let ((.cse25 (* (div .cse26 4294967296) 4294967296)) (.cse16 (mod .cse26 4294967296))) (let ((.cse17 (not (<= .cse16 2147483647))) (.cse21 (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|)) (.cse27 (= (+ |ULTIMATE.start_ssl3_accept_~s__state~0#1| .cse25) .cse26))) (let ((.cse5 (<= 8466 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse6 (< |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8496)) (.cse3 (not (<= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse20 (= 3 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|)) (.cse18 (or (and (= (+ |ULTIMATE.start_ssl3_accept_~s__state~0#1| .cse25 4294967296) .cse26) (not (<= .cse26 (+ 2147483647 .cse25)))) .cse27)) (.cse9 (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse10 (<= 8640 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|)) (.cse1 (< |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8496)) (.cse13 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8448)) (.cse12 (not .cse21)) (.cse11 (<= 8640 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse4 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse19 (< |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656)) (.cse22 (<= 8512 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse23 (not (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8496))) (.cse7 (< 8496 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|)) (.cse8 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576)) (.cse2 (or (< .cse16 8656) .cse17)) (.cse24 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) (.cse14 (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse0 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse15 (<= 8656 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6 .cse7 .cse8 .cse2) (and .cse4 .cse2 (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (and .cse0 .cse5 .cse6 .cse2) (and .cse9 .cse10 .cse11 .cse12) (and .cse4 .cse12) (and .cse0 .cse13 .cse7 .cse8 .cse2) (and (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8528) .cse4 .cse2) (and .cse14 .cse9 .cse8 .cse2 .cse15) (and .cse0 (or (<= .cse16 8496) .cse17)) (and .cse18 .cse4 .cse19 .cse1) (and .cse9 .cse13 .cse20 .cse21 .cse2) (and .cse14 .cse0 .cse22 .cse2) (and .cse4 .cse1 .cse2 .cse3) (and .cse4 (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8512) .cse2) (and .cse0 .cse13 .cse20) (and .cse0 .cse13 (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 3) .cse2) (and .cse18 .cse4 .cse19 .cse7 .cse8) (and .cse14 .cse9 .cse12 .cse15) (and .cse9 .cse10 .cse13 .cse12) (and .cse4 .cse19 .cse22 .cse1 .cse2) (and .cse4 .cse13 .cse7 .cse8 .cse2) (and .cse0 .cse12) (and .cse4 .cse23 .cse7 .cse8 .cse2 .cse24) (and .cse14 .cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) .cse11 .cse8 .cse2) (and .cse4 (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|) .cse2) (and (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|) .cse4 (= (+ 8496 .cse25) .cse26) .cse8) (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0) (and .cse0 .cse27) (and .cse4 .cse19 .cse22 .cse7 .cse8 .cse2) (and .cse0 .cse23 .cse7 .cse8 .cse2 .cse24) (and .cse14 .cse0 .cse15)))))) [2022-07-22 11:04:29,142 INFO L899 garLoopResultBuilder]: For program point L567(lines 567 571) no Hoare annotation was computed. [2022-07-22 11:04:29,143 INFO L899 garLoopResultBuilder]: For program point L303(lines 303 307) no Hoare annotation was computed. [2022-07-22 11:04:29,143 INFO L899 garLoopResultBuilder]: For program point L303-2(lines 221 599) no Hoare annotation was computed. [2022-07-22 11:04:29,143 INFO L899 garLoopResultBuilder]: For program point L204(lines 204 607) no Hoare annotation was computed. [2022-07-22 11:04:29,143 INFO L899 garLoopResultBuilder]: For program point L171(lines 171 618) no Hoare annotation was computed. [2022-07-22 11:04:29,143 INFO L899 garLoopResultBuilder]: For program point L138(lines 138 629) no Hoare annotation was computed. [2022-07-22 11:04:29,143 INFO L899 garLoopResultBuilder]: For program point L370(lines 370 397) no Hoare annotation was computed. [2022-07-22 11:04:29,143 INFO L899 garLoopResultBuilder]: For program point L370-1(lines 370 397) no Hoare annotation was computed. [2022-07-22 11:04:29,143 INFO L899 garLoopResultBuilder]: For program point L371(lines 371 394) no Hoare annotation was computed. [2022-07-22 11:04:29,143 INFO L902 garLoopResultBuilder]: At program point L669(lines 110 670) the Hoare annotation is: true [2022-07-22 11:04:29,143 INFO L899 garLoopResultBuilder]: For program point L207(lines 207 606) no Hoare annotation was computed. [2022-07-22 11:04:29,144 INFO L899 garLoopResultBuilder]: For program point L174(lines 174 617) no Hoare annotation was computed. [2022-07-22 11:04:29,144 INFO L899 garLoopResultBuilder]: For program point L141(lines 141 628) no Hoare annotation was computed. [2022-07-22 11:04:29,144 INFO L899 garLoopResultBuilder]: For program point L406(lines 406 437) no Hoare annotation was computed. [2022-07-22 11:04:29,144 INFO L899 garLoopResultBuilder]: For program point L241(lines 241 258) no Hoare annotation was computed. [2022-07-22 11:04:29,144 INFO L895 garLoopResultBuilder]: At program point L208(lines 204 607) the Hoare annotation is: (let ((.cse1 (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse5 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576)) (.cse6 (let ((.cse8 (mod (+ (* 2 |ULTIMATE.start_ssl3_accept_~ag_X~0#1|) (* 2 |ULTIMATE.start_ssl3_accept_~ag_Y~0#1|)) 4294967296))) (or (< .cse8 8656) (not (<= .cse8 2147483647))))) (.cse7 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse3 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (.cse0 (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse4 (<= 8656 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1) .cse2 .cse4) (and .cse0 .cse1 .cse2 .cse5 .cse6 .cse4) (and .cse0 .cse7 .cse2 .cse5 .cse6 .cse4) (and .cse0 .cse7 .cse2 .cse3 .cse4) (and .cse0 .cse2 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0) .cse4))) [2022-07-22 11:04:29,144 INFO L895 garLoopResultBuilder]: At program point L175(lines 171 618) the Hoare annotation is: (let ((.cse3 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse5 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse8 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (.cse0 (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse7 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse2 (<= 8512 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse6 (let ((.cse9 (mod (+ (* 2 |ULTIMATE.start_ssl3_accept_~ag_X~0#1|) (* 2 |ULTIMATE.start_ssl3_accept_~ag_Y~0#1|)) 4294967296))) (or (< .cse9 8656) (not (<= .cse9 2147483647))))) (.cse4 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse5 .cse1 .cse2 .cse6 .cse4) (and .cse0 .cse7 .cse1 .cse2 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse8) (and .cse0 .cse5 .cse1 .cse2 .cse8) (and .cse0 .cse7 .cse1 .cse2 .cse6 .cse4))) [2022-07-22 11:04:29,144 INFO L899 garLoopResultBuilder]: For program point L241-2(lines 221 599) no Hoare annotation was computed. [2022-07-22 11:04:29,145 INFO L899 garLoopResultBuilder]: For program point L638(lines 638 666) no Hoare annotation was computed. [2022-07-22 11:04:29,145 INFO L899 garLoopResultBuilder]: For program point L407(lines 407 413) no Hoare annotation was computed. [2022-07-22 11:04:29,145 INFO L899 garLoopResultBuilder]: For program point L374(lines 374 393) no Hoare annotation was computed. [2022-07-22 11:04:29,145 INFO L899 garLoopResultBuilder]: For program point L639(lines 639 663) no Hoare annotation was computed. [2022-07-22 11:04:29,145 INFO L899 garLoopResultBuilder]: For program point L573(lines 573 577) no Hoare annotation was computed. [2022-07-22 11:04:29,145 INFO L899 garLoopResultBuilder]: For program point L540(lines 540 544) no Hoare annotation was computed. [2022-07-22 11:04:29,145 INFO L899 garLoopResultBuilder]: For program point L507(lines 507 511) no Hoare annotation was computed. [2022-07-22 11:04:29,145 INFO L899 garLoopResultBuilder]: For program point L573-2(lines 573 577) no Hoare annotation was computed. [2022-07-22 11:04:29,146 INFO L899 garLoopResultBuilder]: For program point L540-2(lines 221 599) no Hoare annotation was computed. [2022-07-22 11:04:29,146 INFO L899 garLoopResultBuilder]: For program point L375(lines 375 379) no Hoare annotation was computed. [2022-07-22 11:04:29,146 INFO L899 garLoopResultBuilder]: For program point L375-2(lines 374 391) no Hoare annotation was computed. [2022-07-22 11:04:29,146 INFO L899 garLoopResultBuilder]: For program point L243(lines 243 248) no Hoare annotation was computed. [2022-07-22 11:04:29,146 INFO L899 garLoopResultBuilder]: For program point L210(lines 210 605) no Hoare annotation was computed. [2022-07-22 11:04:29,146 INFO L899 garLoopResultBuilder]: For program point L177(lines 177 616) no Hoare annotation was computed. [2022-07-22 11:04:29,146 INFO L899 garLoopResultBuilder]: For program point L144(lines 144 627) no Hoare annotation was computed. [2022-07-22 11:04:29,147 INFO L895 garLoopResultBuilder]: At program point L111-2(lines 111 668) the Hoare annotation is: (let ((.cse26 (+ (* 2 |ULTIMATE.start_ssl3_accept_~ag_X~0#1|) (* 2 |ULTIMATE.start_ssl3_accept_~ag_Y~0#1|)))) (let ((.cse25 (* (div .cse26 4294967296) 4294967296)) (.cse16 (mod .cse26 4294967296))) (let ((.cse17 (not (<= .cse16 2147483647))) (.cse21 (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|)) (.cse27 (= (+ |ULTIMATE.start_ssl3_accept_~s__state~0#1| .cse25) .cse26))) (let ((.cse5 (<= 8466 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse6 (< |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8496)) (.cse3 (not (<= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse20 (= 3 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|)) (.cse18 (or (and (= (+ |ULTIMATE.start_ssl3_accept_~s__state~0#1| .cse25 4294967296) .cse26) (not (<= .cse26 (+ 2147483647 .cse25)))) .cse27)) (.cse9 (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse10 (<= 8640 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|)) (.cse1 (< |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8496)) (.cse13 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8448)) (.cse12 (not .cse21)) (.cse11 (<= 8640 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse4 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse19 (< |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656)) (.cse22 (<= 8512 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse23 (not (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8496))) (.cse7 (< 8496 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|)) (.cse8 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576)) (.cse2 (or (< .cse16 8656) .cse17)) (.cse24 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) (.cse14 (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse0 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse15 (<= 8656 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6 .cse7 .cse8 .cse2) (and .cse4 .cse2 (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (and .cse0 .cse5 .cse6 .cse2) (and .cse9 .cse10 .cse11 .cse12) (and .cse4 .cse12) (and .cse0 .cse13 .cse7 .cse8 .cse2) (and (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8528) .cse4 .cse2) (and .cse14 .cse9 .cse8 .cse2 .cse15) (and .cse0 (or (<= .cse16 8496) .cse17)) (and .cse18 .cse4 .cse19 .cse1) (and .cse9 .cse13 .cse20 .cse21 .cse2) (and .cse14 .cse0 .cse22 .cse2) (and .cse4 .cse1 .cse2 .cse3) (and .cse4 (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8512) .cse2) (and .cse0 .cse13 .cse20) (and .cse0 .cse13 (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 3) .cse2) (and .cse18 .cse4 .cse19 .cse7 .cse8) (and .cse14 .cse9 .cse12 .cse15) (and .cse9 .cse10 .cse13 .cse12) (and .cse4 .cse19 .cse22 .cse1 .cse2) (and .cse4 .cse13 .cse7 .cse8 .cse2) (and .cse0 .cse12) (and .cse4 .cse23 .cse7 .cse8 .cse2 .cse24) (and .cse14 .cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) .cse11 .cse8 .cse2) (and .cse4 (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|) .cse2) (and (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|) .cse4 (= (+ 8496 .cse25) .cse26) .cse8) (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0) (and .cse0 .cse27) (and .cse4 .cse19 .cse22 .cse7 .cse8 .cse2) (and .cse0 .cse23 .cse7 .cse8 .cse2 .cse24) (and .cse14 .cse0 .cse15)))))) [2022-07-22 11:04:29,147 INFO L899 garLoopResultBuilder]: For program point L673(lines 673 677) no Hoare annotation was computed. [2022-07-22 11:04:29,147 INFO L899 garLoopResultBuilder]: For program point L640(lines 640 649) no Hoare annotation was computed. [2022-07-22 11:04:29,147 INFO L899 garLoopResultBuilder]: For program point L673-2(lines 673 677) no Hoare annotation was computed. [2022-07-22 11:04:29,147 INFO L899 garLoopResultBuilder]: For program point L640-2(lines 639 661) no Hoare annotation was computed. [2022-07-22 11:04:29,147 INFO L899 garLoopResultBuilder]: For program point L475(lines 475 479) no Hoare annotation was computed. [2022-07-22 11:04:29,147 INFO L899 garLoopResultBuilder]: For program point L343-1(lines 343 352) no Hoare annotation was computed. [2022-07-22 11:04:29,148 INFO L895 garLoopResultBuilder]: At program point L178(lines 177 616) the Hoare annotation is: (let ((.cse5 (mod (+ (* 2 |ULTIMATE.start_ssl3_accept_~ag_X~0#1|) (* 2 |ULTIMATE.start_ssl3_accept_~ag_Y~0#1|)) 4294967296))) (let ((.cse6 (not (<= .cse5 2147483647))) (.cse11 (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (let ((.cse10 (= 3 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|)) (.cse9 (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse12 (not .cse11)) (.cse4 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse2 (< |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8496)) (.cse0 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse1 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8448)) (.cse7 (< 8496 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|)) (.cse8 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576)) (.cse3 (or (< .cse5 8656) .cse6))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse1 (or (<= .cse5 8496) .cse6)) (and .cse4 .cse1 .cse7 .cse8 .cse3) (and .cse1 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (and .cse9 .cse1 .cse10 .cse11 .cse3) (and .cse4 .cse1 .cse10) (and .cse4 .cse1 .cse12) (and .cse0 .cse1 .cse12) (and .cse9 (<= 8640 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|) .cse1 .cse12) (and .cse4 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse7 .cse8 .cse3))))) [2022-07-22 11:04:29,148 INFO L895 garLoopResultBuilder]: At program point L145(lines 138 629) the Hoare annotation is: (let ((.cse9 (+ (* 2 |ULTIMATE.start_ssl3_accept_~ag_X~0#1|) (* 2 |ULTIMATE.start_ssl3_accept_~ag_Y~0#1|))) (.cse5 (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (let ((.cse8 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) (.cse1 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse6 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576)) (.cse0 (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse10 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse3 (not .cse5)) (.cse11 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse4 (< |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8496)) (.cse7 (let ((.cse12 (mod .cse9 4294967296))) (or (< .cse12 8656) (not (<= .cse12 2147483647)))))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse1 .cse4 .cse5 (< |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8496) .cse6 .cse7 .cse8) (and .cse1 (= (+ 8496 (* (div .cse9 4294967296) 4294967296)) .cse9) .cse5 .cse6 .cse8 (not (<= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (and .cse4 .cse10) (and .cse1 .cse4 (< 8496 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|) .cse6 .cse7) (and .cse0 .cse11 .cse2 .cse3) (and .cse0 .cse2 .cse10 .cse3) (and .cse11 .cse4 .cse7)))) [2022-07-22 11:04:29,148 INFO L899 garLoopResultBuilder]: For program point L112(line 112) no Hoare annotation was computed. [2022-07-22 11:04:29,148 INFO L899 garLoopResultBuilder]: For program point L642(lines 642 646) no Hoare annotation was computed. [2022-07-22 11:04:29,148 INFO L899 garLoopResultBuilder]: For program point L213(lines 213 604) no Hoare annotation was computed. [2022-07-22 11:04:29,148 INFO L899 garLoopResultBuilder]: For program point L180(lines 180 615) no Hoare annotation was computed. [2022-07-22 11:04:29,148 INFO L899 garLoopResultBuilder]: For program point L147(lines 147 626) no Hoare annotation was computed. [2022-07-22 11:04:29,149 INFO L899 garLoopResultBuilder]: For program point L114(lines 114 637) no Hoare annotation was computed. [2022-07-22 11:04:29,149 INFO L895 garLoopResultBuilder]: At program point L214(lines 210 605) the Hoare annotation is: (let ((.cse1 (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse3 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (.cse0 (<= 8656 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (or (and (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0) .cse0) (and .cse1 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576) (let ((.cse2 (mod (+ (* 2 |ULTIMATE.start_ssl3_accept_~ag_X~0#1|) (* 2 |ULTIMATE.start_ssl3_accept_~ag_Y~0#1|)) 4294967296))) (or (< .cse2 8656) (not (<= .cse2 2147483647)))) .cse0) (and (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1) .cse0) (and .cse1 .cse3 .cse0) (and (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse3 .cse0))) [2022-07-22 11:04:29,149 INFO L895 garLoopResultBuilder]: At program point L115(lines 114 637) the Hoare annotation is: (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) [2022-07-22 11:04:29,149 INFO L899 garLoopResultBuilder]: For program point L347(lines 347 351) no Hoare annotation was computed. [2022-07-22 11:04:29,149 INFO L899 garLoopResultBuilder]: For program point L480(lines 480 491) no Hoare annotation was computed. [2022-07-22 11:04:29,149 INFO L899 garLoopResultBuilder]: For program point L447(lines 447 451) no Hoare annotation was computed. [2022-07-22 11:04:29,149 INFO L895 garLoopResultBuilder]: At program point L381(lines 364 399) the Hoare annotation is: (let ((.cse2 (let ((.cse9 (mod (+ (* 2 |ULTIMATE.start_ssl3_accept_~ag_X~0#1|) (* 2 |ULTIMATE.start_ssl3_accept_~ag_Y~0#1|)) 4294967296))) (or (< .cse9 8656) (not (<= .cse9 2147483647))))) (.cse3 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) (.cse4 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse5 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse6 (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse0 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse7 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse1 (<= 8512 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse8 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|)))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse1 .cse2 .cse3) (and .cse1 .cse5 .cse3) (and .cse6 .cse4 .cse7 .cse1 .cse8) (and .cse6 .cse7 .cse1 .cse5 .cse8) (and .cse6 .cse0 .cse7 .cse1 .cse8))) [2022-07-22 11:04:29,150 INFO L899 garLoopResultBuilder]: For program point L249(lines 249 254) no Hoare annotation was computed. [2022-07-22 11:04:29,150 INFO L899 garLoopResultBuilder]: For program point L216(lines 216 603) no Hoare annotation was computed. [2022-07-22 11:04:29,150 INFO L899 garLoopResultBuilder]: For program point L183(lines 183 614) no Hoare annotation was computed. [2022-07-22 11:04:29,150 INFO L899 garLoopResultBuilder]: For program point L150(lines 150 625) no Hoare annotation was computed. [2022-07-22 11:04:29,150 INFO L899 garLoopResultBuilder]: For program point L117(lines 117 636) no Hoare annotation was computed. [2022-07-22 11:04:29,150 INFO L895 garLoopResultBuilder]: At program point L415(lines 406 437) the Hoare annotation is: (let ((.cse2 (let ((.cse9 (mod (+ (* 2 |ULTIMATE.start_ssl3_accept_~ag_X~0#1|) (* 2 |ULTIMATE.start_ssl3_accept_~ag_Y~0#1|)) 4294967296))) (or (< .cse9 8656) (not (<= .cse9 2147483647))))) (.cse3 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) (.cse4 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse5 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse6 (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse0 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse7 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse1 (<= 8512 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse8 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|)))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse1 .cse2 .cse3) (and .cse1 .cse5 .cse3) (and .cse6 .cse4 .cse7 .cse1 .cse8) (and .cse6 .cse7 .cse1 .cse5 .cse8) (and .cse6 .cse0 .cse7 .cse1 .cse8))) [2022-07-22 11:04:29,150 INFO L895 garLoopResultBuilder]: At program point L217(lines 216 603) the Hoare annotation is: (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) [2022-07-22 11:04:29,151 INFO L895 garLoopResultBuilder]: At program point L184(lines 180 615) the Hoare annotation is: (let ((.cse2 (let ((.cse9 (mod (+ (* 2 |ULTIMATE.start_ssl3_accept_~ag_X~0#1|) (* 2 |ULTIMATE.start_ssl3_accept_~ag_Y~0#1|)) 4294967296))) (or (< .cse9 8656) (not (<= .cse9 2147483647))))) (.cse4 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse5 (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse0 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse6 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse7 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (.cse1 (<= 8512 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse8 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse3 (not (<= 8656 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and .cse0 .cse1 (< 8496 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|) (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576) .cse2 .cse3) (and .cse4 .cse1 .cse2 .cse3) (and .cse0 .cse1 (< |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8496) .cse2 .cse3) (and .cse5 .cse4 .cse6 .cse1 .cse7) (and .cse5 .cse6 .cse1 .cse8 .cse7) (and .cse5 .cse0 .cse6 .cse1 .cse7) (and .cse1 .cse8 .cse3))) [2022-07-22 11:04:29,151 INFO L895 garLoopResultBuilder]: At program point L151(lines 147 626) the Hoare annotation is: (let ((.cse11 (mod (+ (* 2 |ULTIMATE.start_ssl3_accept_~ag_X~0#1|) (* 2 |ULTIMATE.start_ssl3_accept_~ag_Y~0#1|)) 4294967296))) (let ((.cse9 (< .cse11 8656)) (.cse10 (not (<= .cse11 2147483647)))) (let ((.cse1 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse5 (or .cse9 .cse10)) (.cse4 (<= 8466 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse6 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) (.cse8 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse0 (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse7 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse3 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|)))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 .cse4 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576) .cse5 .cse6) (and .cse0 (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|) .cse2 .cse7 .cse6) (and .cse0 .cse8 .cse2 .cse4 .cse5 .cse6) (and .cse0 .cse2 .cse4 (or .cse9 (not (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8496)) .cse10) .cse7 .cse6) (and .cse0 .cse8 .cse2 .cse3) (and .cse0 .cse2 .cse7 .cse3))))) [2022-07-22 11:04:29,151 INFO L899 garLoopResultBuilder]: For program point L85(lines 85 93) no Hoare annotation was computed. [2022-07-22 11:04:29,151 INFO L899 garLoopResultBuilder]: For program point L383(lines 383 387) no Hoare annotation was computed. [2022-07-22 11:04:29,151 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-22 11:04:29,151 INFO L899 garLoopResultBuilder]: For program point L417(lines 417 423) no Hoare annotation was computed. [2022-07-22 11:04:29,151 INFO L899 garLoopResultBuilder]: For program point L186(lines 186 613) no Hoare annotation was computed. [2022-07-22 11:04:29,152 INFO L899 garLoopResultBuilder]: For program point L153(lines 153 624) no Hoare annotation was computed. [2022-07-22 11:04:29,152 INFO L899 garLoopResultBuilder]: For program point L120(lines 120 635) no Hoare annotation was computed. [2022-07-22 11:04:29,152 INFO L899 garLoopResultBuilder]: For program point L583(lines 583 593) no Hoare annotation was computed. [2022-07-22 11:04:29,152 INFO L899 garLoopResultBuilder]: For program point L583-1(lines 583 593) no Hoare annotation was computed. [2022-07-22 11:04:29,152 INFO L899 garLoopResultBuilder]: For program point L484(lines 484 488) no Hoare annotation was computed. [2022-07-22 11:04:29,152 INFO L899 garLoopResultBuilder]: For program point L286(lines 286 290) no Hoare annotation was computed. [2022-07-22 11:04:29,152 INFO L895 garLoopResultBuilder]: At program point L220(lines 219 602) the Hoare annotation is: (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) [2022-07-22 11:04:29,152 INFO L899 garLoopResultBuilder]: For program point L88(lines 88 92) no Hoare annotation was computed. [2022-07-22 11:04:29,153 INFO L899 garLoopResultBuilder]: For program point L88-2(lines 85 93) no Hoare annotation was computed. [2022-07-22 11:04:29,153 INFO L899 garLoopResultBuilder]: For program point L518(lines 518 522) no Hoare annotation was computed. [2022-07-22 11:04:29,153 INFO L899 garLoopResultBuilder]: For program point L320(lines 320 328) no Hoare annotation was computed. [2022-07-22 11:04:29,153 INFO L902 garLoopResultBuilder]: At program point L684(lines 76 686) the Hoare annotation is: true [2022-07-22 11:04:29,153 INFO L899 garLoopResultBuilder]: For program point L651(lines 651 657) no Hoare annotation was computed. [2022-07-22 11:04:29,153 INFO L899 garLoopResultBuilder]: For program point L552(lines 552 557) no Hoare annotation was computed. [2022-07-22 11:04:29,153 INFO L899 garLoopResultBuilder]: For program point L189(lines 189 612) no Hoare annotation was computed. [2022-07-22 11:04:29,153 INFO L899 garLoopResultBuilder]: For program point L156(lines 156 623) no Hoare annotation was computed. [2022-07-22 11:04:29,154 INFO L899 garLoopResultBuilder]: For program point L123(lines 123 634) no Hoare annotation was computed. [2022-07-22 11:04:29,154 INFO L902 garLoopResultBuilder]: At program point L685(lines 19 687) the Hoare annotation is: true [2022-07-22 11:04:29,154 INFO L899 garLoopResultBuilder]: For program point L586(lines 586 590) no Hoare annotation was computed. [2022-07-22 11:04:29,154 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-22 11:04:29,154 INFO L895 garLoopResultBuilder]: At program point L190(lines 186 613) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse4 (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse5 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse6 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (.cse7 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse3 (not (<= 8656 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse8 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse9 (< |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656)) (.cse1 (<= 8512 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse2 (let ((.cse10 (mod (+ (* 2 |ULTIMATE.start_ssl3_accept_~ag_X~0#1|) (* 2 |ULTIMATE.start_ssl3_accept_~ag_Y~0#1|)) 4294967296))) (or (< .cse10 8656) (not (<= .cse10 2147483647)))))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse0 .cse5 .cse1 .cse6) (and .cse4 .cse5 .cse1 .cse7 .cse6) (and .cse4 .cse8 .cse5 .cse1 .cse6) (and .cse8 .cse9 .cse1 (< |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8496) .cse2) (and .cse1 .cse7 .cse3) (and .cse8 .cse9 .cse1 (< 8496 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|) (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576) .cse2))) [2022-07-22 11:04:29,154 INFO L895 garLoopResultBuilder]: At program point L157(lines 153 624) the Hoare annotation is: (let ((.cse2 (let ((.cse9 (mod (+ (* 2 |ULTIMATE.start_ssl3_accept_~ag_X~0#1|) (* 2 |ULTIMATE.start_ssl3_accept_~ag_Y~0#1|)) 4294967296))) (or (< .cse9 8656) (not (<= .cse9 2147483647))))) (.cse3 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) (.cse4 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse5 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse6 (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse0 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse7 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse1 (<= 8512 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse8 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|)))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse1 .cse2 .cse3) (and .cse1 .cse5 .cse3) (and .cse6 .cse4 .cse7 .cse1 .cse8) (and .cse6 .cse7 .cse1 .cse5 .cse8) (and .cse6 .cse0 .cse7 .cse1 .cse8))) [2022-07-22 11:04:29,154 INFO L899 garLoopResultBuilder]: For program point L323(lines 323 327) no Hoare annotation was computed. [2022-07-22 11:04:29,155 INFO L899 garLoopResultBuilder]: For program point L323-2(lines 221 599) no Hoare annotation was computed. [2022-07-22 11:04:29,155 INFO L895 garLoopResultBuilder]: At program point L224(lines 117 636) the Hoare annotation is: (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) [2022-07-22 11:04:29,155 INFO L899 garLoopResultBuilder]: For program point L192(lines 192 611) no Hoare annotation was computed. [2022-07-22 11:04:29,155 INFO L899 garLoopResultBuilder]: For program point L159(lines 159 622) no Hoare annotation was computed. [2022-07-22 11:04:29,155 INFO L899 garLoopResultBuilder]: For program point L126(lines 126 633) no Hoare annotation was computed. [2022-07-22 11:04:29,155 INFO L899 garLoopResultBuilder]: For program point L523(lines 523 527) no Hoare annotation was computed. [2022-07-22 11:04:29,155 INFO L899 garLoopResultBuilder]: For program point L523-2(lines 523 527) no Hoare annotation was computed. [2022-07-22 11:04:29,155 INFO L899 garLoopResultBuilder]: For program point L457-1(lines 457 469) no Hoare annotation was computed. [2022-07-22 11:04:29,156 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-22 11:04:29,156 INFO L895 garLoopResultBuilder]: At program point L425(lines 416 436) the Hoare annotation is: (let ((.cse3 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse5 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse8 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (.cse0 (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse7 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse2 (<= 8512 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse6 (let ((.cse9 (mod (+ (* 2 |ULTIMATE.start_ssl3_accept_~ag_X~0#1|) (* 2 |ULTIMATE.start_ssl3_accept_~ag_Y~0#1|)) 4294967296))) (or (< .cse9 8656) (not (<= .cse9 2147483647))))) (.cse4 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse5 .cse1 .cse2 .cse6 .cse4) (and .cse0 .cse7 .cse1 .cse2 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse8) (and .cse0 .cse5 .cse1 .cse2 .cse8) (and .cse0 .cse7 .cse1 .cse2 .cse6 .cse4))) [2022-07-22 11:04:29,156 INFO L899 garLoopResultBuilder]: For program point L359(lines 359 363) no Hoare annotation was computed. [2022-07-22 11:04:29,156 INFO L899 garLoopResultBuilder]: For program point L359-2(lines 221 599) no Hoare annotation was computed. [2022-07-22 11:04:29,156 INFO L899 garLoopResultBuilder]: For program point L95(lines 95 103) no Hoare annotation was computed. [2022-07-22 11:04:29,156 INFO L899 garLoopResultBuilder]: For program point L95-1(lines 76 686) no Hoare annotation was computed. [2022-07-22 11:04:29,156 INFO L899 garLoopResultBuilder]: For program point L195(lines 195 610) no Hoare annotation was computed. [2022-07-22 11:04:29,157 INFO L899 garLoopResultBuilder]: For program point L162(lines 162 621) no Hoare annotation was computed. [2022-07-22 11:04:29,157 INFO L899 garLoopResultBuilder]: For program point L129(lines 129 632) no Hoare annotation was computed. [2022-07-22 11:04:29,157 INFO L899 garLoopResultBuilder]: For program point L96(lines 96 100) no Hoare annotation was computed. [2022-07-22 11:04:29,157 INFO L899 garLoopResultBuilder]: For program point L460(lines 460 465) no Hoare annotation was computed. [2022-07-22 11:04:29,157 INFO L899 garLoopResultBuilder]: For program point L229(lines 229 233) no Hoare annotation was computed. [2022-07-22 11:04:29,157 INFO L895 garLoopResultBuilder]: At program point L196(lines 192 611) the Hoare annotation is: (let ((.cse2 (let ((.cse9 (mod (+ (* 2 |ULTIMATE.start_ssl3_accept_~ag_X~0#1|) (* 2 |ULTIMATE.start_ssl3_accept_~ag_Y~0#1|)) 4294967296))) (or (< .cse9 8656) (not (<= .cse9 2147483647))))) (.cse0 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse5 (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse4 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse6 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse7 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (.cse1 (<= 8512 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse8 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse3 (not (<= 8656 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse1 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576) .cse2 .cse3) (and .cse5 .cse0 .cse6 .cse1 .cse7) (and .cse5 .cse6 .cse1 .cse8 .cse7) (and .cse5 .cse4 .cse6 .cse1 .cse7) (and .cse1 .cse8 .cse3))) [2022-07-22 11:04:29,157 INFO L895 garLoopResultBuilder]: At program point L163(lines 159 622) the Hoare annotation is: (let ((.cse2 (let ((.cse9 (mod (+ (* 2 |ULTIMATE.start_ssl3_accept_~ag_X~0#1|) (* 2 |ULTIMATE.start_ssl3_accept_~ag_Y~0#1|)) 4294967296))) (or (< .cse9 8656) (not (<= .cse9 2147483647))))) (.cse3 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) (.cse4 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse5 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse6 (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse0 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse7 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse1 (<= 8512 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse8 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|)))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse1 .cse2 .cse3) (and .cse1 .cse5 .cse3) (and .cse6 .cse4 .cse7 .cse1 .cse8) (and .cse6 .cse7 .cse1 .cse5 .cse8) (and .cse6 .cse0 .cse7 .cse1 .cse8))) [2022-07-22 11:04:29,158 INFO L899 garLoopResultBuilder]: For program point L229-2(lines 221 599) no Hoare annotation was computed. [2022-07-22 11:04:29,158 INFO L899 garLoopResultBuilder]: For program point L428(lines 428 432) no Hoare annotation was computed. [2022-07-22 11:04:29,158 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-22 11:04:29,158 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 680) no Hoare annotation was computed. [2022-07-22 11:04:29,158 INFO L899 garLoopResultBuilder]: For program point L198(lines 198 609) no Hoare annotation was computed. [2022-07-22 11:04:29,158 INFO L899 garLoopResultBuilder]: For program point L165(lines 165 620) no Hoare annotation was computed. [2022-07-22 11:04:29,158 INFO L899 garLoopResultBuilder]: For program point L132(lines 132 631) no Hoare annotation was computed. [2022-07-22 11:04:29,158 INFO L899 garLoopResultBuilder]: For program point L562(lines 562 566) no Hoare annotation was computed. [2022-07-22 11:04:29,159 INFO L899 garLoopResultBuilder]: For program point L496(lines 496 500) no Hoare annotation was computed. [2022-07-22 11:04:29,159 INFO L895 garLoopResultBuilder]: At program point L133(lines 129 632) the Hoare annotation is: (let ((.cse6 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse5 (let ((.cse9 (mod (+ (* 2 |ULTIMATE.start_ssl3_accept_~ag_X~0#1|) (* 2 |ULTIMATE.start_ssl3_accept_~ag_Y~0#1|)) 4294967296))) (or (< .cse9 8656) (not (<= .cse9 2147483647))))) (.cse3 (<= 8466 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse4 (< |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8496)) (.cse1 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse0 (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse8 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse7 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse6 .cse2 .cse7) (and .cse0 .cse6 .cse2 .cse3 .cse4 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576) .cse5) (and .cse0 .cse2 .cse3 .cse4 .cse8) (and .cse0 .cse1 .cse2 .cse7) (and .cse0 .cse2 .cse8 .cse7))) [2022-07-22 11:04:29,159 INFO L895 garLoopResultBuilder]: At program point L563(lines 76 686) the Hoare annotation is: false [2022-07-22 11:04:29,159 INFO L899 garLoopResultBuilder]: For program point L266(lines 266 280) no Hoare annotation was computed. [2022-07-22 11:04:29,162 INFO L356 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:04:29,164 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-22 11:04:29,202 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.07 11:04:29 BoogieIcfgContainer [2022-07-22 11:04:29,202 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-22 11:04:29,203 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-22 11:04:29,203 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-22 11:04:29,203 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-22 11:04:29,203 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 11:03:41" (3/4) ... [2022-07-22 11:04:29,207 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-22 11:04:29,227 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2022-07-22 11:04:29,228 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-07-22 11:04:29,228 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-07-22 11:04:29,229 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-22 11:04:29,290 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-22 11:04:29,291 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-22 11:04:29,291 INFO L158 Benchmark]: Toolchain (without parser) took 48785.47ms. Allocated memory was 98.6MB in the beginning and 1.1GB in the end (delta: 966.8MB). Free memory was 66.2MB in the beginning and 509.2MB in the end (delta: -443.0MB). Peak memory consumption was 523.2MB. Max. memory is 16.1GB. [2022-07-22 11:04:29,291 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 98.6MB. Free memory is still 52.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 11:04:29,291 INFO L158 Benchmark]: CACSL2BoogieTranslator took 370.22ms. Allocated memory was 98.6MB in the beginning and 123.7MB in the end (delta: 25.2MB). Free memory was 66.0MB in the beginning and 94.8MB in the end (delta: -28.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-22 11:04:29,292 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.68ms. Allocated memory is still 123.7MB. Free memory was 94.8MB in the beginning and 91.9MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-22 11:04:29,292 INFO L158 Benchmark]: Boogie Preprocessor took 57.40ms. Allocated memory is still 123.7MB. Free memory was 91.9MB in the beginning and 89.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-22 11:04:29,292 INFO L158 Benchmark]: RCFGBuilder took 538.98ms. Allocated memory is still 123.7MB. Free memory was 89.8MB in the beginning and 90.8MB in the end (delta: -1.0MB). Peak memory consumption was 28.6MB. Max. memory is 16.1GB. [2022-07-22 11:04:29,292 INFO L158 Benchmark]: TraceAbstraction took 47669.87ms. Allocated memory was 123.7MB in the beginning and 1.1GB in the end (delta: 941.6MB). Free memory was 90.2MB in the beginning and 517.6MB in the end (delta: -427.4MB). Peak memory consumption was 717.8MB. Max. memory is 16.1GB. [2022-07-22 11:04:29,293 INFO L158 Benchmark]: Witness Printer took 87.88ms. Allocated memory is still 1.1GB. Free memory was 517.6MB in the beginning and 509.2MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-22 11:04:29,294 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 98.6MB. Free memory is still 52.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 370.22ms. Allocated memory was 98.6MB in the beginning and 123.7MB in the end (delta: 25.2MB). Free memory was 66.0MB in the beginning and 94.8MB in the end (delta: -28.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.68ms. Allocated memory is still 123.7MB. Free memory was 94.8MB in the beginning and 91.9MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 57.40ms. Allocated memory is still 123.7MB. Free memory was 91.9MB in the beginning and 89.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 538.98ms. Allocated memory is still 123.7MB. Free memory was 89.8MB in the beginning and 90.8MB in the end (delta: -1.0MB). Peak memory consumption was 28.6MB. Max. memory is 16.1GB. * TraceAbstraction took 47669.87ms. Allocated memory was 123.7MB in the beginning and 1.1GB in the end (delta: 941.6MB). Free memory was 90.2MB in the beginning and 517.6MB in the end (delta: -427.4MB). Peak memory consumption was 717.8MB. Max. memory is 16.1GB. * Witness Printer took 87.88ms. Allocated memory is still 1.1GB. Free memory was 517.6MB in the beginning and 509.2MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 680]: 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, 138 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 47.6s, OverallIterations: 21, TraceHistogramMax: 21, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.2s, AutomataDifference: 7.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 30.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3607 SdHoareTripleChecker+Valid, 3.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3607 mSDsluCounter, 9593 SdHoareTripleChecker+Invalid, 3.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 716 IncrementalHoareTripleChecker+Unchecked, 4440 mSDsCounter, 717 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4691 IncrementalHoareTripleChecker+Invalid, 6124 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 717 mSolverCounterUnsat, 5153 mSDtfsCounter, 4691 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4504 GetRequests, 4435 SyntacticMatches, 2 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19067occurred in iteration=20, InterpolantAutomatonStates: 99, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.6s AutomataMinimizationTime, 21 MinimizatonAttempts, 8149 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 29 LocationsWithAnnotation, 29 PreInvPairs, 1191 NumberOfFragments, 4932 HoareAnnotationTreeSize, 29 FomulaSimplifications, 45738 FormulaSimplificationTreeSizeReduction, 13.0s HoareSimplificationTime, 29 FomulaSimplificationsInter, 141006 FormulaSimplificationTreeSizeReductionInter, 17.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 7884 NumberOfCodeBlocks, 7884 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 9619 ConstructedInterpolants, 35 QuantifiedInterpolants, 26697 SizeOfPredicates, 9 NumberOfNonLiveVariables, 4217 ConjunctsInSsa, 18 ConjunctsInUnsatCore, 31 InterpolantComputations, 17 PerfectInterpolantSequences, 43543/44409 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: 111]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((blastFlag == 1 && s__s3__tmp__next_state___0 < 8496) && ((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647))) && !(8496 <= s__state)) || (((((2 == blastFlag && 8466 <= s__state) && s__state < 8496) && 8496 < s__s3__tmp__next_state___0) && s__s3__tmp__next_state___0 <= 8576) && ((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647)))) || ((2 == blastFlag && ((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647))) && 8544 == s__state)) || (((blastFlag == 1 && 8466 <= s__state) && s__state < 8496) && ((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647)))) || (((3 == blastFlag && 8640 <= s__s3__tmp__next_state___0) && 8640 <= s__state) && !(0 == s__hit))) || (2 == blastFlag && !(0 == s__hit))) || ((((blastFlag == 1 && s__state <= 8448) && 8496 < s__s3__tmp__next_state___0) && s__s3__tmp__next_state___0 <= 8576) && ((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647)))) || ((s__state == 8528 && 2 == blastFlag) && ((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647)))) || ((((!(8673 == s__state) && 3 == blastFlag) && s__s3__tmp__next_state___0 <= 8576) && ((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647))) && 8656 <= s__state)) || (blastFlag == 1 && ((2 * ag_X + 2 * ag_Y) % 4294967296 <= 8496 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647)))) || (((((s__state + (2 * ag_X + 2 * ag_Y) / 4294967296 * 4294967296 + 4294967296 == 2 * ag_X + 2 * ag_Y && !(2 * ag_X + 2 * ag_Y <= 2147483647 + (2 * ag_X + 2 * ag_Y) / 4294967296 * 4294967296)) || s__state + (2 * ag_X + 2 * ag_Y) / 4294967296 * 4294967296 == 2 * ag_X + 2 * ag_Y) && 2 == blastFlag) && s__state < 8656) && s__s3__tmp__next_state___0 < 8496)) || ((((3 == blastFlag && s__state <= 8448) && 3 == s__s3__tmp__next_state___0) && 0 == s__hit) && ((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647)))) || (((!(8673 == s__state) && blastFlag == 1) && 8512 <= s__state) && ((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647)))) || (((2 == blastFlag && s__s3__tmp__next_state___0 < 8496) && ((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647))) && !(8496 <= s__state))) || ((2 == blastFlag && s__state == 8512) && ((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647)))) || ((blastFlag == 1 && s__state <= 8448) && 3 == s__s3__tmp__next_state___0)) || (((blastFlag == 1 && s__state <= 8448) && s__state == 3) && ((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647)))) || ((((((s__state + (2 * ag_X + 2 * ag_Y) / 4294967296 * 4294967296 + 4294967296 == 2 * ag_X + 2 * ag_Y && !(2 * ag_X + 2 * ag_Y <= 2147483647 + (2 * ag_X + 2 * ag_Y) / 4294967296 * 4294967296)) || s__state + (2 * ag_X + 2 * ag_Y) / 4294967296 * 4294967296 == 2 * ag_X + 2 * ag_Y) && 2 == blastFlag) && s__state < 8656) && 8496 < s__s3__tmp__next_state___0) && s__s3__tmp__next_state___0 <= 8576)) || (((!(8673 == s__state) && 3 == blastFlag) && !(0 == s__hit)) && 8656 <= s__state)) || (((3 == blastFlag && 8640 <= s__s3__tmp__next_state___0) && s__state <= 8448) && !(0 == s__hit))) || ((((2 == blastFlag && s__state < 8656) && 8512 <= s__state) && s__s3__tmp__next_state___0 < 8496) && ((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647)))) || ((((2 == blastFlag && s__state <= 8448) && 8496 < s__s3__tmp__next_state___0) && s__s3__tmp__next_state___0 <= 8576) && ((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647)))) || (blastFlag == 1 && !(0 == s__hit))) || (((((2 == blastFlag && !(s__state <= 8496)) && 8496 < s__s3__tmp__next_state___0) && s__s3__tmp__next_state___0 <= 8576) && ((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647))) && s__state <= 8576)) || (((((!(8673 == s__state) && 2 == blastFlag) && !(s__state == 8672)) && 8640 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && ((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647)))) || ((2 == blastFlag && 8560 == s__state) && ((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647)))) || (((8496 == s__state && 2 == blastFlag) && 8496 + (2 * ag_X + 2 * ag_Y) / 4294967296 * 4294967296 == 2 * ag_X + 2 * ag_Y) && s__s3__tmp__next_state___0 <= 8576)) || blastFlag == 0) || (blastFlag == 1 && s__state + (2 * ag_X + 2 * ag_Y) / 4294967296 * 4294967296 == 2 * ag_X + 2 * ag_Y)) || (((((2 == blastFlag && s__state < 8656) && 8512 <= s__state) && 8496 < s__s3__tmp__next_state___0) && s__s3__tmp__next_state___0 <= 8576) && ((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647)))) || (((((blastFlag == 1 && !(s__state <= 8496)) && 8496 < s__s3__tmp__next_state___0) && s__s3__tmp__next_state___0 <= 8576) && ((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647))) && s__state <= 8576)) || ((!(8673 == s__state) && blastFlag == 1) && 8656 <= s__state) - InvariantResult [Line: 171]: Loop Invariant Derived loop invariant: ((((((((!(8673 == s__state) && !(s__state == 8672)) && 8512 <= s__state) && blastFlag == 0) && s__state <= 8576) || (((((!(8673 == s__state) && 2 == blastFlag) && !(s__state == 8672)) && 8512 <= s__state) && ((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647))) && s__state <= 8576)) || ((((!(8673 == s__state) && blastFlag == 1) && !(s__state == 8672)) && 8512 <= s__state) && !(0 == s__hit))) || ((((!(8673 == s__state) && !(s__state == 8672)) && 8512 <= s__state) && blastFlag == 0) && !(0 == s__hit))) || ((((!(8673 == s__state) && 2 == blastFlag) && !(s__state == 8672)) && 8512 <= s__state) && !(0 == s__hit))) || (((((!(8673 == s__state) && blastFlag == 1) && !(s__state == 8672)) && 8512 <= s__state) && ((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647))) && s__state <= 8576) - InvariantResult [Line: 76]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 416]: Loop Invariant Derived loop invariant: ((((((((!(8673 == s__state) && !(s__state == 8672)) && 8512 <= s__state) && blastFlag == 0) && s__state <= 8576) || (((((!(8673 == s__state) && 2 == blastFlag) && !(s__state == 8672)) && 8512 <= s__state) && ((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647))) && s__state <= 8576)) || ((((!(8673 == s__state) && blastFlag == 1) && !(s__state == 8672)) && 8512 <= s__state) && !(0 == s__hit))) || ((((!(8673 == s__state) && !(s__state == 8672)) && 8512 <= s__state) && blastFlag == 0) && !(0 == s__hit))) || ((((!(8673 == s__state) && 2 == blastFlag) && !(s__state == 8672)) && 8512 <= s__state) && !(0 == s__hit))) || (((((!(8673 == s__state) && blastFlag == 1) && !(s__state == 8672)) && 8512 <= s__state) && ((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647))) && s__state <= 8576) - InvariantResult [Line: 153]: Loop Invariant Derived loop invariant: (((((((2 == blastFlag && 8512 <= s__state) && ((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647))) && s__state <= 8576) || (((blastFlag == 1 && 8512 <= s__state) && ((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647))) && s__state <= 8576)) || ((8512 <= s__state && blastFlag == 0) && s__state <= 8576)) || ((((!(8673 == s__state) && blastFlag == 1) && !(s__state == 8672)) && 8512 <= s__state) && !(0 == s__hit))) || ((((!(8673 == s__state) && !(s__state == 8672)) && 8512 <= s__state) && blastFlag == 0) && !(0 == s__hit))) || ((((!(8673 == s__state) && 2 == blastFlag) && !(s__state == 8672)) && 8512 <= s__state) && !(0 == s__hit)) - InvariantResult [Line: 204]: Loop Invariant Derived loop invariant: ((((((((!(8673 == s__state) && 3 == blastFlag) && !(s__state == 8672)) && !(0 == s__hit)) && 8656 <= s__state) || (((!(8673 == s__state) && blastFlag == 1) && !(s__state == 8672)) && 8656 <= s__state)) || (((((!(8673 == s__state) && 3 == blastFlag) && !(s__state == 8672)) && s__s3__tmp__next_state___0 <= 8576) && ((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647))) && 8656 <= s__state)) || (((((!(8673 == s__state) && 2 == blastFlag) && !(s__state == 8672)) && s__s3__tmp__next_state___0 <= 8576) && ((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647))) && 8656 <= s__state)) || ((((!(8673 == s__state) && 2 == blastFlag) && !(s__state == 8672)) && !(0 == s__hit)) && 8656 <= s__state)) || (((!(8673 == s__state) && !(s__state == 8672)) && blastFlag == 0) && 8656 <= s__state) - InvariantResult [Line: 129]: Loop Invariant Derived loop invariant: (((((((((!(8673 == s__state) && blastFlag == 1) && !(s__state == 8672)) && 8466 <= s__state) && s__state < 8496) && ((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647))) || (((!(8673 == s__state) && 2 == blastFlag) && !(s__state == 8672)) && !(0 == s__hit))) || ((((((!(8673 == s__state) && 2 == blastFlag) && !(s__state == 8672)) && 8466 <= s__state) && s__state < 8496) && s__s3__tmp__next_state___0 <= 8576) && ((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647)))) || ((((!(8673 == s__state) && !(s__state == 8672)) && 8466 <= s__state) && s__state < 8496) && blastFlag == 0)) || (((!(8673 == s__state) && blastFlag == 1) && !(s__state == 8672)) && !(0 == s__hit))) || (((!(8673 == s__state) && !(s__state == 8672)) && blastFlag == 0) && !(0 == s__hit)) - InvariantResult [Line: 406]: Loop Invariant Derived loop invariant: (((((((2 == blastFlag && 8512 <= s__state) && ((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647))) && s__state <= 8576) || (((blastFlag == 1 && 8512 <= s__state) && ((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647))) && s__state <= 8576)) || ((8512 <= s__state && blastFlag == 0) && s__state <= 8576)) || ((((!(8673 == s__state) && blastFlag == 1) && !(s__state == 8672)) && 8512 <= s__state) && !(0 == s__hit))) || ((((!(8673 == s__state) && !(s__state == 8672)) && 8512 <= s__state) && blastFlag == 0) && !(0 == s__hit))) || ((((!(8673 == s__state) && 2 == blastFlag) && !(s__state == 8672)) && 8512 <= s__state) && !(0 == s__hit)) - InvariantResult [Line: 110]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: !(s__state == 8672) - InvariantResult [Line: 135]: Loop Invariant Derived loop invariant: ((((((((((2 == blastFlag && 8466 <= s__state) && s__state < 8496) && 8496 < s__s3__tmp__next_state___0) && s__s3__tmp__next_state___0 <= 8576) && ((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647))) || (((blastFlag == 1 && 8466 <= s__state) && s__state < 8496) && ((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647)))) || (((!(8673 == s__state) && 2 == blastFlag) && !(s__state == 8672)) && !(0 == s__hit))) || ((((2 == blastFlag && 8466 <= s__state) && s__state < 8496) && s__s3__tmp__next_state___0 < 8496) && ((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647)))) || ((8466 <= s__state && s__state < 8496) && blastFlag == 0)) || (((!(8673 == s__state) && blastFlag == 1) && !(s__state == 8672)) && !(0 == s__hit))) || (((!(8673 == s__state) && !(s__state == 8672)) && blastFlag == 0) && !(0 == s__hit)) - InvariantResult [Line: 147]: Loop Invariant Derived loop invariant: ((((((((!(8673 == s__state) && 2 == blastFlag) && !(s__state == 8672)) && !(0 == s__hit)) || ((((((!(8673 == s__state) && 2 == blastFlag) && !(s__state == 8672)) && 8466 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && ((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647))) && s__state <= 8576)) || ((((!(8673 == s__state) && 8496 == s__state) && !(s__state == 8672)) && blastFlag == 0) && s__state <= 8576)) || (((((!(8673 == s__state) && blastFlag == 1) && !(s__state == 8672)) && 8466 <= s__state) && ((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647))) && s__state <= 8576)) || (((((!(8673 == s__state) && !(s__state == 8672)) && 8466 <= s__state) && (((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !(s__state <= 8496)) || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647))) && blastFlag == 0) && s__state <= 8576)) || (((!(8673 == s__state) && blastFlag == 1) && !(s__state == 8672)) && !(0 == s__hit))) || (((!(8673 == s__state) && !(s__state == 8672)) && blastFlag == 0) && !(0 == s__hit)) - InvariantResult [Line: 180]: Loop Invariant Derived loop invariant: ((((((((((2 == blastFlag && 8512 <= s__state) && 8496 < s__s3__tmp__next_state___0) && s__s3__tmp__next_state___0 <= 8576) && ((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647))) && !(8656 <= s__state)) || (((blastFlag == 1 && 8512 <= s__state) && ((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647))) && !(8656 <= s__state))) || ((((2 == blastFlag && 8512 <= s__state) && s__s3__tmp__next_state___0 < 8496) && ((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647))) && !(8656 <= s__state))) || ((((!(8673 == s__state) && blastFlag == 1) && !(s__state == 8672)) && 8512 <= s__state) && !(0 == s__hit))) || ((((!(8673 == s__state) && !(s__state == 8672)) && 8512 <= s__state) && blastFlag == 0) && !(0 == s__hit))) || ((((!(8673 == s__state) && 2 == blastFlag) && !(s__state == 8672)) && 8512 <= s__state) && !(0 == s__hit))) || ((8512 <= s__state && blastFlag == 0) && !(8656 <= s__state)) - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 198]: Loop Invariant Derived loop invariant: ((((((((blastFlag == 1 && 8640 <= s__state) && ((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647))) && !(8656 <= s__state)) || ((((!(8673 == s__state) && 2 == blastFlag) && !(s__state == 8672)) && 8640 <= s__state) && !(0 == s__hit))) || ((((!(8673 == s__state) && blastFlag == 1) && !(s__state == 8672)) && 8640 <= s__state) && !(0 == s__hit))) || ((((!(8673 == s__state) && !(s__state == 8672)) && 8640 <= s__state) && blastFlag == 0) && !(0 == s__hit))) || ((8640 <= s__state && blastFlag == 0) && !(8656 <= s__state))) || (((((!(8673 == s__state) && 3 == blastFlag) && !(s__state == 8672)) && 8640 <= s__s3__tmp__next_state___0) && 8640 <= s__state) && !(0 == s__hit))) || ((((2 == blastFlag && 8640 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && ((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647))) && !(8656 <= s__state)) - InvariantResult [Line: 159]: Loop Invariant Derived loop invariant: (((((((2 == blastFlag && 8512 <= s__state) && ((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647))) && s__state <= 8576) || (((blastFlag == 1 && 8512 <= s__state) && ((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647))) && s__state <= 8576)) || ((8512 <= s__state && blastFlag == 0) && s__state <= 8576)) || ((((!(8673 == s__state) && blastFlag == 1) && !(s__state == 8672)) && 8512 <= s__state) && !(0 == s__hit))) || ((((!(8673 == s__state) && !(s__state == 8672)) && 8512 <= s__state) && blastFlag == 0) && !(0 == s__hit))) || ((((!(8673 == s__state) && 2 == blastFlag) && !(s__state == 8672)) && 8512 <= s__state) && !(0 == s__hit)) - InvariantResult [Line: 216]: Loop Invariant Derived loop invariant: !(s__state == 8672) - InvariantResult [Line: 210]: Loop Invariant Derived loop invariant: ((((blastFlag == 0 && 8656 <= s__state) || (((3 == blastFlag && s__s3__tmp__next_state___0 <= 8576) && ((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647))) && 8656 <= s__state)) || (blastFlag == 1 && 8656 <= s__state)) || ((3 == blastFlag && !(0 == s__hit)) && 8656 <= s__state)) || ((2 == blastFlag && !(0 == s__hit)) && 8656 <= s__state) - InvariantResult [Line: 114]: Loop Invariant Derived loop invariant: !(s__state == 8672) - InvariantResult [Line: 138]: Loop Invariant Derived loop invariant: (((((((((!(8673 == s__state) && 2 == blastFlag) && !(s__state == 8672)) && !(0 == s__hit)) || ((((((2 == blastFlag && s__state < 8496) && 0 == s__hit) && s__s3__tmp__next_state___0 < 8496) && s__s3__tmp__next_state___0 <= 8576) && ((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647))) && s__state <= 8576)) || (((((2 == blastFlag && 8496 + (2 * ag_X + 2 * ag_Y) / 4294967296 * 4294967296 == 2 * ag_X + 2 * ag_Y) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576) && !(8496 <= s__state))) || (s__state < 8496 && blastFlag == 0)) || ((((2 == blastFlag && s__state < 8496) && 8496 < s__s3__tmp__next_state___0) && s__s3__tmp__next_state___0 <= 8576) && ((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647)))) || (((!(8673 == s__state) && blastFlag == 1) && !(s__state == 8672)) && !(0 == s__hit))) || (((!(8673 == s__state) && !(s__state == 8672)) && blastFlag == 0) && !(0 == s__hit))) || ((blastFlag == 1 && s__state < 8496) && ((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647))) - InvariantResult [Line: 165]: Loop Invariant Derived loop invariant: (((((((2 == blastFlag && 8512 <= s__state) && ((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647))) && s__state <= 8576) || (((blastFlag == 1 && 8512 <= s__state) && ((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647))) && s__state <= 8576)) || ((8512 <= s__state && blastFlag == 0) && s__state <= 8576)) || ((((!(8673 == s__state) && blastFlag == 1) && !(s__state == 8672)) && 8512 <= s__state) && !(0 == s__hit))) || ((((!(8673 == s__state) && !(s__state == 8672)) && 8512 <= s__state) && blastFlag == 0) && !(0 == s__hit))) || ((((!(8673 == s__state) && 2 == blastFlag) && !(s__state == 8672)) && 8512 <= s__state) && !(0 == s__hit)) - InvariantResult [Line: 186]: Loop Invariant Derived loop invariant: ((((((((blastFlag == 1 && 8512 <= s__state) && ((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647))) && !(8656 <= s__state)) || ((((!(8673 == s__state) && blastFlag == 1) && !(s__state == 8672)) && 8512 <= s__state) && !(0 == s__hit))) || ((((!(8673 == s__state) && !(s__state == 8672)) && 8512 <= s__state) && blastFlag == 0) && !(0 == s__hit))) || ((((!(8673 == s__state) && 2 == blastFlag) && !(s__state == 8672)) && 8512 <= s__state) && !(0 == s__hit))) || ((((2 == blastFlag && s__state < 8656) && 8512 <= s__state) && s__s3__tmp__next_state___0 < 8496) && ((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647)))) || ((8512 <= s__state && blastFlag == 0) && !(8656 <= s__state))) || (((((2 == blastFlag && s__state < 8656) && 8512 <= s__state) && 8496 < s__s3__tmp__next_state___0) && s__s3__tmp__next_state___0 <= 8576) && ((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647))) - InvariantResult [Line: 177]: Loop Invariant Derived loop invariant: ((((((((((((2 == blastFlag && s__state <= 8448) && s__s3__tmp__next_state___0 < 8496) && ((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647))) || ((blastFlag == 1 && s__state <= 8448) && ((2 * ag_X + 2 * ag_Y) % 4294967296 <= 8496 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647)))) || ((((blastFlag == 1 && s__state <= 8448) && 8496 < s__s3__tmp__next_state___0) && s__s3__tmp__next_state___0 <= 8576) && ((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647)))) || (s__state <= 8448 && blastFlag == 0)) || ((((3 == blastFlag && s__state <= 8448) && 3 == s__s3__tmp__next_state___0) && 0 == s__hit) && ((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647)))) || ((blastFlag == 1 && s__state <= 8448) && 3 == s__s3__tmp__next_state___0)) || ((blastFlag == 1 && s__state <= 8448) && !(0 == s__hit))) || ((2 == blastFlag && s__state <= 8448) && !(0 == s__hit))) || (((3 == blastFlag && 8640 <= s__s3__tmp__next_state___0) && s__state <= 8448) && !(0 == s__hit))) || (((blastFlag == 1 && s__state <= 8448) && s__s3__tmp__next_state___0 < 8496) && ((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647)))) || ((((2 == blastFlag && s__state <= 8448) && 8496 < s__s3__tmp__next_state___0) && s__s3__tmp__next_state___0 <= 8576) && ((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647))) - InvariantResult [Line: 111]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((blastFlag == 1 && s__s3__tmp__next_state___0 < 8496) && ((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647))) && !(8496 <= s__state)) || (((((2 == blastFlag && 8466 <= s__state) && s__state < 8496) && 8496 < s__s3__tmp__next_state___0) && s__s3__tmp__next_state___0 <= 8576) && ((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647)))) || ((2 == blastFlag && ((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647))) && 8544 == s__state)) || (((blastFlag == 1 && 8466 <= s__state) && s__state < 8496) && ((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647)))) || (((3 == blastFlag && 8640 <= s__s3__tmp__next_state___0) && 8640 <= s__state) && !(0 == s__hit))) || (2 == blastFlag && !(0 == s__hit))) || ((((blastFlag == 1 && s__state <= 8448) && 8496 < s__s3__tmp__next_state___0) && s__s3__tmp__next_state___0 <= 8576) && ((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647)))) || ((s__state == 8528 && 2 == blastFlag) && ((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647)))) || ((((!(8673 == s__state) && 3 == blastFlag) && s__s3__tmp__next_state___0 <= 8576) && ((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647))) && 8656 <= s__state)) || (blastFlag == 1 && ((2 * ag_X + 2 * ag_Y) % 4294967296 <= 8496 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647)))) || (((((s__state + (2 * ag_X + 2 * ag_Y) / 4294967296 * 4294967296 + 4294967296 == 2 * ag_X + 2 * ag_Y && !(2 * ag_X + 2 * ag_Y <= 2147483647 + (2 * ag_X + 2 * ag_Y) / 4294967296 * 4294967296)) || s__state + (2 * ag_X + 2 * ag_Y) / 4294967296 * 4294967296 == 2 * ag_X + 2 * ag_Y) && 2 == blastFlag) && s__state < 8656) && s__s3__tmp__next_state___0 < 8496)) || ((((3 == blastFlag && s__state <= 8448) && 3 == s__s3__tmp__next_state___0) && 0 == s__hit) && ((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647)))) || (((!(8673 == s__state) && blastFlag == 1) && 8512 <= s__state) && ((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647)))) || (((2 == blastFlag && s__s3__tmp__next_state___0 < 8496) && ((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647))) && !(8496 <= s__state))) || ((2 == blastFlag && s__state == 8512) && ((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647)))) || ((blastFlag == 1 && s__state <= 8448) && 3 == s__s3__tmp__next_state___0)) || (((blastFlag == 1 && s__state <= 8448) && s__state == 3) && ((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647)))) || ((((((s__state + (2 * ag_X + 2 * ag_Y) / 4294967296 * 4294967296 + 4294967296 == 2 * ag_X + 2 * ag_Y && !(2 * ag_X + 2 * ag_Y <= 2147483647 + (2 * ag_X + 2 * ag_Y) / 4294967296 * 4294967296)) || s__state + (2 * ag_X + 2 * ag_Y) / 4294967296 * 4294967296 == 2 * ag_X + 2 * ag_Y) && 2 == blastFlag) && s__state < 8656) && 8496 < s__s3__tmp__next_state___0) && s__s3__tmp__next_state___0 <= 8576)) || (((!(8673 == s__state) && 3 == blastFlag) && !(0 == s__hit)) && 8656 <= s__state)) || (((3 == blastFlag && 8640 <= s__s3__tmp__next_state___0) && s__state <= 8448) && !(0 == s__hit))) || ((((2 == blastFlag && s__state < 8656) && 8512 <= s__state) && s__s3__tmp__next_state___0 < 8496) && ((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647)))) || ((((2 == blastFlag && s__state <= 8448) && 8496 < s__s3__tmp__next_state___0) && s__s3__tmp__next_state___0 <= 8576) && ((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647)))) || (blastFlag == 1 && !(0 == s__hit))) || (((((2 == blastFlag && !(s__state <= 8496)) && 8496 < s__s3__tmp__next_state___0) && s__s3__tmp__next_state___0 <= 8576) && ((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647))) && s__state <= 8576)) || (((((!(8673 == s__state) && 2 == blastFlag) && !(s__state == 8672)) && 8640 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && ((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647)))) || ((2 == blastFlag && 8560 == s__state) && ((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647)))) || (((8496 == s__state && 2 == blastFlag) && 8496 + (2 * ag_X + 2 * ag_Y) / 4294967296 * 4294967296 == 2 * ag_X + 2 * ag_Y) && s__s3__tmp__next_state___0 <= 8576)) || blastFlag == 0) || (blastFlag == 1 && s__state + (2 * ag_X + 2 * ag_Y) / 4294967296 * 4294967296 == 2 * ag_X + 2 * ag_Y)) || (((((2 == blastFlag && s__state < 8656) && 8512 <= s__state) && 8496 < s__s3__tmp__next_state___0) && s__s3__tmp__next_state___0 <= 8576) && ((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647)))) || (((((blastFlag == 1 && !(s__state <= 8496)) && 8496 < s__s3__tmp__next_state___0) && s__s3__tmp__next_state___0 <= 8576) && ((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647))) && s__state <= 8576)) || ((!(8673 == s__state) && blastFlag == 1) && 8656 <= s__state) - InvariantResult [Line: 76]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 192]: Loop Invariant Derived loop invariant: (((((((blastFlag == 1 && 8512 <= s__state) && ((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647))) && !(8656 <= s__state)) || ((((2 == blastFlag && 8512 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && ((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647))) && !(8656 <= s__state))) || ((((!(8673 == s__state) && blastFlag == 1) && !(s__state == 8672)) && 8512 <= s__state) && !(0 == s__hit))) || ((((!(8673 == s__state) && !(s__state == 8672)) && 8512 <= s__state) && blastFlag == 0) && !(0 == s__hit))) || ((((!(8673 == s__state) && 2 == blastFlag) && !(s__state == 8672)) && 8512 <= s__state) && !(0 == s__hit))) || ((8512 <= s__state && blastFlag == 0) && !(8656 <= s__state)) - InvariantResult [Line: 219]: Loop Invariant Derived loop invariant: !(s__state == 8672) - InvariantResult [Line: 688]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 364]: Loop Invariant Derived loop invariant: (((((((2 == blastFlag && 8512 <= s__state) && ((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647))) && s__state <= 8576) || (((blastFlag == 1 && 8512 <= s__state) && ((2 * ag_X + 2 * ag_Y) % 4294967296 < 8656 || !((2 * ag_X + 2 * ag_Y) % 4294967296 <= 2147483647))) && s__state <= 8576)) || ((8512 <= s__state && blastFlag == 0) && s__state <= 8576)) || ((((!(8673 == s__state) && blastFlag == 1) && !(s__state == 8672)) && 8512 <= s__state) && !(0 == s__hit))) || ((((!(8673 == s__state) && !(s__state == 8672)) && 8512 <= s__state) && blastFlag == 0) && !(0 == s__hit))) || ((((!(8673 == s__state) && 2 == blastFlag) && !(s__state == 8672)) && 8512 <= s__state) && !(0 == s__hit)) RESULT: Ultimate proved your program to be correct! [2022-07-22 11:04:29,326 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE