./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/openssl-simplified/s3_clnt_4.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/openssl-simplified/s3_clnt_4.cil-1.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 ef0a7247f371c06426a6fd229da0de853cef924cb960a979813f84bccc63d5fc --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-11 23:45:52,107 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-11 23:45:52,109 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-11 23:45:52,147 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-11 23:45:52,149 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-11 23:45:52,150 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-11 23:45:52,151 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-11 23:45:52,154 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-11 23:45:52,156 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-11 23:45:52,157 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-11 23:45:52,158 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-11 23:45:52,158 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-11 23:45:52,160 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-11 23:45:52,161 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-11 23:45:52,162 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-11 23:45:52,164 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-11 23:45:52,165 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-11 23:45:52,167 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-11 23:45:52,168 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-11 23:45:52,169 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-11 23:45:52,170 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-11 23:45:52,171 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-11 23:45:52,172 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-11 23:45:52,173 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-11 23:45:52,174 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-11 23:45:52,177 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-11 23:45:52,179 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-11 23:45:52,180 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-11 23:45:52,180 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-11 23:45:52,181 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-11 23:45:52,181 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-11 23:45:52,182 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-11 23:45:52,183 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-11 23:45:52,184 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-11 23:45:52,184 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-11 23:45:52,185 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-11 23:45:52,185 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-11 23:45:52,185 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-11 23:45:52,186 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-11 23:45:52,186 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-11 23:45:52,186 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-11 23:45:52,188 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-11 23:45:52,189 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-11 23:45:52,208 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-11 23:45:52,208 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-11 23:45:52,209 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-11 23:45:52,209 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-11 23:45:52,209 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-11 23:45:52,209 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-11 23:45:52,210 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-11 23:45:52,210 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-11 23:45:52,210 INFO L138 SettingsManager]: * Use SBE=true [2022-07-11 23:45:52,210 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-11 23:45:52,210 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-11 23:45:52,211 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-11 23:45:52,211 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-11 23:45:52,211 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-11 23:45:52,213 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-11 23:45:52,213 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-11 23:45:52,213 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-11 23:45:52,213 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-11 23:45:52,214 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-11 23:45:52,214 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-11 23:45:52,215 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-11 23:45:52,215 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-11 23:45:52,215 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-11 23:45:52,215 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-11 23:45:52,215 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-11 23:45:52,216 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-11 23:45:52,216 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-11 23:45:52,216 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-11 23:45:52,216 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-11 23:45:52,217 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-11 23:45:52,217 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-11 23:45:52,217 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-11 23:45:52,217 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-11 23:45:52,217 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ef0a7247f371c06426a6fd229da0de853cef924cb960a979813f84bccc63d5fc [2022-07-11 23:45:52,423 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-11 23:45:52,437 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-11 23:45:52,439 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-11 23:45:52,440 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-11 23:45:52,440 INFO L275 PluginConnector]: CDTParser initialized [2022-07-11 23:45:52,441 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/openssl-simplified/s3_clnt_4.cil-1.c [2022-07-11 23:45:52,512 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40c9ca3f2/cf3ae839d6654eaf98fec51b495bc7b4/FLAGe72ad7f51 [2022-07-11 23:45:52,916 INFO L306 CDTParser]: Found 1 translation units. [2022-07-11 23:45:52,916 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl-simplified/s3_clnt_4.cil-1.c [2022-07-11 23:45:52,923 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40c9ca3f2/cf3ae839d6654eaf98fec51b495bc7b4/FLAGe72ad7f51 [2022-07-11 23:45:52,932 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40c9ca3f2/cf3ae839d6654eaf98fec51b495bc7b4 [2022-07-11 23:45:52,934 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-11 23:45:52,935 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-11 23:45:52,936 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-11 23:45:52,936 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-11 23:45:52,938 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-11 23:45:52,939 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 11:45:52" (1/1) ... [2022-07-11 23:45:52,939 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e84cb8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:45:52, skipping insertion in model container [2022-07-11 23:45:52,940 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 11:45:52" (1/1) ... [2022-07-11 23:45:52,944 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-11 23:45:52,980 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-11 23:45:53,142 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl-simplified/s3_clnt_4.cil-1.c[35886,35899] [2022-07-11 23:45:53,149 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-11 23:45:53,160 INFO L203 MainTranslator]: Completed pre-run [2022-07-11 23:45:53,199 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl-simplified/s3_clnt_4.cil-1.c[35886,35899] [2022-07-11 23:45:53,201 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-11 23:45:53,209 INFO L208 MainTranslator]: Completed translation [2022-07-11 23:45:53,210 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:45:53 WrapperNode [2022-07-11 23:45:53,210 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-11 23:45:53,211 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-11 23:45:53,211 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-11 23:45:53,211 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-11 23:45:53,220 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:45:53" (1/1) ... [2022-07-11 23:45:53,227 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:45:53" (1/1) ... [2022-07-11 23:45:53,249 INFO L137 Inliner]: procedures = 15, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 508 [2022-07-11 23:45:53,250 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-11 23:45:53,250 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-11 23:45:53,250 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-11 23:45:53,255 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-11 23:45:53,261 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:45:53" (1/1) ... [2022-07-11 23:45:53,261 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:45:53" (1/1) ... [2022-07-11 23:45:53,264 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:45:53" (1/1) ... [2022-07-11 23:45:53,264 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:45:53" (1/1) ... [2022-07-11 23:45:53,269 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:45:53" (1/1) ... [2022-07-11 23:45:53,274 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:45:53" (1/1) ... [2022-07-11 23:45:53,285 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:45:53" (1/1) ... [2022-07-11 23:45:53,287 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-11 23:45:53,290 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-11 23:45:53,290 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-11 23:45:53,290 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-11 23:45:53,291 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:45:53" (1/1) ... [2022-07-11 23:45:53,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-11 23:45:53,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:45:53,329 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-11 23:45:53,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-11 23:45:53,374 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-11 23:45:53,374 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-11 23:45:53,374 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-11 23:45:53,374 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-11 23:45:53,447 INFO L234 CfgBuilder]: Building ICFG [2022-07-11 23:45:53,448 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-11 23:45:53,472 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-11 23:45:53,864 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2022-07-11 23:45:53,868 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2022-07-11 23:45:53,869 INFO L275 CfgBuilder]: Performing block encoding [2022-07-11 23:45:53,874 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-11 23:45:53,876 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-11 23:45:53,878 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 11:45:53 BoogieIcfgContainer [2022-07-11 23:45:53,878 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-11 23:45:53,880 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-11 23:45:53,881 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-11 23:45:53,886 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-11 23:45:53,886 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.07 11:45:52" (1/3) ... [2022-07-11 23:45:53,887 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ea6ba8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 11:45:53, skipping insertion in model container [2022-07-11 23:45:53,887 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:45:53" (2/3) ... [2022-07-11 23:45:53,887 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ea6ba8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 11:45:53, skipping insertion in model container [2022-07-11 23:45:53,888 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 11:45:53" (3/3) ... [2022-07-11 23:45:53,890 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_clnt_4.cil-1.c [2022-07-11 23:45:53,902 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-11 23:45:53,902 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-11 23:45:53,965 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-11 23:45:53,972 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2e818cb9, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1d8a8d5e [2022-07-11 23:45:53,973 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-11 23:45:53,981 INFO L276 IsEmpty]: Start isEmpty. Operand has 128 states, 126 states have (on average 1.7142857142857142) internal successors, (216), 127 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:45:53,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-11 23:45:53,987 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:45:53,987 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] [2022-07-11 23:45:53,988 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:45:53,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:45:53,992 INFO L85 PathProgramCache]: Analyzing trace with hash -1457695038, now seen corresponding path program 1 times [2022-07-11 23:45:53,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:45:53,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465993029] [2022-07-11 23:45:53,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:45:53,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:45:54,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:45:54,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:45:54,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:45:54,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465993029] [2022-07-11 23:45:54,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465993029] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:45:54,209 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:45:54,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:45:54,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644534211] [2022-07-11 23:45:54,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:45:54,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:45:54,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:45:54,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:45:54,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:45:54,242 INFO L87 Difference]: Start difference. First operand has 128 states, 126 states have (on average 1.7142857142857142) internal successors, (216), 127 states have internal predecessors, (216), 0 states have call successors, (0), 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 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:45:54,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:45:54,387 INFO L93 Difference]: Finished difference Result 252 states and 427 transitions. [2022-07-11 23:45:54,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:45:54,390 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2022-07-11 23:45:54,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:45:54,398 INFO L225 Difference]: With dead ends: 252 [2022-07-11 23:45:54,399 INFO L226 Difference]: Without dead ends: 115 [2022-07-11 23:45:54,402 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:45:54,405 INFO L413 NwaCegarLoop]: 211 mSDtfsCounter, 7 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:45:54,406 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 325 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:45:54,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-07-11 23:45:54,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2022-07-11 23:45:54,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 114 states have (on average 1.5087719298245614) internal successors, (172), 114 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:45:54,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 172 transitions. [2022-07-11 23:45:54,449 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 172 transitions. Word has length 24 [2022-07-11 23:45:54,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:45:54,450 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 172 transitions. [2022-07-11 23:45:54,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:45:54,450 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 172 transitions. [2022-07-11 23:45:54,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-11 23:45:54,453 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:45:54,453 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-11 23:45:54,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-11 23:45:54,454 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:45:54,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:45:54,454 INFO L85 PathProgramCache]: Analyzing trace with hash 561717339, now seen corresponding path program 1 times [2022-07-11 23:45:54,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:45:54,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030391435] [2022-07-11 23:45:54,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:45:54,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:45:54,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:45:54,553 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:45:54,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:45:54,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030391435] [2022-07-11 23:45:54,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030391435] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:45:54,554 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:45:54,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:45:54,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019071151] [2022-07-11 23:45:54,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:45:54,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:45:54,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:45:54,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:45:54,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:45:54,557 INFO L87 Difference]: Start difference. First operand 115 states and 172 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:45:54,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:45:54,652 INFO L93 Difference]: Finished difference Result 238 states and 360 transitions. [2022-07-11 23:45:54,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:45:54,653 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2022-07-11 23:45:54,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:45:54,656 INFO L225 Difference]: With dead ends: 238 [2022-07-11 23:45:54,656 INFO L226 Difference]: Without dead ends: 133 [2022-07-11 23:45:54,660 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:45:54,661 INFO L413 NwaCegarLoop]: 162 mSDtfsCounter, 13 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:45:54,661 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 244 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:45:54,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-07-11 23:45:54,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 130. [2022-07-11 23:45:54,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 129 states have (on average 1.4883720930232558) internal successors, (192), 129 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:45:54,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 192 transitions. [2022-07-11 23:45:54,674 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 192 transitions. Word has length 37 [2022-07-11 23:45:54,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:45:54,675 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 192 transitions. [2022-07-11 23:45:54,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:45:54,677 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 192 transitions. [2022-07-11 23:45:54,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-11 23:45:54,679 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:45:54,679 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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] [2022-07-11 23:45:54,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-11 23:45:54,681 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:45:54,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:45:54,682 INFO L85 PathProgramCache]: Analyzing trace with hash 356453796, now seen corresponding path program 1 times [2022-07-11 23:45:54,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:45:54,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143732790] [2022-07-11 23:45:54,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:45:54,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:45:54,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:45:54,740 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-11 23:45:54,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:45:54,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143732790] [2022-07-11 23:45:54,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143732790] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:45:54,741 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:45:54,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:45:54,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355210996] [2022-07-11 23:45:54,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:45:54,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:45:54,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:45:54,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:45:54,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:45:54,743 INFO L87 Difference]: Start difference. First operand 130 states and 192 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:45:54,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:45:54,840 INFO L93 Difference]: Finished difference Result 271 states and 406 transitions. [2022-07-11 23:45:54,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:45:54,840 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 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 51 [2022-07-11 23:45:54,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:45:54,841 INFO L225 Difference]: With dead ends: 271 [2022-07-11 23:45:54,841 INFO L226 Difference]: Without dead ends: 151 [2022-07-11 23:45:54,845 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:45:54,848 INFO L413 NwaCegarLoop]: 177 mSDtfsCounter, 15 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:45:54,849 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 257 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:45:54,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-07-11 23:45:54,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 147. [2022-07-11 23:45:54,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 146 states have (on average 1.4657534246575343) internal successors, (214), 146 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:45:54,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 214 transitions. [2022-07-11 23:45:54,862 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 214 transitions. Word has length 51 [2022-07-11 23:45:54,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:45:54,862 INFO L495 AbstractCegarLoop]: Abstraction has 147 states and 214 transitions. [2022-07-11 23:45:54,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:45:54,863 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 214 transitions. [2022-07-11 23:45:54,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-07-11 23:45:54,868 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:45:54,868 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:45:54,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-11 23:45:54,868 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:45:54,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:45:54,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1231505257, now seen corresponding path program 1 times [2022-07-11 23:45:54,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:45:54,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077905353] [2022-07-11 23:45:54,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:45:54,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:45:54,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:45:54,953 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-11 23:45:54,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:45:54,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077905353] [2022-07-11 23:45:54,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077905353] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:45:54,955 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:45:54,955 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:45:54,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624914228] [2022-07-11 23:45:54,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:45:54,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:45:54,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:45:54,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:45:54,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:45:54,958 INFO L87 Difference]: Start difference. First operand 147 states and 214 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:45:55,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:45:55,074 INFO L93 Difference]: Finished difference Result 335 states and 503 transitions. [2022-07-11 23:45:55,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:45:55,075 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 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 68 [2022-07-11 23:45:55,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:45:55,076 INFO L225 Difference]: With dead ends: 335 [2022-07-11 23:45:55,076 INFO L226 Difference]: Without dead ends: 197 [2022-07-11 23:45:55,076 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:45:55,077 INFO L413 NwaCegarLoop]: 160 mSDtfsCounter, 53 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:45:55,077 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 231 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:45:55,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2022-07-11 23:45:55,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 188. [2022-07-11 23:45:55,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 187 states have (on average 1.411764705882353) internal successors, (264), 187 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:45:55,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 264 transitions. [2022-07-11 23:45:55,082 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 264 transitions. Word has length 68 [2022-07-11 23:45:55,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:45:55,082 INFO L495 AbstractCegarLoop]: Abstraction has 188 states and 264 transitions. [2022-07-11 23:45:55,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:45:55,082 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 264 transitions. [2022-07-11 23:45:55,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-07-11 23:45:55,083 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:45:55,083 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:45:55,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-11 23:45:55,083 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:45:55,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:45:55,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1258023705, now seen corresponding path program 1 times [2022-07-11 23:45:55,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:45:55,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964925664] [2022-07-11 23:45:55,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:45:55,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:45:55,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:45:55,120 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-11 23:45:55,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:45:55,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964925664] [2022-07-11 23:45:55,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964925664] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:45:55,120 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:45:55,120 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:45:55,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726082178] [2022-07-11 23:45:55,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:45:55,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:45:55,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:45:55,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:45:55,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:45:55,122 INFO L87 Difference]: Start difference. First operand 188 states and 264 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:45:55,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:45:55,197 INFO L93 Difference]: Finished difference Result 391 states and 557 transitions. [2022-07-11 23:45:55,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:45:55,197 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 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 68 [2022-07-11 23:45:55,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:45:55,198 INFO L225 Difference]: With dead ends: 391 [2022-07-11 23:45:55,198 INFO L226 Difference]: Without dead ends: 213 [2022-07-11 23:45:55,199 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:45:55,199 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 18 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:45:55,200 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 262 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:45:55,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2022-07-11 23:45:55,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 207. [2022-07-11 23:45:55,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 206 states have (on average 1.3980582524271845) internal successors, (288), 206 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:45:55,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 288 transitions. [2022-07-11 23:45:55,204 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 288 transitions. Word has length 68 [2022-07-11 23:45:55,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:45:55,205 INFO L495 AbstractCegarLoop]: Abstraction has 207 states and 288 transitions. [2022-07-11 23:45:55,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:45:55,207 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 288 transitions. [2022-07-11 23:45:55,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-07-11 23:45:55,209 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:45:55,210 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:45:55,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-11 23:45:55,210 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:45:55,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:45:55,212 INFO L85 PathProgramCache]: Analyzing trace with hash -1378844437, now seen corresponding path program 1 times [2022-07-11 23:45:55,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:45:55,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748668211] [2022-07-11 23:45:55,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:45:55,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:45:55,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:45:55,263 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-07-11 23:45:55,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:45:55,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748668211] [2022-07-11 23:45:55,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748668211] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:45:55,264 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:45:55,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:45:55,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106961037] [2022-07-11 23:45:55,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:45:55,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:45:55,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:45:55,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:45:55,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:45:55,266 INFO L87 Difference]: Start difference. First operand 207 states and 288 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:45:55,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:45:55,353 INFO L93 Difference]: Finished difference Result 428 states and 604 transitions. [2022-07-11 23:45:55,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:45:55,353 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2022-07-11 23:45:55,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:45:55,354 INFO L225 Difference]: With dead ends: 428 [2022-07-11 23:45:55,354 INFO L226 Difference]: Without dead ends: 231 [2022-07-11 23:45:55,355 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:45:55,355 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 13 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:45:55,356 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 261 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:45:55,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2022-07-11 23:45:55,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 228. [2022-07-11 23:45:55,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 227 states have (on average 1.3832599118942732) internal successors, (314), 227 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:45:55,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 314 transitions. [2022-07-11 23:45:55,360 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 314 transitions. Word has length 85 [2022-07-11 23:45:55,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:45:55,360 INFO L495 AbstractCegarLoop]: Abstraction has 228 states and 314 transitions. [2022-07-11 23:45:55,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:45:55,361 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 314 transitions. [2022-07-11 23:45:55,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-07-11 23:45:55,361 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:45:55,361 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:45:55,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-11 23:45:55,362 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:45:55,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:45:55,362 INFO L85 PathProgramCache]: Analyzing trace with hash 311084899, now seen corresponding path program 1 times [2022-07-11 23:45:55,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:45:55,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122730413] [2022-07-11 23:45:55,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:45:55,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:45:55,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:45:55,393 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-07-11 23:45:55,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:45:55,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122730413] [2022-07-11 23:45:55,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122730413] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:45:55,394 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:45:55,394 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:45:55,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395574396] [2022-07-11 23:45:55,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:45:55,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:45:55,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:45:55,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:45:55,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:45:55,395 INFO L87 Difference]: Start difference. First operand 228 states and 314 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:45:55,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:45:55,414 INFO L93 Difference]: Finished difference Result 660 states and 910 transitions. [2022-07-11 23:45:55,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:45:55,414 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-07-11 23:45:55,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:45:55,418 INFO L225 Difference]: With dead ends: 660 [2022-07-11 23:45:55,418 INFO L226 Difference]: Without dead ends: 442 [2022-07-11 23:45:55,418 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:45:55,419 INFO L413 NwaCegarLoop]: 207 mSDtfsCounter, 124 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:45:55,419 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 363 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:45:55,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2022-07-11 23:45:55,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 442. [2022-07-11 23:45:55,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 442 states, 441 states have (on average 1.3718820861678005) internal successors, (605), 441 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:45:55,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 605 transitions. [2022-07-11 23:45:55,427 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 605 transitions. Word has length 105 [2022-07-11 23:45:55,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:45:55,428 INFO L495 AbstractCegarLoop]: Abstraction has 442 states and 605 transitions. [2022-07-11 23:45:55,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:45:55,428 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 605 transitions. [2022-07-11 23:45:55,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-07-11 23:45:55,432 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:45:55,432 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:45:55,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-11 23:45:55,432 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:45:55,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:45:55,432 INFO L85 PathProgramCache]: Analyzing trace with hash 990357153, now seen corresponding path program 1 times [2022-07-11 23:45:55,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:45:55,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186137142] [2022-07-11 23:45:55,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:45:55,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:45:55,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:45:55,483 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-07-11 23:45:55,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:45:55,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186137142] [2022-07-11 23:45:55,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186137142] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:45:55,484 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:45:55,484 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:45:55,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201281236] [2022-07-11 23:45:55,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:45:55,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:45:55,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:45:55,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:45:55,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:45:55,486 INFO L87 Difference]: Start difference. First operand 442 states and 605 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:45:55,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:45:55,500 INFO L93 Difference]: Finished difference Result 895 states and 1224 transitions. [2022-07-11 23:45:55,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:45:55,501 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-07-11 23:45:55,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:45:55,502 INFO L225 Difference]: With dead ends: 895 [2022-07-11 23:45:55,502 INFO L226 Difference]: Without dead ends: 463 [2022-07-11 23:45:55,503 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:45:55,503 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 11 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:45:55,504 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 343 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:45:55,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2022-07-11 23:45:55,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 463. [2022-07-11 23:45:55,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 463 states, 462 states have (on average 1.367965367965368) internal successors, (632), 462 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:45:55,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 632 transitions. [2022-07-11 23:45:55,515 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 632 transitions. Word has length 105 [2022-07-11 23:45:55,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:45:55,516 INFO L495 AbstractCegarLoop]: Abstraction has 463 states and 632 transitions. [2022-07-11 23:45:55,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:45:55,516 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 632 transitions. [2022-07-11 23:45:55,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-07-11 23:45:55,518 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:45:55,518 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:45:55,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-11 23:45:55,518 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:45:55,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:45:55,518 INFO L85 PathProgramCache]: Analyzing trace with hash 1829390815, now seen corresponding path program 1 times [2022-07-11 23:45:55,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:45:55,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971606975] [2022-07-11 23:45:55,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:45:55,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:45:55,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:45:55,546 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2022-07-11 23:45:55,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:45:55,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971606975] [2022-07-11 23:45:55,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971606975] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:45:55,547 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:45:55,547 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:45:55,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003907957] [2022-07-11 23:45:55,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:45:55,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:45:55,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:45:55,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:45:55,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:45:55,548 INFO L87 Difference]: Start difference. First operand 463 states and 632 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:45:55,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:45:55,561 INFO L93 Difference]: Finished difference Result 943 states and 1285 transitions. [2022-07-11 23:45:55,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:45:55,562 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-07-11 23:45:55,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:45:55,563 INFO L225 Difference]: With dead ends: 943 [2022-07-11 23:45:55,563 INFO L226 Difference]: Without dead ends: 490 [2022-07-11 23:45:55,564 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:45:55,565 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 20 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:45:55,565 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 315 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:45:55,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2022-07-11 23:45:55,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 490. [2022-07-11 23:45:55,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 490 states, 489 states have (on average 1.361963190184049) internal successors, (666), 489 states have internal predecessors, (666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:45:55,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 666 transitions. [2022-07-11 23:45:55,576 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 666 transitions. Word has length 105 [2022-07-11 23:45:55,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:45:55,576 INFO L495 AbstractCegarLoop]: Abstraction has 490 states and 666 transitions. [2022-07-11 23:45:55,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:45:55,576 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 666 transitions. [2022-07-11 23:45:55,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-07-11 23:45:55,577 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:45:55,577 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:45:55,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-11 23:45:55,577 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:45:55,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:45:55,578 INFO L85 PathProgramCache]: Analyzing trace with hash -915547054, now seen corresponding path program 1 times [2022-07-11 23:45:55,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:45:55,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737208028] [2022-07-11 23:45:55,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:45:55,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:45:55,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:45:55,599 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2022-07-11 23:45:55,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:45:55,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737208028] [2022-07-11 23:45:55,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737208028] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:45:55,600 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:45:55,600 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:45:55,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950523324] [2022-07-11 23:45:55,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:45:55,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:45:55,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:45:55,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:45:55,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:45:55,601 INFO L87 Difference]: Start difference. First operand 490 states and 666 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:45:55,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:45:55,622 INFO L93 Difference]: Finished difference Result 708 states and 966 transitions. [2022-07-11 23:45:55,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:45:55,622 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107 [2022-07-11 23:45:55,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:45:55,624 INFO L225 Difference]: With dead ends: 708 [2022-07-11 23:45:55,624 INFO L226 Difference]: Without dead ends: 706 [2022-07-11 23:45:55,625 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:45:55,625 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 139 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:45:55,625 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 305 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:45:55,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 706 states. [2022-07-11 23:45:55,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 706 to 706. [2022-07-11 23:45:55,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 706 states, 705 states have (on average 1.3673758865248227) internal successors, (964), 705 states have internal predecessors, (964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:45:55,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 964 transitions. [2022-07-11 23:45:55,635 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 964 transitions. Word has length 107 [2022-07-11 23:45:55,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:45:55,636 INFO L495 AbstractCegarLoop]: Abstraction has 706 states and 964 transitions. [2022-07-11 23:45:55,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:45:55,636 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 964 transitions. [2022-07-11 23:45:55,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-07-11 23:45:55,637 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:45:55,637 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:45:55,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-11 23:45:55,640 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:45:55,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:45:55,640 INFO L85 PathProgramCache]: Analyzing trace with hash -1430305885, now seen corresponding path program 1 times [2022-07-11 23:45:55,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:45:55,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32742503] [2022-07-11 23:45:55,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:45:55,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:45:55,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:45:55,682 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 200 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2022-07-11 23:45:55,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:45:55,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32742503] [2022-07-11 23:45:55,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32742503] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:45:55,683 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:45:55,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:45:55,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407338457] [2022-07-11 23:45:55,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:45:55,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:45:55,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:45:55,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:45:55,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:45:55,684 INFO L87 Difference]: Start difference. First operand 706 states and 964 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:45:55,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:45:55,793 INFO L93 Difference]: Finished difference Result 1528 states and 2147 transitions. [2022-07-11 23:45:55,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:45:55,793 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 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 147 [2022-07-11 23:45:55,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:45:55,796 INFO L225 Difference]: With dead ends: 1528 [2022-07-11 23:45:55,797 INFO L226 Difference]: Without dead ends: 856 [2022-07-11 23:45:55,798 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:45:55,798 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 93 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:45:55,798 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 196 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:45:55,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 856 states. [2022-07-11 23:45:55,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 856 to 823. [2022-07-11 23:45:55,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 823 states, 822 states have (on average 1.4026763990267639) internal successors, (1153), 822 states have internal predecessors, (1153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:45:55,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 1153 transitions. [2022-07-11 23:45:55,813 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 1153 transitions. Word has length 147 [2022-07-11 23:45:55,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:45:55,813 INFO L495 AbstractCegarLoop]: Abstraction has 823 states and 1153 transitions. [2022-07-11 23:45:55,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:45:55,813 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1153 transitions. [2022-07-11 23:45:55,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2022-07-11 23:45:55,815 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:45:55,815 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:45:55,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-11 23:45:55,815 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:45:55,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:45:55,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1346631412, now seen corresponding path program 1 times [2022-07-11 23:45:55,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:45:55,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382536752] [2022-07-11 23:45:55,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:45:55,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:45:55,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:45:55,858 INFO L134 CoverageAnalysis]: Checked inductivity of 399 backedges. 275 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2022-07-11 23:45:55,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:45:55,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382536752] [2022-07-11 23:45:55,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382536752] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:45:55,859 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:45:55,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:45:55,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439607373] [2022-07-11 23:45:55,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:45:55,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:45:55,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:45:55,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:45:55,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:45:55,861 INFO L87 Difference]: Start difference. First operand 823 states and 1153 transitions. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:45:55,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:45:55,951 INFO L93 Difference]: Finished difference Result 1689 states and 2365 transitions. [2022-07-11 23:45:55,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:45:55,952 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 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 [2022-07-11 23:45:55,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:45:55,954 INFO L225 Difference]: With dead ends: 1689 [2022-07-11 23:45:55,954 INFO L226 Difference]: Without dead ends: 903 [2022-07-11 23:45:55,955 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:45:55,955 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 14 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:45:55,956 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 260 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:45:55,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 903 states. [2022-07-11 23:45:55,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 903 to 892. [2022-07-11 23:45:55,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 892 states, 891 states have (on average 1.388327721661055) internal successors, (1237), 891 states have internal predecessors, (1237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:45:55,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892 states to 892 states and 1237 transitions. [2022-07-11 23:45:55,970 INFO L78 Accepts]: Start accepts. Automaton has 892 states and 1237 transitions. Word has length 183 [2022-07-11 23:45:55,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:45:55,970 INFO L495 AbstractCegarLoop]: Abstraction has 892 states and 1237 transitions. [2022-07-11 23:45:55,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:45:55,970 INFO L276 IsEmpty]: Start isEmpty. Operand 892 states and 1237 transitions. [2022-07-11 23:45:55,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2022-07-11 23:45:55,972 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:45:55,972 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:45:55,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-11 23:45:55,972 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:45:55,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:45:55,973 INFO L85 PathProgramCache]: Analyzing trace with hash 880338370, now seen corresponding path program 1 times [2022-07-11 23:45:55,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:45:55,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145721287] [2022-07-11 23:45:55,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:45:55,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:45:55,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:45:56,009 INFO L134 CoverageAnalysis]: Checked inductivity of 522 backedges. 343 proven. 0 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2022-07-11 23:45:56,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:45:56,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145721287] [2022-07-11 23:45:56,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145721287] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:45:56,009 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:45:56,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:45:56,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985129419] [2022-07-11 23:45:56,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:45:56,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:45:56,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:45:56,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:45:56,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:45:56,018 INFO L87 Difference]: Start difference. First operand 892 states and 1237 transitions. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:45:56,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:45:56,093 INFO L93 Difference]: Finished difference Result 1831 states and 2546 transitions. [2022-07-11 23:45:56,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:45:56,094 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 204 [2022-07-11 23:45:56,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:45:56,097 INFO L225 Difference]: With dead ends: 1831 [2022-07-11 23:45:56,097 INFO L226 Difference]: Without dead ends: 976 [2022-07-11 23:45:56,098 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:45:56,098 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 11 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:45:56,099 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 262 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:45:56,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2022-07-11 23:45:56,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 967. [2022-07-11 23:45:56,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 967 states, 966 states have (on average 1.3737060041407867) internal successors, (1327), 966 states have internal predecessors, (1327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:45:56,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 967 states to 967 states and 1327 transitions. [2022-07-11 23:45:56,115 INFO L78 Accepts]: Start accepts. Automaton has 967 states and 1327 transitions. Word has length 204 [2022-07-11 23:45:56,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:45:56,115 INFO L495 AbstractCegarLoop]: Abstraction has 967 states and 1327 transitions. [2022-07-11 23:45:56,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:45:56,116 INFO L276 IsEmpty]: Start isEmpty. Operand 967 states and 1327 transitions. [2022-07-11 23:45:56,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2022-07-11 23:45:56,117 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:45:56,118 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:45:56,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-11 23:45:56,118 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:45:56,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:45:56,118 INFO L85 PathProgramCache]: Analyzing trace with hash -1998340689, now seen corresponding path program 1 times [2022-07-11 23:45:56,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:45:56,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789520338] [2022-07-11 23:45:56,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:45:56,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:45:56,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:45:56,157 INFO L134 CoverageAnalysis]: Checked inductivity of 663 backedges. 411 proven. 0 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2022-07-11 23:45:56,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:45:56,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789520338] [2022-07-11 23:45:56,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789520338] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:45:56,158 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:45:56,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:45:56,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593343290] [2022-07-11 23:45:56,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:45:56,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:45:56,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:45:56,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:45:56,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:45:56,160 INFO L87 Difference]: Start difference. First operand 967 states and 1327 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:45:56,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:45:56,232 INFO L93 Difference]: Finished difference Result 1987 states and 2735 transitions. [2022-07-11 23:45:56,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:45:56,233 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 228 [2022-07-11 23:45:56,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:45:56,235 INFO L225 Difference]: With dead ends: 1987 [2022-07-11 23:45:56,235 INFO L226 Difference]: Without dead ends: 1057 [2022-07-11 23:45:56,238 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:45:56,238 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 10 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:45:56,238 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 262 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:45:56,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1057 states. [2022-07-11 23:45:56,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1057 to 1051. [2022-07-11 23:45:56,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1051 states, 1050 states have (on average 1.358095238095238) internal successors, (1426), 1050 states have internal predecessors, (1426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:45:56,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1051 states to 1051 states and 1426 transitions. [2022-07-11 23:45:56,253 INFO L78 Accepts]: Start accepts. Automaton has 1051 states and 1426 transitions. Word has length 228 [2022-07-11 23:45:56,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:45:56,254 INFO L495 AbstractCegarLoop]: Abstraction has 1051 states and 1426 transitions. [2022-07-11 23:45:56,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:45:56,254 INFO L276 IsEmpty]: Start isEmpty. Operand 1051 states and 1426 transitions. [2022-07-11 23:45:56,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2022-07-11 23:45:56,256 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:45:56,256 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:45:56,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-11 23:45:56,257 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:45:56,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:45:56,257 INFO L85 PathProgramCache]: Analyzing trace with hash -967299791, now seen corresponding path program 1 times [2022-07-11 23:45:56,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:45:56,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134363444] [2022-07-11 23:45:56,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:45:56,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:45:56,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:45:56,320 INFO L134 CoverageAnalysis]: Checked inductivity of 663 backedges. 411 proven. 0 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2022-07-11 23:45:56,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:45:56,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134363444] [2022-07-11 23:45:56,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134363444] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:45:56,320 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:45:56,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:45:56,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707708984] [2022-07-11 23:45:56,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:45:56,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:45:56,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:45:56,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:45:56,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:45:56,322 INFO L87 Difference]: Start difference. First operand 1051 states and 1426 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:45:56,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:45:56,400 INFO L93 Difference]: Finished difference Result 2167 states and 2960 transitions. [2022-07-11 23:45:56,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:45:56,401 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 228 [2022-07-11 23:45:56,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:45:56,404 INFO L225 Difference]: With dead ends: 2167 [2022-07-11 23:45:56,404 INFO L226 Difference]: Without dead ends: 1153 [2022-07-11 23:45:56,406 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:45:56,407 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 11 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:45:56,407 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 263 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:45:56,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1153 states. [2022-07-11 23:45:56,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1153 to 1144. [2022-07-11 23:45:56,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1144 states, 1143 states have (on average 1.342082239720035) internal successors, (1534), 1143 states have internal predecessors, (1534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:45:56,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1144 states to 1144 states and 1534 transitions. [2022-07-11 23:45:56,429 INFO L78 Accepts]: Start accepts. Automaton has 1144 states and 1534 transitions. Word has length 228 [2022-07-11 23:45:56,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:45:56,430 INFO L495 AbstractCegarLoop]: Abstraction has 1144 states and 1534 transitions. [2022-07-11 23:45:56,430 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:45:56,430 INFO L276 IsEmpty]: Start isEmpty. Operand 1144 states and 1534 transitions. [2022-07-11 23:45:56,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2022-07-11 23:45:56,432 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:45:56,432 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 10, 10, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:45:56,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-11 23:45:56,433 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:45:56,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:45:56,433 INFO L85 PathProgramCache]: Analyzing trace with hash -1465419185, now seen corresponding path program 1 times [2022-07-11 23:45:56,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:45:56,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7480179] [2022-07-11 23:45:56,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:45:56,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:45:56,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:45:56,477 INFO L134 CoverageAnalysis]: Checked inductivity of 830 backedges. 530 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2022-07-11 23:45:56,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:45:56,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7480179] [2022-07-11 23:45:56,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7480179] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:45:56,478 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:45:56,479 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:45:56,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216614255] [2022-07-11 23:45:56,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:45:56,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:45:56,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:45:56,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:45:56,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:45:56,480 INFO L87 Difference]: Start difference. First operand 1144 states and 1534 transitions. Second operand has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:45:56,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:45:56,506 INFO L93 Difference]: Finished difference Result 3355 states and 4503 transitions. [2022-07-11 23:45:56,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:45:56,507 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 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 258 [2022-07-11 23:45:56,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:45:56,512 INFO L225 Difference]: With dead ends: 3355 [2022-07-11 23:45:56,512 INFO L226 Difference]: Without dead ends: 2248 [2022-07-11 23:45:56,514 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:45:56,514 INFO L413 NwaCegarLoop]: 318 mSDtfsCounter, 127 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:45:56,514 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 482 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:45:56,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2248 states. [2022-07-11 23:45:56,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2248 to 2246. [2022-07-11 23:45:56,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2246 states, 2245 states have (on average 1.3420935412026727) internal successors, (3013), 2245 states have internal predecessors, (3013), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:45:56,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2246 states to 2246 states and 3013 transitions. [2022-07-11 23:45:56,569 INFO L78 Accepts]: Start accepts. Automaton has 2246 states and 3013 transitions. Word has length 258 [2022-07-11 23:45:56,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:45:56,570 INFO L495 AbstractCegarLoop]: Abstraction has 2246 states and 3013 transitions. [2022-07-11 23:45:56,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:45:56,570 INFO L276 IsEmpty]: Start isEmpty. Operand 2246 states and 3013 transitions. [2022-07-11 23:45:56,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2022-07-11 23:45:56,573 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:45:56,573 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 10, 10, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:45:56,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-11 23:45:56,574 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:45:56,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:45:56,574 INFO L85 PathProgramCache]: Analyzing trace with hash -434378287, now seen corresponding path program 1 times [2022-07-11 23:45:56,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:45:56,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165277267] [2022-07-11 23:45:56,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:45:56,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:45:56,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:45:56,627 INFO L134 CoverageAnalysis]: Checked inductivity of 830 backedges. 485 proven. 0 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2022-07-11 23:45:56,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:45:56,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165277267] [2022-07-11 23:45:56,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165277267] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:45:56,628 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:45:56,628 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:45:56,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331899511] [2022-07-11 23:45:56,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:45:56,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:45:56,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:45:56,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:45:56,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:45:56,629 INFO L87 Difference]: Start difference. First operand 2246 states and 3013 transitions. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:45:56,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:45:56,726 INFO L93 Difference]: Finished difference Result 4680 states and 6329 transitions. [2022-07-11 23:45:56,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:45:56,727 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 258 [2022-07-11 23:45:56,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:45:56,733 INFO L225 Difference]: With dead ends: 4680 [2022-07-11 23:45:56,733 INFO L226 Difference]: Without dead ends: 2471 [2022-07-11 23:45:56,735 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:45:56,736 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 12 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:45:56,736 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 262 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:45:56,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2471 states. [2022-07-11 23:45:56,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2471 to 2459. [2022-07-11 23:45:56,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2459 states, 2458 states have (on average 1.3246541903986981) internal successors, (3256), 2458 states have internal predecessors, (3256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:45:56,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2459 states to 2459 states and 3256 transitions. [2022-07-11 23:45:56,777 INFO L78 Accepts]: Start accepts. Automaton has 2459 states and 3256 transitions. Word has length 258 [2022-07-11 23:45:56,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:45:56,777 INFO L495 AbstractCegarLoop]: Abstraction has 2459 states and 3256 transitions. [2022-07-11 23:45:56,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:45:56,777 INFO L276 IsEmpty]: Start isEmpty. Operand 2459 states and 3256 transitions. [2022-07-11 23:45:56,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2022-07-11 23:45:56,781 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:45:56,781 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 12, 11, 11, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:45:56,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-11 23:45:56,781 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:45:56,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:45:56,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1948571271, now seen corresponding path program 1 times [2022-07-11 23:45:56,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:45:56,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731911398] [2022-07-11 23:45:56,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:45:56,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:45:56,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:45:56,827 INFO L134 CoverageAnalysis]: Checked inductivity of 1015 backedges. 555 proven. 0 refuted. 0 times theorem prover too weak. 460 trivial. 0 not checked. [2022-07-11 23:45:56,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:45:56,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731911398] [2022-07-11 23:45:56,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731911398] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:45:56,828 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:45:56,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:45:56,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293751222] [2022-07-11 23:45:56,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:45:56,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:45:56,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:45:56,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:45:56,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:45:56,829 INFO L87 Difference]: Start difference. First operand 2459 states and 3256 transitions. Second operand has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:45:56,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:45:56,935 INFO L93 Difference]: Finished difference Result 4992 states and 6632 transitions. [2022-07-11 23:45:56,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:45:56,935 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 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 282 [2022-07-11 23:45:56,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:45:56,941 INFO L225 Difference]: With dead ends: 4992 [2022-07-11 23:45:56,941 INFO L226 Difference]: Without dead ends: 2570 [2022-07-11 23:45:56,944 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:45:56,944 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 10 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:45:56,944 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 262 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:45:56,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2570 states. [2022-07-11 23:45:56,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2570 to 2558. [2022-07-11 23:45:56,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2558 states, 2557 states have (on average 1.3179507235041064) internal successors, (3370), 2557 states have internal predecessors, (3370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:45:56,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2558 states to 2558 states and 3370 transitions. [2022-07-11 23:45:56,991 INFO L78 Accepts]: Start accepts. Automaton has 2558 states and 3370 transitions. Word has length 282 [2022-07-11 23:45:56,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:45:56,991 INFO L495 AbstractCegarLoop]: Abstraction has 2558 states and 3370 transitions. [2022-07-11 23:45:56,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:45:56,992 INFO L276 IsEmpty]: Start isEmpty. Operand 2558 states and 3370 transitions. [2022-07-11 23:45:56,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2022-07-11 23:45:56,995 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:45:56,996 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 12, 11, 11, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:45:56,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-11 23:45:56,996 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:45:56,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:45:56,997 INFO L85 PathProgramCache]: Analyzing trace with hash -1124753462, now seen corresponding path program 1 times [2022-07-11 23:45:56,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:45:56,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880720872] [2022-07-11 23:45:56,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:45:56,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:45:57,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:45:57,036 INFO L134 CoverageAnalysis]: Checked inductivity of 1027 backedges. 442 proven. 0 refuted. 0 times theorem prover too weak. 585 trivial. 0 not checked. [2022-07-11 23:45:57,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:45:57,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880720872] [2022-07-11 23:45:57,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880720872] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:45:57,036 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:45:57,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:45:57,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657262378] [2022-07-11 23:45:57,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:45:57,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:45:57,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:45:57,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:45:57,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:45:57,039 INFO L87 Difference]: Start difference. First operand 2558 states and 3370 transitions. Second operand has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:45:57,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:45:57,161 INFO L93 Difference]: Finished difference Result 5379 states and 7220 transitions. [2022-07-11 23:45:57,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:45:57,162 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 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 293 [2022-07-11 23:45:57,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:45:57,170 INFO L225 Difference]: With dead ends: 5379 [2022-07-11 23:45:57,170 INFO L226 Difference]: Without dead ends: 2858 [2022-07-11 23:45:57,172 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:45:57,173 INFO L413 NwaCegarLoop]: 177 mSDtfsCounter, 51 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:45:57,173 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 251 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:45:57,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2858 states. [2022-07-11 23:45:57,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2858 to 2798. [2022-07-11 23:45:57,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2798 states, 2797 states have (on average 1.305684662138005) internal successors, (3652), 2797 states have internal predecessors, (3652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:45:57,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2798 states to 2798 states and 3652 transitions. [2022-07-11 23:45:57,223 INFO L78 Accepts]: Start accepts. Automaton has 2798 states and 3652 transitions. Word has length 293 [2022-07-11 23:45:57,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:45:57,223 INFO L495 AbstractCegarLoop]: Abstraction has 2798 states and 3652 transitions. [2022-07-11 23:45:57,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:45:57,224 INFO L276 IsEmpty]: Start isEmpty. Operand 2798 states and 3652 transitions. [2022-07-11 23:45:57,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2022-07-11 23:45:57,229 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:45:57,229 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 14, 14, 13, 13, 13, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:45:57,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-11 23:45:57,229 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:45:57,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:45:57,230 INFO L85 PathProgramCache]: Analyzing trace with hash 495610836, now seen corresponding path program 1 times [2022-07-11 23:45:57,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:45:57,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868528803] [2022-07-11 23:45:57,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:45:57,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:45:57,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:45:57,278 INFO L134 CoverageAnalysis]: Checked inductivity of 1171 backedges. 631 proven. 0 refuted. 0 times theorem prover too weak. 540 trivial. 0 not checked. [2022-07-11 23:45:57,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:45:57,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868528803] [2022-07-11 23:45:57,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868528803] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:45:57,278 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:45:57,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:45:57,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335362989] [2022-07-11 23:45:57,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:45:57,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:45:57,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:45:57,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:45:57,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:45:57,280 INFO L87 Difference]: Start difference. First operand 2798 states and 3652 transitions. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:45:57,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:45:57,398 INFO L93 Difference]: Finished difference Result 5643 states and 7358 transitions. [2022-07-11 23:45:57,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:45:57,399 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 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 301 [2022-07-11 23:45:57,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:45:57,406 INFO L225 Difference]: With dead ends: 5643 [2022-07-11 23:45:57,406 INFO L226 Difference]: Without dead ends: 2864 [2022-07-11 23:45:57,410 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:45:57,410 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 118 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:45:57,411 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 174 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:45:57,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2864 states. [2022-07-11 23:45:57,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2864 to 2792. [2022-07-11 23:45:57,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2792 states, 2791 states have (on average 1.2955929774274453) internal successors, (3616), 2791 states have internal predecessors, (3616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:45:57,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2792 states to 2792 states and 3616 transitions. [2022-07-11 23:45:57,476 INFO L78 Accepts]: Start accepts. Automaton has 2792 states and 3616 transitions. Word has length 301 [2022-07-11 23:45:57,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:45:57,477 INFO L495 AbstractCegarLoop]: Abstraction has 2792 states and 3616 transitions. [2022-07-11 23:45:57,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:45:57,477 INFO L276 IsEmpty]: Start isEmpty. Operand 2792 states and 3616 transitions. [2022-07-11 23:45:57,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2022-07-11 23:45:57,482 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:45:57,482 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 13, 13, 13, 12, 12, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:45:57,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-11 23:45:57,482 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:45:57,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:45:57,483 INFO L85 PathProgramCache]: Analyzing trace with hash -870156213, now seen corresponding path program 1 times [2022-07-11 23:45:57,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:45:57,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681636269] [2022-07-11 23:45:57,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:45:57,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:45:57,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:45:57,532 INFO L134 CoverageAnalysis]: Checked inductivity of 1256 backedges. 657 proven. 14 refuted. 0 times theorem prover too weak. 585 trivial. 0 not checked. [2022-07-11 23:45:57,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:45:57,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681636269] [2022-07-11 23:45:57,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681636269] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:45:57,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1529492005] [2022-07-11 23:45:57,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:45:57,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:45:57,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:45:57,535 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-11 23:45:57,566 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-11 23:45:57,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:45:57,649 INFO L263 TraceCheckSpWp]: Trace formula consists of 616 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-11 23:45:57,657 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:45:57,757 INFO L134 CoverageAnalysis]: Checked inductivity of 1256 backedges. 657 proven. 14 refuted. 0 times theorem prover too weak. 585 trivial. 0 not checked. [2022-07-11 23:45:57,757 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:45:57,868 INFO L134 CoverageAnalysis]: Checked inductivity of 1256 backedges. 657 proven. 14 refuted. 0 times theorem prover too weak. 585 trivial. 0 not checked. [2022-07-11 23:45:57,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1529492005] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:45:57,868 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:45:57,869 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-07-11 23:45:57,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561771112] [2022-07-11 23:45:57,869 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:45:57,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-11 23:45:57,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:45:57,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-11 23:45:57,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-11 23:45:57,871 INFO L87 Difference]: Start difference. First operand 2792 states and 3616 transitions. Second operand has 6 states, 6 states have (on average 38.666666666666664) internal successors, (232), 6 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:45:58,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:45:58,218 INFO L93 Difference]: Finished difference Result 8442 states and 10924 transitions. [2022-07-11 23:45:58,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-11 23:45:58,219 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 38.666666666666664) internal successors, (232), 6 states have internal predecessors, (232), 0 states have call successors, (0), 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 332 [2022-07-11 23:45:58,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:45:58,249 INFO L225 Difference]: With dead ends: 8442 [2022-07-11 23:45:58,249 INFO L226 Difference]: Without dead ends: 5681 [2022-07-11 23:45:58,254 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 670 GetRequests, 664 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-07-11 23:45:58,254 INFO L413 NwaCegarLoop]: 304 mSDtfsCounter, 244 mSDsluCounter, 564 mSDsCounter, 0 mSdLazyCounter, 524 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 868 SdHoareTripleChecker+Invalid, 589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-11 23:45:58,254 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 868 Invalid, 589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 524 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-11 23:45:58,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5681 states. [2022-07-11 23:45:58,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5681 to 3680. [2022-07-11 23:45:58,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3680 states, 3679 states have (on average 1.281870073389508) internal successors, (4716), 3679 states have internal predecessors, (4716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:45:58,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3680 states to 3680 states and 4716 transitions. [2022-07-11 23:45:58,340 INFO L78 Accepts]: Start accepts. Automaton has 3680 states and 4716 transitions. Word has length 332 [2022-07-11 23:45:58,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:45:58,340 INFO L495 AbstractCegarLoop]: Abstraction has 3680 states and 4716 transitions. [2022-07-11 23:45:58,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 38.666666666666664) internal successors, (232), 6 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:45:58,341 INFO L276 IsEmpty]: Start isEmpty. Operand 3680 states and 4716 transitions. [2022-07-11 23:45:58,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2022-07-11 23:45:58,346 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:45:58,346 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 13, 13, 13, 12, 12, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:45:58,366 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-11 23:45:58,564 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,SelfDestructingSolverStorable20 [2022-07-11 23:45:58,564 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:45:58,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:45:58,564 INFO L85 PathProgramCache]: Analyzing trace with hash -734234391, now seen corresponding path program 1 times [2022-07-11 23:45:58,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:45:58,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998472046] [2022-07-11 23:45:58,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:45:58,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:45:58,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:45:58,641 INFO L134 CoverageAnalysis]: Checked inductivity of 1256 backedges. 770 proven. 0 refuted. 0 times theorem prover too weak. 486 trivial. 0 not checked. [2022-07-11 23:45:58,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:45:58,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998472046] [2022-07-11 23:45:58,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998472046] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:45:58,642 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:45:58,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:45:58,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579560081] [2022-07-11 23:45:58,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:45:58,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:45:58,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:45:58,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:45:58,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:45:58,645 INFO L87 Difference]: Start difference. First operand 3680 states and 4716 transitions. Second operand has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:45:58,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:45:58,710 INFO L93 Difference]: Finished difference Result 9682 states and 12466 transitions. [2022-07-11 23:45:58,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:45:58,710 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 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 333 [2022-07-11 23:45:58,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:45:58,719 INFO L225 Difference]: With dead ends: 9682 [2022-07-11 23:45:58,719 INFO L226 Difference]: Without dead ends: 6039 [2022-07-11 23:45:58,724 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:45:58,725 INFO L413 NwaCegarLoop]: 276 mSDtfsCounter, 84 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:45:58,725 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 438 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:45:58,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6039 states. [2022-07-11 23:45:58,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6039 to 5695. [2022-07-11 23:45:58,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5695 states, 5694 states have (on average 1.2867931155602388) internal successors, (7327), 5694 states have internal predecessors, (7327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:45:58,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5695 states to 5695 states and 7327 transitions. [2022-07-11 23:45:58,841 INFO L78 Accepts]: Start accepts. Automaton has 5695 states and 7327 transitions. Word has length 333 [2022-07-11 23:45:58,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:45:58,866 INFO L495 AbstractCegarLoop]: Abstraction has 5695 states and 7327 transitions. [2022-07-11 23:45:58,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:45:58,867 INFO L276 IsEmpty]: Start isEmpty. Operand 5695 states and 7327 transitions. [2022-07-11 23:45:58,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2022-07-11 23:45:58,873 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:45:58,874 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 14, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:45:58,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-11 23:45:58,874 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:45:58,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:45:58,875 INFO L85 PathProgramCache]: Analyzing trace with hash -1600541490, now seen corresponding path program 1 times [2022-07-11 23:45:58,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:45:58,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458531224] [2022-07-11 23:45:58,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:45:58,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:45:58,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:45:58,919 INFO L134 CoverageAnalysis]: Checked inductivity of 1422 backedges. 733 proven. 0 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2022-07-11 23:45:58,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:45:58,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458531224] [2022-07-11 23:45:58,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458531224] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:45:58,920 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:45:58,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:45:58,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720987336] [2022-07-11 23:45:58,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:45:58,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:45:58,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:45:58,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:45:58,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:45:58,921 INFO L87 Difference]: Start difference. First operand 5695 states and 7327 transitions. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:45:59,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:45:59,081 INFO L93 Difference]: Finished difference Result 11959 states and 15320 transitions. [2022-07-11 23:45:59,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:45:59,081 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 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 338 [2022-07-11 23:45:59,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:45:59,090 INFO L225 Difference]: With dead ends: 11959 [2022-07-11 23:45:59,090 INFO L226 Difference]: Without dead ends: 6301 [2022-07-11 23:45:59,096 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:45:59,096 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 130 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:45:59,096 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 147 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:45:59,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6301 states. [2022-07-11 23:45:59,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6301 to 5869. [2022-07-11 23:45:59,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5869 states, 5868 states have (on average 1.2885139740967961) internal successors, (7561), 5868 states have internal predecessors, (7561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:45:59,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5869 states to 5869 states and 7561 transitions. [2022-07-11 23:45:59,213 INFO L78 Accepts]: Start accepts. Automaton has 5869 states and 7561 transitions. Word has length 338 [2022-07-11 23:45:59,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:45:59,213 INFO L495 AbstractCegarLoop]: Abstraction has 5869 states and 7561 transitions. [2022-07-11 23:45:59,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:45:59,214 INFO L276 IsEmpty]: Start isEmpty. Operand 5869 states and 7561 transitions. [2022-07-11 23:45:59,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2022-07-11 23:45:59,220 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:45:59,221 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 16, 16, 15, 15, 15, 15, 15, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:45:59,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-11 23:45:59,221 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:45:59,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:45:59,221 INFO L85 PathProgramCache]: Analyzing trace with hash 296800678, now seen corresponding path program 1 times [2022-07-11 23:45:59,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:45:59,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28131398] [2022-07-11 23:45:59,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:45:59,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:45:59,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:45:59,271 INFO L134 CoverageAnalysis]: Checked inductivity of 1651 backedges. 957 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2022-07-11 23:45:59,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:45:59,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28131398] [2022-07-11 23:45:59,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28131398] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:45:59,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1892081513] [2022-07-11 23:45:59,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:45:59,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:45:59,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:45:59,273 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-11 23:45:59,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-11 23:45:59,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:45:59,384 INFO L263 TraceCheckSpWp]: Trace formula consists of 701 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-11 23:45:59,388 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:45:59,449 INFO L134 CoverageAnalysis]: Checked inductivity of 1651 backedges. 957 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2022-07-11 23:45:59,449 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:45:59,530 INFO L134 CoverageAnalysis]: Checked inductivity of 1651 backedges. 957 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2022-07-11 23:45:59,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1892081513] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:45:59,531 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:45:59,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-07-11 23:45:59,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771323795] [2022-07-11 23:45:59,531 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:45:59,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-11 23:45:59,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:45:59,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-11 23:45:59,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-11 23:45:59,533 INFO L87 Difference]: Start difference. First operand 5869 states and 7561 transitions. Second operand has 6 states, 6 states have (on average 39.0) internal successors, (234), 6 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:45:59,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:45:59,780 INFO L93 Difference]: Finished difference Result 13204 states and 16946 transitions. [2022-07-11 23:45:59,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-11 23:45:59,780 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 39.0) internal successors, (234), 6 states have internal predecessors, (234), 0 states have call successors, (0), 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 376 [2022-07-11 23:45:59,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:45:59,791 INFO L225 Difference]: With dead ends: 13204 [2022-07-11 23:45:59,791 INFO L226 Difference]: Without dead ends: 7359 [2022-07-11 23:45:59,797 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 756 GetRequests, 751 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-11 23:45:59,797 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 470 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 470 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-11 23:45:59,798 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [470 Valid, 331 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-11 23:45:59,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7359 states. [2022-07-11 23:45:59,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7359 to 5989. [2022-07-11 23:45:59,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5989 states, 5988 states have (on average 1.2762191048764195) internal successors, (7642), 5988 states have internal predecessors, (7642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:45:59,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5989 states to 5989 states and 7642 transitions. [2022-07-11 23:45:59,900 INFO L78 Accepts]: Start accepts. Automaton has 5989 states and 7642 transitions. Word has length 376 [2022-07-11 23:45:59,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:45:59,901 INFO L495 AbstractCegarLoop]: Abstraction has 5989 states and 7642 transitions. [2022-07-11 23:45:59,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 39.0) internal successors, (234), 6 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:45:59,901 INFO L276 IsEmpty]: Start isEmpty. Operand 5989 states and 7642 transitions. [2022-07-11 23:45:59,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 416 [2022-07-11 23:45:59,940 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:45:59,940 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 16, 16, 16, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:45:59,959 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-11 23:46:00,147 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,SelfDestructingSolverStorable23 [2022-07-11 23:46:00,148 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:46:00,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:46:00,148 INFO L85 PathProgramCache]: Analyzing trace with hash -2142183135, now seen corresponding path program 1 times [2022-07-11 23:46:00,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:46:00,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138947985] [2022-07-11 23:46:00,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:46:00,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:46:00,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:46:00,192 INFO L134 CoverageAnalysis]: Checked inductivity of 1972 backedges. 887 proven. 0 refuted. 0 times theorem prover too weak. 1085 trivial. 0 not checked. [2022-07-11 23:46:00,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:46:00,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138947985] [2022-07-11 23:46:00,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138947985] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:46:00,192 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:46:00,192 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:46:00,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025178852] [2022-07-11 23:46:00,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:46:00,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:46:00,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:46:00,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:46:00,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:46:00,194 INFO L87 Difference]: Start difference. First operand 5989 states and 7642 transitions. Second operand has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:46:00,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:46:00,305 INFO L93 Difference]: Finished difference Result 11539 states and 14488 transitions. [2022-07-11 23:46:00,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:46:00,305 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 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 415 [2022-07-11 23:46:00,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:46:00,310 INFO L225 Difference]: With dead ends: 11539 [2022-07-11 23:46:00,310 INFO L226 Difference]: Without dead ends: 3293 [2022-07-11 23:46:00,316 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:46:00,317 INFO L413 NwaCegarLoop]: 177 mSDtfsCounter, 39 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:46:00,320 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 259 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:46:00,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3293 states. [2022-07-11 23:46:00,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3293 to 3227. [2022-07-11 23:46:00,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3227 states, 3226 states have (on average 1.2625542467451953) internal successors, (4073), 3226 states have internal predecessors, (4073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:46:00,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3227 states to 3227 states and 4073 transitions. [2022-07-11 23:46:00,366 INFO L78 Accepts]: Start accepts. Automaton has 3227 states and 4073 transitions. Word has length 415 [2022-07-11 23:46:00,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:46:00,366 INFO L495 AbstractCegarLoop]: Abstraction has 3227 states and 4073 transitions. [2022-07-11 23:46:00,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:46:00,366 INFO L276 IsEmpty]: Start isEmpty. Operand 3227 states and 4073 transitions. [2022-07-11 23:46:00,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 483 [2022-07-11 23:46:00,370 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:46:00,370 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 17, 17, 17, 16, 16, 15, 15, 13, 13, 11, 11, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:46:00,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-11 23:46:00,371 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:46:00,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:46:00,371 INFO L85 PathProgramCache]: Analyzing trace with hash -2025530628, now seen corresponding path program 1 times [2022-07-11 23:46:00,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:46:00,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541687474] [2022-07-11 23:46:00,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:46:00,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:46:00,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:46:00,432 INFO L134 CoverageAnalysis]: Checked inductivity of 2503 backedges. 1481 proven. 14 refuted. 0 times theorem prover too weak. 1008 trivial. 0 not checked. [2022-07-11 23:46:00,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:46:00,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541687474] [2022-07-11 23:46:00,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541687474] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:46:00,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [473482770] [2022-07-11 23:46:00,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:46:00,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:46:00,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:46:00,434 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-11 23:46:00,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-11 23:46:00,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:46:00,556 INFO L263 TraceCheckSpWp]: Trace formula consists of 816 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-11 23:46:00,560 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:46:00,628 INFO L134 CoverageAnalysis]: Checked inductivity of 2503 backedges. 1481 proven. 14 refuted. 0 times theorem prover too weak. 1008 trivial. 0 not checked. [2022-07-11 23:46:00,629 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:46:00,697 INFO L134 CoverageAnalysis]: Checked inductivity of 2503 backedges. 1481 proven. 14 refuted. 0 times theorem prover too weak. 1008 trivial. 0 not checked. [2022-07-11 23:46:00,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [473482770] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:46:00,698 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:46:00,698 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2022-07-11 23:46:00,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348262095] [2022-07-11 23:46:00,698 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:46:00,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-11 23:46:00,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:46:00,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-11 23:46:00,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-07-11 23:46:00,700 INFO L87 Difference]: Start difference. First operand 3227 states and 4073 transitions. Second operand has 8 states, 8 states have (on average 40.125) internal successors, (321), 8 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:46:00,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:46:00,898 INFO L93 Difference]: Finished difference Result 3861 states and 4882 transitions. [2022-07-11 23:46:00,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-11 23:46:00,899 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 40.125) internal successors, (321), 8 states have internal predecessors, (321), 0 states have call successors, (0), 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 482 [2022-07-11 23:46:00,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:46:00,899 INFO L225 Difference]: With dead ends: 3861 [2022-07-11 23:46:00,900 INFO L226 Difference]: Without dead ends: 0 [2022-07-11 23:46:00,902 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 970 GetRequests, 962 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-07-11 23:46:00,902 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 100 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 615 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-11 23:46:00,903 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 615 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-11 23:46:00,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-11 23:46:00,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-11 23:46:00,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:46:00,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-11 23:46:00,904 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 482 [2022-07-11 23:46:00,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:46:00,904 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-11 23:46:00,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 40.125) internal successors, (321), 8 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:46:00,905 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-11 23:46:00,905 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-11 23:46:00,907 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-11 23:46:00,926 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-11 23:46:01,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:46:01,127 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-11 23:46:03,424 INFO L899 garLoopResultBuilder]: For program point L399(lines 399 403) no Hoare annotation was computed. [2022-07-11 23:46:03,424 INFO L895 garLoopResultBuilder]: At program point L333(lines 87 562) the Hoare annotation is: false [2022-07-11 23:46:03,424 INFO L899 garLoopResultBuilder]: For program point L399-2(lines 213 496) no Hoare annotation was computed. [2022-07-11 23:46:03,424 INFO L899 garLoopResultBuilder]: For program point L234(lines 234 245) no Hoare annotation was computed. [2022-07-11 23:46:03,424 INFO L899 garLoopResultBuilder]: For program point L234-2(lines 213 496) no Hoare annotation was computed. [2022-07-11 23:46:03,424 INFO L899 garLoopResultBuilder]: For program point L532(lines 532 548) no Hoare annotation was computed. [2022-07-11 23:46:03,424 INFO L899 garLoopResultBuilder]: For program point L301(lines 301 303) no Hoare annotation was computed. [2022-07-11 23:46:03,424 INFO L899 garLoopResultBuilder]: For program point L301-2(lines 296 308) no Hoare annotation was computed. [2022-07-11 23:46:03,424 INFO L899 garLoopResultBuilder]: For program point L533(lines 533 547) no Hoare annotation was computed. [2022-07-11 23:46:03,424 INFO L899 garLoopResultBuilder]: For program point L368(lines 368 370) no Hoare annotation was computed. [2022-07-11 23:46:03,424 INFO L899 garLoopResultBuilder]: For program point L335(lines 335 337) no Hoare annotation was computed. [2022-07-11 23:46:03,424 INFO L899 garLoopResultBuilder]: For program point L236(lines 236 239) no Hoare annotation was computed. [2022-07-11 23:46:03,424 INFO L899 garLoopResultBuilder]: For program point L203(lines 203 501) no Hoare annotation was computed. [2022-07-11 23:46:03,425 INFO L899 garLoopResultBuilder]: For program point L170(lines 170 512) no Hoare annotation was computed. [2022-07-11 23:46:03,425 INFO L899 garLoopResultBuilder]: For program point L137(lines 137 523) no Hoare annotation was computed. [2022-07-11 23:46:03,425 INFO L899 garLoopResultBuilder]: For program point L104(lines 104 108) no Hoare annotation was computed. [2022-07-11 23:46:03,425 INFO L899 garLoopResultBuilder]: For program point L534(lines 534 539) no Hoare annotation was computed. [2022-07-11 23:46:03,425 INFO L899 garLoopResultBuilder]: For program point L534-2(lines 533 547) no Hoare annotation was computed. [2022-07-11 23:46:03,426 INFO L899 garLoopResultBuilder]: For program point L270(lines 270 272) no Hoare annotation was computed. [2022-07-11 23:46:03,426 INFO L895 garLoopResultBuilder]: At program point L204(lines 200 502) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4560)) (.cse1 (<= 4560 |ULTIMATE.start_ssl3_connect_~s__state~0#1|))) (or (and (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0) (<= |ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1| 4560) .cse0 .cse1 (<= 4560 |ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1|)) (and (= 2 |ULTIMATE.start_ssl3_connect_~blastFlag~0#1|) .cse0 .cse1))) [2022-07-11 23:46:03,426 INFO L895 garLoopResultBuilder]: At program point L138(lines 134 524) the Hoare annotation is: (and (not (<= 4400 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 1) (<= 4352 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) [2022-07-11 23:46:03,426 INFO L899 garLoopResultBuilder]: For program point L105(lines 105 107) no Hoare annotation was computed. [2022-07-11 23:46:03,426 INFO L899 garLoopResultBuilder]: For program point L536(lines 536 538) no Hoare annotation was computed. [2022-07-11 23:46:03,426 INFO L899 garLoopResultBuilder]: For program point L206(lines 206 500) no Hoare annotation was computed. [2022-07-11 23:46:03,426 INFO L899 garLoopResultBuilder]: For program point L173(lines 173 511) no Hoare annotation was computed. [2022-07-11 23:46:03,426 INFO L899 garLoopResultBuilder]: For program point L140(lines 140 522) no Hoare annotation was computed. [2022-07-11 23:46:03,427 INFO L899 garLoopResultBuilder]: For program point L372(lines 372 377) no Hoare annotation was computed. [2022-07-11 23:46:03,427 INFO L899 garLoopResultBuilder]: For program point L372-2(lines 372 377) no Hoare annotation was computed. [2022-07-11 23:46:03,427 INFO L899 garLoopResultBuilder]: For program point L240(lines 240 243) no Hoare annotation was computed. [2022-07-11 23:46:03,427 INFO L895 garLoopResultBuilder]: At program point L207(lines 206 500) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4352)) (.cse1 (<= 4352 |ULTIMATE.start_ssl3_connect_~s__state~0#1|))) (or (and (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0) (<= |ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1| 4560) .cse0 .cse1 (<= 4560 |ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1|)) (and (= 3 |ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1|) (= 2 |ULTIMATE.start_ssl3_connect_~blastFlag~0#1|) .cse0 .cse1))) [2022-07-11 23:46:03,427 INFO L895 garLoopResultBuilder]: At program point L174(lines 164 514) the Hoare annotation is: (let ((.cse0 (<= 4432 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (.cse1 (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4528))) (or (and .cse0 (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0) .cse1 (<= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 4)) (and .cse0 (= 2 |ULTIMATE.start_ssl3_connect_~blastFlag~0#1|) .cse1))) [2022-07-11 23:46:03,427 INFO L899 garLoopResultBuilder]: For program point L472-1(lines 472 474) no Hoare annotation was computed. [2022-07-11 23:46:03,427 INFO L902 garLoopResultBuilder]: At program point L572(lines 564 574) the Hoare annotation is: true [2022-07-11 23:46:03,427 INFO L899 garLoopResultBuilder]: For program point L209(lines 209 499) no Hoare annotation was computed. [2022-07-11 23:46:03,428 INFO L899 garLoopResultBuilder]: For program point L176(lines 176 510) no Hoare annotation was computed. [2022-07-11 23:46:03,428 INFO L899 garLoopResultBuilder]: For program point L143(lines 143 521) no Hoare annotation was computed. [2022-07-11 23:46:03,428 INFO L899 garLoopResultBuilder]: For program point L110-1(lines 87 562) no Hoare annotation was computed. [2022-07-11 23:46:03,428 INFO L899 garLoopResultBuilder]: For program point L408(lines 408 411) no Hoare annotation was computed. [2022-07-11 23:46:03,428 INFO L902 garLoopResultBuilder]: At program point L210(lines 209 499) the Hoare annotation is: true [2022-07-11 23:46:03,428 INFO L895 garLoopResultBuilder]: At program point L144(lines 140 522) the Hoare annotation is: (and (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0) (= 2 |ULTIMATE.start_ssl3_connect_~blastFlag~0#1|) (<= 4352 |ULTIMATE.start_ssl3_connect_~s__state~0#1|) (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4528)) [2022-07-11 23:46:03,428 INFO L899 garLoopResultBuilder]: For program point L111(line 111) no Hoare annotation was computed. [2022-07-11 23:46:03,428 INFO L899 garLoopResultBuilder]: For program point L541(lines 541 545) no Hoare annotation was computed. [2022-07-11 23:46:03,428 INFO L899 garLoopResultBuilder]: For program point L277(lines 277 279) no Hoare annotation was computed. [2022-07-11 23:46:03,428 INFO L899 garLoopResultBuilder]: For program point L277-2(lines 213 496) no Hoare annotation was computed. [2022-07-11 23:46:03,429 INFO L899 garLoopResultBuilder]: For program point L443(lines 443 445) no Hoare annotation was computed. [2022-07-11 23:46:03,429 INFO L899 garLoopResultBuilder]: For program point L344(lines 344 346) no Hoare annotation was computed. [2022-07-11 23:46:03,429 INFO L902 garLoopResultBuilder]: At program point L212(lines 211 499) the Hoare annotation is: true [2022-07-11 23:46:03,429 INFO L899 garLoopResultBuilder]: For program point L179(lines 179 509) no Hoare annotation was computed. [2022-07-11 23:46:03,429 INFO L899 garLoopResultBuilder]: For program point L146(lines 146 520) no Hoare annotation was computed. [2022-07-11 23:46:03,429 INFO L899 garLoopResultBuilder]: For program point L113(lines 113 531) no Hoare annotation was computed. [2022-07-11 23:46:03,429 INFO L895 garLoopResultBuilder]: At program point L180(lines 176 510) the Hoare annotation is: (let ((.cse0 (<= 4432 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (.cse1 (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4528))) (or (and .cse0 (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0) .cse1 (<= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 4)) (and .cse0 (= 2 |ULTIMATE.start_ssl3_connect_~blastFlag~0#1|) .cse1))) [2022-07-11 23:46:03,429 INFO L895 garLoopResultBuilder]: At program point L114(lines 113 531) the Hoare annotation is: (and (= 12292 |ULTIMATE.start_ssl3_connect_~s__state~0#1|) (= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 0)) [2022-07-11 23:46:03,429 INFO L899 garLoopResultBuilder]: For program point L478(lines 478 480) no Hoare annotation was computed. [2022-07-11 23:46:03,429 INFO L899 garLoopResultBuilder]: For program point L478-2(lines 478 480) no Hoare annotation was computed. [2022-07-11 23:46:03,429 INFO L899 garLoopResultBuilder]: For program point L446(lines 446 450) no Hoare annotation was computed. [2022-07-11 23:46:03,430 INFO L899 garLoopResultBuilder]: For program point L446-2(lines 446 450) no Hoare annotation was computed. [2022-07-11 23:46:03,430 INFO L899 garLoopResultBuilder]: For program point L347(lines 347 351) no Hoare annotation was computed. [2022-07-11 23:46:03,430 INFO L899 garLoopResultBuilder]: For program point L347-2(lines 347 351) no Hoare annotation was computed. [2022-07-11 23:46:03,430 INFO L899 garLoopResultBuilder]: For program point L182(lines 182 508) no Hoare annotation was computed. [2022-07-11 23:46:03,430 INFO L899 garLoopResultBuilder]: For program point L149(lines 149 519) no Hoare annotation was computed. [2022-07-11 23:46:03,430 INFO L899 garLoopResultBuilder]: For program point L116(lines 116 530) no Hoare annotation was computed. [2022-07-11 23:46:03,430 INFO L895 garLoopResultBuilder]: At program point L150(lines 146 520) the Hoare annotation is: (and (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0) (not (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4400)) (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4528) (<= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 4)) [2022-07-11 23:46:03,430 INFO L899 garLoopResultBuilder]: For program point L316(lines 316 318) no Hoare annotation was computed. [2022-07-11 23:46:03,430 INFO L899 garLoopResultBuilder]: For program point L283(lines 283 287) no Hoare annotation was computed. [2022-07-11 23:46:03,430 INFO L899 garLoopResultBuilder]: For program point L250(lines 250 253) no Hoare annotation was computed. [2022-07-11 23:46:03,431 INFO L899 garLoopResultBuilder]: For program point L316-2(lines 213 496) no Hoare annotation was computed. [2022-07-11 23:46:03,431 INFO L899 garLoopResultBuilder]: For program point L283-2(lines 283 287) no Hoare annotation was computed. [2022-07-11 23:46:03,431 INFO L899 garLoopResultBuilder]: For program point L416(lines 416 418) no Hoare annotation was computed. [2022-07-11 23:46:03,431 INFO L899 garLoopResultBuilder]: For program point L383(lines 383 385) no Hoare annotation was computed. [2022-07-11 23:46:03,432 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-11 23:46:03,432 INFO L895 garLoopResultBuilder]: At program point L218(lines 116 530) the Hoare annotation is: (and (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4352) (= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 0)) [2022-07-11 23:46:03,432 INFO L899 garLoopResultBuilder]: For program point L185(lines 185 507) no Hoare annotation was computed. [2022-07-11 23:46:03,432 INFO L899 garLoopResultBuilder]: For program point L152(lines 152 518) no Hoare annotation was computed. [2022-07-11 23:46:03,432 INFO L899 garLoopResultBuilder]: For program point L119(lines 119 529) no Hoare annotation was computed. [2022-07-11 23:46:03,433 INFO L895 garLoopResultBuilder]: At program point L186(lines 182 508) the Hoare annotation is: (let ((.cse0 (<= 4432 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (.cse1 (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4528))) (or (and .cse0 (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0) .cse1 (<= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 4)) (and .cse0 (= 2 |ULTIMATE.start_ssl3_connect_~blastFlag~0#1|) .cse1))) [2022-07-11 23:46:03,433 INFO L899 garLoopResultBuilder]: For program point L484(lines 484 486) no Hoare annotation was computed. [2022-07-11 23:46:03,433 INFO L899 garLoopResultBuilder]: For program point L484-2(lines 484 486) no Hoare annotation was computed. [2022-07-11 23:46:03,433 INFO L902 garLoopResultBuilder]: At program point L551(lines 109 552) the Hoare annotation is: true [2022-07-11 23:46:03,433 INFO L899 garLoopResultBuilder]: For program point L188(lines 188 506) no Hoare annotation was computed. [2022-07-11 23:46:03,433 INFO L899 garLoopResultBuilder]: For program point L155(lines 155 517) no Hoare annotation was computed. [2022-07-11 23:46:03,434 INFO L899 garLoopResultBuilder]: For program point L122(lines 122 528) no Hoare annotation was computed. [2022-07-11 23:46:03,434 INFO L895 garLoopResultBuilder]: At program point L156(lines 152 518) the Hoare annotation is: (let ((.cse0 (<= 4432 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (.cse1 (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4528))) (or (and .cse0 (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0) .cse1 (<= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 4)) (and .cse0 (= 2 |ULTIMATE.start_ssl3_connect_~blastFlag~0#1|) .cse1))) [2022-07-11 23:46:03,434 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-11 23:46:03,434 INFO L899 garLoopResultBuilder]: For program point L223(lines 223 225) no Hoare annotation was computed. [2022-07-11 23:46:03,434 INFO L899 garLoopResultBuilder]: For program point L223-2(lines 223 225) no Hoare annotation was computed. [2022-07-11 23:46:03,434 INFO L899 garLoopResultBuilder]: For program point L191(lines 191 505) no Hoare annotation was computed. [2022-07-11 23:46:03,434 INFO L899 garLoopResultBuilder]: For program point L158(lines 158 516) no Hoare annotation was computed. [2022-07-11 23:46:03,434 INFO L899 garLoopResultBuilder]: For program point L125(lines 125 527) no Hoare annotation was computed. [2022-07-11 23:46:03,435 INFO L899 garLoopResultBuilder]: For program point L489(lines 489 491) no Hoare annotation was computed. [2022-07-11 23:46:03,435 INFO L899 garLoopResultBuilder]: For program point L456(lines 456 467) no Hoare annotation was computed. [2022-07-11 23:46:03,435 INFO L899 garLoopResultBuilder]: For program point L423(lines 423 437) no Hoare annotation was computed. [2022-07-11 23:46:03,435 INFO L899 garLoopResultBuilder]: For program point L423-1(lines 423 437) no Hoare annotation was computed. [2022-07-11 23:46:03,435 INFO L899 garLoopResultBuilder]: For program point L456-2(lines 456 467) no Hoare annotation was computed. [2022-07-11 23:46:03,435 INFO L899 garLoopResultBuilder]: For program point L324(lines 324 327) no Hoare annotation was computed. [2022-07-11 23:46:03,435 INFO L895 garLoopResultBuilder]: At program point L192(lines 188 506) the Hoare annotation is: (let ((.cse0 (<= 4432 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (.cse1 (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4528))) (or (and .cse0 (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0) .cse1 (<= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 4)) (and .cse0 (= 2 |ULTIMATE.start_ssl3_connect_~blastFlag~0#1|) .cse1))) [2022-07-11 23:46:03,435 INFO L899 garLoopResultBuilder]: For program point L556(lines 556 558) no Hoare annotation was computed. [2022-07-11 23:46:03,436 INFO L899 garLoopResultBuilder]: For program point L556-2(lines 556 558) no Hoare annotation was computed. [2022-07-11 23:46:03,436 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-11 23:46:03,436 INFO L899 garLoopResultBuilder]: For program point L359(lines 359 361) no Hoare annotation was computed. [2022-07-11 23:46:03,436 INFO L899 garLoopResultBuilder]: For program point L194(lines 194 504) no Hoare annotation was computed. [2022-07-11 23:46:03,436 INFO L899 garLoopResultBuilder]: For program point L161(lines 161 515) no Hoare annotation was computed. [2022-07-11 23:46:03,436 INFO L899 garLoopResultBuilder]: For program point L128(lines 128 526) no Hoare annotation was computed. [2022-07-11 23:46:03,436 INFO L899 garLoopResultBuilder]: For program point L393(lines 393 395) no Hoare annotation was computed. [2022-07-11 23:46:03,436 INFO L899 garLoopResultBuilder]: For program point L294(lines 294 308) no Hoare annotation was computed. [2022-07-11 23:46:03,436 INFO L899 garLoopResultBuilder]: For program point L228(lines 228 231) no Hoare annotation was computed. [2022-07-11 23:46:03,436 INFO L899 garLoopResultBuilder]: For program point L294-2(lines 294 308) no Hoare annotation was computed. [2022-07-11 23:46:03,437 INFO L895 garLoopResultBuilder]: At program point L162(lines 158 516) the Hoare annotation is: (let ((.cse0 (<= 4432 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (.cse1 (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4528))) (or (and .cse0 (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0) .cse1 (<= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 4)) (and .cse0 (= 2 |ULTIMATE.start_ssl3_connect_~blastFlag~0#1|) .cse1))) [2022-07-11 23:46:03,437 INFO L899 garLoopResultBuilder]: For program point L96(lines 96 102) no Hoare annotation was computed. [2022-07-11 23:46:03,437 INFO L899 garLoopResultBuilder]: For program point L427(lines 427 433) no Hoare annotation was computed. [2022-07-11 23:46:03,437 INFO L899 garLoopResultBuilder]: For program point L262(lines 262 264) no Hoare annotation was computed. [2022-07-11 23:46:03,437 INFO L899 garLoopResultBuilder]: For program point L262-2(lines 213 496) no Hoare annotation was computed. [2022-07-11 23:46:03,437 INFO L899 garLoopResultBuilder]: For program point L461(lines 461 464) no Hoare annotation was computed. [2022-07-11 23:46:03,437 INFO L899 garLoopResultBuilder]: For program point L197(lines 197 503) no Hoare annotation was computed. [2022-07-11 23:46:03,437 INFO L899 garLoopResultBuilder]: For program point L164(lines 164 514) no Hoare annotation was computed. [2022-07-11 23:46:03,437 INFO L899 garLoopResultBuilder]: For program point L131(lines 131 525) no Hoare annotation was computed. [2022-07-11 23:46:03,437 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-11 23:46:03,438 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 560) no Hoare annotation was computed. [2022-07-11 23:46:03,438 INFO L902 garLoopResultBuilder]: At program point L561(lines 22 563) the Hoare annotation is: true [2022-07-11 23:46:03,438 INFO L895 garLoopResultBuilder]: At program point L198(lines 194 504) the Hoare annotation is: (let ((.cse0 (<= 4432 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (.cse2 (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0)) (.cse1 (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4560))) (or (and .cse0 (= 2 |ULTIMATE.start_ssl3_connect_~blastFlag~0#1|) .cse1) (and .cse0 .cse2 (<= |ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1| 4560) .cse1) (and .cse0 .cse2 .cse1 (<= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 4)))) [2022-07-11 23:46:03,438 INFO L895 garLoopResultBuilder]: At program point L132(lines 128 526) the Hoare annotation is: (and (< |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4400) (<= 4352 |ULTIMATE.start_ssl3_connect_~s__state~0#1|) (= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 0)) [2022-07-11 23:46:03,438 INFO L899 garLoopResultBuilder]: For program point L99(lines 99 101) no Hoare annotation was computed. [2022-07-11 23:46:03,438 INFO L899 garLoopResultBuilder]: For program point L99-2(lines 96 102) no Hoare annotation was computed. [2022-07-11 23:46:03,438 INFO L899 garLoopResultBuilder]: For program point L298(lines 298 304) no Hoare annotation was computed. [2022-07-11 23:46:03,439 INFO L895 garLoopResultBuilder]: At program point L497(lines 110 550) the Hoare annotation is: (let ((.cse0 (<= 4432 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (.cse2 (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4528)) (.cse8 (<= 4560 |ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1|)) (.cse5 (<= |ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1| 4560)) (.cse9 (= 3 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (.cse6 (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4560)) (.cse7 (<= 4560 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (.cse10 (<= |ULTIMATE.start_ssl3_connect_~s__state~0#1| 4352)) (.cse11 (<= 4352 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)) (.cse3 (<= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 4)) (.cse1 (= |ULTIMATE.start_ssl3_connect_~s__hit~0#1| 0)) (.cse4 (= 2 |ULTIMATE.start_ssl3_connect_~blastFlag~0#1|))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse4 .cse2) (and .cse1 .cse5 .cse6 .cse7 .cse8) (and (= 4384 |ULTIMATE.start_ssl3_connect_~s__state~0#1|) (= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 1)) (and .cse1 .cse4 .cse9) (and .cse1 .cse5 .cse10 .cse11 .cse8) (and .cse5 .cse9) (and (= 4368 |ULTIMATE.start_ssl3_connect_~s__state~0#1|) (= |ULTIMATE.start_ssl3_connect_~blastFlag~0#1| 0)) (and .cse4 .cse6 .cse7) (and (= 3 |ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1|) .cse4 .cse10 .cse11) (and .cse1 (= 4416 |ULTIMATE.start_ssl3_connect_~s__state~0#1|) .cse3) (and .cse1 .cse4 (= 4400 |ULTIMATE.start_ssl3_connect_~s__state~0#1|)))) [2022-07-11 23:46:03,439 INFO L899 garLoopResultBuilder]: For program point L332(lines 332 334) no Hoare annotation was computed. [2022-07-11 23:46:03,439 INFO L899 garLoopResultBuilder]: For program point L200(lines 200 502) no Hoare annotation was computed. [2022-07-11 23:46:03,439 INFO L899 garLoopResultBuilder]: For program point L167(lines 167 513) no Hoare annotation was computed. [2022-07-11 23:46:03,439 INFO L899 garLoopResultBuilder]: For program point L134(lines 134 524) no Hoare annotation was computed. [2022-07-11 23:46:03,443 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:46:03,445 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-11 23:46:03,471 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.07 11:46:03 BoogieIcfgContainer [2022-07-11 23:46:03,472 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-11 23:46:03,472 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-11 23:46:03,472 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-11 23:46:03,472 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-11 23:46:03,473 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 11:45:53" (3/4) ... [2022-07-11 23:46:03,475 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-11 23:46:03,485 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2022-07-11 23:46:03,485 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-07-11 23:46:03,486 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-07-11 23:46:03,486 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-11 23:46:03,539 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-11 23:46:03,541 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-11 23:46:03,541 INFO L158 Benchmark]: Toolchain (without parser) took 10606.31ms. Allocated memory was 92.3MB in the beginning and 310.4MB in the end (delta: 218.1MB). Free memory was 66.8MB in the beginning and 98.0MB in the end (delta: -31.3MB). Peak memory consumption was 187.8MB. Max. memory is 16.1GB. [2022-07-11 23:46:03,541 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 92.3MB. Free memory is still 48.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-11 23:46:03,541 INFO L158 Benchmark]: CACSL2BoogieTranslator took 274.21ms. Allocated memory was 92.3MB in the beginning and 111.1MB in the end (delta: 18.9MB). Free memory was 66.6MB in the beginning and 81.8MB in the end (delta: -15.1MB). Peak memory consumption was 10.7MB. Max. memory is 16.1GB. [2022-07-11 23:46:03,542 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.22ms. Allocated memory is still 111.1MB. Free memory was 81.8MB in the beginning and 79.0MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-11 23:46:03,542 INFO L158 Benchmark]: Boogie Preprocessor took 37.10ms. Allocated memory is still 111.1MB. Free memory was 79.0MB in the beginning and 77.2MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-11 23:46:03,542 INFO L158 Benchmark]: RCFGBuilder took 587.93ms. Allocated memory is still 111.1MB. Free memory was 77.2MB in the beginning and 82.6MB in the end (delta: -5.5MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2022-07-11 23:46:03,542 INFO L158 Benchmark]: TraceAbstraction took 9592.02ms. Allocated memory was 111.1MB in the beginning and 310.4MB in the end (delta: 199.2MB). Free memory was 82.1MB in the beginning and 105.4MB in the end (delta: -23.3MB). Peak memory consumption was 201.1MB. Max. memory is 16.1GB. [2022-07-11 23:46:03,542 INFO L158 Benchmark]: Witness Printer took 68.51ms. Allocated memory is still 310.4MB. Free memory was 105.4MB in the beginning and 98.0MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-11 23:46:03,543 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.10ms. Allocated memory is still 92.3MB. Free memory is still 48.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 274.21ms. Allocated memory was 92.3MB in the beginning and 111.1MB in the end (delta: 18.9MB). Free memory was 66.6MB in the beginning and 81.8MB in the end (delta: -15.1MB). Peak memory consumption was 10.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.22ms. Allocated memory is still 111.1MB. Free memory was 81.8MB in the beginning and 79.0MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.10ms. Allocated memory is still 111.1MB. Free memory was 79.0MB in the beginning and 77.2MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 587.93ms. Allocated memory is still 111.1MB. Free memory was 77.2MB in the beginning and 82.6MB in the end (delta: -5.5MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 9592.02ms. Allocated memory was 111.1MB in the beginning and 310.4MB in the end (delta: 199.2MB). Free memory was 82.1MB in the beginning and 105.4MB in the end (delta: -23.3MB). Peak memory consumption was 201.1MB. Max. memory is 16.1GB. * Witness Printer took 68.51ms. Allocated memory is still 310.4MB. Free memory was 105.4MB in the beginning and 98.0MB in the end (delta: 7.3MB). 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: 560]: 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, 128 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.5s, OverallIterations: 26, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1937 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1937 mSDsluCounter, 8238 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3372 mSDsCounter, 549 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2886 IncrementalHoareTripleChecker+Invalid, 3435 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 549 mSolverCounterUnsat, 4866 mSDtfsCounter, 2886 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2465 GetRequests, 2423 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5989occurred in iteration=24, InterpolantAutomatonStates: 86, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 26 MinimizatonAttempts, 4464 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 22 LocationsWithAnnotation, 22 PreInvPairs, 177 NumberOfFragments, 436 HoareAnnotationTreeSize, 22 FomulaSimplifications, 4108 FormulaSimplificationTreeSizeReduction, 0.7s HoareSimplificationTime, 22 FomulaSimplificationsInter, 9007 FormulaSimplificationTreeSizeReductionInter, 1.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 6603 NumberOfCodeBlocks, 6603 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 7761 ConstructedInterpolants, 0 QuantifiedInterpolants, 10326 SizeOfPredicates, 3 NumberOfNonLiveVariables, 2133 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 32 InterpolantComputations, 23 PerfectInterpolantSequences, 28918/29017 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: 176]: Loop Invariant Derived loop invariant: (((4432 <= s__state && s__hit == 0) && s__state <= 4528) && blastFlag <= 4) || ((4432 <= s__state && 2 == blastFlag) && s__state <= 4528) - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 113]: Loop Invariant Derived loop invariant: 12292 == s__state && blastFlag == 0 - InvariantResult [Line: 110]: Loop Invariant Derived loop invariant: (((((((((((((4432 <= s__state && s__hit == 0) && s__state <= 4528) && blastFlag <= 4) || ((4432 <= s__state && 2 == blastFlag) && s__state <= 4528)) || ((((s__hit == 0 && s__s3__tmp__next_state___0 <= 4560) && s__state <= 4560) && 4560 <= s__state) && 4560 <= s__s3__tmp__next_state___0)) || (4384 == s__state && blastFlag == 1)) || ((s__hit == 0 && 2 == blastFlag) && 3 == s__state)) || ((((s__hit == 0 && s__s3__tmp__next_state___0 <= 4560) && s__state <= 4352) && 4352 <= s__state) && 4560 <= s__s3__tmp__next_state___0)) || (s__s3__tmp__next_state___0 <= 4560 && 3 == s__state)) || (4368 == s__state && blastFlag == 0)) || ((2 == blastFlag && s__state <= 4560) && 4560 <= s__state)) || (((3 == s__s3__tmp__next_state___0 && 2 == blastFlag) && s__state <= 4352) && 4352 <= s__state)) || ((s__hit == 0 && 4416 == s__state) && blastFlag <= 4)) || ((s__hit == 0 && 2 == blastFlag) && 4400 == s__state) - InvariantResult [Line: 194]: Loop Invariant Derived loop invariant: (((4432 <= s__state && 2 == blastFlag) && s__state <= 4560) || (((4432 <= s__state && s__hit == 0) && s__s3__tmp__next_state___0 <= 4560) && s__state <= 4560)) || (((4432 <= s__state && s__hit == 0) && s__state <= 4560) && blastFlag <= 4) - InvariantResult [Line: 564]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 206]: Loop Invariant Derived loop invariant: ((((s__hit == 0 && s__s3__tmp__next_state___0 <= 4560) && s__state <= 4352) && 4352 <= s__state) && 4560 <= s__s3__tmp__next_state___0) || (((3 == s__s3__tmp__next_state___0 && 2 == blastFlag) && s__state <= 4352) && 4352 <= s__state) - InvariantResult [Line: 211]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 116]: Loop Invariant Derived loop invariant: s__state <= 4352 && blastFlag == 0 - InvariantResult [Line: 140]: Loop Invariant Derived loop invariant: ((s__hit == 0 && 2 == blastFlag) && 4352 <= s__state) && s__state <= 4528 - InvariantResult [Line: 200]: Loop Invariant Derived loop invariant: ((((s__hit == 0 && s__s3__tmp__next_state___0 <= 4560) && s__state <= 4560) && 4560 <= s__state) && 4560 <= s__s3__tmp__next_state___0) || ((2 == blastFlag && s__state <= 4560) && 4560 <= s__state) - InvariantResult [Line: 209]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 128]: Loop Invariant Derived loop invariant: (s__state < 4400 && 4352 <= s__state) && blastFlag == 0 - InvariantResult [Line: 152]: Loop Invariant Derived loop invariant: (((4432 <= s__state && s__hit == 0) && s__state <= 4528) && blastFlag <= 4) || ((4432 <= s__state && 2 == blastFlag) && s__state <= 4528) - InvariantResult [Line: 188]: Loop Invariant Derived loop invariant: (((4432 <= s__state && s__hit == 0) && s__state <= 4528) && blastFlag <= 4) || ((4432 <= s__state && 2 == blastFlag) && s__state <= 4528) - InvariantResult [Line: 164]: Loop Invariant Derived loop invariant: (((4432 <= s__state && s__hit == 0) && s__state <= 4528) && blastFlag <= 4) || ((4432 <= s__state && 2 == blastFlag) && s__state <= 4528) - InvariantResult [Line: 87]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 134]: Loop Invariant Derived loop invariant: (!(4400 <= s__state) && blastFlag == 1) && 4352 <= s__state - InvariantResult [Line: 146]: Loop Invariant Derived loop invariant: ((s__hit == 0 && !(s__state <= 4400)) && s__state <= 4528) && blastFlag <= 4 - InvariantResult [Line: 109]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 182]: Loop Invariant Derived loop invariant: (((4432 <= s__state && s__hit == 0) && s__state <= 4528) && blastFlag <= 4) || ((4432 <= s__state && 2 == blastFlag) && s__state <= 4528) - InvariantResult [Line: 158]: Loop Invariant Derived loop invariant: (((4432 <= s__state && s__hit == 0) && s__state <= 4528) && blastFlag <= 4) || ((4432 <= s__state && 2 == blastFlag) && s__state <= 4528) RESULT: Ultimate proved your program to be correct! [2022-07-11 23:46:03,576 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