./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/bitvector/s3_srvr_2a_alt.BV.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b5317dae Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector/s3_srvr_2a_alt.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 ffdd9c6c8ed32275119d4b9d2dc66b9f80986fea1a039186a702d6c803e62485 --- Real Ultimate output --- This is Ultimate 0.2.2-?-b5317da-m [2023-02-16 00:42:49,008 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-16 00:42:49,009 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-16 00:42:49,040 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-16 00:42:49,041 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-16 00:42:49,044 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-16 00:42:49,046 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-16 00:42:49,048 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-16 00:42:49,051 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-16 00:42:49,055 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-16 00:42:49,056 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-16 00:42:49,058 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-16 00:42:49,058 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-16 00:42:49,060 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-16 00:42:49,061 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-16 00:42:49,064 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-16 00:42:49,065 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-16 00:42:49,066 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-16 00:42:49,067 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-16 00:42:49,072 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-16 00:42:49,073 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-16 00:42:49,074 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-16 00:42:49,075 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-16 00:42:49,076 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-16 00:42:49,080 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-16 00:42:49,080 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-16 00:42:49,080 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-16 00:42:49,082 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-16 00:42:49,082 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-16 00:42:49,083 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-16 00:42:49,083 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-16 00:42:49,084 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-16 00:42:49,085 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-16 00:42:49,086 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-16 00:42:49,088 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-16 00:42:49,088 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-16 00:42:49,088 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-16 00:42:49,088 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-16 00:42:49,089 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-16 00:42:49,090 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-16 00:42:49,091 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-16 00:42:49,091 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-16 00:42:49,129 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-16 00:42:49,130 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-16 00:42:49,131 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-16 00:42:49,131 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-16 00:42:49,132 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-16 00:42:49,132 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-16 00:42:49,132 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-16 00:42:49,133 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-16 00:42:49,133 INFO L138 SettingsManager]: * Use SBE=true [2023-02-16 00:42:49,134 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-16 00:42:49,135 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-16 00:42:49,135 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-16 00:42:49,135 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-16 00:42:49,135 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-16 00:42:49,135 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-16 00:42:49,136 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-16 00:42:49,136 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-16 00:42:49,136 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-16 00:42:49,136 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-16 00:42:49,136 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-16 00:42:49,136 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-16 00:42:49,137 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-16 00:42:49,137 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-16 00:42:49,137 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-16 00:42:49,137 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 00:42:49,138 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-16 00:42:49,138 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-16 00:42:49,138 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-16 00:42:49,138 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-16 00:42:49,139 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-16 00:42:49,139 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-16 00:42:49,139 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-16 00:42:49,139 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-16 00:42:49,139 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-16 00:42:49,140 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-16 00:42:49,140 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ffdd9c6c8ed32275119d4b9d2dc66b9f80986fea1a039186a702d6c803e62485 [2023-02-16 00:42:49,380 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-16 00:42:49,405 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-16 00:42:49,407 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-16 00:42:49,408 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-16 00:42:49,408 INFO L275 PluginConnector]: CDTParser initialized [2023-02-16 00:42:49,409 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/s3_srvr_2a_alt.BV.c.cil.c [2023-02-16 00:42:50,477 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-16 00:42:50,668 INFO L351 CDTParser]: Found 1 translation units. [2023-02-16 00:42:50,668 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/s3_srvr_2a_alt.BV.c.cil.c [2023-02-16 00:42:50,679 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51f4ac476/9e8386b5458e40f09349b909e464b287/FLAGd5b4528d2 [2023-02-16 00:42:50,689 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51f4ac476/9e8386b5458e40f09349b909e464b287 [2023-02-16 00:42:50,691 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-16 00:42:50,692 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-16 00:42:50,693 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-16 00:42:50,694 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-16 00:42:50,696 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-16 00:42:50,697 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 12:42:50" (1/1) ... [2023-02-16 00:42:50,698 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34ba9f9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:42:50, skipping insertion in model container [2023-02-16 00:42:50,698 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 12:42:50" (1/1) ... [2023-02-16 00:42:50,703 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-16 00:42:50,745 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-16 00:42:50,968 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/s3_srvr_2a_alt.BV.c.cil.c[44811,44824] [2023-02-16 00:42:50,986 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 00:42:50,996 INFO L203 MainTranslator]: Completed pre-run [2023-02-16 00:42:51,065 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/s3_srvr_2a_alt.BV.c.cil.c[44811,44824] [2023-02-16 00:42:51,072 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 00:42:51,084 INFO L208 MainTranslator]: Completed translation [2023-02-16 00:42:51,085 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:42:51 WrapperNode [2023-02-16 00:42:51,085 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-16 00:42:51,086 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-16 00:42:51,087 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-16 00:42:51,087 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-16 00:42:51,092 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:42:51" (1/1) ... [2023-02-16 00:42:51,110 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:42:51" (1/1) ... [2023-02-16 00:42:51,150 INFO L138 Inliner]: procedures = 15, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 529 [2023-02-16 00:42:51,150 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-16 00:42:51,151 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-16 00:42:51,151 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-16 00:42:51,151 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-16 00:42:51,159 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:42:51" (1/1) ... [2023-02-16 00:42:51,159 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:42:51" (1/1) ... [2023-02-16 00:42:51,163 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:42:51" (1/1) ... [2023-02-16 00:42:51,163 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:42:51" (1/1) ... [2023-02-16 00:42:51,177 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:42:51" (1/1) ... [2023-02-16 00:42:51,184 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:42:51" (1/1) ... [2023-02-16 00:42:51,185 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:42:51" (1/1) ... [2023-02-16 00:42:51,187 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:42:51" (1/1) ... [2023-02-16 00:42:51,193 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-16 00:42:51,194 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-16 00:42:51,194 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-16 00:42:51,194 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-16 00:42:51,195 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:42:51" (1/1) ... [2023-02-16 00:42:51,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 00:42:51,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:42:51,230 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-16 00:42:51,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-16 00:42:51,265 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-16 00:42:51,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-16 00:42:51,266 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-16 00:42:51,267 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-16 00:42:51,364 INFO L235 CfgBuilder]: Building ICFG [2023-02-16 00:42:51,366 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-16 00:42:51,381 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-02-16 00:42:51,831 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2023-02-16 00:42:51,831 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2023-02-16 00:42:51,831 INFO L276 CfgBuilder]: Performing block encoding [2023-02-16 00:42:51,838 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-16 00:42:51,838 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2023-02-16 00:42:51,840 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 12:42:51 BoogieIcfgContainer [2023-02-16 00:42:51,840 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-16 00:42:51,842 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-16 00:42:51,842 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-16 00:42:51,845 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-16 00:42:51,845 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.02 12:42:50" (1/3) ... [2023-02-16 00:42:51,845 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7943e620 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 12:42:51, skipping insertion in model container [2023-02-16 00:42:51,846 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:42:51" (2/3) ... [2023-02-16 00:42:51,846 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7943e620 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 12:42:51, skipping insertion in model container [2023-02-16 00:42:51,846 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 12:42:51" (3/3) ... [2023-02-16 00:42:51,847 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr_2a_alt.BV.c.cil.c [2023-02-16 00:42:51,862 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-16 00:42:51,862 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-16 00:42:51,914 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-16 00:42:51,921 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@12ee2851, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-16 00:42:51,921 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-16 00:42:51,927 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) [2023-02-16 00:42:51,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-02-16 00:42:51,937 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:42:51,937 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] [2023-02-16 00:42:51,938 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:42:51,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:42:51,942 INFO L85 PathProgramCache]: Analyzing trace with hash 1632002022, now seen corresponding path program 1 times [2023-02-16 00:42:51,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:42:51,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656750075] [2023-02-16 00:42:51,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:42:51,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:42:52,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:42:52,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 00:42:52,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:42:52,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656750075] [2023-02-16 00:42:52,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656750075] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 00:42:52,300 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 00:42:52,300 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 00:42:52,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557006074] [2023-02-16 00:42:52,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 00:42:52,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 00:42:52,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:42:52,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 00:42:52,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 00:42:52,343 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) [2023-02-16 00:42:52,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:42:52,546 INFO L93 Difference]: Finished difference Result 284 states and 484 transitions. [2023-02-16 00:42:52,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 00:42:52,550 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 [2023-02-16 00:42:52,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:42:52,561 INFO L225 Difference]: With dead ends: 284 [2023-02-16 00:42:52,562 INFO L226 Difference]: Without dead ends: 128 [2023-02-16 00:42:52,565 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 00:42:52,569 INFO L413 NwaCegarLoop]: 211 mSDtfsCounter, 20 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 00:42:52,570 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 326 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 00:42:52,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2023-02-16 00:42:52,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 125. [2023-02-16 00:42:52,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 124 states have (on average 1.4919354838709677) internal successors, (185), 124 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:42:52,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 185 transitions. [2023-02-16 00:42:52,612 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 185 transitions. Word has length 44 [2023-02-16 00:42:52,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:42:52,614 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 185 transitions. [2023-02-16 00:42:52,614 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) [2023-02-16 00:42:52,614 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 185 transitions. [2023-02-16 00:42:52,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-02-16 00:42:52,621 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:42:52,622 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] [2023-02-16 00:42:52,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-16 00:42:52,623 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:42:52,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:42:52,624 INFO L85 PathProgramCache]: Analyzing trace with hash 2033157093, now seen corresponding path program 1 times [2023-02-16 00:42:52,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:42:52,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088859433] [2023-02-16 00:42:52,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:42:52,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:42:52,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:42:52,761 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 00:42:52,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:42:52,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088859433] [2023-02-16 00:42:52,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088859433] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 00:42:52,762 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 00:42:52,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 00:42:52,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530205077] [2023-02-16 00:42:52,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 00:42:52,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 00:42:52,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:42:52,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 00:42:52,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 00:42:52,764 INFO L87 Difference]: Start difference. First operand 125 states and 185 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) [2023-02-16 00:42:52,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:42:52,811 INFO L93 Difference]: Finished difference Result 331 states and 502 transitions. [2023-02-16 00:42:52,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 00:42:52,812 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 [2023-02-16 00:42:52,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:42:52,817 INFO L225 Difference]: With dead ends: 331 [2023-02-16 00:42:52,817 INFO L226 Difference]: Without dead ends: 225 [2023-02-16 00:42:52,818 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 00:42:52,821 INFO L413 NwaCegarLoop]: 183 mSDtfsCounter, 111 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 00:42:52,823 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 346 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 00:42:52,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2023-02-16 00:42:52,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 225. [2023-02-16 00:42:52,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 224 states have (on average 1.5) internal successors, (336), 224 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:42:52,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 336 transitions. [2023-02-16 00:42:52,847 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 336 transitions. Word has length 60 [2023-02-16 00:42:52,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:42:52,849 INFO L495 AbstractCegarLoop]: Abstraction has 225 states and 336 transitions. [2023-02-16 00:42:52,850 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) [2023-02-16 00:42:52,850 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 336 transitions. [2023-02-16 00:42:52,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-02-16 00:42:52,852 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:42:52,852 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] [2023-02-16 00:42:52,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-16 00:42:52,853 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:42:52,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:42:52,854 INFO L85 PathProgramCache]: Analyzing trace with hash -2013663709, now seen corresponding path program 1 times [2023-02-16 00:42:52,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:42:52,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791749422] [2023-02-16 00:42:52,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:42:52,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:42:52,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:42:52,907 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 00:42:52,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:42:52,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791749422] [2023-02-16 00:42:52,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791749422] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 00:42:52,908 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 00:42:52,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 00:42:52,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267816631] [2023-02-16 00:42:52,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 00:42:52,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 00:42:52,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:42:52,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 00:42:52,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 00:42:52,910 INFO L87 Difference]: Start difference. First operand 225 states and 336 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) [2023-02-16 00:42:52,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:42:52,927 INFO L93 Difference]: Finished difference Result 433 states and 652 transitions. [2023-02-16 00:42:52,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 00:42:52,928 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 [2023-02-16 00:42:52,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:42:52,929 INFO L225 Difference]: With dead ends: 433 [2023-02-16 00:42:52,929 INFO L226 Difference]: Without dead ends: 227 [2023-02-16 00:42:52,930 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 00:42:52,931 INFO L413 NwaCegarLoop]: 173 mSDtfsCounter, 6 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 00:42:52,932 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 326 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 00:42:52,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2023-02-16 00:42:52,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2023-02-16 00:42:52,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 226 states have (on average 1.4955752212389382) internal successors, (338), 226 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:42:52,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 338 transitions. [2023-02-16 00:42:52,956 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 338 transitions. Word has length 60 [2023-02-16 00:42:52,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:42:52,957 INFO L495 AbstractCegarLoop]: Abstraction has 227 states and 338 transitions. [2023-02-16 00:42:52,957 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) [2023-02-16 00:42:52,958 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 338 transitions. [2023-02-16 00:42:52,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2023-02-16 00:42:52,960 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:42:52,961 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:42:52,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-16 00:42:52,961 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:42:52,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:42:52,965 INFO L85 PathProgramCache]: Analyzing trace with hash 64836761, now seen corresponding path program 1 times [2023-02-16 00:42:52,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:42:52,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23370205] [2023-02-16 00:42:52,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:42:52,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:42:52,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:42:53,070 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-02-16 00:42:53,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:42:53,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23370205] [2023-02-16 00:42:53,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23370205] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 00:42:53,072 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 00:42:53,072 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 00:42:53,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532243828] [2023-02-16 00:42:53,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 00:42:53,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 00:42:53,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:42:53,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 00:42:53,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 00:42:53,075 INFO L87 Difference]: Start difference. First operand 227 states and 338 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:42:53,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:42:53,199 INFO L93 Difference]: Finished difference Result 524 states and 805 transitions. [2023-02-16 00:42:53,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 00:42:53,199 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2023-02-16 00:42:53,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:42:53,201 INFO L225 Difference]: With dead ends: 524 [2023-02-16 00:42:53,201 INFO L226 Difference]: Without dead ends: 318 [2023-02-16 00:42:53,202 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 00:42:53,203 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 14 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 00:42:53,204 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 272 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 00:42:53,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2023-02-16 00:42:53,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 310. [2023-02-16 00:42:53,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 309 states have (on average 1.3948220064724919) internal successors, (431), 309 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:42:53,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 431 transitions. [2023-02-16 00:42:53,216 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 431 transitions. Word has length 81 [2023-02-16 00:42:53,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:42:53,216 INFO L495 AbstractCegarLoop]: Abstraction has 310 states and 431 transitions. [2023-02-16 00:42:53,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:42:53,217 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 431 transitions. [2023-02-16 00:42:53,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2023-02-16 00:42:53,218 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:42:53,218 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:42:53,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-16 00:42:53,218 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:42:53,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:42:53,219 INFO L85 PathProgramCache]: Analyzing trace with hash 312983255, now seen corresponding path program 1 times [2023-02-16 00:42:53,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:42:53,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353451682] [2023-02-16 00:42:53,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:42:53,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:42:53,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:42:53,259 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-02-16 00:42:53,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:42:53,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353451682] [2023-02-16 00:42:53,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353451682] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 00:42:53,260 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 00:42:53,260 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 00:42:53,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352688820] [2023-02-16 00:42:53,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 00:42:53,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 00:42:53,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:42:53,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 00:42:53,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 00:42:53,262 INFO L87 Difference]: Start difference. First operand 310 states and 431 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:42:53,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:42:53,364 INFO L93 Difference]: Finished difference Result 628 states and 882 transitions. [2023-02-16 00:42:53,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 00:42:53,365 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2023-02-16 00:42:53,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:42:53,366 INFO L225 Difference]: With dead ends: 628 [2023-02-16 00:42:53,366 INFO L226 Difference]: Without dead ends: 339 [2023-02-16 00:42:53,367 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 00:42:53,374 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 12 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 00:42:53,374 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 273 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 00:42:53,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2023-02-16 00:42:53,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 333. [2023-02-16 00:42:53,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 332 states have (on average 1.3825301204819278) internal successors, (459), 332 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:42:53,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 459 transitions. [2023-02-16 00:42:53,388 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 459 transitions. Word has length 81 [2023-02-16 00:42:53,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:42:53,388 INFO L495 AbstractCegarLoop]: Abstraction has 333 states and 459 transitions. [2023-02-16 00:42:53,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:42:53,388 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 459 transitions. [2023-02-16 00:42:53,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2023-02-16 00:42:53,390 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:42:53,390 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:42:53,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-16 00:42:53,390 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:42:53,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:42:53,391 INFO L85 PathProgramCache]: Analyzing trace with hash 1731331013, now seen corresponding path program 1 times [2023-02-16 00:42:53,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:42:53,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125961928] [2023-02-16 00:42:53,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:42:53,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:42:53,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:42:53,437 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2023-02-16 00:42:53,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:42:53,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125961928] [2023-02-16 00:42:53,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125961928] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 00:42:53,438 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 00:42:53,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 00:42:53,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527246951] [2023-02-16 00:42:53,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 00:42:53,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 00:42:53,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:42:53,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 00:42:53,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 00:42:53,440 INFO L87 Difference]: Start difference. First operand 333 states and 459 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:42:53,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:42:53,541 INFO L93 Difference]: Finished difference Result 719 states and 1015 transitions. [2023-02-16 00:42:53,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 00:42:53,541 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2023-02-16 00:42:53,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:42:53,543 INFO L225 Difference]: With dead ends: 719 [2023-02-16 00:42:53,543 INFO L226 Difference]: Without dead ends: 407 [2023-02-16 00:42:53,544 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 00:42:53,545 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 28 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 00:42:53,545 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 272 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 00:42:53,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2023-02-16 00:42:53,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 383. [2023-02-16 00:42:53,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 382 states have (on average 1.3586387434554974) internal successors, (519), 382 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:42:53,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 519 transitions. [2023-02-16 00:42:53,554 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 519 transitions. Word has length 101 [2023-02-16 00:42:53,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:42:53,555 INFO L495 AbstractCegarLoop]: Abstraction has 383 states and 519 transitions. [2023-02-16 00:42:53,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:42:53,556 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 519 transitions. [2023-02-16 00:42:53,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-02-16 00:42:53,560 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:42:53,560 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] [2023-02-16 00:42:53,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-02-16 00:42:53,561 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:42:53,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:42:53,562 INFO L85 PathProgramCache]: Analyzing trace with hash -1340556462, now seen corresponding path program 1 times [2023-02-16 00:42:53,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:42:53,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923856189] [2023-02-16 00:42:53,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:42:53,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:42:53,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:42:53,652 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2023-02-16 00:42:53,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:42:53,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923856189] [2023-02-16 00:42:53,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923856189] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 00:42:53,653 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 00:42:53,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 00:42:53,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981058190] [2023-02-16 00:42:53,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 00:42:53,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 00:42:53,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:42:53,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 00:42:53,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 00:42:53,655 INFO L87 Difference]: Start difference. First operand 383 states and 519 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) [2023-02-16 00:42:53,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:42:53,681 INFO L93 Difference]: Finished difference Result 912 states and 1246 transitions. [2023-02-16 00:42:53,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 00:42:53,682 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 [2023-02-16 00:42:53,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:42:53,684 INFO L225 Difference]: With dead ends: 912 [2023-02-16 00:42:53,684 INFO L226 Difference]: Without dead ends: 550 [2023-02-16 00:42:53,685 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 00:42:53,686 INFO L413 NwaCegarLoop]: 319 mSDtfsCounter, 111 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 482 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 [2023-02-16 00:42:53,686 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 482 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 00:42:53,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2023-02-16 00:42:53,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 550. [2023-02-16 00:42:53,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 549 states have (on average 1.360655737704918) internal successors, (747), 549 states have internal predecessors, (747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:42:53,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 747 transitions. [2023-02-16 00:42:53,698 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 747 transitions. Word has length 121 [2023-02-16 00:42:53,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:42:53,698 INFO L495 AbstractCegarLoop]: Abstraction has 550 states and 747 transitions. [2023-02-16 00:42:53,699 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) [2023-02-16 00:42:53,699 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 747 transitions. [2023-02-16 00:42:53,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-02-16 00:42:53,700 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:42:53,701 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] [2023-02-16 00:42:53,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-02-16 00:42:53,701 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:42:53,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:42:53,702 INFO L85 PathProgramCache]: Analyzing trace with hash 2057017556, now seen corresponding path program 1 times [2023-02-16 00:42:53,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:42:53,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921830738] [2023-02-16 00:42:53,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:42:53,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:42:53,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:42:53,766 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-02-16 00:42:53,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:42:53,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921830738] [2023-02-16 00:42:53,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921830738] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 00:42:53,767 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 00:42:53,767 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 00:42:53,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896121489] [2023-02-16 00:42:53,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 00:42:53,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 00:42:53,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:42:53,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 00:42:53,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 00:42:53,769 INFO L87 Difference]: Start difference. First operand 550 states and 747 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) [2023-02-16 00:42:53,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:42:53,798 INFO L93 Difference]: Finished difference Result 1271 states and 1733 transitions. [2023-02-16 00:42:53,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 00:42:53,799 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 [2023-02-16 00:42:53,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:42:53,802 INFO L225 Difference]: With dead ends: 1271 [2023-02-16 00:42:53,802 INFO L226 Difference]: Without dead ends: 742 [2023-02-16 00:42:53,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 [2023-02-16 00:42:53,803 INFO L413 NwaCegarLoop]: 317 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, 480 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 [2023-02-16 00:42:53,804 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 480 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 00:42:53,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 742 states. [2023-02-16 00:42:53,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 742 to 742. [2023-02-16 00:42:53,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 742 states, 741 states have (on average 1.3576248313090418) internal successors, (1006), 741 states have internal predecessors, (1006), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:42:53,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 742 states and 1006 transitions. [2023-02-16 00:42:53,820 INFO L78 Accepts]: Start accepts. Automaton has 742 states and 1006 transitions. Word has length 121 [2023-02-16 00:42:53,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:42:53,820 INFO L495 AbstractCegarLoop]: Abstraction has 742 states and 1006 transitions. [2023-02-16 00:42:53,820 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) [2023-02-16 00:42:53,820 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 1006 transitions. [2023-02-16 00:42:53,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2023-02-16 00:42:53,823 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:42:53,823 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:42:53,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-02-16 00:42:53,823 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:42:53,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:42:53,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1067369758, now seen corresponding path program 1 times [2023-02-16 00:42:53,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:42:53,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543285593] [2023-02-16 00:42:53,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:42:53,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:42:53,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:42:53,885 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 209 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2023-02-16 00:42:53,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:42:53,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543285593] [2023-02-16 00:42:53,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543285593] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 00:42:53,886 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 00:42:53,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 00:42:53,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815292540] [2023-02-16 00:42:53,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 00:42:53,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 00:42:53,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:42:53,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 00:42:53,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 00:42:53,888 INFO L87 Difference]: Start difference. First operand 742 states and 1006 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:42:54,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:42:54,025 INFO L93 Difference]: Finished difference Result 1592 states and 2215 transitions. [2023-02-16 00:42:54,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 00:42:54,025 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 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 183 [2023-02-16 00:42:54,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:42:54,028 INFO L225 Difference]: With dead ends: 1592 [2023-02-16 00:42:54,029 INFO L226 Difference]: Without dead ends: 871 [2023-02-16 00:42:54,029 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 00:42:54,030 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 35 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 00:42:54,030 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 267 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 00:42:54,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2023-02-16 00:42:54,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 865. [2023-02-16 00:42:54,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 865 states, 864 states have (on average 1.3240740740740742) internal successors, (1144), 864 states have internal predecessors, (1144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:42:54,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 865 states to 865 states and 1144 transitions. [2023-02-16 00:42:54,047 INFO L78 Accepts]: Start accepts. Automaton has 865 states and 1144 transitions. Word has length 183 [2023-02-16 00:42:54,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:42:54,048 INFO L495 AbstractCegarLoop]: Abstraction has 865 states and 1144 transitions. [2023-02-16 00:42:54,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:42:54,048 INFO L276 IsEmpty]: Start isEmpty. Operand 865 states and 1144 transitions. [2023-02-16 00:42:54,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2023-02-16 00:42:54,051 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:42:54,051 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] [2023-02-16 00:42:54,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-02-16 00:42:54,052 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:42:54,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:42:54,052 INFO L85 PathProgramCache]: Analyzing trace with hash -860101462, now seen corresponding path program 1 times [2023-02-16 00:42:54,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:42:54,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743490320] [2023-02-16 00:42:54,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:42:54,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:42:54,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:42:54,122 INFO L134 CoverageAnalysis]: Checked inductivity of 434 backedges. 299 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2023-02-16 00:42:54,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:42:54,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743490320] [2023-02-16 00:42:54,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743490320] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 00:42:54,123 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 00:42:54,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 00:42:54,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660524705] [2023-02-16 00:42:54,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 00:42:54,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 00:42:54,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:42:54,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 00:42:54,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 00:42:54,125 INFO L87 Difference]: Start difference. First operand 865 states and 1144 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) [2023-02-16 00:42:54,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:42:54,262 INFO L93 Difference]: Finished difference Result 1881 states and 2567 transitions. [2023-02-16 00:42:54,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 00:42:54,263 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 [2023-02-16 00:42:54,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:42:54,266 INFO L225 Difference]: With dead ends: 1881 [2023-02-16 00:42:54,266 INFO L226 Difference]: Without dead ends: 989 [2023-02-16 00:42:54,267 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 00:42:54,268 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 36 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 00:42:54,268 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 267 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 00:42:54,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 989 states. [2023-02-16 00:42:54,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 989 to 989. [2023-02-16 00:42:54,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 989 states, 988 states have (on average 1.3036437246963564) internal successors, (1288), 988 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:42:54,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 989 states to 989 states and 1288 transitions. [2023-02-16 00:42:54,287 INFO L78 Accepts]: Start accepts. Automaton has 989 states and 1288 transitions. Word has length 225 [2023-02-16 00:42:54,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:42:54,288 INFO L495 AbstractCegarLoop]: Abstraction has 989 states and 1288 transitions. [2023-02-16 00:42:54,288 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) [2023-02-16 00:42:54,288 INFO L276 IsEmpty]: Start isEmpty. Operand 989 states and 1288 transitions. [2023-02-16 00:42:54,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2023-02-16 00:42:54,292 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:42:54,292 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] [2023-02-16 00:42:54,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-02-16 00:42:54,292 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:42:54,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:42:54,293 INFO L85 PathProgramCache]: Analyzing trace with hash -482554043, now seen corresponding path program 1 times [2023-02-16 00:42:54,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:42:54,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844590493] [2023-02-16 00:42:54,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:42:54,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:42:54,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:42:54,406 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 430 proven. 16 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2023-02-16 00:42:54,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:42:54,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844590493] [2023-02-16 00:42:54,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844590493] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 00:42:54,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [579339121] [2023-02-16 00:42:54,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:42:54,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:42:54,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:42:54,412 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 00:42:54,421 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-16 00:42:54,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:42:54,551 INFO L263 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-16 00:42:54,558 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:42:54,661 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 430 proven. 16 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2023-02-16 00:42:54,661 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 00:42:54,771 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 430 proven. 16 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2023-02-16 00:42:54,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [579339121] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 00:42:54,778 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 00:42:54,778 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2023-02-16 00:42:54,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003573222] [2023-02-16 00:42:54,778 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 00:42:54,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-16 00:42:54,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:42:54,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-16 00:42:54,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-16 00:42:54,780 INFO L87 Difference]: Start difference. First operand 989 states and 1288 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) [2023-02-16 00:42:55,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:42:55,466 INFO L93 Difference]: Finished difference Result 4290 states and 5915 transitions. [2023-02-16 00:42:55,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-16 00:42:55,467 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 [2023-02-16 00:42:55,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:42:55,480 INFO L225 Difference]: With dead ends: 4290 [2023-02-16 00:42:55,481 INFO L226 Difference]: Without dead ends: 3322 [2023-02-16 00:42:55,483 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 514 GetRequests, 507 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2023-02-16 00:42:55,483 INFO L413 NwaCegarLoop]: 408 mSDtfsCounter, 338 mSDsluCounter, 605 mSDsCounter, 0 mSdLazyCounter, 767 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 1013 SdHoareTripleChecker+Invalid, 826 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 767 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-16 00:42:55,484 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [338 Valid, 1013 Invalid, 826 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 767 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-02-16 00:42:55,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3322 states. [2023-02-16 00:42:55,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3322 to 2444. [2023-02-16 00:42:55,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2444 states, 2443 states have (on average 1.3074089234547688) internal successors, (3194), 2443 states have internal predecessors, (3194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:42:55,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2444 states to 2444 states and 3194 transitions. [2023-02-16 00:42:55,566 INFO L78 Accepts]: Start accepts. Automaton has 2444 states and 3194 transitions. Word has length 253 [2023-02-16 00:42:55,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:42:55,567 INFO L495 AbstractCegarLoop]: Abstraction has 2444 states and 3194 transitions. [2023-02-16 00:42:55,567 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) [2023-02-16 00:42:55,567 INFO L276 IsEmpty]: Start isEmpty. Operand 2444 states and 3194 transitions. [2023-02-16 00:42:55,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2023-02-16 00:42:55,573 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:42:55,574 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] [2023-02-16 00:42:55,584 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-02-16 00:42:55,781 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,SelfDestructingSolverStorable10 [2023-02-16 00:42:55,781 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:42:55,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:42:55,782 INFO L85 PathProgramCache]: Analyzing trace with hash -193734653, now seen corresponding path program 1 times [2023-02-16 00:42:55,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:42:55,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369891937] [2023-02-16 00:42:55,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:42:55,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:42:55,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:42:55,870 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 400 proven. 0 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2023-02-16 00:42:55,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:42:55,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369891937] [2023-02-16 00:42:55,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369891937] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 00:42:55,870 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 00:42:55,871 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 00:42:55,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12077137] [2023-02-16 00:42:55,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 00:42:55,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 00:42:55,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:42:55,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 00:42:55,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 00:42:55,873 INFO L87 Difference]: Start difference. First operand 2444 states and 3194 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) [2023-02-16 00:42:55,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:42:55,950 INFO L93 Difference]: Finished difference Result 6784 states and 8940 transitions. [2023-02-16 00:42:55,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 00:42:55,951 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 [2023-02-16 00:42:55,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:42:55,961 INFO L225 Difference]: With dead ends: 6784 [2023-02-16 00:42:55,961 INFO L226 Difference]: Without dead ends: 3133 [2023-02-16 00:42:55,966 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 00:42:55,967 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 [2023-02-16 00:42:55,967 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] [2023-02-16 00:42:55,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3133 states. [2023-02-16 00:42:56,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3133 to 3031. [2023-02-16 00:42:56,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3031 states, 3030 states have (on average 1.328052805280528) internal successors, (4024), 3030 states have internal predecessors, (4024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:42:56,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3031 states to 3031 states and 4024 transitions. [2023-02-16 00:42:56,046 INFO L78 Accepts]: Start accepts. Automaton has 3031 states and 4024 transitions. Word has length 253 [2023-02-16 00:42:56,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:42:56,046 INFO L495 AbstractCegarLoop]: Abstraction has 3031 states and 4024 transitions. [2023-02-16 00:42:56,047 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) [2023-02-16 00:42:56,047 INFO L276 IsEmpty]: Start isEmpty. Operand 3031 states and 4024 transitions. [2023-02-16 00:42:56,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2023-02-16 00:42:56,052 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:42:56,053 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] [2023-02-16 00:42:56,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-02-16 00:42:56,053 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:42:56,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:42:56,054 INFO L85 PathProgramCache]: Analyzing trace with hash -257796221, now seen corresponding path program 1 times [2023-02-16 00:42:56,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:42:56,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860590536] [2023-02-16 00:42:56,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:42:56,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:42:56,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:42:56,143 INFO L134 CoverageAnalysis]: Checked inductivity of 875 backedges. 493 proven. 0 refuted. 0 times theorem prover too weak. 382 trivial. 0 not checked. [2023-02-16 00:42:56,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:42:56,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860590536] [2023-02-16 00:42:56,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860590536] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 00:42:56,144 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 00:42:56,144 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 00:42:56,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138961586] [2023-02-16 00:42:56,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 00:42:56,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 00:42:56,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:42:56,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 00:42:56,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 00:42:56,146 INFO L87 Difference]: Start difference. First operand 3031 states and 4024 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) [2023-02-16 00:42:56,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:42:56,285 INFO L93 Difference]: Finished difference Result 6437 states and 8611 transitions. [2023-02-16 00:42:56,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 00:42:56,286 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 [2023-02-16 00:42:56,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:42:56,296 INFO L225 Difference]: With dead ends: 6437 [2023-02-16 00:42:56,297 INFO L226 Difference]: Without dead ends: 3427 [2023-02-16 00:42:56,300 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 00:42:56,302 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 17 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 00:42:56,302 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 272 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 00:42:56,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3427 states. [2023-02-16 00:42:56,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3427 to 3355. [2023-02-16 00:42:56,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3355 states, 3354 states have (on average 1.3142516398330353) internal successors, (4408), 3354 states have internal predecessors, (4408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:42:56,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3355 states to 3355 states and 4408 transitions. [2023-02-16 00:42:56,387 INFO L78 Accepts]: Start accepts. Automaton has 3355 states and 4408 transitions. Word has length 299 [2023-02-16 00:42:56,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:42:56,387 INFO L495 AbstractCegarLoop]: Abstraction has 3355 states and 4408 transitions. [2023-02-16 00:42:56,387 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) [2023-02-16 00:42:56,388 INFO L276 IsEmpty]: Start isEmpty. Operand 3355 states and 4408 transitions. [2023-02-16 00:42:56,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2023-02-16 00:42:56,394 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:42:56,394 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] [2023-02-16 00:42:56,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-02-16 00:42:56,395 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:42:56,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:42:56,395 INFO L85 PathProgramCache]: Analyzing trace with hash 212293102, now seen corresponding path program 1 times [2023-02-16 00:42:56,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:42:56,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761932016] [2023-02-16 00:42:56,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:42:56,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:42:56,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:42:56,480 INFO L134 CoverageAnalysis]: Checked inductivity of 1066 backedges. 627 proven. 0 refuted. 0 times theorem prover too weak. 439 trivial. 0 not checked. [2023-02-16 00:42:56,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:42:56,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761932016] [2023-02-16 00:42:56,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761932016] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 00:42:56,481 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 00:42:56,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 00:42:56,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411103411] [2023-02-16 00:42:56,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 00:42:56,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 00:42:56,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:42:56,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 00:42:56,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 00:42:56,485 INFO L87 Difference]: Start difference. First operand 3355 states and 4408 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:42:56,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:42:56,639 INFO L93 Difference]: Finished difference Result 7049 states and 9307 transitions. [2023-02-16 00:42:56,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 00:42:56,640 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 [2023-02-16 00:42:56,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:42:56,651 INFO L225 Difference]: With dead ends: 7049 [2023-02-16 00:42:56,652 INFO L226 Difference]: Without dead ends: 3715 [2023-02-16 00:42:56,656 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 00:42:56,657 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 10 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 00:42:56,657 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 272 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 00:42:56,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3715 states. [2023-02-16 00:42:56,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3715 to 3034. [2023-02-16 00:42:56,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3034 states, 3033 states have (on average 1.3056379821958457) internal successors, (3960), 3033 states have internal predecessors, (3960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:42:56,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3034 states to 3034 states and 3960 transitions. [2023-02-16 00:42:56,738 INFO L78 Accepts]: Start accepts. Automaton has 3034 states and 3960 transitions. Word has length 322 [2023-02-16 00:42:56,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:42:56,738 INFO L495 AbstractCegarLoop]: Abstraction has 3034 states and 3960 transitions. [2023-02-16 00:42:56,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:42:56,739 INFO L276 IsEmpty]: Start isEmpty. Operand 3034 states and 3960 transitions. [2023-02-16 00:42:56,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2023-02-16 00:42:56,745 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:42:56,745 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] [2023-02-16 00:42:56,745 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-02-16 00:42:56,746 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:42:56,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:42:56,746 INFO L85 PathProgramCache]: Analyzing trace with hash -812160295, now seen corresponding path program 1 times [2023-02-16 00:42:56,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:42:56,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962501370] [2023-02-16 00:42:56,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:42:56,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:42:56,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:42:56,843 INFO L134 CoverageAnalysis]: Checked inductivity of 1301 backedges. 692 proven. 0 refuted. 0 times theorem prover too weak. 609 trivial. 0 not checked. [2023-02-16 00:42:56,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:42:56,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962501370] [2023-02-16 00:42:56,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962501370] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 00:42:56,844 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 00:42:56,845 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 00:42:56,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482410419] [2023-02-16 00:42:56,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 00:42:56,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 00:42:56,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:42:56,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 00:42:56,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 00:42:56,846 INFO L87 Difference]: Start difference. First operand 3034 states and 3960 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) [2023-02-16 00:42:56,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:42:56,983 INFO L93 Difference]: Finished difference Result 9048 states and 11812 transitions. [2023-02-16 00:42:56,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 00:42:56,983 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 [2023-02-16 00:42:56,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:42:57,003 INFO L225 Difference]: With dead ends: 9048 [2023-02-16 00:42:57,003 INFO L226 Difference]: Without dead ends: 6035 [2023-02-16 00:42:57,008 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 00:42:57,009 INFO L413 NwaCegarLoop]: 318 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, 484 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 00:42:57,009 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 484 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 00:42:57,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6035 states. [2023-02-16 00:42:57,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6035 to 5852. [2023-02-16 00:42:57,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5852 states, 5851 states have (on average 1.3083233635276021) internal successors, (7655), 5851 states have internal predecessors, (7655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:42:57,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5852 states to 5852 states and 7655 transitions. [2023-02-16 00:42:57,198 INFO L78 Accepts]: Start accepts. Automaton has 5852 states and 7655 transitions. Word has length 354 [2023-02-16 00:42:57,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:42:57,199 INFO L495 AbstractCegarLoop]: Abstraction has 5852 states and 7655 transitions. [2023-02-16 00:42:57,199 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) [2023-02-16 00:42:57,199 INFO L276 IsEmpty]: Start isEmpty. Operand 5852 states and 7655 transitions. [2023-02-16 00:42:57,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2023-02-16 00:42:57,209 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:42:57,210 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] [2023-02-16 00:42:57,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-02-16 00:42:57,210 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:42:57,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:42:57,211 INFO L85 PathProgramCache]: Analyzing trace with hash 209922624, now seen corresponding path program 1 times [2023-02-16 00:42:57,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:42:57,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313142821] [2023-02-16 00:42:57,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:42:57,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:42:57,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:42:57,320 INFO L134 CoverageAnalysis]: Checked inductivity of 1301 backedges. 871 proven. 26 refuted. 0 times theorem prover too weak. 404 trivial. 0 not checked. [2023-02-16 00:42:57,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:42:57,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313142821] [2023-02-16 00:42:57,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313142821] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 00:42:57,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1112375830] [2023-02-16 00:42:57,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:42:57,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:42:57,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:42:57,322 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 00:42:57,354 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-16 00:42:57,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:42:57,504 INFO L263 TraceCheckSpWp]: Trace formula consists of 584 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-16 00:42:57,528 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:42:57,807 INFO L134 CoverageAnalysis]: Checked inductivity of 1301 backedges. 680 proven. 0 refuted. 0 times theorem prover too weak. 621 trivial. 0 not checked. [2023-02-16 00:42:57,807 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 00:42:57,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1112375830] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 00:42:57,808 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-16 00:42:57,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2023-02-16 00:42:57,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287992914] [2023-02-16 00:42:57,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 00:42:57,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 00:42:57,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:42:57,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 00:42:57,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-16 00:42:57,810 INFO L87 Difference]: Start difference. First operand 5852 states and 7655 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) [2023-02-16 00:42:57,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:42:57,910 INFO L93 Difference]: Finished difference Result 6714 states and 8793 transitions. [2023-02-16 00:42:57,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 00:42:57,910 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 [2023-02-16 00:42:57,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:42:57,937 INFO L225 Difference]: With dead ends: 6714 [2023-02-16 00:42:57,938 INFO L226 Difference]: Without dead ends: 4851 [2023-02-16 00:42:57,941 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 [2023-02-16 00:42:57,942 INFO L413 NwaCegarLoop]: 318 mSDtfsCounter, 83 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 476 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 [2023-02-16 00:42:57,942 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 476 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 00:42:57,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4851 states. [2023-02-16 00:42:58,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4851 to 3807. [2023-02-16 00:42:58,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3807 states, 3806 states have (on average 1.3084603258013663) internal successors, (4980), 3806 states have internal predecessors, (4980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:42:58,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3807 states to 3807 states and 4980 transitions. [2023-02-16 00:42:58,086 INFO L78 Accepts]: Start accepts. Automaton has 3807 states and 4980 transitions. Word has length 355 [2023-02-16 00:42:58,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:42:58,087 INFO L495 AbstractCegarLoop]: Abstraction has 3807 states and 4980 transitions. [2023-02-16 00:42:58,088 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) [2023-02-16 00:42:58,088 INFO L276 IsEmpty]: Start isEmpty. Operand 3807 states and 4980 transitions. [2023-02-16 00:42:58,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 418 [2023-02-16 00:42:58,098 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:42:58,098 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] [2023-02-16 00:42:58,107 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-02-16 00:42:58,308 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,SelfDestructingSolverStorable15 [2023-02-16 00:42:58,309 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:42:58,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:42:58,310 INFO L85 PathProgramCache]: Analyzing trace with hash 1965226690, now seen corresponding path program 1 times [2023-02-16 00:42:58,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:42:58,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603077838] [2023-02-16 00:42:58,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:42:58,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:42:58,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:42:58,444 INFO L134 CoverageAnalysis]: Checked inductivity of 2004 backedges. 1251 proven. 26 refuted. 0 times theorem prover too weak. 727 trivial. 0 not checked. [2023-02-16 00:42:58,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:42:58,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603077838] [2023-02-16 00:42:58,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603077838] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 00:42:58,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2116458621] [2023-02-16 00:42:58,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:42:58,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:42:58,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:42:58,449 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 00:42:58,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-16 00:42:58,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:42:58,587 INFO L263 TraceCheckSpWp]: Trace formula consists of 674 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-16 00:42:58,591 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:42:58,674 INFO L134 CoverageAnalysis]: Checked inductivity of 2004 backedges. 1251 proven. 26 refuted. 0 times theorem prover too weak. 727 trivial. 0 not checked. [2023-02-16 00:42:58,674 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 00:42:58,765 INFO L134 CoverageAnalysis]: Checked inductivity of 2004 backedges. 1251 proven. 26 refuted. 0 times theorem prover too weak. 727 trivial. 0 not checked. [2023-02-16 00:42:58,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2116458621] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 00:42:58,766 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 00:42:58,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2023-02-16 00:42:58,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826857147] [2023-02-16 00:42:58,767 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 00:42:58,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-16 00:42:58,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:42:58,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-16 00:42:58,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-16 00:42:58,769 INFO L87 Difference]: Start difference. First operand 3807 states and 4980 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) [2023-02-16 00:42:59,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:42:59,266 INFO L93 Difference]: Finished difference Result 9411 states and 12702 transitions. [2023-02-16 00:42:59,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-16 00:42:59,267 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 [2023-02-16 00:42:59,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:42:59,277 INFO L225 Difference]: With dead ends: 9411 [2023-02-16 00:42:59,277 INFO L226 Difference]: Without dead ends: 5466 [2023-02-16 00:42:59,283 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 [2023-02-16 00:42:59,283 INFO L413 NwaCegarLoop]: 258 mSDtfsCounter, 355 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 650 SdHoareTripleChecker+Invalid, 522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-16 00:42:59,284 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [355 Valid, 650 Invalid, 522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-16 00:42:59,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5466 states. [2023-02-16 00:42:59,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5466 to 4809. [2023-02-16 00:42:59,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4809 states, 4808 states have (on average 1.3741680532445923) internal successors, (6607), 4808 states have internal predecessors, (6607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:42:59,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4809 states to 4809 states and 6607 transitions. [2023-02-16 00:42:59,435 INFO L78 Accepts]: Start accepts. Automaton has 4809 states and 6607 transitions. Word has length 417 [2023-02-16 00:42:59,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:42:59,435 INFO L495 AbstractCegarLoop]: Abstraction has 4809 states and 6607 transitions. [2023-02-16 00:42:59,435 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) [2023-02-16 00:42:59,436 INFO L276 IsEmpty]: Start isEmpty. Operand 4809 states and 6607 transitions. [2023-02-16 00:42:59,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 510 [2023-02-16 00:42:59,450 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:42:59,450 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] [2023-02-16 00:42:59,465 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-16 00:42:59,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:42:59,664 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:42:59,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:42:59,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1529804208, now seen corresponding path program 1 times [2023-02-16 00:42:59,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:42:59,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902358497] [2023-02-16 00:42:59,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:42:59,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:42:59,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:42:59,816 INFO L134 CoverageAnalysis]: Checked inductivity of 3138 backedges. 1671 proven. 0 refuted. 0 times theorem prover too weak. 1467 trivial. 0 not checked. [2023-02-16 00:42:59,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:42:59,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902358497] [2023-02-16 00:42:59,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902358497] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 00:42:59,816 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 00:42:59,817 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 00:42:59,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136833504] [2023-02-16 00:42:59,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 00:42:59,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 00:42:59,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:42:59,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 00:42:59,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 00:42:59,819 INFO L87 Difference]: Start difference. First operand 4809 states and 6607 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) [2023-02-16 00:43:00,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:43:00,006 INFO L93 Difference]: Finished difference Result 9708 states and 13293 transitions. [2023-02-16 00:43:00,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 00:43:00,007 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 [2023-02-16 00:43:00,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:43:00,015 INFO L225 Difference]: With dead ends: 9708 [2023-02-16 00:43:00,016 INFO L226 Difference]: Without dead ends: 4920 [2023-02-16 00:43:00,021 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 00:43:00,022 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 14 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 00:43:00,023 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 272 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 00:43:00,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4920 states. [2023-02-16 00:43:00,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4920 to 4869. [2023-02-16 00:43:00,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4869 states, 4868 states have (on average 1.346343467543139) internal successors, (6554), 4868 states have internal predecessors, (6554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:43:00,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4869 states to 4869 states and 6554 transitions. [2023-02-16 00:43:00,154 INFO L78 Accepts]: Start accepts. Automaton has 4869 states and 6554 transitions. Word has length 509 [2023-02-16 00:43:00,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:43:00,155 INFO L495 AbstractCegarLoop]: Abstraction has 4869 states and 6554 transitions. [2023-02-16 00:43:00,155 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) [2023-02-16 00:43:00,155 INFO L276 IsEmpty]: Start isEmpty. Operand 4869 states and 6554 transitions. [2023-02-16 00:43:00,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 514 [2023-02-16 00:43:00,169 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:43:00,170 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] [2023-02-16 00:43:00,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-02-16 00:43:00,171 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:43:00,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:43:00,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1911316890, now seen corresponding path program 1 times [2023-02-16 00:43:00,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:43:00,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761583187] [2023-02-16 00:43:00,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:43:00,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:43:00,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:43:00,558 INFO L134 CoverageAnalysis]: Checked inductivity of 3204 backedges. 1744 proven. 206 refuted. 0 times theorem prover too weak. 1254 trivial. 0 not checked. [2023-02-16 00:43:00,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:43:00,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761583187] [2023-02-16 00:43:00,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761583187] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 00:43:00,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1741526791] [2023-02-16 00:43:00,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:43:00,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:43:00,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:43:00,565 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 00:43:00,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-16 00:43:00,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:43:00,718 INFO L263 TraceCheckSpWp]: Trace formula consists of 816 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-16 00:43:00,724 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:43:01,515 INFO L134 CoverageAnalysis]: Checked inductivity of 3204 backedges. 1792 proven. 239 refuted. 0 times theorem prover too weak. 1173 trivial. 0 not checked. [2023-02-16 00:43:01,515 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 00:43:02,167 INFO L134 CoverageAnalysis]: Checked inductivity of 3204 backedges. 1887 proven. 144 refuted. 0 times theorem prover too weak. 1173 trivial. 0 not checked. [2023-02-16 00:43:02,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1741526791] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 00:43:02,167 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 00:43:02,168 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2023-02-16 00:43:02,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386606996] [2023-02-16 00:43:02,168 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 00:43:02,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-16 00:43:02,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:43:02,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-16 00:43:02,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2023-02-16 00:43:02,170 INFO L87 Difference]: Start difference. First operand 4869 states and 6554 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) [2023-02-16 00:43:04,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:43:04,543 INFO L93 Difference]: Finished difference Result 22900 states and 30682 transitions. [2023-02-16 00:43:04,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-02-16 00:43:04,544 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 [2023-02-16 00:43:04,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:43:04,575 INFO L225 Difference]: With dead ends: 22900 [2023-02-16 00:43:04,576 INFO L226 Difference]: Without dead ends: 17872 [2023-02-16 00:43:04,586 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1057 GetRequests, 1033 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=196, Invalid=454, Unknown=0, NotChecked=0, Total=650 [2023-02-16 00:43:04,587 INFO L413 NwaCegarLoop]: 331 mSDtfsCounter, 1242 mSDsluCounter, 1263 mSDsCounter, 0 mSdLazyCounter, 2020 mSolverCounterSat, 258 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1242 SdHoareTripleChecker+Valid, 1594 SdHoareTripleChecker+Invalid, 2278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 258 IncrementalHoareTripleChecker+Valid, 2020 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-02-16 00:43:04,587 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1242 Valid, 1594 Invalid, 2278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [258 Valid, 2020 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-02-16 00:43:04,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17872 states. [2023-02-16 00:43:05,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17872 to 16675. [2023-02-16 00:43:05,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16675 states, 16674 states have (on average 1.3002878733357324) internal successors, (21681), 16674 states have internal predecessors, (21681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:43:05,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16675 states to 16675 states and 21681 transitions. [2023-02-16 00:43:05,353 INFO L78 Accepts]: Start accepts. Automaton has 16675 states and 21681 transitions. Word has length 513 [2023-02-16 00:43:05,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:43:05,353 INFO L495 AbstractCegarLoop]: Abstraction has 16675 states and 21681 transitions. [2023-02-16 00:43:05,354 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) [2023-02-16 00:43:05,354 INFO L276 IsEmpty]: Start isEmpty. Operand 16675 states and 21681 transitions. [2023-02-16 00:43:05,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 584 [2023-02-16 00:43:05,393 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:43:05,394 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] [2023-02-16 00:43:05,407 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-02-16 00:43:05,601 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 [2023-02-16 00:43:05,601 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:43:05,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:43:05,602 INFO L85 PathProgramCache]: Analyzing trace with hash 944376353, now seen corresponding path program 2 times [2023-02-16 00:43:05,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:43:05,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138569361] [2023-02-16 00:43:05,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:43:05,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:43:05,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:43:05,840 INFO L134 CoverageAnalysis]: Checked inductivity of 4078 backedges. 1321 proven. 16 refuted. 0 times theorem prover too weak. 2741 trivial. 0 not checked. [2023-02-16 00:43:05,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:43:05,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138569361] [2023-02-16 00:43:05,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138569361] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 00:43:05,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1918353212] [2023-02-16 00:43:05,841 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-16 00:43:05,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:43:05,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:43:05,843 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 00:43:05,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-16 00:43:06,007 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-16 00:43:06,007 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 00:43:06,011 INFO L263 TraceCheckSpWp]: Trace formula consists of 902 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-16 00:43:06,016 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:43:06,081 INFO L134 CoverageAnalysis]: Checked inductivity of 4078 backedges. 1321 proven. 16 refuted. 0 times theorem prover too weak. 2741 trivial. 0 not checked. [2023-02-16 00:43:06,082 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 00:43:06,151 INFO L134 CoverageAnalysis]: Checked inductivity of 4078 backedges. 1321 proven. 16 refuted. 0 times theorem prover too weak. 2741 trivial. 0 not checked. [2023-02-16 00:43:06,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1918353212] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 00:43:06,152 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 00:43:06,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2023-02-16 00:43:06,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35060791] [2023-02-16 00:43:06,154 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 00:43:06,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-16 00:43:06,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:43:06,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-16 00:43:06,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-02-16 00:43:06,156 INFO L87 Difference]: Start difference. First operand 16675 states and 21681 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) [2023-02-16 00:43:06,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:43:06,776 INFO L93 Difference]: Finished difference Result 22819 states and 29528 transitions. [2023-02-16 00:43:06,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-16 00:43:06,776 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 [2023-02-16 00:43:06,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:43:06,777 INFO L225 Difference]: With dead ends: 22819 [2023-02-16 00:43:06,777 INFO L226 Difference]: Without dead ends: 0 [2023-02-16 00:43:06,792 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 [2023-02-16 00:43:06,792 INFO L413 NwaCegarLoop]: 275 mSDtfsCounter, 213 mSDsluCounter, 616 mSDsCounter, 0 mSdLazyCounter, 560 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 891 SdHoareTripleChecker+Invalid, 597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-16 00:43:06,793 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 891 Invalid, 597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 560 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-16 00:43:06,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-02-16 00:43:06,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-02-16 00:43:06,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:43:06,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-02-16 00:43:06,794 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 583 [2023-02-16 00:43:06,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:43:06,794 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-02-16 00:43:06,794 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) [2023-02-16 00:43:06,794 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-02-16 00:43:06,795 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-02-16 00:43:06,797 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-02-16 00:43:06,807 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-02-16 00:43:07,004 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 [2023-02-16 00:43:07,006 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-02-16 00:43:16,428 INFO L899 garLoopResultBuilder]: For program point L366(lines 366 397) no Hoare annotation was computed. [2023-02-16 00:43:16,428 INFO L899 garLoopResultBuilder]: For program point L333(lines 333 337) no Hoare annotation was computed. [2023-02-16 00:43:16,428 INFO L899 garLoopResultBuilder]: For program point L267(lines 267 272) no Hoare annotation was computed. [2023-02-16 00:43:16,428 INFO L899 garLoopResultBuilder]: For program point L333-2(lines 333 337) no Hoare annotation was computed. [2023-02-16 00:43:16,428 INFO L899 garLoopResultBuilder]: For program point L201(lines 201 607) no Hoare annotation was computed. [2023-02-16 00:43:16,428 INFO L899 garLoopResultBuilder]: For program point L168(lines 168 618) no Hoare annotation was computed. [2023-02-16 00:43:16,429 INFO L899 garLoopResultBuilder]: For program point L135(lines 135 629) no Hoare annotation was computed. [2023-02-16 00:43:16,429 INFO L895 garLoopResultBuilder]: At program point ssl3_accept_switch_1_8593#1(lines 186 612) the Hoare annotation is: (let ((.cse0 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| 0))) (.cse3 (not (<= 8656 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse5 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse4 (let ((.cse6 (* 2 (mod (+ |ULTIMATE.start_ssl3_accept_~ag_X~0#1| |ULTIMATE.start_ssl3_accept_~ag_Y~0#1|) 2147483648)))) (or (not (<= .cse6 2147483647)) (< .cse6 8656)))) (.cse2 (not (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8496)))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse0 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576) .cse4 .cse2 (< 8496 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|)) (and .cse5 .cse1 .cse2) (and .cse3 .cse5 .cse4 .cse2))) [2023-02-16 00:43:16,429 INFO L899 garLoopResultBuilder]: For program point L532(lines 532 537) no Hoare annotation was computed. [2023-02-16 00:43:16,429 INFO L895 garLoopResultBuilder]: At program point ssl3_accept_switch_1_8529#1(lines 159 621) the Hoare annotation is: (let ((.cse0 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse1 (let ((.cse6 (* 2 (mod (+ |ULTIMATE.start_ssl3_accept_~ag_X~0#1| |ULTIMATE.start_ssl3_accept_~ag_Y~0#1|) 2147483648)))) (or (not (<= .cse6 2147483647)) (< .cse6 8656)))) (.cse3 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| 0))) (.cse5 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse2 (not (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8496)))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse4 .cse2) (and .cse5 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse2))) [2023-02-16 00:43:16,429 INFO L899 garLoopResultBuilder]: For program point L566(lines 566 570) no Hoare annotation was computed. [2023-02-16 00:43:16,430 INFO L895 garLoopResultBuilder]: At program point ssl3_accept_switch_1_8497#1(lines 147 625) the Hoare annotation is: (let ((.cse1 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse2 (let ((.cse5 (* 2 (mod (+ |ULTIMATE.start_ssl3_accept_~ag_X~0#1| |ULTIMATE.start_ssl3_accept_~ag_Y~0#1|) 2147483648)))) (or (not (<= .cse5 2147483647)) (< .cse5 8656)))) (.cse3 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) (.cse0 (not (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| 0))) (.cse4 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1))) (or (and .cse0 .cse1) (and .cse1 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576) .cse2 .cse3) (and .cse4 .cse2 .cse3) (and .cse0 .cse4))) [2023-02-16 00:43:16,430 INFO L899 garLoopResultBuilder]: For program point L302(lines 302 306) no Hoare annotation was computed. [2023-02-16 00:43:16,430 INFO L899 garLoopResultBuilder]: For program point L302-2(lines 221 598) no Hoare annotation was computed. [2023-02-16 00:43:16,430 INFO L899 garLoopResultBuilder]: For program point L369(lines 369 396) no Hoare annotation was computed. [2023-02-16 00:43:16,430 INFO L899 garLoopResultBuilder]: For program point L369-1(lines 369 396) no Hoare annotation was computed. [2023-02-16 00:43:16,430 INFO L899 garLoopResultBuilder]: For program point L204(lines 204 606) no Hoare annotation was computed. [2023-02-16 00:43:16,430 INFO L899 garLoopResultBuilder]: For program point L171(lines 171 617) no Hoare annotation was computed. [2023-02-16 00:43:16,430 INFO L899 garLoopResultBuilder]: For program point L138(lines 138 628) no Hoare annotation was computed. [2023-02-16 00:43:16,431 INFO L895 garLoopResultBuilder]: At program point ssl3_accept_switch_1_8482#1(lines 135 629) the Hoare annotation is: (let ((.cse7 (+ |ULTIMATE.start_ssl3_accept_~ag_X~0#1| |ULTIMATE.start_ssl3_accept_~ag_Y~0#1|))) (let ((.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| 0))) (.cse3 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse2 (let ((.cse8 (* 2 (mod .cse7 2147483648)))) (or (<= .cse8 8496) (not (<= .cse8 2147483647))))) (.cse0 (not (<= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|))) (or (and .cse0 (< |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8496) .cse1 .cse2) (and .cse3 .cse4) (and .cse1 .cse4) (and .cse0 .cse3 .cse2) (and .cse0 .cse1 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576) (let ((.cse6 (+ (* 2 |ULTIMATE.start_ssl3_accept_~ag_X~0#1|) (* 2 |ULTIMATE.start_ssl3_accept_~ag_Y~0#1|))) (.cse5 (* 4294967296 (div .cse7 2147483648)))) (or (= (+ .cse5 |ULTIMATE.start_ssl3_accept_~s__state~0#1|) .cse6) (and (= (+ .cse5 |ULTIMATE.start_ssl3_accept_~s__state~0#1| 4294967296) .cse6) (not (<= .cse6 (+ .cse5 2147483647)))))) (< 8496 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|))))) [2023-02-16 00:43:16,431 INFO L899 garLoopResultBuilder]: For program point L370(lines 370 393) no Hoare annotation was computed. [2023-02-16 00:43:16,431 INFO L902 garLoopResultBuilder]: At program point L668(lines 76 685) the Hoare annotation is: true [2023-02-16 00:43:16,431 INFO L899 garLoopResultBuilder]: For program point L405(lines 405 436) no Hoare annotation was computed. [2023-02-16 00:43:16,431 INFO L899 garLoopResultBuilder]: For program point L207(lines 207 605) no Hoare annotation was computed. [2023-02-16 00:43:16,431 INFO L899 garLoopResultBuilder]: For program point L174(lines 174 616) no Hoare annotation was computed. [2023-02-16 00:43:16,431 INFO L899 garLoopResultBuilder]: For program point L141(lines 141 627) no Hoare annotation was computed. [2023-02-16 00:43:16,432 INFO L899 garLoopResultBuilder]: For program point L637(lines 637 665) no Hoare annotation was computed. [2023-02-16 00:43:16,432 INFO L899 garLoopResultBuilder]: For program point L406(lines 406 412) no Hoare annotation was computed. [2023-02-16 00:43:16,432 INFO L899 garLoopResultBuilder]: For program point L373(lines 373 392) no Hoare annotation was computed. [2023-02-16 00:43:16,432 INFO L899 garLoopResultBuilder]: For program point L241(lines 241 258) no Hoare annotation was computed. [2023-02-16 00:43:16,432 INFO L899 garLoopResultBuilder]: For program point L241-2(lines 221 598) no Hoare annotation was computed. [2023-02-16 00:43:16,432 INFO L899 garLoopResultBuilder]: For program point L638(lines 638 662) no Hoare annotation was computed. [2023-02-16 00:43:16,432 INFO L899 garLoopResultBuilder]: For program point L572(lines 572 576) no Hoare annotation was computed. [2023-02-16 00:43:16,432 INFO L899 garLoopResultBuilder]: For program point L539(lines 539 543) no Hoare annotation was computed. [2023-02-16 00:43:16,433 INFO L899 garLoopResultBuilder]: For program point L506(lines 506 510) no Hoare annotation was computed. [2023-02-16 00:43:16,433 INFO L899 garLoopResultBuilder]: For program point L572-2(lines 572 576) no Hoare annotation was computed. [2023-02-16 00:43:16,433 INFO L899 garLoopResultBuilder]: For program point L539-2(lines 221 598) no Hoare annotation was computed. [2023-02-16 00:43:16,433 INFO L899 garLoopResultBuilder]: For program point L374(lines 374 378) no Hoare annotation was computed. [2023-02-16 00:43:16,433 INFO L899 garLoopResultBuilder]: For program point L374-2(lines 373 390) no Hoare annotation was computed. [2023-02-16 00:43:16,433 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(lines 687 698) the Hoare annotation is: true [2023-02-16 00:43:16,433 INFO L899 garLoopResultBuilder]: For program point L672(lines 672 676) no Hoare annotation was computed. [2023-02-16 00:43:16,433 INFO L899 garLoopResultBuilder]: For program point L639(lines 639 648) no Hoare annotation was computed. [2023-02-16 00:43:16,434 INFO L899 garLoopResultBuilder]: For program point L672-2(lines 672 676) no Hoare annotation was computed. [2023-02-16 00:43:16,434 INFO L899 garLoopResultBuilder]: For program point L639-2(lines 638 660) no Hoare annotation was computed. [2023-02-16 00:43:16,434 INFO L899 garLoopResultBuilder]: For program point L474(lines 474 478) no Hoare annotation was computed. [2023-02-16 00:43:16,434 INFO L899 garLoopResultBuilder]: For program point L342-1(lines 342 351) no Hoare annotation was computed. [2023-02-16 00:43:16,434 INFO L899 garLoopResultBuilder]: For program point L243(lines 243 248) no Hoare annotation was computed. [2023-02-16 00:43:16,434 INFO L899 garLoopResultBuilder]: For program point L210(lines 210 604) no Hoare annotation was computed. [2023-02-16 00:43:16,434 INFO L899 garLoopResultBuilder]: For program point L177(lines 177 615) no Hoare annotation was computed. [2023-02-16 00:43:16,434 INFO L899 garLoopResultBuilder]: For program point L144(lines 144 626) no Hoare annotation was computed. [2023-02-16 00:43:16,435 INFO L895 garLoopResultBuilder]: At program point L111-2(lines 111 667) the Hoare annotation is: (let ((.cse26 (+ |ULTIMATE.start_ssl3_accept_~ag_X~0#1| |ULTIMATE.start_ssl3_accept_~ag_Y~0#1|))) (let ((.cse21 (* 2 (mod .cse26 2147483648))) (.cse22 (* 4294967296 (div .cse26 2147483648))) (.cse23 (+ (* 2 |ULTIMATE.start_ssl3_accept_~ag_X~0#1|) (* 2 |ULTIMATE.start_ssl3_accept_~ag_Y~0#1|)))) (let ((.cse16 (= (+ .cse22 |ULTIMATE.start_ssl3_accept_~s__state~0#1|) .cse23)) (.cse17 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8496)) (.cse25 (not (<= .cse21 2147483647)))) (let ((.cse18 (= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 3)) (.cse15 (< |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8496)) (.cse10 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8448)) (.cse7 (<= 8672 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse8 (= 8466 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse1 (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656)) (.cse19 (or (<= .cse21 8496) .cse25)) (.cse4 (not (<= 8656 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse6 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse13 (not .cse17)) (.cse9 (not (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| 0))) (.cse11 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 3)) (.cse5 (<= 8640 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse12 (<= 8640 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|)) (.cse0 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse2 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576)) (.cse3 (or .cse25 (< .cse21 8656))) (.cse20 (let ((.cse24 (<= .cse23 (+ .cse22 2147483647)))) (or (and (= (+ .cse22 |ULTIMATE.start_ssl3_accept_~s__state~0#1| 4294967296) .cse23) (not .cse24)) (and .cse16 .cse24)))) (.cse14 (< 8496 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse0 .cse2 .cse3 .cse5) (and .cse6 .cse7) (and .cse6 .cse8 .cse3) (and .cse9 .cse10 .cse11 .cse12) (and .cse4 .cse0 .cse2 .cse3 .cse13 .cse14) (and .cse0 .cse9) (and .cse15 .cse0 .cse16 .cse17) (and .cse6 .cse9) (and .cse3 (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|) .cse10 .cse18 .cse11) (and .cse6 .cse2 .cse3 .cse10 .cse14) (and .cse6 .cse10 .cse18) (and (not (<= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) .cse15 .cse0 .cse19) (and .cse0 .cse2 .cse3 .cse10 .cse14) (and .cse9 .cse7 .cse11) (and .cse6 .cse20) (and .cse7 .cse2 .cse3 .cse11) (and .cse0 (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8560) .cse3) (and (= 0 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8464)) (and (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8544) .cse0 .cse3) (and .cse0 .cse8 .cse2 .cse3 .cse14) (and (<= .cse21 |ULTIMATE.start_ssl3_accept_~s__state~0#1|) .cse6 .cse1) (and .cse0 .cse3 (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8512)) (and .cse6 .cse19) (and .cse0 .cse3 (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8528)) (and .cse4 .cse6 .cse3 .cse13) (and .cse9 .cse11 .cse5 .cse12) (and .cse0 .cse2 .cse3 .cse20 .cse14)))))) [2023-02-16 00:43:16,435 INFO L895 garLoopResultBuilder]: At program point ssl3_accept_switch_1_8481#1(lines 129 631) the Hoare annotation is: (let ((.cse1 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse0 (not (<= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse2 (let ((.cse5 (* 2 (mod (+ |ULTIMATE.start_ssl3_accept_~ag_X~0#1| |ULTIMATE.start_ssl3_accept_~ag_Y~0#1|) 2147483648)))) (or (<= .cse5 8496) (not (<= .cse5 2147483647))))) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| 0))) (.cse4 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1))) (or (and .cse0 .cse1 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576) .cse2) (and .cse3 .cse1) (and .cse0 .cse4 .cse2) (and .cse3 .cse4))) [2023-02-16 00:43:16,435 INFO L899 garLoopResultBuilder]: For program point L112(line 112) no Hoare annotation was computed. [2023-02-16 00:43:16,435 INFO L899 garLoopResultBuilder]: For program point L641(lines 641 645) no Hoare annotation was computed. [2023-02-16 00:43:16,435 INFO L899 garLoopResultBuilder]: For program point L213(lines 213 603) no Hoare annotation was computed. [2023-02-16 00:43:16,436 INFO L899 garLoopResultBuilder]: For program point L180(lines 180 614) no Hoare annotation was computed. [2023-02-16 00:43:16,436 INFO L899 garLoopResultBuilder]: For program point L147(lines 147 625) no Hoare annotation was computed. [2023-02-16 00:43:16,436 INFO L899 garLoopResultBuilder]: For program point L114(lines 114 636) no Hoare annotation was computed. [2023-02-16 00:43:16,436 INFO L899 garLoopResultBuilder]: For program point L346(lines 346 350) no Hoare annotation was computed. [2023-02-16 00:43:16,436 INFO L899 garLoopResultBuilder]: For program point L479(lines 479 490) no Hoare annotation was computed. [2023-02-16 00:43:16,436 INFO L899 garLoopResultBuilder]: For program point L446(lines 446 450) no Hoare annotation was computed. [2023-02-16 00:43:16,436 INFO L895 garLoopResultBuilder]: At program point L380(lines 363 398) the Hoare annotation is: (let ((.cse0 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse1 (let ((.cse6 (* 2 (mod (+ |ULTIMATE.start_ssl3_accept_~ag_X~0#1| |ULTIMATE.start_ssl3_accept_~ag_Y~0#1|) 2147483648)))) (or (not (<= .cse6 2147483647)) (< .cse6 8656)))) (.cse3 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| 0))) (.cse5 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse2 (not (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8496)))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse4 .cse2) (and .cse5 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse2))) [2023-02-16 00:43:16,437 INFO L899 garLoopResultBuilder]: For program point L249(lines 249 254) no Hoare annotation was computed. [2023-02-16 00:43:16,437 INFO L899 garLoopResultBuilder]: For program point L216(lines 216 602) no Hoare annotation was computed. [2023-02-16 00:43:16,437 INFO L899 garLoopResultBuilder]: For program point L183(lines 183 613) no Hoare annotation was computed. [2023-02-16 00:43:16,437 INFO L895 garLoopResultBuilder]: At program point ssl3_accept_switch_1_8657#1(lines 204 606) the Hoare annotation is: (let ((.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| 0))) (.cse1 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse0 (<= 8640 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (or (and (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1) .cse0) (let ((.cse3 (* 2 (mod (+ |ULTIMATE.start_ssl3_accept_~ag_X~0#1| |ULTIMATE.start_ssl3_accept_~ag_Y~0#1|) 2147483648)))) (let ((.cse2 (not (<= .cse3 2147483647)))) (and .cse1 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576) (or .cse2 (< .cse3 8656)) (or (<= .cse3 |ULTIMATE.start_ssl3_accept_~s__state~0#1|) .cse2) .cse0))) (and .cse4 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 3) .cse0) (and .cse4 .cse1 .cse0))) [2023-02-16 00:43:16,437 INFO L899 garLoopResultBuilder]: For program point L150(lines 150 624) no Hoare annotation was computed. [2023-02-16 00:43:16,437 INFO L899 garLoopResultBuilder]: For program point L117(lines 117 635) no Hoare annotation was computed. [2023-02-16 00:43:16,437 INFO L899 garLoopResultBuilder]: For program point L382(lines 382 386) no Hoare annotation was computed. [2023-02-16 00:43:16,437 INFO L899 garLoopResultBuilder]: For program point L85(lines 85 93) no Hoare annotation was computed. [2023-02-16 00:43:16,438 INFO L899 garLoopResultBuilder]: For program point L416(lines 416 422) no Hoare annotation was computed. [2023-02-16 00:43:16,438 INFO L899 garLoopResultBuilder]: For program point L582(lines 582 592) no Hoare annotation was computed. [2023-02-16 00:43:16,438 INFO L899 garLoopResultBuilder]: For program point L582-1(lines 582 592) no Hoare annotation was computed. [2023-02-16 00:43:16,438 INFO L899 garLoopResultBuilder]: For program point L483(lines 483 487) no Hoare annotation was computed. [2023-02-16 00:43:16,438 INFO L899 garLoopResultBuilder]: For program point L285(lines 285 289) no Hoare annotation was computed. [2023-02-16 00:43:16,438 INFO L899 garLoopResultBuilder]: For program point L186(lines 186 612) no Hoare annotation was computed. [2023-02-16 00:43:16,438 INFO L899 garLoopResultBuilder]: For program point L153(lines 153 623) no Hoare annotation was computed. [2023-02-16 00:43:16,438 INFO L899 garLoopResultBuilder]: For program point L120(lines 120 634) no Hoare annotation was computed. [2023-02-16 00:43:16,439 INFO L899 garLoopResultBuilder]: For program point L517(lines 517 521) no Hoare annotation was computed. [2023-02-16 00:43:16,439 INFO L899 garLoopResultBuilder]: For program point L319(lines 319 327) no Hoare annotation was computed. [2023-02-16 00:43:16,439 INFO L899 garLoopResultBuilder]: For program point L88(lines 88 92) no Hoare annotation was computed. [2023-02-16 00:43:16,439 INFO L899 garLoopResultBuilder]: For program point L88-2(lines 85 93) no Hoare annotation was computed. [2023-02-16 00:43:16,439 INFO L902 garLoopResultBuilder]: At program point ssl3_accept_switch_1_3#1(lines 216 602) the Hoare annotation is: true [2023-02-16 00:43:16,439 INFO L902 garLoopResultBuilder]: At program point L683(lines 76 685) the Hoare annotation is: true [2023-02-16 00:43:16,439 INFO L899 garLoopResultBuilder]: For program point L650(lines 650 656) no Hoare annotation was computed. [2023-02-16 00:43:16,439 INFO L899 garLoopResultBuilder]: For program point L551(lines 551 556) no Hoare annotation was computed. [2023-02-16 00:43:16,440 INFO L902 garLoopResultBuilder]: At program point ssl3_accept_switch_1_default#1(lines 219 601) the Hoare annotation is: true [2023-02-16 00:43:16,440 INFO L899 garLoopResultBuilder]: For program point L585(lines 585 589) no Hoare annotation was computed. [2023-02-16 00:43:16,440 INFO L895 garLoopResultBuilder]: At program point $Ultimate##176(lines 456 468) the Hoare annotation is: (let ((.cse10 (* 2 (mod (+ |ULTIMATE.start_ssl3_accept_~ag_X~0#1| |ULTIMATE.start_ssl3_accept_~ag_Y~0#1|) 2147483648)))) (let ((.cse11 (not (<= .cse10 2147483647)))) (let ((.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| 0))) (.cse4 (= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 3)) (.cse8 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 3)) (.cse5 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576)) (.cse6 (or .cse11 (< .cse10 8656))) (.cse7 (< 8496 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|)) (.cse0 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse3 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse9 (or (<= .cse10 8496) .cse11)) (.cse2 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8448))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse2 .cse4) (and .cse0 .cse5 .cse6 .cse2 .cse7) (and .cse1 .cse2 .cse8 (<= 8640 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|)) (and .cse3 .cse1 .cse2) (and .cse6 (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|) .cse2 .cse4 .cse8) (and .cse3 .cse5 .cse6 .cse2 .cse7) (and (< |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8496) .cse0 .cse9 .cse2) (and .cse3 .cse9 .cse2))))) [2023-02-16 00:43:16,440 INFO L895 garLoopResultBuilder]: At program point ssl3_accept_switch_1_8577#1(lines 180 614) the Hoare annotation is: (let ((.cse0 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| 0))) (.cse3 (not (<= 8656 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse5 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse4 (let ((.cse6 (* 2 (mod (+ |ULTIMATE.start_ssl3_accept_~ag_X~0#1| |ULTIMATE.start_ssl3_accept_~ag_Y~0#1|) 2147483648)))) (or (not (<= .cse6 2147483647)) (< .cse6 8656)))) (.cse2 (not (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8496)))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse0 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576) .cse4 .cse2 (< 8496 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|)) (and .cse5 .cse1 .cse2) (and .cse3 .cse5 .cse4 .cse2))) [2023-02-16 00:43:16,440 INFO L899 garLoopResultBuilder]: For program point L189(lines 189 611) no Hoare annotation was computed. [2023-02-16 00:43:16,440 INFO L899 garLoopResultBuilder]: For program point L156(lines 156 622) no Hoare annotation was computed. [2023-02-16 00:43:16,441 INFO L899 garLoopResultBuilder]: For program point L123(lines 123 633) no Hoare annotation was computed. [2023-02-16 00:43:16,441 INFO L899 garLoopResultBuilder]: For program point L322(lines 322 326) no Hoare annotation was computed. [2023-02-16 00:43:16,441 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-02-16 00:43:16,441 INFO L899 garLoopResultBuilder]: For program point L322-2(lines 221 598) no Hoare annotation was computed. [2023-02-16 00:43:16,441 INFO L895 garLoopResultBuilder]: At program point ssl3_accept_switch_1_8641#1(lines 198 608) the Hoare annotation is: (let ((.cse0 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| 0))) (.cse4 (not (<= 8656 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse3 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse5 (let ((.cse6 (* 2 (mod (+ |ULTIMATE.start_ssl3_accept_~ag_X~0#1| |ULTIMATE.start_ssl3_accept_~ag_Y~0#1|) 2147483648)))) (or (not (<= .cse6 2147483647)) (< .cse6 8656)))) (.cse2 (<= 8640 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse1 .cse2) (and .cse4 .cse0 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576) .cse5 .cse2) (and .cse1 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 3) .cse2 (<= 8640 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|)) (and .cse4 .cse3 .cse5 .cse2))) [2023-02-16 00:43:16,441 INFO L902 garLoopResultBuilder]: At program point L224(lines 117 635) the Hoare annotation is: true [2023-02-16 00:43:16,441 INFO L895 garLoopResultBuilder]: At program point ssl3_accept_ERROR#1(lines 76 685) the Hoare annotation is: false [2023-02-16 00:43:16,441 INFO L902 garLoopResultBuilder]: At program point ssl3_accept_returnLabel#1(lines 19 686) the Hoare annotation is: true [2023-02-16 00:43:16,442 INFO L899 garLoopResultBuilder]: For program point L522(lines 522 526) no Hoare annotation was computed. [2023-02-16 00:43:16,442 INFO L899 garLoopResultBuilder]: For program point L522-2(lines 522 526) no Hoare annotation was computed. [2023-02-16 00:43:16,442 INFO L899 garLoopResultBuilder]: For program point L456-1(lines 456 468) no Hoare annotation was computed. [2023-02-16 00:43:16,442 INFO L899 garLoopResultBuilder]: For program point L192(lines 192 610) no Hoare annotation was computed. [2023-02-16 00:43:16,442 INFO L899 garLoopResultBuilder]: For program point L159(lines 159 621) no Hoare annotation was computed. [2023-02-16 00:43:16,442 INFO L899 garLoopResultBuilder]: For program point L126(lines 126 632) no Hoare annotation was computed. [2023-02-16 00:43:16,442 INFO L895 garLoopResultBuilder]: At program point L424(lines 415 435) the Hoare annotation is: (let ((.cse0 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse1 (let ((.cse6 (* 2 (mod (+ |ULTIMATE.start_ssl3_accept_~ag_X~0#1| |ULTIMATE.start_ssl3_accept_~ag_Y~0#1|) 2147483648)))) (or (not (<= .cse6 2147483647)) (< .cse6 8656)))) (.cse3 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| 0))) (.cse5 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse2 (not (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8496)))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse4 .cse2) (and .cse5 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse2))) [2023-02-16 00:43:16,443 INFO L895 garLoopResultBuilder]: At program point $Ultimate##130(lines 342 351) the Hoare annotation is: (let ((.cse0 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse1 (let ((.cse6 (* 2 (mod (+ |ULTIMATE.start_ssl3_accept_~ag_X~0#1| |ULTIMATE.start_ssl3_accept_~ag_Y~0#1|) 2147483648)))) (or (not (<= .cse6 2147483647)) (< .cse6 8656)))) (.cse3 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| 0))) (.cse5 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse2 (not (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8496)))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse4 .cse2) (and .cse5 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse2))) [2023-02-16 00:43:16,443 INFO L899 garLoopResultBuilder]: For program point L358(lines 358 362) no Hoare annotation was computed. [2023-02-16 00:43:16,443 INFO L899 garLoopResultBuilder]: For program point L358-2(lines 221 598) no Hoare annotation was computed. [2023-02-16 00:43:16,443 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-02-16 00:43:16,443 INFO L895 garLoopResultBuilder]: At program point ssl3_accept_switch_1_8673#1(lines 210 604) the Hoare annotation is: (let ((.cse0 (not (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| 0))) (.cse2 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 3)) (.cse1 (<= 8672 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (or (and .cse0 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse1) (and .cse0 .cse1 .cse2) (and .cse1 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576) (let ((.cse3 (* 2 (mod (+ |ULTIMATE.start_ssl3_accept_~ag_X~0#1| |ULTIMATE.start_ssl3_accept_~ag_Y~0#1|) 2147483648)))) (or (not (<= .cse3 2147483647)) (< .cse3 8656))) .cse2) (and (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1) .cse1))) [2023-02-16 00:43:16,443 INFO L899 garLoopResultBuilder]: For program point L95(lines 95 103) no Hoare annotation was computed. [2023-02-16 00:43:16,443 INFO L899 garLoopResultBuilder]: For program point L95-1(lines 76 685) no Hoare annotation was computed. [2023-02-16 00:43:16,444 INFO L895 garLoopResultBuilder]: At program point ssl3_accept_switch_1_8609#1(lines 192 610) the Hoare annotation is: (let ((.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| 0))) (.cse3 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse4 (not (<= 8656 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse0 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse5 (let ((.cse6 (* 2 (mod (+ |ULTIMATE.start_ssl3_accept_~ag_X~0#1| |ULTIMATE.start_ssl3_accept_~ag_Y~0#1|) 2147483648)))) (or (not (<= .cse6 2147483647)) (< .cse6 8656)))) (.cse2 (not (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8496)))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse1 .cse2) (and .cse4 .cse3 .cse5 .cse2) (and .cse4 .cse0 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576) .cse5 .cse2))) [2023-02-16 00:43:16,444 INFO L899 garLoopResultBuilder]: For program point L459(lines 459 464) no Hoare annotation was computed. [2023-02-16 00:43:16,444 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-02-16 00:43:16,444 INFO L895 garLoopResultBuilder]: At program point $Ultimate##158(lines 404 441) the Hoare annotation is: (let ((.cse0 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse1 (let ((.cse6 (* 2 (mod (+ |ULTIMATE.start_ssl3_accept_~ag_X~0#1| |ULTIMATE.start_ssl3_accept_~ag_Y~0#1|) 2147483648)))) (or (not (<= .cse6 2147483647)) (< .cse6 8656)))) (.cse3 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) (.cse5 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| 0))) (.cse2 (not (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8496)))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse4 .cse2) (and .cse5 .cse1 .cse2 .cse3) (and .cse5 .cse4 .cse2))) [2023-02-16 00:43:16,444 INFO L899 garLoopResultBuilder]: For program point L195(lines 195 609) no Hoare annotation was computed. [2023-02-16 00:43:16,444 INFO L899 garLoopResultBuilder]: For program point L162(lines 162 620) no Hoare annotation was computed. [2023-02-16 00:43:16,444 INFO L899 garLoopResultBuilder]: For program point L129(lines 129 631) no Hoare annotation was computed. [2023-02-16 00:43:16,445 INFO L899 garLoopResultBuilder]: For program point L96(lines 96 100) no Hoare annotation was computed. [2023-02-16 00:43:16,445 INFO L895 garLoopResultBuilder]: At program point ssl3_accept_switch_1_8466#1(lines 138 628) the Hoare annotation is: (let ((.cse3 (* 2 (mod (+ |ULTIMATE.start_ssl3_accept_~ag_X~0#1| |ULTIMATE.start_ssl3_accept_~ag_Y~0#1|) 2147483648)))) (let ((.cse4 (not (<= .cse3 2147483647)))) (let ((.cse1 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse5 (not (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| 0))) (.cse0 (not (<= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse6 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse2 (or .cse4 (< .cse3 8656)))) (or (and .cse0 .cse1 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576) .cse2 (< 8496 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|)) (and .cse0 (< |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8496) .cse1 (or (<= .cse3 8496) .cse4)) (and .cse0 (= 0 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (and .cse1 .cse5) (and .cse6 .cse5) (and .cse0 .cse6 .cse2))))) [2023-02-16 00:43:16,445 INFO L899 garLoopResultBuilder]: For program point L427(lines 427 431) no Hoare annotation was computed. [2023-02-16 00:43:16,445 INFO L895 garLoopResultBuilder]: At program point $Ultimate##166(lines 415 435) the Hoare annotation is: (let ((.cse0 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse1 (let ((.cse6 (* 2 (mod (+ |ULTIMATE.start_ssl3_accept_~ag_X~0#1| |ULTIMATE.start_ssl3_accept_~ag_Y~0#1|) 2147483648)))) (or (not (<= .cse6 2147483647)) (< .cse6 8656)))) (.cse3 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) (.cse5 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| 0))) (.cse2 (not (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8496)))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse4 .cse2) (and .cse5 .cse1 .cse2 .cse3) (and .cse5 .cse4 .cse2))) [2023-02-16 00:43:16,445 INFO L902 garLoopResultBuilder]: At program point ssl3_accept_switch_1_12292#1(lines 114 636) the Hoare annotation is: true [2023-02-16 00:43:16,445 INFO L899 garLoopResultBuilder]: For program point L229(lines 229 233) no Hoare annotation was computed. [2023-02-16 00:43:16,445 INFO L899 garLoopResultBuilder]: For program point L229-2(lines 221 598) no Hoare annotation was computed. [2023-02-16 00:43:16,446 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-02-16 00:43:16,446 INFO L895 garLoopResultBuilder]: At program point $Ultimate##219(lines 637 665) the Hoare annotation is: (let ((.cse26 (+ |ULTIMATE.start_ssl3_accept_~ag_X~0#1| |ULTIMATE.start_ssl3_accept_~ag_Y~0#1|))) (let ((.cse21 (* 2 (mod .cse26 2147483648))) (.cse22 (* 4294967296 (div .cse26 2147483648))) (.cse23 (+ (* 2 |ULTIMATE.start_ssl3_accept_~ag_X~0#1|) (* 2 |ULTIMATE.start_ssl3_accept_~ag_Y~0#1|)))) (let ((.cse16 (= (+ .cse22 |ULTIMATE.start_ssl3_accept_~s__state~0#1|) .cse23)) (.cse17 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8496)) (.cse25 (not (<= .cse21 2147483647)))) (let ((.cse18 (= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 3)) (.cse15 (< |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8496)) (.cse10 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8448)) (.cse7 (<= 8672 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse8 (= 8466 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse1 (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656)) (.cse19 (or (<= .cse21 8496) .cse25)) (.cse4 (not (<= 8656 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse6 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse13 (not .cse17)) (.cse9 (not (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| 0))) (.cse11 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 3)) (.cse5 (<= 8640 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse12 (<= 8640 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|)) (.cse0 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse2 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576)) (.cse3 (or .cse25 (< .cse21 8656))) (.cse20 (let ((.cse24 (<= .cse23 (+ .cse22 2147483647)))) (or (and (= (+ .cse22 |ULTIMATE.start_ssl3_accept_~s__state~0#1| 4294967296) .cse23) (not .cse24)) (and .cse16 .cse24)))) (.cse14 (< 8496 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse0 .cse2 .cse3 .cse5) (and .cse6 .cse7) (and .cse6 .cse8 .cse3) (and .cse9 .cse10 .cse11 .cse12) (and .cse4 .cse0 .cse2 .cse3 .cse13 .cse14) (and .cse0 .cse9) (and .cse15 .cse0 .cse16 .cse17) (and .cse6 .cse9) (and .cse3 (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|) .cse10 .cse18 .cse11) (and .cse6 .cse2 .cse3 .cse10 .cse14) (and .cse6 .cse10 .cse18) (and (not (<= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) .cse15 .cse0 .cse19) (and .cse0 .cse2 .cse3 .cse10 .cse14) (and .cse9 .cse7 .cse11) (and .cse6 .cse20) (and .cse7 .cse2 .cse3 .cse11) (and .cse0 (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8560) .cse3) (and (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8544) .cse0 .cse3) (and .cse0 .cse8 .cse2 .cse3 .cse14) (and (<= .cse21 |ULTIMATE.start_ssl3_accept_~s__state~0#1|) .cse6 .cse1) (and .cse0 .cse3 (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8512)) (and .cse6 .cse19) (and .cse0 .cse3 (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8528)) (and .cse4 .cse6 .cse3 .cse13) (and .cse9 .cse11 .cse5 .cse12) (and .cse0 .cse2 .cse3 .cse20 .cse14)))))) [2023-02-16 00:43:16,446 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 679) no Hoare annotation was computed. [2023-02-16 00:43:16,446 INFO L899 garLoopResultBuilder]: For program point L561(lines 561 565) no Hoare annotation was computed. [2023-02-16 00:43:16,446 INFO L899 garLoopResultBuilder]: For program point L495(lines 495 499) no Hoare annotation was computed. [2023-02-16 00:43:16,446 INFO L899 garLoopResultBuilder]: For program point L198(lines 198 608) no Hoare annotation was computed. [2023-02-16 00:43:16,446 INFO L899 garLoopResultBuilder]: For program point L165(lines 165 619) no Hoare annotation was computed. [2023-02-16 00:43:16,446 INFO L899 garLoopResultBuilder]: For program point L132(lines 132 630) no Hoare annotation was computed. [2023-02-16 00:43:16,447 INFO L895 garLoopResultBuilder]: At program point ssl3_accept_switch_1_8561#1(lines 171 617) the Hoare annotation is: (let ((.cse0 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse1 (let ((.cse6 (* 2 (mod (+ |ULTIMATE.start_ssl3_accept_~ag_X~0#1| |ULTIMATE.start_ssl3_accept_~ag_Y~0#1|) 2147483648)))) (or (not (<= .cse6 2147483647)) (< .cse6 8656)))) (.cse3 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__hit~0#1| 0))) (.cse5 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse2 (not (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8496)))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse4 .cse2) (and .cse5 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse2))) [2023-02-16 00:43:16,447 INFO L899 garLoopResultBuilder]: For program point L266(lines 266 279) no Hoare annotation was computed. [2023-02-16 00:43:16,449 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:43:16,450 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-16 00:43:16,495 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.02 12:43:16 BoogieIcfgContainer [2023-02-16 00:43:16,503 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-16 00:43:16,503 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-16 00:43:16,504 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-16 00:43:16,504 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-16 00:43:16,504 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 12:42:51" (3/4) ... [2023-02-16 00:43:16,507 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-02-16 00:43:16,529 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2023-02-16 00:43:16,530 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2023-02-16 00:43:16,530 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2023-02-16 00:43:16,531 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-02-16 00:43:16,625 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-16 00:43:16,625 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-16 00:43:16,626 INFO L158 Benchmark]: Toolchain (without parser) took 25933.13ms. Allocated memory was 176.2MB in the beginning and 750.8MB in the end (delta: 574.6MB). Free memory was 129.4MB in the beginning and 544.4MB in the end (delta: -415.0MB). Peak memory consumption was 161.9MB. Max. memory is 16.1GB. [2023-02-16 00:43:16,626 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 176.2MB. Free memory is still 124.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-16 00:43:16,626 INFO L158 Benchmark]: CACSL2BoogieTranslator took 392.03ms. Allocated memory is still 176.2MB. Free memory was 129.4MB in the beginning and 113.8MB in the end (delta: 15.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-02-16 00:43:16,626 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.91ms. Allocated memory is still 176.2MB. Free memory was 113.8MB in the beginning and 110.5MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-02-16 00:43:16,627 INFO L158 Benchmark]: Boogie Preprocessor took 42.49ms. Allocated memory is still 176.2MB. Free memory was 110.5MB in the beginning and 108.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-16 00:43:16,627 INFO L158 Benchmark]: RCFGBuilder took 646.06ms. Allocated memory was 176.2MB in the beginning and 218.1MB in the end (delta: 41.9MB). Free memory was 108.4MB in the beginning and 169.1MB in the end (delta: -60.7MB). Peak memory consumption was 27.5MB. Max. memory is 16.1GB. [2023-02-16 00:43:16,627 INFO L158 Benchmark]: TraceAbstraction took 24660.93ms. Allocated memory was 218.1MB in the beginning and 750.8MB in the end (delta: 532.7MB). Free memory was 169.1MB in the beginning and 552.8MB in the end (delta: -383.7MB). Peak memory consumption was 478.6MB. Max. memory is 16.1GB. [2023-02-16 00:43:16,628 INFO L158 Benchmark]: Witness Printer took 121.55ms. Allocated memory is still 750.8MB. Free memory was 552.8MB in the beginning and 544.4MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-02-16 00:43:16,633 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.16ms. Allocated memory is still 176.2MB. Free memory is still 124.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 392.03ms. Allocated memory is still 176.2MB. Free memory was 129.4MB in the beginning and 113.8MB in the end (delta: 15.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.91ms. Allocated memory is still 176.2MB. Free memory was 113.8MB in the beginning and 110.5MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.49ms. Allocated memory is still 176.2MB. Free memory was 110.5MB in the beginning and 108.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 646.06ms. Allocated memory was 176.2MB in the beginning and 218.1MB in the end (delta: 41.9MB). Free memory was 108.4MB in the beginning and 169.1MB in the end (delta: -60.7MB). Peak memory consumption was 27.5MB. Max. memory is 16.1GB. * TraceAbstraction took 24660.93ms. Allocated memory was 218.1MB in the beginning and 750.8MB in the end (delta: 532.7MB). Free memory was 169.1MB in the beginning and 552.8MB in the end (delta: -383.7MB). Peak memory consumption was 478.6MB. Max. memory is 16.1GB. * Witness Printer took 121.55ms. Allocated memory is still 750.8MB. Free memory was 552.8MB in the beginning and 544.4MB 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: 679]: 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: 24.6s, OverallIterations: 20, TraceHistogramMax: 21, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.2s, AutomataDifference: 6.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 9.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2992 SdHoareTripleChecker+Valid, 3.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2992 mSDsluCounter, 9727 SdHoareTripleChecker+Invalid, 2.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4808 mSDsCounter, 618 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4822 IncrementalHoareTripleChecker+Invalid, 5440 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 618 mSolverCounterUnsat, 4919 mSDtfsCounter, 4822 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3990 GetRequests, 3925 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16675occurred in iteration=19, InterpolantAutomatonStates: 97, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.9s AutomataMinimizationTime, 20 MinimizatonAttempts, 4912 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 29 LocationsWithAnnotation, 29 PreInvPairs, 748 NumberOfFragments, 3329 HoareAnnotationTreeSize, 29 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 29 FomulaSimplificationsInter, 71525 FormulaSimplificationTreeSizeReductionInter, 9.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 7056 NumberOfCodeBlocks, 7056 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 8793 ConstructedInterpolants, 0 QuantifiedInterpolants, 22429 SizeOfPredicates, 12 NumberOfNonLiveVariables, 3417 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 29 InterpolantComputations, 16 PerfectInterpolantSequences, 39472/40261 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: 114]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 363]: Loop Invariant Derived loop invariant: (((((2 == blastFlag && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && !(s__state <= 8496)) && s__state <= 8576) || ((2 == blastFlag && !(s__hit == 0)) && !(s__state <= 8496))) || (((blastFlag == 1 && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && !(s__state <= 8496)) && s__state <= 8576)) || ((!(s__hit == 0) && blastFlag == 1) && !(s__state <= 8496)) - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 159]: Loop Invariant Derived loop invariant: (((((2 == blastFlag && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && !(s__state <= 8496)) && s__state <= 8576) || ((2 == blastFlag && !(s__hit == 0)) && !(s__state <= 8496))) || (((blastFlag == 1 && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && !(s__state <= 8496)) && s__state <= 8576)) || ((!(s__hit == 0) && blastFlag == 1) && !(s__state <= 8496)) - InvariantResult [Line: 147]: Loop Invariant Derived loop invariant: (((!(s__hit == 0) && 2 == blastFlag) || (((2 == blastFlag && s__s3__tmp__next_state___0 <= 8576) && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && s__state <= 8576)) || ((blastFlag == 1 && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && s__state <= 8576)) || (!(s__hit == 0) && blastFlag == 1) - InvariantResult [Line: 415]: Loop Invariant Derived loop invariant: (((((2 == blastFlag && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && !(s__state <= 8496)) && s__state <= 8576) || ((2 == blastFlag && !(s__hit == 0)) && !(s__state <= 8496))) || (((blastFlag == 1 && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && !(s__state <= 8496)) && s__state <= 8576)) || ((!(s__hit == 0) && blastFlag == 1) && !(s__state <= 8496)) - InvariantResult [Line: 76]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 192]: Loop Invariant Derived loop invariant: ((((2 == blastFlag && !(s__hit == 0)) && !(s__state <= 8496)) || ((blastFlag == 1 && !(s__hit == 0)) && !(s__state <= 8496))) || (((!(8656 <= s__state) && blastFlag == 1) && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && !(s__state <= 8496))) || ((((!(8656 <= s__state) && 2 == blastFlag) && s__s3__tmp__next_state___0 <= 8576) && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && !(s__state <= 8496)) - InvariantResult [Line: 186]: Loop Invariant Derived loop invariant: ((((2 == blastFlag && !(s__hit == 0)) && !(s__state <= 8496)) || (((((!(8656 <= s__state) && 2 == blastFlag) && s__s3__tmp__next_state___0 <= 8576) && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && !(s__state <= 8496)) && 8496 < s__s3__tmp__next_state___0)) || ((blastFlag == 1 && !(s__hit == 0)) && !(s__state <= 8496))) || (((!(8656 <= s__state) && blastFlag == 1) && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && !(s__state <= 8496)) - InvariantResult [Line: 138]: Loop Invariant Derived loop invariant: ((((((((!(8496 <= s__state) && 2 == blastFlag) && s__s3__tmp__next_state___0 <= 8576) && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && 8496 < s__s3__tmp__next_state___0) || (((!(8496 <= s__state) && s__s3__tmp__next_state___0 < 8496) && 2 == blastFlag) && (2 * ((ag_X + ag_Y) % 2147483648) <= 8496 || !(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647)))) || (!(8496 <= s__state) && 0 == blastFlag)) || (2 == blastFlag && !(s__hit == 0))) || (blastFlag == 1 && !(s__hit == 0))) || ((!(8496 <= s__state) && blastFlag == 1) && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) - InvariantResult [Line: 180]: Loop Invariant Derived loop invariant: ((((2 == blastFlag && !(s__hit == 0)) && !(s__state <= 8496)) || (((((!(8656 <= s__state) && 2 == blastFlag) && s__s3__tmp__next_state___0 <= 8576) && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && !(s__state <= 8496)) && 8496 < s__s3__tmp__next_state___0)) || ((blastFlag == 1 && !(s__hit == 0)) && !(s__state <= 8496))) || (((!(8656 <= s__state) && blastFlag == 1) && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && !(s__state <= 8496)) - InvariantResult [Line: 210]: Loop Invariant Derived loop invariant: ((((!(s__hit == 0) && 2 == blastFlag) && 8672 <= s__state) || ((!(s__hit == 0) && 8672 <= s__state) && blastFlag == 3)) || (((8672 <= s__state && s__s3__tmp__next_state___0 <= 8576) && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && blastFlag == 3)) || (blastFlag == 1 && 8672 <= s__state) - InvariantResult [Line: 129]: Loop Invariant Derived loop invariant: (((((!(8496 <= s__state) && 2 == blastFlag) && s__s3__tmp__next_state___0 <= 8576) && (2 * ((ag_X + ag_Y) % 2147483648) <= 8496 || !(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647))) || (!(s__hit == 0) && 2 == blastFlag)) || ((!(8496 <= s__state) && blastFlag == 1) && (2 * ((ag_X + ag_Y) % 2147483648) <= 8496 || !(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647)))) || (!(s__hit == 0) && blastFlag == 1) - InvariantResult [Line: 637]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((2 == blastFlag && s__state == 8656) && s__s3__tmp__next_state___0 <= 8576) && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) || ((((!(8656 <= s__state) && 2 == blastFlag) && s__s3__tmp__next_state___0 <= 8576) && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && 8640 <= s__state)) || (blastFlag == 1 && 8672 <= s__state)) || ((blastFlag == 1 && 8466 == s__state) && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656))) || (((!(s__hit == 0) && s__state <= 8448) && blastFlag == 3) && 8640 <= s__s3__tmp__next_state___0)) || (((((!(8656 <= s__state) && 2 == blastFlag) && s__s3__tmp__next_state___0 <= 8576) && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && !(s__state <= 8496)) && 8496 < s__s3__tmp__next_state___0)) || (2 == blastFlag && !(s__hit == 0))) || (((s__s3__tmp__next_state___0 < 8496 && 2 == blastFlag) && 4294967296 * ((ag_X + ag_Y) / 2147483648) + s__state == 2 * ag_X + 2 * ag_Y) && s__state <= 8496)) || (blastFlag == 1 && !(s__hit == 0))) || (((((!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656) && 0 == s__hit) && s__state <= 8448) && s__s3__tmp__next_state___0 == 3) && blastFlag == 3)) || ((((blastFlag == 1 && s__s3__tmp__next_state___0 <= 8576) && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && s__state <= 8448) && 8496 < s__s3__tmp__next_state___0)) || ((blastFlag == 1 && s__state <= 8448) && s__s3__tmp__next_state___0 == 3)) || (((!(8496 <= s__state) && s__s3__tmp__next_state___0 < 8496) && 2 == blastFlag) && (2 * ((ag_X + ag_Y) % 2147483648) <= 8496 || !(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647)))) || ((((2 == blastFlag && s__s3__tmp__next_state___0 <= 8576) && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && s__state <= 8448) && 8496 < s__s3__tmp__next_state___0)) || ((!(s__hit == 0) && 8672 <= s__state) && blastFlag == 3)) || (blastFlag == 1 && ((4294967296 * ((ag_X + ag_Y) / 2147483648) + s__state + 4294967296 == 2 * ag_X + 2 * ag_Y && !(2 * ag_X + 2 * ag_Y <= 4294967296 * ((ag_X + ag_Y) / 2147483648) + 2147483647)) || (4294967296 * ((ag_X + ag_Y) / 2147483648) + s__state == 2 * ag_X + 2 * ag_Y && 2 * ag_X + 2 * ag_Y <= 4294967296 * ((ag_X + ag_Y) / 2147483648) + 2147483647)))) || (((8672 <= s__state && s__s3__tmp__next_state___0 <= 8576) && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && blastFlag == 3)) || ((2 == blastFlag && s__state == 8560) && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656))) || ((s__state == 8544 && 2 == blastFlag) && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656))) || ((((2 == blastFlag && 8466 == s__state) && s__s3__tmp__next_state___0 <= 8576) && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && 8496 < s__s3__tmp__next_state___0)) || ((2 * ((ag_X + ag_Y) % 2147483648) <= s__state && blastFlag == 1) && s__state == 8656)) || ((2 == blastFlag && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && s__state == 8512)) || (blastFlag == 1 && (2 * ((ag_X + ag_Y) % 2147483648) <= 8496 || !(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647)))) || ((2 == blastFlag && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && s__state == 8528)) || (((!(8656 <= s__state) && blastFlag == 1) && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && !(s__state <= 8496))) || (((!(s__hit == 0) && blastFlag == 3) && 8640 <= s__state) && 8640 <= s__s3__tmp__next_state___0)) || ((((2 == blastFlag && s__s3__tmp__next_state___0 <= 8576) && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && ((4294967296 * ((ag_X + ag_Y) / 2147483648) + s__state + 4294967296 == 2 * ag_X + 2 * ag_Y && !(2 * ag_X + 2 * ag_Y <= 4294967296 * ((ag_X + ag_Y) / 2147483648) + 2147483647)) || (4294967296 * ((ag_X + ag_Y) / 2147483648) + s__state == 2 * ag_X + 2 * ag_Y && 2 * ag_X + 2 * ag_Y <= 4294967296 * ((ag_X + ag_Y) / 2147483648) + 2147483647))) && 8496 < s__s3__tmp__next_state___0) - InvariantResult [Line: 456]: Loop Invariant Derived loop invariant: (((((((((2 == blastFlag && !(s__hit == 0)) && s__state <= 8448) || ((blastFlag == 1 && s__state <= 8448) && s__s3__tmp__next_state___0 == 3)) || ((((2 == blastFlag && s__s3__tmp__next_state___0 <= 8576) && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && s__state <= 8448) && 8496 < s__s3__tmp__next_state___0)) || (((!(s__hit == 0) && s__state <= 8448) && blastFlag == 3) && 8640 <= s__s3__tmp__next_state___0)) || ((blastFlag == 1 && !(s__hit == 0)) && s__state <= 8448)) || (((((!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656) && 0 == s__hit) && s__state <= 8448) && s__s3__tmp__next_state___0 == 3) && blastFlag == 3)) || ((((blastFlag == 1 && s__s3__tmp__next_state___0 <= 8576) && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && s__state <= 8448) && 8496 < s__s3__tmp__next_state___0)) || (((s__s3__tmp__next_state___0 < 8496 && 2 == blastFlag) && (2 * ((ag_X + ag_Y) % 2147483648) <= 8496 || !(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647))) && s__state <= 8448)) || ((blastFlag == 1 && (2 * ((ag_X + ag_Y) % 2147483648) <= 8496 || !(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647))) && s__state <= 8448) - InvariantResult [Line: 198]: Loop Invariant Derived loop invariant: (((((2 == blastFlag && !(s__hit == 0)) && 8640 <= s__state) || ((blastFlag == 1 && !(s__hit == 0)) && 8640 <= s__state)) || ((((!(8656 <= s__state) && 2 == blastFlag) && s__s3__tmp__next_state___0 <= 8576) && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && 8640 <= s__state)) || (((!(s__hit == 0) && blastFlag == 3) && 8640 <= s__state) && 8640 <= s__s3__tmp__next_state___0)) || (((!(8656 <= s__state) && blastFlag == 1) && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && 8640 <= s__state) - InvariantResult [Line: 219]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 135]: Loop Invariant Derived loop invariant: ((((((!(8496 <= s__state) && s__s3__tmp__next_state___0 < 8496) && 2 == blastFlag) && (2 * ((ag_X + ag_Y) % 2147483648) <= 8496 || !(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647))) || (blastFlag == 1 && !(s__hit == 0))) || (2 == blastFlag && !(s__hit == 0))) || ((!(8496 <= s__state) && blastFlag == 1) && (2 * ((ag_X + ag_Y) % 2147483648) <= 8496 || !(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647)))) || ((((!(8496 <= s__state) && 2 == blastFlag) && s__s3__tmp__next_state___0 <= 8576) && (4294967296 * ((ag_X + ag_Y) / 2147483648) + s__state == 2 * ag_X + 2 * ag_Y || (4294967296 * ((ag_X + ag_Y) / 2147483648) + s__state + 4294967296 == 2 * ag_X + 2 * ag_Y && !(2 * ag_X + 2 * ag_Y <= 4294967296 * ((ag_X + ag_Y) / 2147483648) + 2147483647)))) && 8496 < s__s3__tmp__next_state___0) - InvariantResult [Line: 171]: Loop Invariant Derived loop invariant: (((((2 == blastFlag && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && !(s__state <= 8496)) && s__state <= 8576) || ((2 == blastFlag && !(s__hit == 0)) && !(s__state <= 8496))) || (((blastFlag == 1 && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && !(s__state <= 8496)) && s__state <= 8576)) || ((!(s__hit == 0) && blastFlag == 1) && !(s__state <= 8496)) - InvariantResult [Line: 204]: Loop Invariant Derived loop invariant: (((blastFlag == 1 && 8640 <= s__state) || ((((2 == blastFlag && s__s3__tmp__next_state___0 <= 8576) && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && (2 * ((ag_X + ag_Y) % 2147483648) <= s__state || !(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647))) && 8640 <= s__state)) || ((!(s__hit == 0) && blastFlag == 3) && 8640 <= s__state)) || ((!(s__hit == 0) && 2 == blastFlag) && 8640 <= s__state) - InvariantResult [Line: 216]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 76]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 687]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 342]: Loop Invariant Derived loop invariant: (((((2 == blastFlag && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && !(s__state <= 8496)) && s__state <= 8576) || ((2 == blastFlag && !(s__hit == 0)) && !(s__state <= 8496))) || (((blastFlag == 1 && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && !(s__state <= 8496)) && s__state <= 8576)) || ((!(s__hit == 0) && blastFlag == 1) && !(s__state <= 8496)) - InvariantResult [Line: 111]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((2 == blastFlag && s__state == 8656) && s__s3__tmp__next_state___0 <= 8576) && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) || ((((!(8656 <= s__state) && 2 == blastFlag) && s__s3__tmp__next_state___0 <= 8576) && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && 8640 <= s__state)) || (blastFlag == 1 && 8672 <= s__state)) || ((blastFlag == 1 && 8466 == s__state) && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656))) || (((!(s__hit == 0) && s__state <= 8448) && blastFlag == 3) && 8640 <= s__s3__tmp__next_state___0)) || (((((!(8656 <= s__state) && 2 == blastFlag) && s__s3__tmp__next_state___0 <= 8576) && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && !(s__state <= 8496)) && 8496 < s__s3__tmp__next_state___0)) || (2 == blastFlag && !(s__hit == 0))) || (((s__s3__tmp__next_state___0 < 8496 && 2 == blastFlag) && 4294967296 * ((ag_X + ag_Y) / 2147483648) + s__state == 2 * ag_X + 2 * ag_Y) && s__state <= 8496)) || (blastFlag == 1 && !(s__hit == 0))) || (((((!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656) && 0 == s__hit) && s__state <= 8448) && s__s3__tmp__next_state___0 == 3) && blastFlag == 3)) || ((((blastFlag == 1 && s__s3__tmp__next_state___0 <= 8576) && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && s__state <= 8448) && 8496 < s__s3__tmp__next_state___0)) || ((blastFlag == 1 && s__state <= 8448) && s__s3__tmp__next_state___0 == 3)) || (((!(8496 <= s__state) && s__s3__tmp__next_state___0 < 8496) && 2 == blastFlag) && (2 * ((ag_X + ag_Y) % 2147483648) <= 8496 || !(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647)))) || ((((2 == blastFlag && s__s3__tmp__next_state___0 <= 8576) && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && s__state <= 8448) && 8496 < s__s3__tmp__next_state___0)) || ((!(s__hit == 0) && 8672 <= s__state) && blastFlag == 3)) || (blastFlag == 1 && ((4294967296 * ((ag_X + ag_Y) / 2147483648) + s__state + 4294967296 == 2 * ag_X + 2 * ag_Y && !(2 * ag_X + 2 * ag_Y <= 4294967296 * ((ag_X + ag_Y) / 2147483648) + 2147483647)) || (4294967296 * ((ag_X + ag_Y) / 2147483648) + s__state == 2 * ag_X + 2 * ag_Y && 2 * ag_X + 2 * ag_Y <= 4294967296 * ((ag_X + ag_Y) / 2147483648) + 2147483647)))) || (((8672 <= s__state && s__s3__tmp__next_state___0 <= 8576) && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && blastFlag == 3)) || ((2 == blastFlag && s__state == 8560) && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656))) || (0 == blastFlag && s__state == 8464)) || ((s__state == 8544 && 2 == blastFlag) && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656))) || ((((2 == blastFlag && 8466 == s__state) && s__s3__tmp__next_state___0 <= 8576) && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && 8496 < s__s3__tmp__next_state___0)) || ((2 * ((ag_X + ag_Y) % 2147483648) <= s__state && blastFlag == 1) && s__state == 8656)) || ((2 == blastFlag && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && s__state == 8512)) || (blastFlag == 1 && (2 * ((ag_X + ag_Y) % 2147483648) <= 8496 || !(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647)))) || ((2 == blastFlag && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && s__state == 8528)) || (((!(8656 <= s__state) && blastFlag == 1) && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && !(s__state <= 8496))) || (((!(s__hit == 0) && blastFlag == 3) && 8640 <= s__state) && 8640 <= s__s3__tmp__next_state___0)) || ((((2 == blastFlag && s__s3__tmp__next_state___0 <= 8576) && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && ((4294967296 * ((ag_X + ag_Y) / 2147483648) + s__state + 4294967296 == 2 * ag_X + 2 * ag_Y && !(2 * ag_X + 2 * ag_Y <= 4294967296 * ((ag_X + ag_Y) / 2147483648) + 2147483647)) || (4294967296 * ((ag_X + ag_Y) / 2147483648) + s__state == 2 * ag_X + 2 * ag_Y && 2 * ag_X + 2 * ag_Y <= 4294967296 * ((ag_X + ag_Y) / 2147483648) + 2147483647))) && 8496 < s__s3__tmp__next_state___0) - InvariantResult [Line: 415]: Loop Invariant Derived loop invariant: (((((2 == blastFlag && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && !(s__state <= 8496)) && s__state <= 8576) || ((2 == blastFlag && !(s__hit == 0)) && !(s__state <= 8496))) || (((blastFlag == 1 && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && !(s__state <= 8496)) && s__state <= 8576)) || ((blastFlag == 1 && !(s__hit == 0)) && !(s__state <= 8496)) - InvariantResult [Line: 76]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 404]: Loop Invariant Derived loop invariant: (((((2 == blastFlag && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && !(s__state <= 8496)) && s__state <= 8576) || ((2 == blastFlag && !(s__hit == 0)) && !(s__state <= 8496))) || (((blastFlag == 1 && (!(2 * ((ag_X + ag_Y) % 2147483648) <= 2147483647) || 2 * ((ag_X + ag_Y) % 2147483648) < 8656)) && !(s__state <= 8496)) && s__state <= 8576)) || ((blastFlag == 1 && !(s__hit == 0)) && !(s__state <= 8496)) RESULT: Ultimate proved your program to be correct! [2023-02-16 00:43:16,676 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