./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/openssl/s3_srvr.blast.01.i.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version eb692b52 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/s3_srvr.blast.01.i.cil-2.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 a1fff1f2750aedbe7119b44ad3cdc8a2dbfa05ad8147a422ae9aeb0054d6e253 --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-19 11:02:01,193 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 11:02:01,196 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 11:02:01,231 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 11:02:01,232 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 11:02:01,234 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 11:02:01,236 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 11:02:01,238 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 11:02:01,240 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 11:02:01,243 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 11:02:01,245 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 11:02:01,247 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 11:02:01,247 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 11:02:01,248 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 11:02:01,250 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 11:02:01,253 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 11:02:01,253 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 11:02:01,255 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 11:02:01,256 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 11:02:01,261 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 11:02:01,263 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 11:02:01,264 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 11:02:01,264 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 11:02:01,265 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 11:02:01,266 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 11:02:01,273 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 11:02:01,273 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 11:02:01,273 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 11:02:01,274 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 11:02:01,275 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 11:02:01,276 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 11:02:01,276 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 11:02:01,277 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 11:02:01,278 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 11:02:01,279 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 11:02:01,279 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 11:02:01,280 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 11:02:01,280 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 11:02:01,280 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 11:02:01,281 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 11:02:01,281 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 11:02:01,283 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 11:02:01,284 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-19 11:02:01,316 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 11:02:01,317 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 11:02:01,317 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 11:02:01,318 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 11:02:01,318 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 11:02:01,318 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 11:02:01,319 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 11:02:01,319 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 11:02:01,319 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 11:02:01,320 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 11:02:01,320 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-19 11:02:01,320 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-19 11:02:01,321 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-19 11:02:01,321 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 11:02:01,321 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 11:02:01,321 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 11:02:01,321 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 11:02:01,322 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-19 11:02:01,322 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 11:02:01,323 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 11:02:01,323 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 11:02:01,323 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 11:02:01,323 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 11:02:01,324 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 11:02:01,324 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 11:02:01,325 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 11:02:01,325 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 11:02:01,325 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 11:02:01,325 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-19 11:02:01,325 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-19 11:02:01,326 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 11:02:01,326 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 11:02:01,326 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 11:02:01,326 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 -> a1fff1f2750aedbe7119b44ad3cdc8a2dbfa05ad8147a422ae9aeb0054d6e253 [2022-07-19 11:02:01,543 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 11:02:01,572 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 11:02:01,574 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 11:02:01,575 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 11:02:01,577 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 11:02:01,579 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/openssl/s3_srvr.blast.01.i.cil-2.c [2022-07-19 11:02:01,633 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/509289431/fd0a6d1753454c4f837338ac38402749/FLAG7106f206d [2022-07-19 11:02:02,226 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 11:02:02,231 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl/s3_srvr.blast.01.i.cil-2.c [2022-07-19 11:02:02,254 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/509289431/fd0a6d1753454c4f837338ac38402749/FLAG7106f206d [2022-07-19 11:02:02,480 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/509289431/fd0a6d1753454c4f837338ac38402749 [2022-07-19 11:02:02,482 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 11:02:02,484 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 11:02:02,486 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 11:02:02,487 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 11:02:02,489 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 11:02:02,490 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 11:02:02" (1/1) ... [2022-07-19 11:02:02,491 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b114a51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:02:02, skipping insertion in model container [2022-07-19 11:02:02,491 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 11:02:02" (1/1) ... [2022-07-19 11:02:02,497 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 11:02:02,544 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 11:02:02,929 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/s3_srvr.blast.01.i.cil-2.c[72913,72926] [2022-07-19 11:02:02,937 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 11:02:02,954 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 11:02:03,076 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/s3_srvr.blast.01.i.cil-2.c[72913,72926] [2022-07-19 11:02:03,083 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 11:02:03,098 INFO L208 MainTranslator]: Completed translation [2022-07-19 11:02:03,100 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:02:03 WrapperNode [2022-07-19 11:02:03,100 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 11:02:03,101 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 11:02:03,101 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 11:02:03,101 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 11:02:03,107 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:02:03" (1/1) ... [2022-07-19 11:02:03,139 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:02:03" (1/1) ... [2022-07-19 11:02:03,190 INFO L137 Inliner]: procedures = 31, calls = 223, calls flagged for inlining = 7, calls inlined = 3, statements flattened = 788 [2022-07-19 11:02:03,197 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 11:02:03,198 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 11:02:03,199 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 11:02:03,199 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 11:02:03,206 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:02:03" (1/1) ... [2022-07-19 11:02:03,220 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:02:03" (1/1) ... [2022-07-19 11:02:03,240 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:02:03" (1/1) ... [2022-07-19 11:02:03,242 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:02:03" (1/1) ... [2022-07-19 11:02:03,295 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:02:03" (1/1) ... [2022-07-19 11:02:03,303 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:02:03" (1/1) ... [2022-07-19 11:02:03,317 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:02:03" (1/1) ... [2022-07-19 11:02:03,324 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 11:02:03,329 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 11:02:03,330 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 11:02:03,330 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 11:02:03,331 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:02:03" (1/1) ... [2022-07-19 11:02:03,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 11:02:03,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 11:02:03,360 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-19 11:02:03,385 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-19 11:02:03,403 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 11:02:03,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-19 11:02:03,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-19 11:02:03,404 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-19 11:02:03,404 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-19 11:02:03,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-19 11:02:03,405 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-19 11:02:03,405 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 11:02:03,405 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 11:02:03,575 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 11:02:03,577 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 11:02:03,607 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-19 11:02:06,309 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2022-07-19 11:02:06,310 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2022-07-19 11:02:06,310 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 11:02:06,315 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 11:02:06,316 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-19 11:02:06,317 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 11:02:06 BoogieIcfgContainer [2022-07-19 11:02:06,317 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 11:02:06,319 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 11:02:06,319 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 11:02:06,338 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 11:02:06,339 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 11:02:02" (1/3) ... [2022-07-19 11:02:06,339 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7866129b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 11:02:06, skipping insertion in model container [2022-07-19 11:02:06,339 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:02:03" (2/3) ... [2022-07-19 11:02:06,340 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7866129b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 11:02:06, skipping insertion in model container [2022-07-19 11:02:06,340 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 11:02:06" (3/3) ... [2022-07-19 11:02:06,341 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.01.i.cil-2.c [2022-07-19 11:02:06,353 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 11:02:06,353 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-19 11:02:06,419 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 11:02:06,432 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@412a3475, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@68cd5e92 [2022-07-19 11:02:06,432 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-19 11:02:06,437 INFO L276 IsEmpty]: Start isEmpty. Operand has 147 states, 145 states have (on average 1.696551724137931) internal successors, (246), 146 states have internal predecessors, (246), 0 states have call successors, (0), 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-19 11:02:06,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-07-19 11:02:06,448 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:02:06,448 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 11:02:06,449 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:02:06,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:02:06,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1430116946, now seen corresponding path program 1 times [2022-07-19 11:02:06,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 11:02:06,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610556075] [2022-07-19 11:02:06,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:02:06,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 11:02:06,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 11:02:07,047 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-19 11:02:07,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 11:02:07,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610556075] [2022-07-19 11:02:07,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610556075] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 11:02:07,049 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 11:02:07,049 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 11:02:07,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839653698] [2022-07-19 11:02:07,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 11:02:07,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 11:02:07,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 11:02:07,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 11:02:07,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 11:02:07,079 INFO L87 Difference]: Start difference. First operand has 147 states, 145 states have (on average 1.696551724137931) internal successors, (246), 146 states have internal predecessors, (246), 0 states have call successors, (0), 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 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 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-19 11:02:09,105 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 11:02:09,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 11:02:09,685 INFO L93 Difference]: Finished difference Result 412 states and 693 transitions. [2022-07-19 11:02:09,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 11:02:09,690 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 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 47 [2022-07-19 11:02:09,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 11:02:09,708 INFO L225 Difference]: With dead ends: 412 [2022-07-19 11:02:09,710 INFO L226 Difference]: Without dead ends: 250 [2022-07-19 11:02:09,713 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 11:02:09,718 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 144 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 63 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-07-19 11:02:09,723 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 417 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 274 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-07-19 11:02:09,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2022-07-19 11:02:09,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 177. [2022-07-19 11:02:09,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 176 states have (on average 1.6079545454545454) internal successors, (283), 176 states have internal predecessors, (283), 0 states have call successors, (0), 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-19 11:02:09,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 283 transitions. [2022-07-19 11:02:09,787 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 283 transitions. Word has length 47 [2022-07-19 11:02:09,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 11:02:09,788 INFO L495 AbstractCegarLoop]: Abstraction has 177 states and 283 transitions. [2022-07-19 11:02:09,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 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-19 11:02:09,788 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 283 transitions. [2022-07-19 11:02:09,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-19 11:02:09,790 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:02:09,790 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 11:02:09,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-19 11:02:09,791 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:02:09,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:02:09,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1376827281, now seen corresponding path program 1 times [2022-07-19 11:02:09,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 11:02:09,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767832803] [2022-07-19 11:02:09,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:02:09,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 11:02:09,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 11:02:10,005 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-19 11:02:10,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 11:02:10,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767832803] [2022-07-19 11:02:10,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767832803] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 11:02:10,008 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 11:02:10,008 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 11:02:10,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313856440] [2022-07-19 11:02:10,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 11:02:10,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 11:02:10,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 11:02:10,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 11:02:10,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 11:02:10,013 INFO L87 Difference]: Start difference. First operand 177 states and 283 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 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-19 11:02:12,032 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 11:02:12,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 11:02:12,325 INFO L93 Difference]: Finished difference Result 372 states and 593 transitions. [2022-07-19 11:02:12,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 11:02:12,325 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 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 48 [2022-07-19 11:02:12,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 11:02:12,327 INFO L225 Difference]: With dead ends: 372 [2022-07-19 11:02:12,327 INFO L226 Difference]: Without dead ends: 205 [2022-07-19 11:02:12,328 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 11:02:12,329 INFO L413 NwaCegarLoop]: 177 mSDtfsCounter, 22 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-19 11:02:12,329 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 448 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 150 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-07-19 11:02:12,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2022-07-19 11:02:12,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 188. [2022-07-19 11:02:12,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 187 states have (on average 1.6149732620320856) internal successors, (302), 187 states have internal predecessors, (302), 0 states have call successors, (0), 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-19 11:02:12,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 302 transitions. [2022-07-19 11:02:12,345 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 302 transitions. Word has length 48 [2022-07-19 11:02:12,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 11:02:12,345 INFO L495 AbstractCegarLoop]: Abstraction has 188 states and 302 transitions. [2022-07-19 11:02:12,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 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-19 11:02:12,346 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 302 transitions. [2022-07-19 11:02:12,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-07-19 11:02:12,347 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:02:12,347 INFO L195 NwaCegarLoop]: trace histogram [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-19 11:02:12,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-19 11:02:12,348 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:02:12,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:02:12,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1326962752, now seen corresponding path program 1 times [2022-07-19 11:02:12,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 11:02:12,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28345823] [2022-07-19 11:02:12,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:02:12,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 11:02:12,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 11:02:12,529 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 11:02:12,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 11:02:12,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28345823] [2022-07-19 11:02:12,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28345823] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 11:02:12,530 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 11:02:12,530 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 11:02:12,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742267464] [2022-07-19 11:02:12,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 11:02:12,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 11:02:12,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 11:02:12,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 11:02:12,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 11:02:12,533 INFO L87 Difference]: Start difference. First operand 188 states and 302 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:02:14,540 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 11:02:14,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 11:02:14,935 INFO L93 Difference]: Finished difference Result 514 states and 830 transitions. [2022-07-19 11:02:14,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 11:02:14,936 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2022-07-19 11:02:14,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 11:02:14,938 INFO L225 Difference]: With dead ends: 514 [2022-07-19 11:02:14,938 INFO L226 Difference]: Without dead ends: 347 [2022-07-19 11:02:14,939 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 11:02:14,940 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 140 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 60 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-07-19 11:02:14,940 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 311 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 262 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-07-19 11:02:14,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2022-07-19 11:02:14,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 220. [2022-07-19 11:02:14,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 219 states have (on average 1.6118721461187215) internal successors, (353), 219 states have internal predecessors, (353), 0 states have call successors, (0), 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-19 11:02:14,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 353 transitions. [2022-07-19 11:02:14,953 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 353 transitions. Word has length 61 [2022-07-19 11:02:14,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 11:02:14,953 INFO L495 AbstractCegarLoop]: Abstraction has 220 states and 353 transitions. [2022-07-19 11:02:14,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:02:14,953 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 353 transitions. [2022-07-19 11:02:14,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-19 11:02:14,955 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:02:14,955 INFO L195 NwaCegarLoop]: trace histogram [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-19 11:02:14,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-19 11:02:14,956 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:02:14,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:02:14,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1254725184, now seen corresponding path program 1 times [2022-07-19 11:02:14,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 11:02:14,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960313465] [2022-07-19 11:02:14,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:02:14,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 11:02:15,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 11:02:15,056 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 11:02:15,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 11:02:15,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960313465] [2022-07-19 11:02:15,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960313465] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 11:02:15,057 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 11:02:15,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 11:02:15,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500755571] [2022-07-19 11:02:15,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 11:02:15,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 11:02:15,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 11:02:15,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 11:02:15,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 11:02:15,058 INFO L87 Difference]: Start difference. First operand 220 states and 353 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 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-19 11:02:17,066 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 11:02:17,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 11:02:17,300 INFO L93 Difference]: Finished difference Result 435 states and 694 transitions. [2022-07-19 11:02:17,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 11:02:17,304 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2022-07-19 11:02:17,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 11:02:17,305 INFO L225 Difference]: With dead ends: 435 [2022-07-19 11:02:17,305 INFO L226 Difference]: Without dead ends: 236 [2022-07-19 11:02:17,306 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 11:02:17,307 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 21 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-19 11:02:17,309 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 452 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 146 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-07-19 11:02:17,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2022-07-19 11:02:17,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 220. [2022-07-19 11:02:17,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 219 states have (on average 1.6073059360730593) internal successors, (352), 219 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:02:17,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 352 transitions. [2022-07-19 11:02:17,327 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 352 transitions. Word has length 62 [2022-07-19 11:02:17,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 11:02:17,327 INFO L495 AbstractCegarLoop]: Abstraction has 220 states and 352 transitions. [2022-07-19 11:02:17,328 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 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-19 11:02:17,328 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 352 transitions. [2022-07-19 11:02:17,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-19 11:02:17,334 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:02:17,335 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-19 11:02:17,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-19 11:02:17,336 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:02:17,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:02:17,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1693511684, now seen corresponding path program 1 times [2022-07-19 11:02:17,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 11:02:17,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35202586] [2022-07-19 11:02:17,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:02:17,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 11:02:17,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 11:02:17,487 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 11:02:17,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 11:02:17,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35202586] [2022-07-19 11:02:17,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35202586] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 11:02:17,488 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 11:02:17,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 11:02:17,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940395273] [2022-07-19 11:02:17,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 11:02:17,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 11:02:17,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 11:02:17,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 11:02:17,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 11:02:17,491 INFO L87 Difference]: Start difference. First operand 220 states and 352 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 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-19 11:02:19,498 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 11:02:19,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 11:02:19,856 INFO L93 Difference]: Finished difference Result 519 states and 825 transitions. [2022-07-19 11:02:19,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 11:02:19,857 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2022-07-19 11:02:19,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 11:02:19,859 INFO L225 Difference]: With dead ends: 519 [2022-07-19 11:02:19,859 INFO L226 Difference]: Without dead ends: 320 [2022-07-19 11:02:19,860 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 11:02:19,860 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 139 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 62 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-19 11:02:19,861 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 311 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 261 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-07-19 11:02:19,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2022-07-19 11:02:19,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 221. [2022-07-19 11:02:19,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 220 states have (on average 1.5954545454545455) internal successors, (351), 220 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:02:19,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 351 transitions. [2022-07-19 11:02:19,869 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 351 transitions. Word has length 62 [2022-07-19 11:02:19,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 11:02:19,870 INFO L495 AbstractCegarLoop]: Abstraction has 221 states and 351 transitions. [2022-07-19 11:02:19,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 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-19 11:02:19,870 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 351 transitions. [2022-07-19 11:02:19,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-07-19 11:02:19,871 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:02:19,872 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, 1, 1, 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-19 11:02:19,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-19 11:02:19,872 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:02:19,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:02:19,873 INFO L85 PathProgramCache]: Analyzing trace with hash -1066809839, now seen corresponding path program 1 times [2022-07-19 11:02:19,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 11:02:19,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265121102] [2022-07-19 11:02:19,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:02:19,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 11:02:19,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 11:02:20,006 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-19 11:02:20,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 11:02:20,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265121102] [2022-07-19 11:02:20,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265121102] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 11:02:20,007 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 11:02:20,008 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 11:02:20,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144666913] [2022-07-19 11:02:20,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 11:02:20,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 11:02:20,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 11:02:20,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 11:02:20,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 11:02:20,011 INFO L87 Difference]: Start difference. First operand 221 states and 351 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 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-19 11:02:22,021 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 11:02:22,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 11:02:22,383 INFO L93 Difference]: Finished difference Result 519 states and 821 transitions. [2022-07-19 11:02:22,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 11:02:22,384 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 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 63 [2022-07-19 11:02:22,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 11:02:22,385 INFO L225 Difference]: With dead ends: 519 [2022-07-19 11:02:22,385 INFO L226 Difference]: Without dead ends: 319 [2022-07-19 11:02:22,386 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 11:02:22,387 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 144 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 61 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-19 11:02:22,387 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 313 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 259 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-07-19 11:02:22,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2022-07-19 11:02:22,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 221. [2022-07-19 11:02:22,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 220 states have (on average 1.5772727272727274) internal successors, (347), 220 states have internal predecessors, (347), 0 states have call successors, (0), 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-19 11:02:22,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 347 transitions. [2022-07-19 11:02:22,394 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 347 transitions. Word has length 63 [2022-07-19 11:02:22,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 11:02:22,394 INFO L495 AbstractCegarLoop]: Abstraction has 221 states and 347 transitions. [2022-07-19 11:02:22,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 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-19 11:02:22,395 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 347 transitions. [2022-07-19 11:02:22,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-07-19 11:02:22,396 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:02:22,396 INFO L195 NwaCegarLoop]: trace histogram [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-19 11:02:22,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-19 11:02:22,397 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:02:22,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:02:22,397 INFO L85 PathProgramCache]: Analyzing trace with hash 1102657701, now seen corresponding path program 1 times [2022-07-19 11:02:22,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 11:02:22,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544881672] [2022-07-19 11:02:22,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:02:22,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 11:02:22,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 11:02:22,504 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 11:02:22,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 11:02:22,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544881672] [2022-07-19 11:02:22,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544881672] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 11:02:22,505 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 11:02:22,505 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 11:02:22,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631218515] [2022-07-19 11:02:22,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 11:02:22,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 11:02:22,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 11:02:22,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 11:02:22,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 11:02:22,508 INFO L87 Difference]: Start difference. First operand 221 states and 347 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 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-19 11:02:23,672 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 11:02:23,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 11:02:23,910 INFO L93 Difference]: Finished difference Result 434 states and 682 transitions. [2022-07-19 11:02:23,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 11:02:23,910 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 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 63 [2022-07-19 11:02:23,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 11:02:23,912 INFO L225 Difference]: With dead ends: 434 [2022-07-19 11:02:23,912 INFO L226 Difference]: Without dead ends: 234 [2022-07-19 11:02:23,912 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 11:02:23,913 INFO L413 NwaCegarLoop]: 182 mSDtfsCounter, 24 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-07-19 11:02:23,913 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 458 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-07-19 11:02:23,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2022-07-19 11:02:23,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 221. [2022-07-19 11:02:23,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 220 states have (on average 1.5727272727272728) internal successors, (346), 220 states have internal predecessors, (346), 0 states have call successors, (0), 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-19 11:02:23,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 346 transitions. [2022-07-19 11:02:23,923 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 346 transitions. Word has length 63 [2022-07-19 11:02:23,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 11:02:23,923 INFO L495 AbstractCegarLoop]: Abstraction has 221 states and 346 transitions. [2022-07-19 11:02:23,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 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-19 11:02:23,924 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 346 transitions. [2022-07-19 11:02:23,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-07-19 11:02:23,925 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:02:23,925 INFO L195 NwaCegarLoop]: trace histogram [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-19 11:02:23,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-19 11:02:23,925 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:02:23,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:02:23,927 INFO L85 PathProgramCache]: Analyzing trace with hash -195504471, now seen corresponding path program 1 times [2022-07-19 11:02:23,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 11:02:23,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968706814] [2022-07-19 11:02:23,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:02:23,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 11:02:23,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 11:02:24,026 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 11:02:24,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 11:02:24,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968706814] [2022-07-19 11:02:24,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968706814] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 11:02:24,027 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 11:02:24,027 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 11:02:24,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731326531] [2022-07-19 11:02:24,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 11:02:24,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 11:02:24,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 11:02:24,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 11:02:24,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 11:02:24,031 INFO L87 Difference]: Start difference. First operand 221 states and 346 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 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-19 11:02:26,039 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 11:02:26,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 11:02:26,412 INFO L93 Difference]: Finished difference Result 519 states and 813 transitions. [2022-07-19 11:02:26,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 11:02:26,413 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 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 64 [2022-07-19 11:02:26,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 11:02:26,415 INFO L225 Difference]: With dead ends: 519 [2022-07-19 11:02:26,415 INFO L226 Difference]: Without dead ends: 319 [2022-07-19 11:02:26,415 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 11:02:26,416 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 141 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 61 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-07-19 11:02:26,416 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 313 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 259 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-07-19 11:02:26,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2022-07-19 11:02:26,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 221. [2022-07-19 11:02:26,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 220 states have (on average 1.5545454545454545) internal successors, (342), 220 states have internal predecessors, (342), 0 states have call successors, (0), 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-19 11:02:26,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 342 transitions. [2022-07-19 11:02:26,422 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 342 transitions. Word has length 64 [2022-07-19 11:02:26,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 11:02:26,424 INFO L495 AbstractCegarLoop]: Abstraction has 221 states and 342 transitions. [2022-07-19 11:02:26,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 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-19 11:02:26,425 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 342 transitions. [2022-07-19 11:02:26,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-19 11:02:26,426 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:02:26,426 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 11:02:26,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-19 11:02:26,427 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:02:26,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:02:26,428 INFO L85 PathProgramCache]: Analyzing trace with hash 307896966, now seen corresponding path program 1 times [2022-07-19 11:02:26,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 11:02:26,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045966484] [2022-07-19 11:02:26,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:02:26,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 11:02:26,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 11:02:26,558 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 11:02:26,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 11:02:26,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045966484] [2022-07-19 11:02:26,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045966484] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 11:02:26,560 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 11:02:26,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 11:02:26,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182786487] [2022-07-19 11:02:26,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 11:02:26,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 11:02:26,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 11:02:26,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 11:02:26,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 11:02:26,562 INFO L87 Difference]: Start difference. First operand 221 states and 342 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 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-19 11:02:28,569 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 11:02:28,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 11:02:28,918 INFO L93 Difference]: Finished difference Result 519 states and 806 transitions. [2022-07-19 11:02:28,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 11:02:28,919 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 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 65 [2022-07-19 11:02:28,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 11:02:28,920 INFO L225 Difference]: With dead ends: 519 [2022-07-19 11:02:28,920 INFO L226 Difference]: Without dead ends: 317 [2022-07-19 11:02:28,921 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 11:02:28,921 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 111 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 59 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-19 11:02:28,922 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 327 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 259 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-07-19 11:02:28,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2022-07-19 11:02:28,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 246. [2022-07-19 11:02:28,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 245 states have (on average 1.5959183673469388) internal successors, (391), 245 states have internal predecessors, (391), 0 states have call successors, (0), 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-19 11:02:28,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 391 transitions. [2022-07-19 11:02:28,931 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 391 transitions. Word has length 65 [2022-07-19 11:02:28,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 11:02:28,932 INFO L495 AbstractCegarLoop]: Abstraction has 246 states and 391 transitions. [2022-07-19 11:02:28,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 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-19 11:02:28,932 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 391 transitions. [2022-07-19 11:02:28,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-07-19 11:02:28,935 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:02:28,935 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 11:02:28,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-19 11:02:28,935 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:02:28,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:02:28,943 INFO L85 PathProgramCache]: Analyzing trace with hash -1634406600, now seen corresponding path program 1 times [2022-07-19 11:02:28,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 11:02:28,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084711874] [2022-07-19 11:02:28,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:02:28,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 11:02:29,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 11:02:29,042 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-19 11:02:29,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 11:02:29,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084711874] [2022-07-19 11:02:29,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084711874] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 11:02:29,043 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 11:02:29,043 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 11:02:29,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431032081] [2022-07-19 11:02:29,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 11:02:29,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 11:02:29,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 11:02:29,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 11:02:29,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 11:02:29,044 INFO L87 Difference]: Start difference. First operand 246 states and 391 transitions. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:02:30,295 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 11:02:30,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 11:02:30,528 INFO L93 Difference]: Finished difference Result 511 states and 814 transitions. [2022-07-19 11:02:30,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 11:02:30,528 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2022-07-19 11:02:30,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 11:02:30,530 INFO L225 Difference]: With dead ends: 511 [2022-07-19 11:02:30,530 INFO L226 Difference]: Without dead ends: 286 [2022-07-19 11:02:30,530 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 11:02:30,531 INFO L413 NwaCegarLoop]: 203 mSDtfsCounter, 30 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-07-19 11:02:30,531 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 506 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-07-19 11:02:30,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2022-07-19 11:02:30,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 268. [2022-07-19 11:02:30,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 267 states have (on average 1.591760299625468) internal successors, (425), 267 states have internal predecessors, (425), 0 states have call successors, (0), 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-19 11:02:30,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 425 transitions. [2022-07-19 11:02:30,537 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 425 transitions. Word has length 94 [2022-07-19 11:02:30,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 11:02:30,537 INFO L495 AbstractCegarLoop]: Abstraction has 268 states and 425 transitions. [2022-07-19 11:02:30,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:02:30,538 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 425 transitions. [2022-07-19 11:02:30,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-07-19 11:02:30,538 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:02:30,539 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 11:02:30,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-19 11:02:30,540 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:02:30,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:02:30,540 INFO L85 PathProgramCache]: Analyzing trace with hash 217673300, now seen corresponding path program 1 times [2022-07-19 11:02:30,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 11:02:30,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932781858] [2022-07-19 11:02:30,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:02:30,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 11:02:30,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 11:02:30,647 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-19 11:02:30,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 11:02:30,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932781858] [2022-07-19 11:02:30,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932781858] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 11:02:30,649 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 11:02:30,650 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 11:02:30,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74075117] [2022-07-19 11:02:30,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 11:02:30,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 11:02:30,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 11:02:30,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 11:02:30,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 11:02:30,652 INFO L87 Difference]: Start difference. First operand 268 states and 425 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 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-19 11:02:32,658 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 11:02:32,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 11:02:32,875 INFO L93 Difference]: Finished difference Result 528 states and 840 transitions. [2022-07-19 11:02:32,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 11:02:32,875 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 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 94 [2022-07-19 11:02:32,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 11:02:32,877 INFO L225 Difference]: With dead ends: 528 [2022-07-19 11:02:32,877 INFO L226 Difference]: Without dead ends: 281 [2022-07-19 11:02:32,877 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 11:02:32,878 INFO L413 NwaCegarLoop]: 182 mSDtfsCounter, 20 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-19 11:02:32,878 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 458 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 140 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-07-19 11:02:32,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2022-07-19 11:02:32,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 268. [2022-07-19 11:02:32,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 267 states have (on average 1.5880149812734083) internal successors, (424), 267 states have internal predecessors, (424), 0 states have call successors, (0), 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-19 11:02:32,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 424 transitions. [2022-07-19 11:02:32,885 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 424 transitions. Word has length 94 [2022-07-19 11:02:32,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 11:02:32,885 INFO L495 AbstractCegarLoop]: Abstraction has 268 states and 424 transitions. [2022-07-19 11:02:32,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 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-19 11:02:32,886 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 424 transitions. [2022-07-19 11:02:32,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-07-19 11:02:32,887 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:02:32,888 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 11:02:32,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-19 11:02:32,888 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:02:32,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:02:32,889 INFO L85 PathProgramCache]: Analyzing trace with hash 1724300080, now seen corresponding path program 1 times [2022-07-19 11:02:32,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 11:02:32,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217116219] [2022-07-19 11:02:32,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:02:32,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 11:02:32,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 11:02:33,014 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-19 11:02:33,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 11:02:33,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217116219] [2022-07-19 11:02:33,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217116219] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 11:02:33,015 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 11:02:33,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 11:02:33,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34147811] [2022-07-19 11:02:33,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 11:02:33,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 11:02:33,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 11:02:33,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 11:02:33,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 11:02:33,017 INFO L87 Difference]: Start difference. First operand 268 states and 424 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 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-19 11:02:35,033 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 11:02:35,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 11:02:35,226 INFO L93 Difference]: Finished difference Result 518 states and 826 transitions. [2022-07-19 11:02:35,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 11:02:35,227 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 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 95 [2022-07-19 11:02:35,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 11:02:35,228 INFO L225 Difference]: With dead ends: 518 [2022-07-19 11:02:35,228 INFO L226 Difference]: Without dead ends: 271 [2022-07-19 11:02:35,228 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 11:02:35,229 INFO L413 NwaCegarLoop]: 189 mSDtfsCounter, 11 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-19 11:02:35,229 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 472 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 126 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-07-19 11:02:35,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2022-07-19 11:02:35,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 268. [2022-07-19 11:02:35,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 267 states have (on average 1.5842696629213484) internal successors, (423), 267 states have internal predecessors, (423), 0 states have call successors, (0), 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-19 11:02:35,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 423 transitions. [2022-07-19 11:02:35,235 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 423 transitions. Word has length 95 [2022-07-19 11:02:35,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 11:02:35,236 INFO L495 AbstractCegarLoop]: Abstraction has 268 states and 423 transitions. [2022-07-19 11:02:35,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 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-19 11:02:35,236 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 423 transitions. [2022-07-19 11:02:35,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-07-19 11:02:35,237 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:02:35,237 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2022-07-19 11:02:35,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-19 11:02:35,238 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:02:35,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:02:35,238 INFO L85 PathProgramCache]: Analyzing trace with hash -1693697111, now seen corresponding path program 1 times [2022-07-19 11:02:35,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 11:02:35,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977784851] [2022-07-19 11:02:35,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:02:35,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 11:02:35,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 11:02:35,331 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-19 11:02:35,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 11:02:35,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977784851] [2022-07-19 11:02:35,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977784851] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 11:02:35,332 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 11:02:35,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 11:02:35,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206787151] [2022-07-19 11:02:35,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 11:02:35,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 11:02:35,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 11:02:35,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 11:02:35,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 11:02:35,333 INFO L87 Difference]: Start difference. First operand 268 states and 423 transitions. Second operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 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-19 11:02:37,341 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 11:02:37,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 11:02:37,574 INFO L93 Difference]: Finished difference Result 532 states and 844 transitions. [2022-07-19 11:02:37,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 11:02:37,574 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 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 108 [2022-07-19 11:02:37,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 11:02:37,576 INFO L225 Difference]: With dead ends: 532 [2022-07-19 11:02:37,576 INFO L226 Difference]: Without dead ends: 285 [2022-07-19 11:02:37,576 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 11:02:37,577 INFO L413 NwaCegarLoop]: 190 mSDtfsCounter, 33 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-19 11:02:37,577 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 478 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 158 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-07-19 11:02:37,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2022-07-19 11:02:37,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 268. [2022-07-19 11:02:37,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 267 states have (on average 1.5805243445692885) internal successors, (422), 267 states have internal predecessors, (422), 0 states have call successors, (0), 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-19 11:02:37,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 422 transitions. [2022-07-19 11:02:37,583 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 422 transitions. Word has length 108 [2022-07-19 11:02:37,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 11:02:37,583 INFO L495 AbstractCegarLoop]: Abstraction has 268 states and 422 transitions. [2022-07-19 11:02:37,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 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-19 11:02:37,586 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 422 transitions. [2022-07-19 11:02:37,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-07-19 11:02:37,588 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:02:37,588 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2022-07-19 11:02:37,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-19 11:02:37,588 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:02:37,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:02:37,589 INFO L85 PathProgramCache]: Analyzing trace with hash 778760430, now seen corresponding path program 1 times [2022-07-19 11:02:37,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 11:02:37,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476079934] [2022-07-19 11:02:37,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:02:37,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 11:02:37,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 11:02:37,690 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-19 11:02:37,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 11:02:37,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476079934] [2022-07-19 11:02:37,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476079934] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 11:02:37,691 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 11:02:37,691 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 11:02:37,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137135679] [2022-07-19 11:02:37,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 11:02:37,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 11:02:37,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 11:02:37,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 11:02:37,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 11:02:37,693 INFO L87 Difference]: Start difference. First operand 268 states and 422 transitions. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 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-19 11:02:39,708 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 11:02:40,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 11:02:40,075 INFO L93 Difference]: Finished difference Result 586 states and 915 transitions. [2022-07-19 11:02:40,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 11:02:40,076 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 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 109 [2022-07-19 11:02:40,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 11:02:40,077 INFO L225 Difference]: With dead ends: 586 [2022-07-19 11:02:40,077 INFO L226 Difference]: Without dead ends: 339 [2022-07-19 11:02:40,078 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 11:02:40,078 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 140 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 60 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-07-19 11:02:40,078 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 331 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 257 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-07-19 11:02:40,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2022-07-19 11:02:40,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 268. [2022-07-19 11:02:40,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 267 states have (on average 1.5655430711610487) internal successors, (418), 267 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:02:40,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 418 transitions. [2022-07-19 11:02:40,085 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 418 transitions. Word has length 109 [2022-07-19 11:02:40,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 11:02:40,085 INFO L495 AbstractCegarLoop]: Abstraction has 268 states and 418 transitions. [2022-07-19 11:02:40,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 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-19 11:02:40,085 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 418 transitions. [2022-07-19 11:02:40,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-07-19 11:02:40,086 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:02:40,086 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2022-07-19 11:02:40,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-19 11:02:40,087 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:02:40,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:02:40,087 INFO L85 PathProgramCache]: Analyzing trace with hash -1220545399, now seen corresponding path program 1 times [2022-07-19 11:02:40,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 11:02:40,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759877872] [2022-07-19 11:02:40,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:02:40,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 11:02:40,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 11:02:40,214 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-19 11:02:40,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 11:02:40,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759877872] [2022-07-19 11:02:40,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759877872] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 11:02:40,215 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 11:02:40,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 11:02:40,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202660715] [2022-07-19 11:02:40,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 11:02:40,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 11:02:40,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 11:02:40,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 11:02:40,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 11:02:40,217 INFO L87 Difference]: Start difference. First operand 268 states and 418 transitions. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:02:42,233 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 11:02:42,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 11:02:42,592 INFO L93 Difference]: Finished difference Result 586 states and 907 transitions. [2022-07-19 11:02:42,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 11:02:42,593 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2022-07-19 11:02:42,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 11:02:42,594 INFO L225 Difference]: With dead ends: 586 [2022-07-19 11:02:42,594 INFO L226 Difference]: Without dead ends: 339 [2022-07-19 11:02:42,595 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 11:02:42,595 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 137 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 60 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-07-19 11:02:42,596 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 331 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 257 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-07-19 11:02:42,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2022-07-19 11:02:42,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 268. [2022-07-19 11:02:42,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 267 states have (on average 1.550561797752809) internal successors, (414), 267 states have internal predecessors, (414), 0 states have call successors, (0), 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-19 11:02:42,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 414 transitions. [2022-07-19 11:02:42,602 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 414 transitions. Word has length 111 [2022-07-19 11:02:42,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 11:02:42,603 INFO L495 AbstractCegarLoop]: Abstraction has 268 states and 414 transitions. [2022-07-19 11:02:42,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:02:42,603 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 414 transitions. [2022-07-19 11:02:42,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-07-19 11:02:42,604 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:02:42,604 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 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] [2022-07-19 11:02:42,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-19 11:02:42,604 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:02:42,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:02:42,605 INFO L85 PathProgramCache]: Analyzing trace with hash 89193371, now seen corresponding path program 1 times [2022-07-19 11:02:42,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 11:02:42,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681591093] [2022-07-19 11:02:42,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:02:42,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 11:02:42,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 11:02:42,727 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-19 11:02:42,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 11:02:42,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681591093] [2022-07-19 11:02:42,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681591093] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 11:02:42,728 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 11:02:42,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 11:02:42,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487988436] [2022-07-19 11:02:42,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 11:02:42,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 11:02:42,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 11:02:42,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 11:02:42,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 11:02:42,730 INFO L87 Difference]: Start difference. First operand 268 states and 414 transitions. Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 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-19 11:02:44,737 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 11:02:44,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 11:02:44,924 INFO L93 Difference]: Finished difference Result 522 states and 813 transitions. [2022-07-19 11:02:44,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 11:02:44,925 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 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 112 [2022-07-19 11:02:44,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 11:02:44,926 INFO L225 Difference]: With dead ends: 522 [2022-07-19 11:02:44,926 INFO L226 Difference]: Without dead ends: 275 [2022-07-19 11:02:44,927 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 11:02:44,927 INFO L413 NwaCegarLoop]: 197 mSDtfsCounter, 26 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-19 11:02:44,928 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 492 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 144 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-07-19 11:02:44,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2022-07-19 11:02:44,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 268. [2022-07-19 11:02:44,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 267 states have (on average 1.546816479400749) internal successors, (413), 267 states have internal predecessors, (413), 0 states have call successors, (0), 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-19 11:02:44,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 413 transitions. [2022-07-19 11:02:44,934 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 413 transitions. Word has length 112 [2022-07-19 11:02:44,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 11:02:44,935 INFO L495 AbstractCegarLoop]: Abstraction has 268 states and 413 transitions. [2022-07-19 11:02:44,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 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-19 11:02:44,935 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 413 transitions. [2022-07-19 11:02:44,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-07-19 11:02:44,936 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:02:44,936 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 11:02:44,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-19 11:02:44,937 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:02:44,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:02:44,937 INFO L85 PathProgramCache]: Analyzing trace with hash -1884563494, now seen corresponding path program 1 times [2022-07-19 11:02:44,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 11:02:44,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601196724] [2022-07-19 11:02:44,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:02:44,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 11:02:44,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 11:02:45,040 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-19 11:02:45,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 11:02:45,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601196724] [2022-07-19 11:02:45,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601196724] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 11:02:45,041 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 11:02:45,041 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 11:02:45,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500535855] [2022-07-19 11:02:45,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 11:02:45,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 11:02:45,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 11:02:45,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 11:02:45,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 11:02:45,043 INFO L87 Difference]: Start difference. First operand 268 states and 413 transitions. Second operand has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 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-19 11:02:47,050 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 11:02:47,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 11:02:47,367 INFO L93 Difference]: Finished difference Result 624 states and 964 transitions. [2022-07-19 11:02:47,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 11:02:47,367 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 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 116 [2022-07-19 11:02:47,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 11:02:47,369 INFO L225 Difference]: With dead ends: 624 [2022-07-19 11:02:47,369 INFO L226 Difference]: Without dead ends: 377 [2022-07-19 11:02:47,370 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 11:02:47,370 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 116 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 47 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-19 11:02:47,370 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 325 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 252 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-07-19 11:02:47,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2022-07-19 11:02:47,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 300. [2022-07-19 11:02:47,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 299 states have (on average 1.5518394648829432) internal successors, (464), 299 states have internal predecessors, (464), 0 states have call successors, (0), 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-19 11:02:47,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 464 transitions. [2022-07-19 11:02:47,378 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 464 transitions. Word has length 116 [2022-07-19 11:02:47,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 11:02:47,378 INFO L495 AbstractCegarLoop]: Abstraction has 300 states and 464 transitions. [2022-07-19 11:02:47,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 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-19 11:02:47,379 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 464 transitions. [2022-07-19 11:02:47,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-07-19 11:02:47,380 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:02:47,380 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 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-19 11:02:47,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-19 11:02:47,380 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:02:47,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:02:47,381 INFO L85 PathProgramCache]: Analyzing trace with hash -220313936, now seen corresponding path program 1 times [2022-07-19 11:02:47,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 11:02:47,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988714295] [2022-07-19 11:02:47,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:02:47,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 11:02:47,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 11:02:47,487 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-19 11:02:47,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 11:02:47,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988714295] [2022-07-19 11:02:47,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988714295] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 11:02:47,488 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 11:02:47,488 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 11:02:47,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966551034] [2022-07-19 11:02:47,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 11:02:47,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 11:02:47,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 11:02:47,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 11:02:47,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 11:02:47,490 INFO L87 Difference]: Start difference. First operand 300 states and 464 transitions. Second operand has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:02:49,497 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 11:02:49,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 11:02:49,834 INFO L93 Difference]: Finished difference Result 694 states and 1072 transitions. [2022-07-19 11:02:49,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 11:02:49,835 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 127 [2022-07-19 11:02:49,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 11:02:49,836 INFO L225 Difference]: With dead ends: 694 [2022-07-19 11:02:49,836 INFO L226 Difference]: Without dead ends: 415 [2022-07-19 11:02:49,837 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 11:02:49,837 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 109 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 56 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-19 11:02:49,838 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 315 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 262 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-07-19 11:02:49,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2022-07-19 11:02:49,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 343. [2022-07-19 11:02:49,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 342 states have (on average 1.5614035087719298) internal successors, (534), 342 states have internal predecessors, (534), 0 states have call successors, (0), 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-19 11:02:49,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 534 transitions. [2022-07-19 11:02:49,845 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 534 transitions. Word has length 127 [2022-07-19 11:02:49,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 11:02:49,846 INFO L495 AbstractCegarLoop]: Abstraction has 343 states and 534 transitions. [2022-07-19 11:02:49,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:02:49,846 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 534 transitions. [2022-07-19 11:02:49,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-07-19 11:02:49,847 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:02:49,847 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 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-19 11:02:49,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-19 11:02:49,847 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:02:49,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:02:49,848 INFO L85 PathProgramCache]: Analyzing trace with hash 1658817010, now seen corresponding path program 1 times [2022-07-19 11:02:49,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 11:02:49,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279922835] [2022-07-19 11:02:49,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:02:49,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 11:02:49,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 11:02:49,962 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-07-19 11:02:49,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 11:02:49,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279922835] [2022-07-19 11:02:49,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279922835] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 11:02:49,963 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 11:02:49,963 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 11:02:49,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005198648] [2022-07-19 11:02:49,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 11:02:49,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 11:02:49,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 11:02:49,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 11:02:49,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 11:02:49,964 INFO L87 Difference]: Start difference. First operand 343 states and 534 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 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-19 11:02:49,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 11:02:49,994 INFO L93 Difference]: Finished difference Result 987 states and 1552 transitions. [2022-07-19 11:02:49,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 11:02:49,995 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 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 127 [2022-07-19 11:02:49,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 11:02:49,998 INFO L225 Difference]: With dead ends: 987 [2022-07-19 11:02:49,998 INFO L226 Difference]: Without dead ends: 665 [2022-07-19 11:02:49,999 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-19 11:02:49,999 INFO L413 NwaCegarLoop]: 368 mSDtfsCounter, 143 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 558 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 11:02:49,999 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 558 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 11:02:50,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2022-07-19 11:02:50,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 663. [2022-07-19 11:02:50,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 663 states, 662 states have (on average 1.566465256797583) internal successors, (1037), 662 states have internal predecessors, (1037), 0 states have call successors, (0), 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-19 11:02:50,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 1037 transitions. [2022-07-19 11:02:50,014 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 1037 transitions. Word has length 127 [2022-07-19 11:02:50,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 11:02:50,014 INFO L495 AbstractCegarLoop]: Abstraction has 663 states and 1037 transitions. [2022-07-19 11:02:50,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 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-19 11:02:50,015 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 1037 transitions. [2022-07-19 11:02:50,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-07-19 11:02:50,016 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:02:50,016 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 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-19 11:02:50,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-19 11:02:50,017 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:02:50,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:02:50,017 INFO L85 PathProgramCache]: Analyzing trace with hash -390570832, now seen corresponding path program 1 times [2022-07-19 11:02:50,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 11:02:50,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498866015] [2022-07-19 11:02:50,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:02:50,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 11:02:50,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 11:02:50,124 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-19 11:02:50,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 11:02:50,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498866015] [2022-07-19 11:02:50,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498866015] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 11:02:50,125 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 11:02:50,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 11:02:50,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894688301] [2022-07-19 11:02:50,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 11:02:50,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 11:02:50,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 11:02:50,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 11:02:50,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 11:02:50,127 INFO L87 Difference]: Start difference. First operand 663 states and 1037 transitions. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:02:50,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 11:02:50,159 INFO L93 Difference]: Finished difference Result 1580 states and 2483 transitions. [2022-07-19 11:02:50,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 11:02:50,159 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 127 [2022-07-19 11:02:50,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 11:02:50,163 INFO L225 Difference]: With dead ends: 1580 [2022-07-19 11:02:50,163 INFO L226 Difference]: Without dead ends: 938 [2022-07-19 11:02:50,164 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-19 11:02:50,164 INFO L413 NwaCegarLoop]: 241 mSDtfsCounter, 138 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 11:02:50,165 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 431 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 11:02:50,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 938 states. [2022-07-19 11:02:50,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 938 to 938. [2022-07-19 11:02:50,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 938 states, 937 states have (on average 1.5635005336179295) internal successors, (1465), 937 states have internal predecessors, (1465), 0 states have call successors, (0), 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-19 11:02:50,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 938 states to 938 states and 1465 transitions. [2022-07-19 11:02:50,184 INFO L78 Accepts]: Start accepts. Automaton has 938 states and 1465 transitions. Word has length 127 [2022-07-19 11:02:50,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 11:02:50,184 INFO L495 AbstractCegarLoop]: Abstraction has 938 states and 1465 transitions. [2022-07-19 11:02:50,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:02:50,185 INFO L276 IsEmpty]: Start isEmpty. Operand 938 states and 1465 transitions. [2022-07-19 11:02:50,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-07-19 11:02:50,187 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:02:50,187 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 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-19 11:02:50,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-19 11:02:50,187 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:02:50,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:02:50,188 INFO L85 PathProgramCache]: Analyzing trace with hash 1945821678, now seen corresponding path program 1 times [2022-07-19 11:02:50,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 11:02:50,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066036659] [2022-07-19 11:02:50,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:02:50,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 11:02:50,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 11:02:50,294 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-07-19 11:02:50,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 11:02:50,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066036659] [2022-07-19 11:02:50,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066036659] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 11:02:50,295 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 11:02:50,295 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 11:02:50,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753296828] [2022-07-19 11:02:50,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 11:02:50,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 11:02:50,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 11:02:50,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 11:02:50,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 11:02:50,297 INFO L87 Difference]: Start difference. First operand 938 states and 1465 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:02:50,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 11:02:50,323 INFO L93 Difference]: Finished difference Result 1882 states and 2942 transitions. [2022-07-19 11:02:50,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 11:02:50,323 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 127 [2022-07-19 11:02:50,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 11:02:50,327 INFO L225 Difference]: With dead ends: 1882 [2022-07-19 11:02:50,327 INFO L226 Difference]: Without dead ends: 965 [2022-07-19 11:02:50,328 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-19 11:02:50,329 INFO L413 NwaCegarLoop]: 214 mSDtfsCounter, 15 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 11:02:50,329 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 404 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 11:02:50,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 965 states. [2022-07-19 11:02:50,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 965 to 965. [2022-07-19 11:02:50,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 965 states, 964 states have (on average 1.5560165975103735) internal successors, (1500), 964 states have internal predecessors, (1500), 0 states have call successors, (0), 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-19 11:02:50,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965 states to 965 states and 1500 transitions. [2022-07-19 11:02:50,350 INFO L78 Accepts]: Start accepts. Automaton has 965 states and 1500 transitions. Word has length 127 [2022-07-19 11:02:50,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 11:02:50,350 INFO L495 AbstractCegarLoop]: Abstraction has 965 states and 1500 transitions. [2022-07-19 11:02:50,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:02:50,351 INFO L276 IsEmpty]: Start isEmpty. Operand 965 states and 1500 transitions. [2022-07-19 11:02:50,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-07-19 11:02:50,353 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:02:50,353 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 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-19 11:02:50,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-19 11:02:50,353 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:02:50,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:02:50,354 INFO L85 PathProgramCache]: Analyzing trace with hash 1322540076, now seen corresponding path program 1 times [2022-07-19 11:02:50,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 11:02:50,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081606151] [2022-07-19 11:02:50,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:02:50,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 11:02:50,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 11:02:50,434 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2022-07-19 11:02:50,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 11:02:50,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081606151] [2022-07-19 11:02:50,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081606151] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 11:02:50,435 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 11:02:50,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 11:02:50,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629594477] [2022-07-19 11:02:50,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 11:02:50,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 11:02:50,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 11:02:50,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 11:02:50,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 11:02:50,436 INFO L87 Difference]: Start difference. First operand 965 states and 1500 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:02:50,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 11:02:50,456 INFO L93 Difference]: Finished difference Result 1591 states and 2470 transitions. [2022-07-19 11:02:50,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 11:02:50,456 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 127 [2022-07-19 11:02:50,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 11:02:50,459 INFO L225 Difference]: With dead ends: 1591 [2022-07-19 11:02:50,459 INFO L226 Difference]: Without dead ends: 647 [2022-07-19 11:02:50,460 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-19 11:02:50,461 INFO L413 NwaCegarLoop]: 200 mSDtfsCounter, 4 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 11:02:50,461 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 381 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 11:02:50,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2022-07-19 11:02:50,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 647. [2022-07-19 11:02:50,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 647 states, 646 states have (on average 1.5386996904024768) internal successors, (994), 646 states have internal predecessors, (994), 0 states have call successors, (0), 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-19 11:02:50,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 994 transitions. [2022-07-19 11:02:50,475 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 994 transitions. Word has length 127 [2022-07-19 11:02:50,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 11:02:50,475 INFO L495 AbstractCegarLoop]: Abstraction has 647 states and 994 transitions. [2022-07-19 11:02:50,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:02:50,475 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 994 transitions. [2022-07-19 11:02:50,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-07-19 11:02:50,477 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:02:50,477 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 11:02:50,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-19 11:02:50,477 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:02:50,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:02:50,478 INFO L85 PathProgramCache]: Analyzing trace with hash -116280318, now seen corresponding path program 1 times [2022-07-19 11:02:50,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 11:02:50,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211431369] [2022-07-19 11:02:50,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:02:50,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 11:02:50,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 11:02:50,831 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2022-07-19 11:02:50,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 11:02:50,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211431369] [2022-07-19 11:02:50,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211431369] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 11:02:50,832 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 11:02:50,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 11:02:50,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221366398] [2022-07-19 11:02:50,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 11:02:50,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 11:02:50,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 11:02:50,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 11:02:50,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 11:02:50,834 INFO L87 Difference]: Start difference. First operand 647 states and 994 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 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-19 11:02:52,841 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 11:02:54,864 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 11:02:55,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 11:02:55,176 INFO L93 Difference]: Finished difference Result 1291 states and 1984 transitions. [2022-07-19 11:02:55,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 11:02:55,177 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 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 128 [2022-07-19 11:02:55,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 11:02:55,179 INFO L225 Difference]: With dead ends: 1291 [2022-07-19 11:02:55,179 INFO L226 Difference]: Without dead ends: 647 [2022-07-19 11:02:55,180 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-19 11:02:55,181 INFO L413 NwaCegarLoop]: 197 mSDtfsCounter, 7 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-07-19 11:02:55,181 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 635 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 166 Invalid, 2 Unknown, 0 Unchecked, 4.3s Time] [2022-07-19 11:02:55,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2022-07-19 11:02:55,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 647. [2022-07-19 11:02:55,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 647 states, 646 states have (on average 1.5371517027863777) internal successors, (993), 646 states have internal predecessors, (993), 0 states have call successors, (0), 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-19 11:02:55,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 993 transitions. [2022-07-19 11:02:55,193 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 993 transitions. Word has length 128 [2022-07-19 11:02:55,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 11:02:55,194 INFO L495 AbstractCegarLoop]: Abstraction has 647 states and 993 transitions. [2022-07-19 11:02:55,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 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-19 11:02:55,194 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 993 transitions. [2022-07-19 11:02:55,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-07-19 11:02:55,196 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:02:55,196 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 11:02:55,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-19 11:02:55,196 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:02:55,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:02:55,197 INFO L85 PathProgramCache]: Analyzing trace with hash -545938624, now seen corresponding path program 1 times [2022-07-19 11:02:55,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 11:02:55,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677811345] [2022-07-19 11:02:55,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:02:55,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 11:02:55,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-19 11:02:55,599 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-19 11:02:55,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-19 11:02:55,849 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-19 11:02:55,849 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-19 11:02:55,850 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-19 11:02:55,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-19 11:02:55,856 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] [2022-07-19 11:02:55,860 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-19 11:02:55,998 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.07 11:02:55 BoogieIcfgContainer [2022-07-19 11:02:55,998 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-19 11:02:55,999 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-19 11:02:55,999 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-19 11:02:55,999 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-19 11:02:56,000 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 11:02:06" (3/4) ... [2022-07-19 11:02:56,002 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-19 11:02:56,002 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-19 11:02:56,003 INFO L158 Benchmark]: Toolchain (without parser) took 53519.05ms. Allocated memory was 98.6MB in the beginning and 151.0MB in the end (delta: 52.4MB). Free memory was 67.8MB in the beginning and 56.8MB in the end (delta: 11.0MB). Peak memory consumption was 61.5MB. Max. memory is 16.1GB. [2022-07-19 11:02:56,003 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 98.6MB. Free memory is still 57.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 11:02:56,003 INFO L158 Benchmark]: CACSL2BoogieTranslator took 614.23ms. Allocated memory is still 98.6MB. Free memory was 67.6MB in the beginning and 53.2MB in the end (delta: 14.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-07-19 11:02:56,003 INFO L158 Benchmark]: Boogie Procedure Inliner took 96.63ms. Allocated memory is still 98.6MB. Free memory was 53.2MB in the beginning and 48.4MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-19 11:02:56,003 INFO L158 Benchmark]: Boogie Preprocessor took 129.99ms. Allocated memory was 98.6MB in the beginning and 119.5MB in the end (delta: 21.0MB). Free memory was 48.4MB in the beginning and 88.2MB in the end (delta: -39.8MB). Peak memory consumption was 11.3MB. Max. memory is 16.1GB. [2022-07-19 11:02:56,004 INFO L158 Benchmark]: RCFGBuilder took 2988.33ms. Allocated memory is still 119.5MB. Free memory was 88.2MB in the beginning and 57.8MB in the end (delta: 30.4MB). Peak memory consumption was 48.4MB. Max. memory is 16.1GB. [2022-07-19 11:02:56,004 INFO L158 Benchmark]: TraceAbstraction took 49679.72ms. Allocated memory was 119.5MB in the beginning and 151.0MB in the end (delta: 31.5MB). Free memory was 57.4MB in the beginning and 56.8MB in the end (delta: 583.6kB). Peak memory consumption was 57.2MB. Max. memory is 16.1GB. [2022-07-19 11:02:56,004 INFO L158 Benchmark]: Witness Printer took 3.32ms. Allocated memory is still 151.0MB. Free memory is still 56.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 11:02:56,005 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.20ms. Allocated memory is still 98.6MB. Free memory is still 57.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 614.23ms. Allocated memory is still 98.6MB. Free memory was 67.6MB in the beginning and 53.2MB in the end (delta: 14.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 96.63ms. Allocated memory is still 98.6MB. Free memory was 53.2MB in the beginning and 48.4MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 129.99ms. Allocated memory was 98.6MB in the beginning and 119.5MB in the end (delta: 21.0MB). Free memory was 48.4MB in the beginning and 88.2MB in the end (delta: -39.8MB). Peak memory consumption was 11.3MB. Max. memory is 16.1GB. * RCFGBuilder took 2988.33ms. Allocated memory is still 119.5MB. Free memory was 88.2MB in the beginning and 57.8MB in the end (delta: 30.4MB). Peak memory consumption was 48.4MB. Max. memory is 16.1GB. * TraceAbstraction took 49679.72ms. Allocated memory was 119.5MB in the beginning and 151.0MB in the end (delta: 31.5MB). Free memory was 57.4MB in the beginning and 56.8MB in the end (delta: 583.6kB). Peak memory consumption was 57.2MB. Max. memory is 16.1GB. * Witness Printer took 3.32ms. Allocated memory is still 151.0MB. Free memory is still 56.8MB. There was no memory consumed. 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 - UnprovableResult [Line: 1737]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 1151. Possible FailurePath: [L1054] static int init = 1; [L1055] static SSL_METHOD SSLv3_server_data ; VAL [init=1, SSLv3_server_data={4:0}] [L1077] SSL *s ; [L1078] int tmp ; [L1082] s = malloc(sizeof(SSL)) [L1083] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1084] s->ctx = malloc(sizeof(SSL_CTX)) [L1085] s->session = malloc(sizeof(SSL_SESSION)) [L1086] s->state = 8464 [L1088] s->info_callback = (void (*) ()) __VERIFIER_nondet_ulong() [L1089] s->options = __VERIFIER_nondet_ulong() [L1090] s->verify_mode = __VERIFIER_nondet_int() [L1091] EXPR s->session [L1091] (s->session)->peer = (struct x509_st*) __VERIFIER_nondet_ulong() [L1092] EXPR s->s3 [L1092] (s->s3)->tmp.cert_request = __VERIFIER_nondet_int() [L1093] EXPR s->s3 [L1093] (s->s3)->tmp.new_cipher = malloc(sizeof(struct ssl_cipher_st)) [L1094] EXPR s->s3 [L1094] EXPR (s->s3)->tmp.new_cipher [L1094] ((s->s3)->tmp.new_cipher)->algorithms = __VERIFIER_nondet_ulong() [L1095] EXPR s->s3 [L1095] EXPR (s->s3)->tmp.new_cipher [L1095] ((s->s3)->tmp.new_cipher)->algo_strength = __VERIFIER_nondet_ulong() [L1096] COND FALSE !(__VERIFIER_nondet_int()) [L1102] s->cert = malloc(sizeof(struct cert_st)) [L1103] EXPR s->cert [L1103] (s->cert)->pkeys[0].privatekey = (struct evp_pkey_st*) __VERIFIER_nondet_ulong() [L1106] CALL ssl3_accept(s) [L1112] BUF_MEM *buf = (BUF_MEM *)__VERIFIER_nondet_ulong(); [L1113] unsigned long l ; [L1114] unsigned long Time ; [L1115] unsigned long tmp = __VERIFIER_nondet_long() ; [L1116] void (*cb)() ; [L1117] long num1 ; [L1118] int ret ; [L1119] int new_state ; [L1120] int state ; [L1121] int skip ; [L1122] int got_new_session ; [L1123] int tmp___1 = __VERIFIER_nondet_int() ; [L1124] int tmp___2 = __VERIFIER_nondet_int() ; [L1125] int tmp___3 ; [L1126] int tmp___4 ; [L1127] int tmp___5 ; [L1128] int tmp___6 ; [L1129] int tmp___7 ; [L1130] long tmp___8 = __VERIFIER_nondet_long() ; [L1131] int tmp___9 ; [L1132] int tmp___10 ; [L1133] int blastFlag ; [L1137] blastFlag = 0 [L1138] s->hit=__VERIFIER_nondet_int () [L1139] s->state = 8464 [L1140] Time = tmp [L1141] cb = (void (*)())((void *)0) [L1142] ret = -1 [L1143] skip = 0 [L1144] got_new_session = 0 [L1145] EXPR s->info_callback VAL [={0:0}, blastFlag=0, buf={0:-1}, got_new_session=0, init=1, ret=-1, s={-6:0}, s={-6:0}, s->info_callback={0:5}, skip=0, SSLv3_server_data={4:0}, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1145] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1146] EXPR s->info_callback [L1146] cb = s->info_callback [L1150] EXPR s->in_handshake [L1150] s->in_handshake += 1 [L1151] COND FALSE !(tmp___1 & 12288) VAL [={0:5}, blastFlag=0, buf={0:-1}, got_new_session=0, init=1, ret=-1, s={-6:0}, s={-6:0}, skip=0, SSLv3_server_data={4:0}, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1160] EXPR s->cert VAL [={0:5}, blastFlag=0, buf={0:-1}, got_new_session=0, init=1, ret=-1, s={-6:0}, s={-6:0}, s->cert={-4294967295:0}, skip=0, SSLv3_server_data={4:0}, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1160] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1166] COND TRUE 1 VAL [={0:5}, blastFlag=0, buf={0:-1}, got_new_session=0, init=1, ret=-1, s={-6:0}, s={-6:0}, skip=0, SSLv3_server_data={4:0}, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1168] EXPR s->state [L1168] state = s->state [L1169] EXPR s->state VAL [={0:5}, blastFlag=0, buf={0:-1}, got_new_session=0, init=1, ret=-1, s={-6:0}, s={-6:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1169] COND FALSE !(s->state == 12292) [L1172] EXPR s->state VAL [={0:5}, blastFlag=0, buf={0:-1}, got_new_session=0, init=1, ret=-1, s={-6:0}, s={-6:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1172] COND FALSE !(s->state == 16384) [L1175] EXPR s->state VAL [={0:5}, blastFlag=0, buf={0:-1}, got_new_session=0, init=1, ret=-1, s={-6:0}, s={-6:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1175] COND FALSE !(s->state == 8192) [L1178] EXPR s->state VAL [={0:5}, blastFlag=0, buf={0:-1}, got_new_session=0, init=1, ret=-1, s={-6:0}, s={-6:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1178] COND FALSE !(s->state == 24576) [L1181] EXPR s->state VAL [={0:5}, blastFlag=0, buf={0:-1}, got_new_session=0, init=1, ret=-1, s={-6:0}, s={-6:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1181] COND FALSE !(s->state == 8195) [L1184] EXPR s->state VAL [={0:5}, blastFlag=0, buf={0:-1}, got_new_session=0, init=1, ret=-1, s={-6:0}, s={-6:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1184] COND FALSE !(s->state == 8480) [L1187] EXPR s->state VAL [={0:5}, blastFlag=0, buf={0:-1}, got_new_session=0, init=1, ret=-1, s={-6:0}, s={-6:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1187] COND FALSE !(s->state == 8481) [L1190] EXPR s->state VAL [={0:5}, blastFlag=0, buf={0:-1}, got_new_session=0, init=1, ret=-1, s={-6:0}, s={-6:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1190] COND FALSE !(s->state == 8482) [L1193] EXPR s->state VAL [={0:5}, blastFlag=0, buf={0:-1}, got_new_session=0, init=1, ret=-1, s={-6:0}, s={-6:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1193] COND TRUE s->state == 8464 [L1349] s->shutdown = 0 [L1350] ret = __VERIFIER_nondet_int() [L1351] COND TRUE blastFlag == 0 [L1352] blastFlag = 1 VAL [={0:5}, blastFlag=1, buf={0:-1}, got_new_session=0, init=1, ret=1, s={-6:0}, s={-6:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1356] COND FALSE !(ret <= 0) [L1361] got_new_session = 1 [L1362] s->state = 8496 [L1363] s->init_num = 0 VAL [={0:5}, blastFlag=1, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1696] EXPR s->s3 [L1696] EXPR (s->s3)->tmp.reuse_message VAL [={0:5}, (s->s3)->tmp.reuse_message=4294967303, blastFlag=1, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->s3={-4294967296:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1696] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1725] skip = 0 VAL [={0:5}, blastFlag=1, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1166] COND TRUE 1 VAL [={0:5}, blastFlag=1, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1168] EXPR s->state [L1168] state = s->state [L1169] EXPR s->state VAL [={0:5}, blastFlag=1, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1169] COND FALSE !(s->state == 12292) [L1172] EXPR s->state VAL [={0:5}, blastFlag=1, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1172] COND FALSE !(s->state == 16384) [L1175] EXPR s->state VAL [={0:5}, blastFlag=1, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1175] COND FALSE !(s->state == 8192) [L1178] EXPR s->state VAL [={0:5}, blastFlag=1, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1178] COND FALSE !(s->state == 24576) [L1181] EXPR s->state VAL [={0:5}, blastFlag=1, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1181] COND FALSE !(s->state == 8195) [L1184] EXPR s->state VAL [={0:5}, blastFlag=1, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1184] COND FALSE !(s->state == 8480) [L1187] EXPR s->state VAL [={0:5}, blastFlag=1, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1187] COND FALSE !(s->state == 8481) [L1190] EXPR s->state VAL [={0:5}, blastFlag=1, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1190] COND FALSE !(s->state == 8482) [L1193] EXPR s->state VAL [={0:5}, blastFlag=1, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1193] COND FALSE !(s->state == 8464) [L1196] EXPR s->state VAL [={0:5}, blastFlag=1, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1196] COND FALSE !(s->state == 8465) [L1199] EXPR s->state VAL [={0:5}, blastFlag=1, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1199] COND FALSE !(s->state == 8466) [L1202] EXPR s->state VAL [={0:5}, blastFlag=1, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1202] COND TRUE s->state == 8496 [L1367] ret = __VERIFIER_nondet_int() [L1368] COND TRUE blastFlag == 1 [L1369] blastFlag = 2 VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1373] COND FALSE !(ret <= 0) [L1378] s->hit VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->hit=7, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1378] COND TRUE s->hit [L1379] s->state = 8656 VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1383] s->init_num = 0 VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1696] EXPR s->s3 [L1696] EXPR (s->s3)->tmp.reuse_message VAL [={0:5}, (s->s3)->tmp.reuse_message=4294967303, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->s3={-4294967296:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1696] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1725] skip = 0 VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1166] COND TRUE 1 VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1168] EXPR s->state [L1168] state = s->state [L1169] EXPR s->state VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1169] COND FALSE !(s->state == 12292) [L1172] EXPR s->state VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1172] COND FALSE !(s->state == 16384) [L1175] EXPR s->state VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1175] COND FALSE !(s->state == 8192) [L1178] EXPR s->state VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1178] COND FALSE !(s->state == 24576) [L1181] EXPR s->state VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1181] COND FALSE !(s->state == 8195) [L1184] EXPR s->state VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1184] COND FALSE !(s->state == 8480) [L1187] EXPR s->state VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1187] COND FALSE !(s->state == 8481) [L1190] EXPR s->state VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1190] COND FALSE !(s->state == 8482) [L1193] EXPR s->state VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1193] COND FALSE !(s->state == 8464) [L1196] EXPR s->state VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1196] COND FALSE !(s->state == 8465) [L1199] EXPR s->state VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1199] COND FALSE !(s->state == 8466) [L1202] EXPR s->state VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1202] COND FALSE !(s->state == 8496) [L1205] EXPR s->state VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1205] COND FALSE !(s->state == 8497) [L1208] EXPR s->state VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1208] COND FALSE !(s->state == 8512) [L1211] EXPR s->state VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1211] COND FALSE !(s->state == 8513) [L1214] EXPR s->state VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1214] COND FALSE !(s->state == 8528) [L1217] EXPR s->state VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1217] COND FALSE !(s->state == 8529) [L1220] EXPR s->state VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1220] COND FALSE !(s->state == 8544) [L1223] EXPR s->state VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1223] COND FALSE !(s->state == 8545) [L1226] EXPR s->state VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1226] COND FALSE !(s->state == 8560) [L1229] EXPR s->state VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1229] COND FALSE !(s->state == 8561) [L1232] EXPR s->state VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1232] COND FALSE !(s->state == 8448) [L1235] EXPR s->state VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1235] COND FALSE !(s->state == 8576) [L1238] EXPR s->state VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1238] COND FALSE !(s->state == 8577) [L1241] EXPR s->state VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1241] COND FALSE !(s->state == 8592) [L1244] EXPR s->state VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1244] COND FALSE !(s->state == 8593) [L1247] EXPR s->state VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1247] COND FALSE !(s->state == 8608) [L1250] EXPR s->state VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1250] COND FALSE !(s->state == 8609) [L1253] EXPR s->state VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1253] COND FALSE !(s->state == 8640) [L1256] EXPR s->state VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1256] COND FALSE !(s->state == 8641) [L1259] EXPR s->state VAL [={0:5}, blastFlag=2, buf={0:-1}, got_new_session=1, init=1, ret=1, s={-6:0}, s={-6:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0] [L1259] COND TRUE s->state == 8656 [L1583] EXPR s->session [L1583] EXPR s->s3 [L1583] EXPR (s->s3)->tmp.new_cipher [L1583] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1584] tmp___9 = __VERIFIER_nondet_int() [L1585] COND FALSE !(! tmp___9) [L1591] ret = __VERIFIER_nondet_int() [L1592] COND TRUE blastFlag == 2 [L1593] blastFlag = 5 VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___2=0, tmp___8=0, tmp___9=8] [L1597] COND FALSE !(ret <= 0) [L1602] s->state = 8672 [L1603] s->init_num = 0 [L1604] tmp___10 = __VERIFIER_nondet_int() [L1605] COND FALSE !(! tmp___10) VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1696] EXPR s->s3 [L1696] EXPR (s->s3)->tmp.reuse_message VAL [={0:5}, (s->s3)->tmp.reuse_message=4294967303, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->s3={-4294967296:0}, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1696] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1725] skip = 0 VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1166] COND TRUE 1 VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, skip=0, SSLv3_server_data={4:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1168] EXPR s->state [L1168] state = s->state [L1169] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1169] COND FALSE !(s->state == 12292) [L1172] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1172] COND FALSE !(s->state == 16384) [L1175] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1175] COND FALSE !(s->state == 8192) [L1178] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1178] COND FALSE !(s->state == 24576) [L1181] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1181] COND FALSE !(s->state == 8195) [L1184] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1184] COND FALSE !(s->state == 8480) [L1187] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1187] COND FALSE !(s->state == 8481) [L1190] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1190] COND FALSE !(s->state == 8482) [L1193] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1193] COND FALSE !(s->state == 8464) [L1196] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1196] COND FALSE !(s->state == 8465) [L1199] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1199] COND FALSE !(s->state == 8466) [L1202] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1202] COND FALSE !(s->state == 8496) [L1205] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1205] COND FALSE !(s->state == 8497) [L1208] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1208] COND FALSE !(s->state == 8512) [L1211] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1211] COND FALSE !(s->state == 8513) [L1214] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1214] COND FALSE !(s->state == 8528) [L1217] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1217] COND FALSE !(s->state == 8529) [L1220] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1220] COND FALSE !(s->state == 8544) [L1223] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1223] COND FALSE !(s->state == 8545) [L1226] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1226] COND FALSE !(s->state == 8560) [L1229] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1229] COND FALSE !(s->state == 8561) [L1232] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1232] COND FALSE !(s->state == 8448) [L1235] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1235] COND FALSE !(s->state == 8576) [L1238] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1238] COND FALSE !(s->state == 8577) [L1241] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1241] COND FALSE !(s->state == 8592) [L1244] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1244] COND FALSE !(s->state == 8593) [L1247] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1247] COND FALSE !(s->state == 8608) [L1250] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1250] COND FALSE !(s->state == 8609) [L1253] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1253] COND FALSE !(s->state == 8640) [L1256] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1256] COND FALSE !(s->state == 8641) [L1259] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1259] COND FALSE !(s->state == 8656) [L1262] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1262] COND FALSE !(s->state == 8657) [L1265] EXPR s->state VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=15, s={-6:0}, s={-6:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1265] COND TRUE s->state == 8672 [L1614] ret = __VERIFIER_nondet_int() [L1615] COND FALSE !(blastFlag == 4) VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=-14, s={-6:0}, s={-6:0}, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1618] COND TRUE blastFlag == 5 VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=-14, s={-6:0}, s={-6:0}, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] [L1737] reach_error() VAL [={0:5}, blastFlag=5, buf={0:-1}, got_new_session=1, init=1, ret=-14, s={-6:0}, s={-6:0}, skip=0, SSLv3_server_data={4:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___8=0, tmp___9=8] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 147 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 49.5s, OverallIterations: 24, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 44.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 18 mSolverCounterUnknown, 1815 SdHoareTripleChecker+Valid, 44.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1815 mSDsluCounter, 9467 SdHoareTripleChecker+Invalid, 42.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5584 mSDsCounter, 648 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3998 IncrementalHoareTripleChecker+Invalid, 4664 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 648 mSolverCounterUnsat, 3883 mSDtfsCounter, 3998 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 122 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=965occurred in iteration=21, InterpolantAutomatonStates: 90, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 23 MinimizatonAttempts, 963 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 2265 NumberOfCodeBlocks, 2265 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 2114 ConstructedInterpolants, 0 QuantifiedInterpolants, 5015 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 PerfectInterpolantSequences, 1192/1192 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-07-19 11:02:56,052 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 Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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/s3_srvr.blast.01.i.cil-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 a1fff1f2750aedbe7119b44ad3cdc8a2dbfa05ad8147a422ae9aeb0054d6e253 --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-19 11:02:57,863 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 11:02:57,866 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 11:02:57,915 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 11:02:57,915 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 11:02:57,916 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 11:02:57,920 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 11:02:57,922 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 11:02:57,924 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 11:02:57,929 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 11:02:57,929 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 11:02:57,932 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 11:02:57,932 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 11:02:57,934 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 11:02:57,935 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 11:02:57,942 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 11:02:57,943 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 11:02:57,944 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 11:02:57,946 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 11:02:57,953 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 11:02:57,954 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 11:02:57,955 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 11:02:57,957 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 11:02:57,958 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 11:02:57,960 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 11:02:57,963 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 11:02:57,963 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 11:02:57,963 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 11:02:57,964 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 11:02:57,964 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 11:02:57,965 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 11:02:57,965 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 11:02:57,969 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 11:02:57,969 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 11:02:57,971 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 11:02:57,972 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 11:02:57,972 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 11:02:57,972 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 11:02:57,972 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 11:02:57,973 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 11:02:57,973 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 11:02:57,974 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 11:02:57,979 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-07-19 11:02:58,019 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 11:02:58,021 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 11:02:58,021 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 11:02:58,021 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 11:02:58,022 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 11:02:58,022 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 11:02:58,023 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 11:02:58,023 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 11:02:58,023 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 11:02:58,024 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 11:02:58,024 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-19 11:02:58,024 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-19 11:02:58,025 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 11:02:58,025 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 11:02:58,025 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 11:02:58,025 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 11:02:58,025 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-19 11:02:58,026 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-19 11:02:58,026 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-19 11:02:58,026 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-19 11:02:58,026 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 11:02:58,026 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 11:02:58,027 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 11:02:58,027 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 11:02:58,027 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 11:02:58,027 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 11:02:58,027 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 11:02:58,028 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 11:02:58,028 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 11:02:58,028 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 11:02:58,028 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-19 11:02:58,028 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-19 11:02:58,029 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 11:02:58,029 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 11:02:58,029 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 11:02:58,029 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-19 11:02:58,029 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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 -> a1fff1f2750aedbe7119b44ad3cdc8a2dbfa05ad8147a422ae9aeb0054d6e253 [2022-07-19 11:02:58,331 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 11:02:58,357 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 11:02:58,360 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 11:02:58,361 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 11:02:58,362 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 11:02:58,363 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/openssl/s3_srvr.blast.01.i.cil-2.c [2022-07-19 11:02:58,421 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7aa83bee/4b67f83af4244dd68e0b0792db69cf93/FLAGea271de90 [2022-07-19 11:02:58,975 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 11:02:58,976 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl/s3_srvr.blast.01.i.cil-2.c [2022-07-19 11:02:58,998 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7aa83bee/4b67f83af4244dd68e0b0792db69cf93/FLAGea271de90 [2022-07-19 11:02:59,389 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7aa83bee/4b67f83af4244dd68e0b0792db69cf93 [2022-07-19 11:02:59,391 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 11:02:59,392 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 11:02:59,395 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 11:02:59,396 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 11:02:59,398 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 11:02:59,399 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 11:02:59" (1/1) ... [2022-07-19 11:02:59,400 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2375e9b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:02:59, skipping insertion in model container [2022-07-19 11:02:59,400 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 11:02:59" (1/1) ... [2022-07-19 11:02:59,406 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 11:02:59,469 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 11:02:59,897 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/s3_srvr.blast.01.i.cil-2.c[72913,72926] [2022-07-19 11:02:59,903 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 11:02:59,927 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-07-19 11:02:59,938 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 11:03:00,034 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/s3_srvr.blast.01.i.cil-2.c[72913,72926] [2022-07-19 11:03:00,037 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 11:03:00,046 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 11:03:00,149 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/s3_srvr.blast.01.i.cil-2.c[72913,72926] [2022-07-19 11:03:00,151 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 11:03:00,171 INFO L208 MainTranslator]: Completed translation [2022-07-19 11:03:00,172 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:03:00 WrapperNode [2022-07-19 11:03:00,172 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 11:03:00,173 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 11:03:00,173 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 11:03:00,174 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 11:03:00,179 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:03:00" (1/1) ... [2022-07-19 11:03:00,215 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:03:00" (1/1) ... [2022-07-19 11:03:00,272 INFO L137 Inliner]: procedures = 35, calls = 223, calls flagged for inlining = 7, calls inlined = 3, statements flattened = 757 [2022-07-19 11:03:00,273 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 11:03:00,273 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 11:03:00,273 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 11:03:00,274 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 11:03:00,289 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:03:00" (1/1) ... [2022-07-19 11:03:00,289 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:03:00" (1/1) ... [2022-07-19 11:03:00,305 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:03:00" (1/1) ... [2022-07-19 11:03:00,306 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:03:00" (1/1) ... [2022-07-19 11:03:00,349 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:03:00" (1/1) ... [2022-07-19 11:03:00,370 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:03:00" (1/1) ... [2022-07-19 11:03:00,373 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:03:00" (1/1) ... [2022-07-19 11:03:00,378 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 11:03:00,379 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 11:03:00,379 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 11:03:00,379 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 11:03:00,379 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:03:00" (1/1) ... [2022-07-19 11:03:00,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 11:03:00,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 11:03:00,425 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-19 11:03:00,432 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-19 11:03:00,466 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 11:03:00,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-19 11:03:00,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-19 11:03:00,467 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-19 11:03:00,467 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-19 11:03:00,467 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-19 11:03:00,467 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 11:03:00,467 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 11:03:00,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-19 11:03:00,639 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 11:03:00,640 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 11:03:00,673 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-19 11:03:07,421 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2022-07-19 11:03:07,421 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2022-07-19 11:03:07,421 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 11:03:07,431 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 11:03:07,431 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-19 11:03:07,435 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 11:03:07 BoogieIcfgContainer [2022-07-19 11:03:07,435 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 11:03:07,437 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 11:03:07,437 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 11:03:07,439 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 11:03:07,439 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 11:02:59" (1/3) ... [2022-07-19 11:03:07,440 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71e878b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 11:03:07, skipping insertion in model container [2022-07-19 11:03:07,440 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:03:00" (2/3) ... [2022-07-19 11:03:07,440 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71e878b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 11:03:07, skipping insertion in model container [2022-07-19 11:03:07,440 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 11:03:07" (3/3) ... [2022-07-19 11:03:07,443 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.01.i.cil-2.c [2022-07-19 11:03:07,456 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 11:03:07,456 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-19 11:03:07,508 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 11:03:07,514 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@e237f76, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@174dffd2 [2022-07-19 11:03:07,515 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-19 11:03:07,520 INFO L276 IsEmpty]: Start isEmpty. Operand has 147 states, 145 states have (on average 1.696551724137931) internal successors, (246), 146 states have internal predecessors, (246), 0 states have call successors, (0), 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-19 11:03:07,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-07-19 11:03:07,530 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:03:07,531 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 11:03:07,532 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:03:07,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:03:07,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1430116946, now seen corresponding path program 1 times [2022-07-19 11:03:07,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 11:03:07,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [800883366] [2022-07-19 11:03:07,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:03:07,554 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 11:03:07,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 11:03:07,557 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 11:03:07,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-19 11:03:08,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 11:03:08,119 INFO L263 TraceCheckSpWp]: Trace formula consists of 581 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-19 11:03:08,126 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 11:03:08,358 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-19 11:03:08,358 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 11:03:08,359 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 11:03:08,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [800883366] [2022-07-19 11:03:08,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [800883366] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 11:03:08,360 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 11:03:08,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 11:03:08,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486625397] [2022-07-19 11:03:08,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 11:03:08,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 11:03:08,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 11:03:08,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 11:03:08,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 11:03:08,401 INFO L87 Difference]: Start difference. First operand has 147 states, 145 states have (on average 1.696551724137931) internal successors, (246), 146 states have internal predecessors, (246), 0 states have call successors, (0), 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 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 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-19 11:03:08,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 11:03:08,529 INFO L93 Difference]: Finished difference Result 418 states and 704 transitions. [2022-07-19 11:03:08,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 11:03:08,531 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 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 47 [2022-07-19 11:03:08,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 11:03:08,546 INFO L225 Difference]: With dead ends: 418 [2022-07-19 11:03:08,546 INFO L226 Difference]: Without dead ends: 255 [2022-07-19 11:03:08,550 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 45 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-19 11:03:08,556 INFO L413 NwaCegarLoop]: 237 mSDtfsCounter, 187 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 11:03:08,559 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 457 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 11:03:08,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2022-07-19 11:03:08,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 255. [2022-07-19 11:03:08,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 254 states have (on average 1.5118110236220472) internal successors, (384), 254 states have internal predecessors, (384), 0 states have call successors, (0), 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-19 11:03:08,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 384 transitions. [2022-07-19 11:03:08,633 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 384 transitions. Word has length 47 [2022-07-19 11:03:08,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 11:03:08,633 INFO L495 AbstractCegarLoop]: Abstraction has 255 states and 384 transitions. [2022-07-19 11:03:08,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 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-19 11:03:08,634 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 384 transitions. [2022-07-19 11:03:08,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-07-19 11:03:08,636 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:03:08,637 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 11:03:08,658 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-07-19 11:03:08,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 11:03:08,856 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:03:08,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:03:08,856 INFO L85 PathProgramCache]: Analyzing trace with hash -682574659, now seen corresponding path program 1 times [2022-07-19 11:03:08,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 11:03:08,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [483149777] [2022-07-19 11:03:08,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:03:08,858 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 11:03:08,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 11:03:08,860 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 11:03:08,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-19 11:03:09,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 11:03:09,432 INFO L263 TraceCheckSpWp]: Trace formula consists of 663 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-19 11:03:09,435 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 11:03:09,610 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 11:03:09,611 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 11:03:09,611 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 11:03:09,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [483149777] [2022-07-19 11:03:09,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [483149777] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 11:03:09,611 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 11:03:09,612 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 11:03:09,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944675530] [2022-07-19 11:03:09,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 11:03:09,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 11:03:09,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 11:03:09,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 11:03:09,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 11:03:09,614 INFO L87 Difference]: Start difference. First operand 255 states and 384 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-19 11:03:09,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 11:03:09,797 INFO L93 Difference]: Finished difference Result 498 states and 757 transitions. [2022-07-19 11:03:09,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 11:03:09,797 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 64 [2022-07-19 11:03:09,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 11:03:09,800 INFO L225 Difference]: With dead ends: 498 [2022-07-19 11:03:09,800 INFO L226 Difference]: Without dead ends: 374 [2022-07-19 11:03:09,801 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 62 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-19 11:03:09,802 INFO L413 NwaCegarLoop]: 372 mSDtfsCounter, 137 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 11:03:09,802 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 562 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 11:03:09,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2022-07-19 11:03:09,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 374. [2022-07-19 11:03:09,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 373 states have (on average 1.5067024128686326) internal successors, (562), 373 states have internal predecessors, (562), 0 states have call successors, (0), 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-19 11:03:09,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 562 transitions. [2022-07-19 11:03:09,834 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 562 transitions. Word has length 64 [2022-07-19 11:03:09,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 11:03:09,834 INFO L495 AbstractCegarLoop]: Abstraction has 374 states and 562 transitions. [2022-07-19 11:03:09,835 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-19 11:03:09,835 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 562 transitions. [2022-07-19 11:03:09,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-07-19 11:03:09,842 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:03:09,842 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 11:03:09,868 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-19 11:03:10,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 11:03:10,047 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:03:10,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:03:10,047 INFO L85 PathProgramCache]: Analyzing trace with hash 485035231, now seen corresponding path program 1 times [2022-07-19 11:03:10,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 11:03:10,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [275147316] [2022-07-19 11:03:10,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:03:10,049 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 11:03:10,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 11:03:10,051 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 11:03:10,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-19 11:03:10,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 11:03:10,684 INFO L263 TraceCheckSpWp]: Trace formula consists of 736 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-19 11:03:10,687 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 11:03:10,874 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-19 11:03:10,874 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 11:03:10,874 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 11:03:10,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [275147316] [2022-07-19 11:03:10,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [275147316] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 11:03:10,875 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 11:03:10,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 11:03:10,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783985914] [2022-07-19 11:03:10,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 11:03:10,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 11:03:10,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 11:03:10,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 11:03:10,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 11:03:10,877 INFO L87 Difference]: Start difference. First operand 374 states and 562 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:03:11,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 11:03:11,035 INFO L93 Difference]: Finished difference Result 737 states and 1115 transitions. [2022-07-19 11:03:11,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 11:03:11,038 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2022-07-19 11:03:11,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 11:03:11,041 INFO L225 Difference]: With dead ends: 737 [2022-07-19 11:03:11,041 INFO L226 Difference]: Without dead ends: 494 [2022-07-19 11:03:11,042 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 84 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-19 11:03:11,043 INFO L413 NwaCegarLoop]: 376 mSDtfsCounter, 137 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 566 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 11:03:11,044 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 566 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 11:03:11,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2022-07-19 11:03:11,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 494. [2022-07-19 11:03:11,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 494 states, 493 states have (on average 1.5050709939148073) internal successors, (742), 493 states have internal predecessors, (742), 0 states have call successors, (0), 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-19 11:03:11,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 742 transitions. [2022-07-19 11:03:11,059 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 742 transitions. Word has length 86 [2022-07-19 11:03:11,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 11:03:11,059 INFO L495 AbstractCegarLoop]: Abstraction has 494 states and 742 transitions. [2022-07-19 11:03:11,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 11:03:11,060 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 742 transitions. [2022-07-19 11:03:11,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-07-19 11:03:11,061 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:03:11,062 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 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-19 11:03:11,086 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-19 11:03:11,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 11:03:11,284 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:03:11,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:03:11,284 INFO L85 PathProgramCache]: Analyzing trace with hash -220313936, now seen corresponding path program 1 times [2022-07-19 11:03:11,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 11:03:11,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [858411385] [2022-07-19 11:03:11,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:03:11,286 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 11:03:11,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 11:03:11,288 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 11:03:11,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-19 11:03:11,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 11:03:12,005 INFO L263 TraceCheckSpWp]: Trace formula consists of 856 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-19 11:03:12,009 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 11:03:12,188 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-07-19 11:03:12,189 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 11:03:12,189 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 11:03:12,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [858411385] [2022-07-19 11:03:12,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [858411385] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 11:03:12,189 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 11:03:12,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 11:03:12,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441187239] [2022-07-19 11:03:12,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 11:03:12,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 11:03:12,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 11:03:12,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 11:03:12,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 11:03:12,191 INFO L87 Difference]: Start difference. First operand 494 states and 742 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 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-19 11:03:12,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 11:03:12,308 INFO L93 Difference]: Finished difference Result 854 states and 1285 transitions. [2022-07-19 11:03:12,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 11:03:12,309 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 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 127 [2022-07-19 11:03:12,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 11:03:12,311 INFO L225 Difference]: With dead ends: 854 [2022-07-19 11:03:12,312 INFO L226 Difference]: Without dead ends: 491 [2022-07-19 11:03:12,312 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 125 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-19 11:03:12,313 INFO L413 NwaCegarLoop]: 372 mSDtfsCounter, 138 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 11:03:12,314 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 561 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 11:03:12,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2022-07-19 11:03:12,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 491. [2022-07-19 11:03:12,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 491 states, 490 states have (on average 1.493877551020408) internal successors, (732), 490 states have internal predecessors, (732), 0 states have call successors, (0), 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-19 11:03:12,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 732 transitions. [2022-07-19 11:03:12,327 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 732 transitions. Word has length 127 [2022-07-19 11:03:12,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 11:03:12,328 INFO L495 AbstractCegarLoop]: Abstraction has 491 states and 732 transitions. [2022-07-19 11:03:12,328 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 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-19 11:03:12,328 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 732 transitions. [2022-07-19 11:03:12,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-07-19 11:03:12,330 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:03:12,330 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 11:03:12,354 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-07-19 11:03:12,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 11:03:12,544 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:03:12,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:03:12,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1760202500, now seen corresponding path program 1 times [2022-07-19 11:03:12,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 11:03:12,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [980177905] [2022-07-19 11:03:12,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:03:12,546 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 11:03:12,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 11:03:12,547 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 11:03:12,549 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-19 11:03:13,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 11:03:13,602 INFO L263 TraceCheckSpWp]: Trace formula consists of 857 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-19 11:03:13,608 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 11:03:13,652 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-19 11:03:13,671 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-19 11:03:14,422 INFO L356 Elim1Store]: treesize reduction 1496, result has 4.7 percent of original size [2022-07-19 11:03:14,422 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 58 treesize of output 85 [2022-07-19 11:03:14,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:03:14,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:03:14,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:03:14,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:03:14,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:03:14,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:03:14,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:03:14,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:03:14,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:03:14,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:03:14,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:03:14,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:03:14,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:03:14,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:03:14,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:03:14,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:03:14,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:03:14,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:03:14,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:03:14,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:03:14,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:03:14,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:03:14,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:03:14,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:03:14,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:03:14,505 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:03:14,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:03:14,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:03:14,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:03:14,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:03:14,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:03:14,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:03:14,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:03:14,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:03:14,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:03:14,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:03:14,535 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 36 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 85 [2022-07-19 11:03:14,776 INFO L356 Elim1Store]: treesize reduction 324, result has 10.2 percent of original size [2022-07-19 11:03:14,777 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 49 [2022-07-19 11:03:14,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:03:14,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:03:14,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:03:14,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:03:14,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:03:14,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:03:14,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:03:14,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:03:14,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:03:14,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:03:14,844 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 49 [2022-07-19 11:03:14,877 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-19 11:03:14,883 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-19 11:03:14,923 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2022-07-19 11:03:14,923 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 11:03:14,923 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 11:03:14,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [980177905] [2022-07-19 11:03:14,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [980177905] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 11:03:14,924 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 11:03:14,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 11:03:14,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297828358] [2022-07-19 11:03:14,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 11:03:14,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 11:03:14,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 11:03:14,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 11:03:14,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 11:03:14,926 INFO L87 Difference]: Start difference. First operand 491 states and 732 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 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-19 11:03:16,953 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 11:03:18,959 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 11:03:20,805 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 11:03:25,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 11:03:25,903 INFO L93 Difference]: Finished difference Result 979 states and 1460 transitions. [2022-07-19 11:03:25,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 11:03:25,906 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 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 128 [2022-07-19 11:03:25,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 11:03:25,907 INFO L225 Difference]: With dead ends: 979 [2022-07-19 11:03:25,908 INFO L226 Difference]: Without dead ends: 491 [2022-07-19 11:03:25,908 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-19 11:03:25,911 INFO L413 NwaCegarLoop]: 197 mSDtfsCounter, 7 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.9s IncrementalHoareTripleChecker+Time [2022-07-19 11:03:25,911 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 635 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 166 Invalid, 2 Unknown, 0 Unchecked, 10.9s Time] [2022-07-19 11:03:25,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2022-07-19 11:03:25,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 491. [2022-07-19 11:03:25,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 491 states, 490 states have (on average 1.4918367346938775) internal successors, (731), 490 states have internal predecessors, (731), 0 states have call successors, (0), 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-19 11:03:25,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 731 transitions. [2022-07-19 11:03:25,924 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 731 transitions. Word has length 128 [2022-07-19 11:03:25,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 11:03:25,925 INFO L495 AbstractCegarLoop]: Abstraction has 491 states and 731 transitions. [2022-07-19 11:03:25,925 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 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-19 11:03:25,925 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 731 transitions. [2022-07-19 11:03:25,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-07-19 11:03:25,926 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:03:25,927 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 11:03:25,958 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-07-19 11:03:26,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 11:03:26,148 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:03:26,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:03:26,148 INFO L85 PathProgramCache]: Analyzing trace with hash 1330544194, now seen corresponding path program 1 times [2022-07-19 11:03:26,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 11:03:26,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [454929324] [2022-07-19 11:03:26,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:03:26,149 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 11:03:26,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 11:03:26,151 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 11:03:26,153 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-07-19 11:03:27,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 11:03:27,377 INFO L263 TraceCheckSpWp]: Trace formula consists of 875 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-19 11:03:27,381 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 11:03:27,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:03:27,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:03:27,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:03:27,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:03:27,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 11:03:27,399 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 11:03:27,503 INFO L356 Elim1Store]: treesize reduction 190, result has 12.8 percent of original size [2022-07-19 11:03:27,503 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 38 [2022-07-19 11:03:27,926 INFO L356 Elim1Store]: treesize reduction 825, result has 7.2 percent of original size [2022-07-19 11:03:27,927 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 13 case distinctions, treesize of input 66 treesize of output 86 [2022-07-19 11:03:28,395 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-07-19 11:03:28,395 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 71 treesize of output 23 [2022-07-19 11:03:28,419 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-07-19 11:03:28,419 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 11:03:28,420 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 11:03:28,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [454929324] [2022-07-19 11:03:28,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [454929324] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 11:03:28,420 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 11:03:28,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 11:03:28,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421921740] [2022-07-19 11:03:28,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 11:03:28,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 11:03:28,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 11:03:28,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 11:03:28,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 11:03:28,422 INFO L87 Difference]: Start difference. First operand 491 states and 731 transitions. Second operand has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 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-19 11:03:30,443 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 11:03:32,648 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 11:03:36,307 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 11:03:40,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 11:03:40,363 INFO L93 Difference]: Finished difference Result 1122 states and 1671 transitions. [2022-07-19 11:03:40,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 11:03:40,367 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 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 128 [2022-07-19 11:03:40,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 11:03:40,371 INFO L225 Difference]: With dead ends: 1122 [2022-07-19 11:03:40,371 INFO L226 Difference]: Without dead ends: 641 [2022-07-19 11:03:40,372 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 11:03:40,373 INFO L413 NwaCegarLoop]: 235 mSDtfsCounter, 39 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 9 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 566 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.9s IncrementalHoareTripleChecker+Time [2022-07-19 11:03:40,374 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 566 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 183 Invalid, 2 Unknown, 0 Unchecked, 11.9s Time] [2022-07-19 11:03:40,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2022-07-19 11:03:40,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 566. [2022-07-19 11:03:40,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 565 states have (on average 1.5221238938053097) internal successors, (860), 565 states have internal predecessors, (860), 0 states have call successors, (0), 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-19 11:03:40,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 860 transitions. [2022-07-19 11:03:40,390 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 860 transitions. Word has length 128 [2022-07-19 11:03:40,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 11:03:40,391 INFO L495 AbstractCegarLoop]: Abstraction has 566 states and 860 transitions. [2022-07-19 11:03:40,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 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-19 11:03:40,391 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 860 transitions. [2022-07-19 11:03:40,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-07-19 11:03:40,394 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 11:03:40,394 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 11:03:40,425 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-07-19 11:03:40,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 11:03:40,617 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 11:03:40,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 11:03:40,617 INFO L85 PathProgramCache]: Analyzing trace with hash -545938624, now seen corresponding path program 1 times [2022-07-19 11:03:40,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 11:03:40,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1857540043] [2022-07-19 11:03:40,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 11:03:40,618 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 11:03:40,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 11:03:40,619 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 11:03:40,621 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-07-19 11:03:45,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-19 11:03:45,898 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-19 11:03:47,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-19 11:03:47,681 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-07-19 11:03:47,682 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-19 11:03:47,682 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-19 11:03:47,739 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-07-19 11:03:47,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 11:03:47,910 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2022-07-19 11:03:47,912 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-19 11:03:48,082 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.07 11:03:48 BoogieIcfgContainer [2022-07-19 11:03:48,083 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-19 11:03:48,083 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-19 11:03:48,083 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-19 11:03:48,084 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-19 11:03:48,084 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 11:03:07" (3/4) ... [2022-07-19 11:03:48,086 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-19 11:03:48,198 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-19 11:03:48,199 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-19 11:03:48,199 INFO L158 Benchmark]: Toolchain (without parser) took 48806.94ms. Allocated memory was 56.6MB in the beginning and 104.9MB in the end (delta: 48.2MB). Free memory was 32.9MB in the beginning and 27.7MB in the end (delta: 5.3MB). Peak memory consumption was 52.6MB. Max. memory is 16.1GB. [2022-07-19 11:03:48,200 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 56.6MB. Free memory was 38.7MB in the beginning and 38.7MB in the end (delta: 51.7kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 11:03:48,200 INFO L158 Benchmark]: CACSL2BoogieTranslator took 777.16ms. Allocated memory was 56.6MB in the beginning and 69.2MB in the end (delta: 12.6MB). Free memory was 32.7MB in the beginning and 35.0MB in the end (delta: -2.3MB). Peak memory consumption was 13.7MB. Max. memory is 16.1GB. [2022-07-19 11:03:48,200 INFO L158 Benchmark]: Boogie Procedure Inliner took 99.50ms. Allocated memory is still 69.2MB. Free memory was 34.8MB in the beginning and 47.5MB in the end (delta: -12.8MB). Peak memory consumption was 3.7MB. Max. memory is 16.1GB. [2022-07-19 11:03:48,201 INFO L158 Benchmark]: Boogie Preprocessor took 104.49ms. Allocated memory is still 69.2MB. Free memory was 47.5MB in the beginning and 40.3MB in the end (delta: 7.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-19 11:03:48,201 INFO L158 Benchmark]: RCFGBuilder took 7056.57ms. Allocated memory was 69.2MB in the beginning and 86.0MB in the end (delta: 16.8MB). Free memory was 40.3MB in the beginning and 53.4MB in the end (delta: -13.1MB). Peak memory consumption was 29.5MB. Max. memory is 16.1GB. [2022-07-19 11:03:48,201 INFO L158 Benchmark]: TraceAbstraction took 40646.24ms. Allocated memory was 86.0MB in the beginning and 104.9MB in the end (delta: 18.9MB). Free memory was 52.9MB in the beginning and 44.8MB in the end (delta: 8.1MB). Peak memory consumption was 51.0MB. Max. memory is 16.1GB. [2022-07-19 11:03:48,202 INFO L158 Benchmark]: Witness Printer took 115.55ms. Allocated memory is still 104.9MB. Free memory was 44.8MB in the beginning and 27.7MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-07-19 11:03:48,207 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.18ms. Allocated memory is still 56.6MB. Free memory was 38.7MB in the beginning and 38.7MB in the end (delta: 51.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 777.16ms. Allocated memory was 56.6MB in the beginning and 69.2MB in the end (delta: 12.6MB). Free memory was 32.7MB in the beginning and 35.0MB in the end (delta: -2.3MB). Peak memory consumption was 13.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 99.50ms. Allocated memory is still 69.2MB. Free memory was 34.8MB in the beginning and 47.5MB in the end (delta: -12.8MB). Peak memory consumption was 3.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 104.49ms. Allocated memory is still 69.2MB. Free memory was 47.5MB in the beginning and 40.3MB in the end (delta: 7.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 7056.57ms. Allocated memory was 69.2MB in the beginning and 86.0MB in the end (delta: 16.8MB). Free memory was 40.3MB in the beginning and 53.4MB in the end (delta: -13.1MB). Peak memory consumption was 29.5MB. Max. memory is 16.1GB. * TraceAbstraction took 40646.24ms. Allocated memory was 86.0MB in the beginning and 104.9MB in the end (delta: 18.9MB). Free memory was 52.9MB in the beginning and 44.8MB in the end (delta: 8.1MB). Peak memory consumption was 51.0MB. Max. memory is 16.1GB. * Witness Printer took 115.55ms. Allocated memory is still 104.9MB. Free memory was 44.8MB in the beginning and 27.7MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * 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 - CounterExampleResult [Line: 1737]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L1054] static int init = 1; [L1055] static SSL_METHOD SSLv3_server_data ; VAL [init=1, SSLv3_server_data={4:0}] [L1077] SSL *s ; [L1078] int tmp ; [L1082] s = malloc(sizeof(SSL)) [L1083] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1084] s->ctx = malloc(sizeof(SSL_CTX)) [L1085] s->session = malloc(sizeof(SSL_SESSION)) [L1086] s->state = 8464 [L1088] s->info_callback = (void (*) ()) __VERIFIER_nondet_ulong() [L1089] s->options = __VERIFIER_nondet_ulong() [L1090] s->verify_mode = __VERIFIER_nondet_int() [L1091] EXPR s->session [L1091] (s->session)->peer = (struct x509_st*) __VERIFIER_nondet_ulong() [L1092] EXPR s->s3 [L1092] (s->s3)->tmp.cert_request = __VERIFIER_nondet_int() [L1093] EXPR s->s3 [L1093] (s->s3)->tmp.new_cipher = malloc(sizeof(struct ssl_cipher_st)) [L1094] EXPR s->s3 [L1094] EXPR (s->s3)->tmp.new_cipher [L1094] ((s->s3)->tmp.new_cipher)->algorithms = __VERIFIER_nondet_ulong() [L1095] EXPR s->s3 [L1095] EXPR (s->s3)->tmp.new_cipher [L1095] ((s->s3)->tmp.new_cipher)->algo_strength = __VERIFIER_nondet_ulong() [L1096] COND FALSE !(__VERIFIER_nondet_int()) [L1102] s->cert = malloc(sizeof(struct cert_st)) [L1103] EXPR s->cert [L1103] (s->cert)->pkeys[0].privatekey = (struct evp_pkey_st*) __VERIFIER_nondet_ulong() [L1106] CALL ssl3_accept(s) [L1112] BUF_MEM *buf = (BUF_MEM *)__VERIFIER_nondet_ulong(); [L1113] unsigned long l ; [L1114] unsigned long Time ; [L1115] unsigned long tmp = __VERIFIER_nondet_long() ; [L1116] void (*cb)() ; [L1117] long num1 ; [L1118] int ret ; [L1119] int new_state ; [L1120] int state ; [L1121] int skip ; [L1122] int got_new_session ; [L1123] int tmp___1 = __VERIFIER_nondet_int() ; [L1124] int tmp___2 = __VERIFIER_nondet_int() ; [L1125] int tmp___3 ; [L1126] int tmp___4 ; [L1127] int tmp___5 ; [L1128] int tmp___6 ; [L1129] int tmp___7 ; [L1130] long tmp___8 = __VERIFIER_nondet_long() ; [L1131] int tmp___9 ; [L1132] int tmp___10 ; [L1133] int blastFlag ; [L1137] blastFlag = 0 [L1138] s->hit=__VERIFIER_nondet_int () [L1139] s->state = 8464 [L1140] Time = tmp [L1141] cb = (void (*)())((void *)0) [L1142] ret = -1 [L1143] skip = 0 [L1144] got_new_session = 0 [L1145] EXPR s->info_callback VAL [={0:0}, blastFlag=0, buf=null, got_new_session=0, init=1, ret=4294967295, s={7:0}, s={7:0}, s->info_callback={0:-2147483648}, skip=0, SSLv3_server_data={4:0}, Time=8, tmp=8] [L1145] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1146] EXPR s->info_callback [L1146] cb = s->info_callback [L1150] EXPR s->in_handshake [L1150] s->in_handshake += 1 [L1151] COND FALSE !(tmp___1 & 12288) VAL [={0:-2147483648}, blastFlag=0, buf=null, got_new_session=0, init=1, ret=4294967295, s={7:0}, s={7:0}, skip=0, SSLv3_server_data={4:0}, Time=8, tmp=8, tmp___1=0] [L1160] EXPR s->cert VAL [={0:-2147483648}, blastFlag=0, buf=null, got_new_session=0, init=1, ret=4294967295, s={7:0}, s={7:0}, s->cert={6:0}, skip=0, SSLv3_server_data={4:0}, Time=8, tmp=8, tmp___1=0] [L1160] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1166] COND TRUE 1 VAL [={0:-2147483648}, blastFlag=0, buf=null, got_new_session=0, init=1, ret=4294967295, s={7:0}, s={7:0}, skip=0, SSLv3_server_data={4:0}, Time=8, tmp=8, tmp___1=0] [L1168] EXPR s->state [L1168] state = s->state [L1169] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, buf=null, got_new_session=0, init=1, ret=4294967295, s={7:0}, s={7:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=8, tmp=8, tmp___1=0] [L1169] COND FALSE !(s->state == 12292) [L1172] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, buf=null, got_new_session=0, init=1, ret=4294967295, s={7:0}, s={7:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=8, tmp=8, tmp___1=0] [L1172] COND FALSE !(s->state == 16384) [L1175] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, buf=null, got_new_session=0, init=1, ret=4294967295, s={7:0}, s={7:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=8, tmp=8, tmp___1=0] [L1175] COND FALSE !(s->state == 8192) [L1178] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, buf=null, got_new_session=0, init=1, ret=4294967295, s={7:0}, s={7:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=8, tmp=8, tmp___1=0] [L1178] COND FALSE !(s->state == 24576) [L1181] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, buf=null, got_new_session=0, init=1, ret=4294967295, s={7:0}, s={7:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=8, tmp=8, tmp___1=0] [L1181] COND FALSE !(s->state == 8195) [L1184] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, buf=null, got_new_session=0, init=1, ret=4294967295, s={7:0}, s={7:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=8, tmp=8, tmp___1=0] [L1184] COND FALSE !(s->state == 8480) [L1187] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, buf=null, got_new_session=0, init=1, ret=4294967295, s={7:0}, s={7:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=8, tmp=8, tmp___1=0] [L1187] COND FALSE !(s->state == 8481) [L1190] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, buf=null, got_new_session=0, init=1, ret=4294967295, s={7:0}, s={7:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=8, tmp=8, tmp___1=0] [L1190] COND FALSE !(s->state == 8482) [L1193] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, buf=null, got_new_session=0, init=1, ret=4294967295, s={7:0}, s={7:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=8, tmp=8, tmp___1=0] [L1193] COND TRUE s->state == 8464 [L1349] s->shutdown = 0 [L1350] ret = __VERIFIER_nondet_int() [L1351] COND TRUE blastFlag == 0 [L1352] blastFlag = 1 VAL [={0:-2147483648}, blastFlag=1, buf=null, got_new_session=0, init=1, ret=1073741824, s={7:0}, s={7:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=8, tmp=8, tmp___1=0] [L1356] COND FALSE !(ret <= 0) [L1361] got_new_session = 1 [L1362] s->state = 8496 [L1363] s->init_num = 0 VAL [={0:-2147483648}, blastFlag=1, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=8, tmp=8, tmp___1=0] [L1696] EXPR s->s3 [L1696] EXPR (s->s3)->tmp.reuse_message VAL [={0:-2147483648}, (s->s3)->tmp.reuse_message=-2147483648, blastFlag=1, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->s3={536870919:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=8, tmp=8, tmp___1=0] [L1696] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1725] skip = 0 VAL [={0:-2147483648}, blastFlag=1, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=8, tmp=8, tmp___1=0] [L1166] COND TRUE 1 VAL [={0:-2147483648}, blastFlag=1, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=8, tmp=8, tmp___1=0] [L1168] EXPR s->state [L1168] state = s->state [L1169] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=8, tmp=8, tmp___1=0] [L1169] COND FALSE !(s->state == 12292) [L1172] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=8, tmp=8, tmp___1=0] [L1172] COND FALSE !(s->state == 16384) [L1175] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=8, tmp=8, tmp___1=0] [L1175] COND FALSE !(s->state == 8192) [L1178] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=8, tmp=8, tmp___1=0] [L1178] COND FALSE !(s->state == 24576) [L1181] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=8, tmp=8, tmp___1=0] [L1181] COND FALSE !(s->state == 8195) [L1184] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=8, tmp=8, tmp___1=0] [L1184] COND FALSE !(s->state == 8480) [L1187] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=8, tmp=8, tmp___1=0] [L1187] COND FALSE !(s->state == 8481) [L1190] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=8, tmp=8, tmp___1=0] [L1190] COND FALSE !(s->state == 8482) [L1193] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=8, tmp=8, tmp___1=0] [L1193] COND FALSE !(s->state == 8464) [L1196] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=8, tmp=8, tmp___1=0] [L1196] COND FALSE !(s->state == 8465) [L1199] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=8, tmp=8, tmp___1=0] [L1199] COND FALSE !(s->state == 8466) [L1202] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=8, tmp=8, tmp___1=0] [L1202] COND TRUE s->state == 8496 [L1367] ret = __VERIFIER_nondet_int() [L1368] COND TRUE blastFlag == 1 [L1369] blastFlag = 2 VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=8, tmp=8, tmp___1=0] [L1373] COND FALSE !(ret <= 0) [L1378] s->hit VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->hit=-2147483648, skip=0, SSLv3_server_data={4:0}, state=8496, Time=8, tmp=8, tmp___1=0] [L1378] COND TRUE s->hit [L1379] s->state = 8656 VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=8, tmp=8, tmp___1=0] [L1383] s->init_num = 0 VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=8, tmp=8, tmp___1=0] [L1696] EXPR s->s3 [L1696] EXPR (s->s3)->tmp.reuse_message VAL [={0:-2147483648}, (s->s3)->tmp.reuse_message=-2147483648, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->s3={536870919:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=8, tmp=8, tmp___1=0] [L1696] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1725] skip = 0 VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=8, tmp=8, tmp___1=0] [L1166] COND TRUE 1 VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=8, tmp=8, tmp___1=0] [L1168] EXPR s->state [L1168] state = s->state [L1169] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0] [L1169] COND FALSE !(s->state == 12292) [L1172] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0] [L1172] COND FALSE !(s->state == 16384) [L1175] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0] [L1175] COND FALSE !(s->state == 8192) [L1178] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0] [L1178] COND FALSE !(s->state == 24576) [L1181] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0] [L1181] COND FALSE !(s->state == 8195) [L1184] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0] [L1184] COND FALSE !(s->state == 8480) [L1187] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0] [L1187] COND FALSE !(s->state == 8481) [L1190] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0] [L1190] COND FALSE !(s->state == 8482) [L1193] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0] [L1193] COND FALSE !(s->state == 8464) [L1196] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0] [L1196] COND FALSE !(s->state == 8465) [L1199] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0] [L1199] COND FALSE !(s->state == 8466) [L1202] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0] [L1202] COND FALSE !(s->state == 8496) [L1205] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0] [L1205] COND FALSE !(s->state == 8497) [L1208] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0] [L1208] COND FALSE !(s->state == 8512) [L1211] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0] [L1211] COND FALSE !(s->state == 8513) [L1214] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0] [L1214] COND FALSE !(s->state == 8528) [L1217] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0] [L1217] COND FALSE !(s->state == 8529) [L1220] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0] [L1220] COND FALSE !(s->state == 8544) [L1223] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0] [L1223] COND FALSE !(s->state == 8545) [L1226] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0] [L1226] COND FALSE !(s->state == 8560) [L1229] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0] [L1229] COND FALSE !(s->state == 8561) [L1232] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0] [L1232] COND FALSE !(s->state == 8448) [L1235] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0] [L1235] COND FALSE !(s->state == 8576) [L1238] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0] [L1238] COND FALSE !(s->state == 8577) [L1241] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0] [L1241] COND FALSE !(s->state == 8592) [L1244] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0] [L1244] COND FALSE !(s->state == 8593) [L1247] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0] [L1247] COND FALSE !(s->state == 8608) [L1250] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0] [L1250] COND FALSE !(s->state == 8609) [L1253] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0] [L1253] COND FALSE !(s->state == 8640) [L1256] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0] [L1256] COND FALSE !(s->state == 8641) [L1259] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0] [L1259] COND TRUE s->state == 8656 [L1583] EXPR s->session [L1583] EXPR s->s3 [L1583] EXPR (s->s3)->tmp.new_cipher [L1583] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1584] tmp___9 = __VERIFIER_nondet_int() [L1585] COND FALSE !(! tmp___9) [L1591] ret = __VERIFIER_nondet_int() [L1592] COND TRUE blastFlag == 2 [L1593] blastFlag = 5 VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0, tmp___9=2147483648] [L1597] COND FALSE !(ret <= 0) [L1602] s->state = 8672 [L1603] s->init_num = 0 [L1604] tmp___10 = __VERIFIER_nondet_int() [L1605] COND FALSE !(! tmp___10) VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1696] EXPR s->s3 [L1696] EXPR (s->s3)->tmp.reuse_message VAL [={0:-2147483648}, (s->s3)->tmp.reuse_message=-2147483648, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->s3={536870919:0}, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1696] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1725] skip = 0 VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1166] COND TRUE 1 VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1168] EXPR s->state [L1168] state = s->state [L1169] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1169] COND FALSE !(s->state == 12292) [L1172] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1172] COND FALSE !(s->state == 16384) [L1175] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1175] COND FALSE !(s->state == 8192) [L1178] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1178] COND FALSE !(s->state == 24576) [L1181] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1181] COND FALSE !(s->state == 8195) [L1184] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1184] COND FALSE !(s->state == 8480) [L1187] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1187] COND FALSE !(s->state == 8481) [L1190] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1190] COND FALSE !(s->state == 8482) [L1193] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1193] COND FALSE !(s->state == 8464) [L1196] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1196] COND FALSE !(s->state == 8465) [L1199] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1199] COND FALSE !(s->state == 8466) [L1202] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1202] COND FALSE !(s->state == 8496) [L1205] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1205] COND FALSE !(s->state == 8497) [L1208] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1208] COND FALSE !(s->state == 8512) [L1211] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1211] COND FALSE !(s->state == 8513) [L1214] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1214] COND FALSE !(s->state == 8528) [L1217] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1217] COND FALSE !(s->state == 8529) [L1220] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1220] COND FALSE !(s->state == 8544) [L1223] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1223] COND FALSE !(s->state == 8545) [L1226] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1226] COND FALSE !(s->state == 8560) [L1229] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1229] COND FALSE !(s->state == 8561) [L1232] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1232] COND FALSE !(s->state == 8448) [L1235] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1235] COND FALSE !(s->state == 8576) [L1238] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1238] COND FALSE !(s->state == 8577) [L1241] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1241] COND FALSE !(s->state == 8592) [L1244] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1244] COND FALSE !(s->state == 8593) [L1247] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1247] COND FALSE !(s->state == 8608) [L1250] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1250] COND FALSE !(s->state == 8609) [L1253] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1253] COND FALSE !(s->state == 8640) [L1256] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1256] COND FALSE !(s->state == 8641) [L1259] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1259] COND FALSE !(s->state == 8656) [L1262] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1262] COND FALSE !(s->state == 8657) [L1265] EXPR s->state VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=1073741824, s={7:0}, s={7:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1265] COND TRUE s->state == 8672 [L1614] ret = __VERIFIER_nondet_int() [L1615] COND FALSE !(blastFlag == 4) VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=9, s={7:0}, s={7:0}, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1618] COND TRUE blastFlag == 5 VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=9, s={7:0}, s={7:0}, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] [L1737] reach_error() VAL [={0:-2147483648}, blastFlag=5, buf=null, got_new_session=1, init=1, ret=9, s={7:0}, s={7:0}, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=2147483648, tmp___9=2147483648] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 147 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 40.4s, OverallIterations: 7, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 23.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 4 mSolverCounterUnknown, 645 SdHoareTripleChecker+Valid, 23.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 645 mSDsluCounter, 3347 SdHoareTripleChecker+Invalid, 22.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1558 mSDsCounter, 30 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 418 IncrementalHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 30 mSolverCounterUnsat, 1789 mSDtfsCounter, 418 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 577 GetRequests, 565 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=566occurred in iteration=6, InterpolantAutomatonStates: 22, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 75 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 8.0s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 708 NumberOfCodeBlocks, 708 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 574 ConstructedInterpolants, 0 QuantifiedInterpolants, 1718 SizeOfPredicates, 11 NumberOfNonLiveVariables, 4568 ConjunctsInSsa, 43 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 359/359 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 RESULT: Ultimate proved your program to be incorrect! [2022-07-19 11:03:48,274 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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE